The week's pick
Random Articles
Reseach Article
Article:An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 9 - Number 6 |
| Year of Publication: 2010 |
| Authors: Natarajan Meghanathan |
10.5120/1388-1871
|
Natarajan Meghanathan . Article:An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks. International Journal of Computer Applications. 9, 6 ( November 2010), 30-35. DOI=10.5120/1388-1871
Abstract
The high-level contribution of this paper is an energy-aware version of the well-known position-based Greedy Perimeter Stateless Routing (GPSR) protocol for mobile ad hoc networks (MANETs). In the proposed energy-aware GPSR protocol, referred to as E-GPSR, we optimize the greedy forwarding mode as follows: a forwarding node first determines a candidate set of neighbor nodes – the nodes that lie closer to the destination than itself. The weight of each such candidate neighbor node is then computed to be the sum of the fraction of the initial energy currently available at the neighbor node and the progress (i.e., the fraction of the distance covered between the forwarding node and the destination) obtained with the selection of the neighbor node. The candidate neighbor node that has the largest weight value is the chosen next hop node to receive the data packet. This procedure is repeated at every hop where greedy forwarding is possible. In case, greedy forwarding is not possible, similar to GPSR, E-GPSR switches to perimeter forwarding. With E-GPSR, the fairness of node usage considerably improves compared to GPSR. Simulation results illustrate that the time of first node failure, due to the exhaustion of battery charge, increases significantly (as large as by 55%) with the use of E-GPSR, whereas the hop count increases only as large as by 7%.
References
- J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, J. Jetcheva, “A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols,” Proceedings of the 4th ACM Annual International Conference on Mobile Computing and Networking, pp.85-97, Dallas, TX, USA, October 1998.
- P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark, “Scenario-based Performance Analysis of Routing Protocols for Mobile Ad hoc Networks,” Proceedings of the 5th ACM Annual International Conference on Mobile Computing and Networking, pp. 195-206, Seattle, WA, USA, August 1999.
- B. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243-254, Boston, MA, USA, August 2000.
- W. Keiss, H. Fuessler and J. Widmer, “Hierarchical Location Service for Mobile Ad hoc Networks,” ACM SIGMOBILE Mobile Computing and Communications Review, vol. 8, no. 4, pp. 47-58, 2004.
- K. Fall and K. Varadhan, “ns notes and documentation,” The VINT Project at LBL, Xerox PARC, UCB, and USC/ISI, http://www.isi.edu/nsnam/ns, August 2001.
- G. Bianchi, “Performance Analysis of the IEEE 802.11 Distributed Coordination Function,” IEEE Journal of Selected Areas in Communication, vol. 18, no. 3, pp. 535-547, March 2000.
- C. Bettstetter, H. Hartenstein and X. Perez-Costa, “Stochastic Properties of the Random-Way Point Mobility Model,” Wireless Networks, vol. 10, no. 5, pp. 555-567, September 2004.
- S. Sharma, H. M. Gupta and S. Dharmaraja, “EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks,” Proceedings of the SPECTS Conference, pp. 122-129, June 2008.
- Y. Yu, R. Govindan and D. Estrin, “Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” UCLA Technical Report, UCLA/CSD-TR-01-0023, May 2001.
Index Terms
Keywords