Abstract
Let \(S \subset \mathbb {R}^2\) be a set of n sites. The unit disk graph \({{\mathrm{UD}}}(S)\) on S has vertex set S and an edge between two distinct sites \(s,t \in S\) if and only if s and t have Euclidean distance \(|st| \le 1\).
A routing scheme R for \({{\mathrm{UD}}}(S)\) assigns to each site \(s \in S\) a label \(\ell (s)\) and a routing table \(\rho (s)\). For any two sites \(s, t \in S\), the scheme R must be able to route a packet from s to t in the following way: given a current site r (initially, \(r = s\)), a header h (initially empty), and the target label \(\ell (t)\), the scheme R may consult the current routing table \(\rho (r)\) to compute a new site \(r'\) and a new header \(h'\), where \(r'\) is a neighbor of r. The packet is then routed to \(r'\), and the process is repeated until the packet reaches t. The resulting sequence of sites is called the routing path. The stretch of R is the maximum ratio of the (Euclidean) length of the routing path of R and the shortest path in \({{\mathrm{UD}}}(S)\), over all pairs of sites in S.
For any given \(\varepsilon > 0\), we show how to construct a routing scheme for \({{\mathrm{UD}}}(S)\) with stretch \(1+\varepsilon \) using labels of \(O(\log n)\) bits and routing tables of \(O(\varepsilon ^{-5}\log ^2 n \log ^2 D)\) bits, where D is the (Euclidean) diameter of \({{\mathrm{UD}}}(S)\). The header size is \(O(\log n \log D)\) bits.
This work is supported by GIF project 1161 & DFG project MU/3501/1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
Callahan, P., Kosaraju, S.: A decomposition of multidimensional point sets with applications to \(k\)-nearest-neighbors and \(n\)-body potential fields. J. ACM 42(1), 67–90 (1995)
Chechik, S.: Compact routing schemes with improved stretch. In: Proceedings of 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 33–41 (2013)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)
Fraigniaud, Pierre, Gavoille, Cyril: Routing in trees. In: Orejas, F., Spirakis, Paul G., van Leeuwen, Jan (eds.) ICALP 2001. LNCS, vol. 2076, p. 757. Springer, Heidelberg (2001)
Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM J. Comput. 35(1), 151–169 (2005)
Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: a taxonomy. In: Cheng, X., Huang, X., Du, D.-Z. (eds.) Ad Hoc Wireless Networking. Network Theory and Applications, vol. 14, pp. 103–136. Springer, New York (2004)
Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM J. Comput. 34(2), 453–474 (2004)
Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)
Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510–530 (1989)
Roditty, L., Tov, R.: New routing techniques and their applications. In: Proceedings of 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 23–32 (2015)
Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Comput. J. 28(1), 5–8 (1985)
Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993–1024 (2004)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)
Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for unit disk graphs. Comput. Geom. 45(7), 305–325 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P. (2016). Routing in Unit Disk Graphs. In: Kranakis, E., Navarro, G., Chávez, E. (eds) LATIN 2016: Theoretical Informatics. LATIN 2016. Lecture Notes in Computer Science(), vol 9644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49529-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-49529-2_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49528-5
Online ISBN: 978-3-662-49529-2
eBook Packages: Computer ScienceComputer Science (R0)