Abstract
Geographic routing for ad hoc and sensor networks has gained a lot of momentum during the last few years. In this scheme routes are created locally by each individual node, just based on the position of the destination and its local neighbors. To do that, a node selects its best neighbor (according to some metric) out of those being closer than itself to the destination. This operation is called greedy mode. When a node has no such neighbors, it enters into face routing mode. However, for face routing to work properly, the underlying graph needs to be planarized by removing crossing edges, which may eventually be very good from the routing metric point-of-view. In this paper, we introduce a new localized scheme to build a planar virtual spanner in a simple and efficient way, with low control overhead. The produced virtual spanner allows face routing to be executed, without the need to remove any of the original links in the network. Thus, the best links according to the routing metric can still be used, Our simulation results show that by performing face routing over the virtual spanner, we manage to enhance the routing performance both for greedy-face-greedy routing and face routing between a 40 to 60% compared to existing planarity tests.
Partially supported by CONACyT and the Spanish MEC by means of the “Ramon y Cajal” program and the SAVIA project (CIT-410000-2005-1).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Boone, P., Chávez, E., Gleitzky, L., Kranakis, E., Opatrny, J., Salazar, G., Urrutia, J.: Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 23–34. Springer, Heidelberg (2004)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad-hoc wireless networks. ACM/Kluwer Wireless Networks 7(6), 609–616 (2001)
Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry, Vancouver (August 1999), pp. 51–54 (1999)
Toussaint, G.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tejeda, H., Chávez, E., Sanchez, J.A., Ruiz, P.M. (2006). A Virtual Spanner for Efficient Face Routing in Multihop Wireless Networks. In: Cuenca, P., Orozco-Barbosa, L. (eds) Personal Wireless Communications. PWC 2006. Lecture Notes in Computer Science, vol 4217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11872153_40
Download citation
DOI: https://doi.org/10.1007/11872153_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45174-7
Online ISBN: 978-3-540-45176-1
eBook Packages: Computer ScienceComputer Science (R0)