An Energy Aware WSN Geographic Routing Protocol

Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specially designed for WSNs. The focus has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we propose an energy efficient data forwarding protocol called Energy Aware Geographic Routing Protocol (EAGRP) for wireless sensor networks to extend the life time of the network. In EAGRP, both position information and energy are available at nodes used to route packets from sources to destination. This will prolong the lifetime of the sensor nodes; hence the network life time and thus get higher packet delivery ratio and minimal compromise of energy efficiency. The proposed protocol is an efficient and energy conservative routing technique for multi-hop wireless sensor networks. The routing design of EAGRP is based on two parameters: location and energy levels of nodes. Each node knows the location and energy level of its neighbors. The performance measures have been analyzed with variable number of nodes. Our simulation results indicate that the proposed algorithm gives better performance in terms of higher packet delivery ratio, delay, and energy consumption. KeywordsWireless Sensor Networks; Energy efficient; Position information; Routing protocol.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Levente Buttyán,et al.  A taxonomy of routing protocols for wireless sensor networks , 2007 .

[3]  S.A. Notani Performance Simulation of Multihop Routing Algorithms for Ad-Hoc Wireless Sensor Networks Using TOSSIM , 2008, 2008 10th International Conference on Advanced Communication Technology.

[4]  Jan M. Rabaey,et al.  Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks , 2002, USENIX Annual Technical Conference, General Track.

[5]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[7]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[8]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[9]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[10]  David E. Culler,et al.  System architecture for wireless sensor networks , 2003 .

[11]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[12]  Leonard Barolli,et al.  Performance Behavior of AODV, DSR and DSDV Protocols for Different Radio Models in Ad-Hoc Sensor Networks , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).

[13]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[14]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.