Abstract
This paper presents a gradient routing algorithm a modified approach of DIR (compass routing) method to suit for mobile ad hoc network. It is a direction based localized algorithm where each node makes forwarding decisions solely based on the position of itself, its neighbors and destination. Source node selects a neighbor node to forward a message which is closest (having minimum gradient i.e. angle) towards the direction of destination. This algorithm makes use of the position information of nodes to improve the performance of routing protocols in mobile ad hoc network. The performance of gradient algorithms is compared with other directional routing algorithms LAR and DREAM in mobile environment using proactive approach. The experimental results show that gradient algorithm have higher success rate and lower flooding rate compared to LAR and DREAM
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruhil, A.P., Lobiyal, D.K., Stojmenovic, I. (2005). Position Based Gradient Routing in Mobile Ad Hoc Networks. In: Chakraborty, G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604655_7
Download citation
DOI: https://doi.org/10.1007/11604655_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30999-4
Online ISBN: 978-3-540-32429-4
eBook Packages: Computer ScienceComputer Science (R0)