1.

Abstract

Sensors are the new wheel- a revolution in field of technology, a gateway to advancement. The use of sensors will bring revolution in the field science and technology, and so the future networks will comprise of densely installed sensors. The need of the hour is the conservation of energy and sensors fulfill the criterion of saving energy. The networks employed with sensors can have unattended nodes and are only alive or active when they sense an incoming packet that has to be routed to a destination. In this way a longer lifetime of a network is expected, while saving the energy consumed per route selected. All these results are proved in the given research papers through simulation, although all the three research papers use different algorithms to get to the desired and proposed results.

2. Introduction As the technological advancements increase in the industry so does the increase of deploying more sensor orientated networks. Installing the networks by a large number of closely situated sensors is the future, Because a sensor is the closest thing to making an environment artificially intelligent; and interactive. Humans can control and observe the under-observation phenomenon from far off places making the network more convenient. The network may have one or more than one sensors deployed in it. The network will have power source (mobile) as the sensor networks are wireless and non-stationary. The power source is a low energy dissipating source so our main concern is to minimize the power consumption by the sensors. Also the nodes of the network are not attended and they have a limited energy source. So this is done by directing the path of traffic so it does not broadcast the messages throughout the network, and outside it. The applications of sensor networks include both military and non-military applications. Applications that require monitoring the environment, observing the industrial processes - for example humidity control, temperature control. And target surveillance in military can be done without the actually presence of a human being. Our main concern is the deployment of sensor s that they can conserve energy as the use low power battery supply as their source of energy. Also the lifetime of a network depends greatly on the conservation of energy. Routing done on the basis of using sensor networks is one of the approaches discussed in all three-research papers to conserve energy.

3. Literature Review All the research paper have one thing common that they concentrate on finding algorithms which minimize the consumption of energy in installing the sensor networks for implementation of different energy efficient routing algorithms using the knowledge of geographical locations. The first research paper Geographical and Energy Aware Routing discusses a method in which the most effective and efficient way is to spread the packet only to the geographical location it is ultimately destined to reach. This is done by putting the information about that specific geographical location where it is destined to reach in the packets header. By doing so the message is not broadcasted everywhere but only to the destination. This system is better than most of the models research on before because it deals with the problems of broadcasting. This network does not need a location database for the routers to keep a track of packet forwarding routes, but it requires the network to work on the basis of named data. This method is limited to immobile sensor networks. This helps in learning techniques for route determining. Each node knows it current location in this algorithm, making up for a local system. Collectively energy aware parameters and geographical location work together to give an energy efficient routing protocol discussed in this paper. This is done by routing a packet to geographically informed neighbors, this protocol is generally and commonly more efficient for ad-hoc networks. The second research paper discusses a method for packet routing by using the destination address and the position of the routers. The whole idea behind doing this is keeping in view a routers neighbors. If the destination is unreachable it routes the packet to all the immediate neighbors, this is the reason its topology cannot handle more number of workstations as it is not suitable for ad-hoc or shortest path protocols. For mobile networks where the destinations are not stationary it finds new routes by using local topology. Scalability is the main issue that the authors wanted to solve. Scalability is expanding your network including more number of nodes. When doing that there are two factors that dominate the routing algorithm development increasing the complexity, which are: The rate at which the topology changes. And the number of routers,

The approach that is used when the number of destinations increase is called Hierarchy. It uses back bone routers and as the number of nodes increases, well structured architecture makes it easy to scale up the network. But hierarchy is not suitable for mobile wireless networks, and for that matter ad-hoc networks. So for scaling ad-hoc networks the authors have proposed a technique called caching. For wireless mobile networks the routers update their tropical information to keep routing the packets. Caching is a useful technique because it does not forward routing information to idle routers, and it minimizes the number of hops. The authors of this research paper want to increase scalability on the following measures: The number of packets a routing algorithm sends.

The number of application packets a routing algorithm sends successfully. The much memory is required by anode for routing.

The networks that this research paper has discussed are: Ad-hoc networks Sensor networks. Rooftop networks.

This research paper gives a very efficient method of routing which only uses the destination address and information about next hop to make a correct routing decision. The third research paper discusses a method by which sensor networks can be used to from an energy efficient location based routing algorithm, which increases the life time of the network. The information that is required by a node to make routing decisions i.e. decision about its next hop, is its geographical location and energy, also these parameters for its neighbors. It routes the packets by making sub-destination before the actual destination. These sub-destinations are geographically close and so it chooses the most reliable and shortest path for routing.

Comparison of all

4. Motivation 5. Problem statement 6. Pros and cons 7. Conclusion The simulation results show that for non-uniform traffic GEAR gives 70% to 80% efficient packet delivery in comparison to GPSR. And for uniform traffic it gives 25% to 25% more efficient packet delivery in comparison to GPSR.

8. Future enhancement 9. Your idea