Abstract
We address the problem of discovering routes in strongly connected planar geometric networks with directed links. We consider two types of directed planar geometric networks: Eulerian (in which every vertex has the same number of ingoing and outgoing edges) and outerplanar (in which a single face contains all the vertices of the network). Motivated by the necessity for establishing communication in wireless networking based only on geographic proximity, in both instances we give algorithms that use only information that is geographically local to the vertices participating in the route discovery.
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.
Similar content being viewed by others
References
Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. In: Proc. of 7th Annu. ACM Sympos. Comput. Geom, pp. 98–104 (1991)
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. American Elsevier Publishing Co., Inc, Amsterdam (1976)
Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. Internat. J. Comput. Geom. Appl. 12(4), 297–308 (2002) Annual International Symposium on Algorithms and Computation (Taipei, 2000)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7, 609–616 (2001)
Chavez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Traversal of a quasi-planar subdivision without using mark bits. In: accepted for 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004), Fanta Fe, New Mexico (2004)
Czyczowicz, J., Kranakis, E., Santoro, N., Urrutia, J.: Traversal of geometric planar networks using a mobile agent with constant memory (in preparation)
Gold, C., Maydell, U., Ramsden, J.: Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphic 11(2), 170–175 (1977)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, pp. 51–54 (1999)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: Of theory and practice. In: Proc. of the 22nd ACM Symposium on the Principles of Distributed Computing, PODC (2003)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proc. of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC (2003)
Peuquet, D., Marble, D.: Arc/info: an example of a contemporary geographic information system. In: In Introductory Readings in Geographic Information Systems, Taylor & Francis, pp. 90–99 (1990)
Peuquet, D., Marble, D.: Technical description of the dime system. In: Introductory Readings in Geographic Information Systems, Taylor & Francis, pp. 100–111 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chávez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J. (2004). Route Discovery with Constant Memory in Oriented Planar Geometric Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2004. Lecture Notes in Computer Science, vol 3121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27820-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-27820-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22476-1
Online ISBN: 978-3-540-27820-7
eBook Packages: Springer Book Archive