Abstract
The recent availability of small, inexpensive low power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power efficient and scalable networks, provided justification for applying position based routing methods in ad hoc networks. A number of such algorithms were developed recently. They are all based on three greedy schemes, applied when the forwarding node is able to advance the message toward destination. In this paper we show that the hop count, that is the number of transmissions needed to route a message from a source node to a destination node can be estimated reasonably accurately (in random unit graphs with uniform traffic), with less than 10%, 5% and 7% error for directional (compass), distance (greedy) and progress (MFR) based schemes, respectively, for 100 nodes with average degrees between 5 and 14, without experiments. Our results are derived from statistical observations regarding expected position of forwarding neighbor.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Bose, P. Morin, I Stojmenovic and J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in: 3rd Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, August 20, 1999, pp. 48–55; Wireless Networks 7(6) (2001) 609-616.
G.G. Finn, Routing and addressing problems in large metropolitan-scale internetworks, ISI Research Report ISU/RR-87-180 (March 1987).
J. Hightower and G. Borriello, Location systems for ubiquitous computing, IEEE Computer (August 2001) 57–66.
E. Kranakis, H. Singh and J. Urrutia, Compass routing on geometric networks, in: Proc. 11th Canadian Conference on Computational Geometry, Vancouver, August 1999.
K. Li, Topological characteristics of random multihop wireless networks, in: Proc. Hawaii Internat. Conf. on System Sciences (HICSS), 2003.
I. Stojmenovic, Location updates for efficient routing in ad hoc networks, in: Handbook of Wireless Networks and Mobile Computing, ed. I. Stojmenovic (Wiley, New York, 2002) pp. 451–471, www.site.uottawa.ca/~ivan.
I. Stojmenovic and X. Lin, Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks, IEEE Transactions on Parallel and Distributed Systems 12(10) (2001) 1023–1032.
I. Stojmenovic and X. Lin, Power-aware localized routing in wireless networks, IEEE Transactions on Parallel and Distributed Systems 12(11) (2001) 1122–1133.
H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Transactions on Communications 32(3) (1984) 246–257.
Y.C. Tseng, W.H. Liao and S.L.Wu, Mobile ad hoc networks and routing protocols, in: Handbook of Wireless Networks and Mobile Computing, ed. I. Stojmenovic (Wiley, New York, 2002) pp. 371–392.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Acevedo Contla, P., Stojmenovic, M. Estimating Hop Counts in Position Based Routing Schemes for Ad Hoc Networks. Telecommunication Systems 22, 109–118 (2003). https://doi.org/10.1023/A:1023434702987
Issue Date:
DOI: https://doi.org/10.1023/A:1023434702987