Abstract
A spanner is a subgraph of a given graph that supports the original graph’s shortest path lengths up to a constant factor. Planar spanners and their distributed construction are of particular interest for geographic routing, which is an efficient localized routing scheme for wireless ad hoc and sensor networks. Planarity of the network graph is a key criterion for guaranteed delivery, while the spanner property supports efficiency in terms of path length. We consider the problem of reactive local spanner construction, where a node’s local topology is determined on demand. Known message-efficient reactive planarization algorithms do not preserve the spanner property, while reactive spanner constructions with a low message overhead have not been described so far. We introduce the concept of direct planarization which may be an enabler of efficient reactive spanner construction. Given an edge, nodes check for all incident intersecting edges a certain geometric criterion and withdraw the edge if this criterion is not satisfied. We use this concept to derive a generic reactive topology control mechanism and consider two geometric criteria. Simulation results show that direct planarization increases the performance of localized geographic routing by providing shorter paths than existing reactive approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
X. Lin and I. Stojmenović. Location-based localized alternate, disjoint and multipath routing algorithms for wireless networks. Journal of Parallel and Distributed Computing, 63:22–32, 2003.
P. Bose, P. Morin, I. Stojmenović, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M 99), pages 48–55, August 1999.
H. Frey and I. Stojmenović. On delivery guarantees of face and combined greedyface routing in ad hoc and sensor networks. In 12th Annual Int. Conference on Mobile Computing and Networking (MobiCom’06), 2006.
G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261–268, 1980.
K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259–278, 1969.
B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In 6th ACM/IEEE Annual Int. Conference on Mobile Computing and Networking (MobiCom’00), pages 243–254, August 2000.
P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of gabriel graphs and beta-skeletons. In Latin American Symposium on Theoretical Informatics (LATIN’02), April 2002.
H. Kalosha, A. Nayak, S. Rührup, and I. Stojmenović. Select-and-protest-based beaconless georouting with guaranteed delivery in wireless sensor networks. In 27th IEEE Conference on Computer Communications (INFOCOM), April 2008.
D.P. Dobkin, S.J. Friedman, and K.J. Supowit. Delaunay graphs are almost as good as complete graphs. In Discrete and Computational Geometry, 1990.
J.M. Keil and C.A. Gutwin. Classes of graphs which approximate the complete euclidean graph. In Discrete Computational Geometry, 7, 1992.
J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In 2nd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’01), pages 45–55, October 2001.
X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In 21st Joint Conference of the IEEE Computer and Communications Society (INFOCOM), pages 1268–1277, June 2002.
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
Frey, H., Rührup, S. (2009). Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks. In: David, K., Geihs, K. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92666-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-92666-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92665-8
Online ISBN: 978-3-540-92666-5
eBook Packages: Computer Science and Engineering (German Language)