GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Hi-index | 0.01 |
Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. 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. The proposed protocol is an efficient and energy conservative routing technique for multi-hop wireless sensor networks. The significance of this study is that there has been a very limited investigation of the effect of mobility models on routing protocol performance in Wireless Sensor Network. We have considered the influence random waypoint mobility models on the performance of EAGRP routing protocol. 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, throughput, energy consumption, routing overhead, and delay.