Abstract
For an adhoc network with n nodes, we propose a proactive routing protocol without routing tables which uses O(logn) bits per node for the location service tables. The algorithm is based on 1-dimensional virtual coordinates, which we call labels. The decision of where to forward a packet is oblivious and purely local, depending only on the labels of the immediate neighbours and the label of the destination: the packet is forwarded to the neighbour whose label is closest to that of the destination. The algorithm is based on mapping the network to an ordered list where each node has one or more integer labels. This labeling can be produced by any arbitrary traversal of the network visiting all the nodes, in particular by a depth-first search of a flood tree which gives a 2n length traversal. We show experimentally that, in terms of hop number, our routing algorithm is far superior to geographic protocols in randomly generated networks and for sparse networks produces routes of length very close to those of the shortest path.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chavez, E., Mitton, N., Tejeda, H.: Routing in Wireless Networks with Position Trees. In: Kranakis, E., Opatrny, J. (eds.) ADHOC-NOW 2007. LNCS, vol. 4686, pp. 32–45. Springer, Heidelberg (2007)
Internet Engineering Task Force (IETF) MANET working group documents: http://www.ietf.org/html.charters/manet-charter.html , and, http://www.ianchak.com/manet/
Johnson, D.B.: Scalable and Robust Internetwork Routing for Mobile Hosts. In: Proceedings of the 14th International Conference on Distributed Computing Systems, p. 211. IEEE Computer Society, Poznan (1994)
Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance Vector (DSDV) for Mobile Computers. In: Proc. of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, August 1994, pp. 234–244 (1994)
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without local information. In: MobiCom 2003: Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 96–108. ACM Press, New York (2003)
Santosh, V., Kanade, V.: Life (and routing) on the Wireless Manifold, Technical Report, Georgia Tech. (2008)
Shaukat, K., Syrotiuk, V.: Statistical Monitoring to Control a Proactive Routing Protocol. In: Kranakis, E., Opatrny, J. (eds.) ADHOC-NOW 2007. LNCS, vol. 4686, pp. 46–58. Springer, Heidelberg (2007)
Tejeda, H., Chavez, E., Sanchez, J.A., Ruiz, P.M.: Energy-Efficient Face Routing on the Virtual Spanner. In: Kunz, T., Ravi, S.S. (eds.) ADHOC-NOW 2006. LNCS, vol. 4104, pp. 101–113. Springer, Heidelberg (2006)
Urrutia, J.: Local solutions for global problems in wireless networks. Journal of Discrete Algorithms 5, 395–407 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chávez, E., Fraser, M., Tejeda, H. (2009). Proximal Labeling for Oblivious Routing in Wireless Ad Hoc Networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2009. Lecture Notes in Computer Science, vol 5793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04383-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-04383-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04382-6
Online ISBN: 978-3-642-04383-3
eBook Packages: Computer ScienceComputer Science (R0)