Abstract
The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge between two points if and only if their Euclidean distance is at most one. A hop spanner for the UDG is a spanning subgraph H such that for every edge (p, q) in the UDG the topological shortest path between p and q in H has a constant number of edges. The hop stretch factor of H is the maximum number of edges of these paths. A hop spanner is plane (i.e. embedded planar) if its edges do not cross each other.
The problem of constructing hop spanners for the UDG has received considerable attention in both computational geometry and wireless ad hoc networks. Despite this attention, there has not been significant progress on getting hop spanners that (i) are plane, and (ii) have low hop stretch factor. Previous constructions either do not ensure the planarity or have high hop stretch factor. The only construction that satisfies both conditions is due to Catusse, Chepoi, and Vaxès [5]; their plane hop spanner has hop stretch factor at most 449.
Our main result is a simple algorithm that constructs a plane hop spanner for the UDG. In addition to the simplicity, the hop stretch factor of the constructed spanner is at most \(341\). Even though the algorithm itself is simple, its analysis is rather involved. Several results on the plane geometry are established in the course of the proof. These results are of independent interest.
Supported by NSERC Postdoctoral Fellowship.
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 subscriptionsReferences
Alzoubi, K.M., Li, X., Wang, Y., Wan, P., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 14(4), 408–421 (2003)
Biniaz, A.: Plane hop spanners for unit disk graphs: simpler and better. arXiv:1902.10051 (2019). http://arxiv.org/abs/1902.10051
Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 85–96. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29344-3_8
Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818–830 (2013)
Catusse, N., Chepoi, V., Vaxès, Y.: Planar hop spanners for unit disk graphs. In: Scheideler, C. (ed.) ALGOSENSORS 2010. LNCS, vol. 6451, pp. 16–30. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16988-5_2
Chen, J., Jiang, A., Kanj, I.A., Xia, G., Zhang, F.: Separability and topology control of quasi unit disk graphs. Wirel. Netw. 17(1), 53–67 (2011). Also in INFOCOM 2007
Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5, 399–407 (1990). Also in FOCS 1987
Eppstein, D.: Spanning trees and spanners. Technical report, Information and Computer Science, University of California, Irvine (1996)
Fürer, M., Kasiviswanathan, S.P.: Spanners for geometric intersection graphs with applications. J. Comput. Geom. 3(1), 31–64 (2012)
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. 23(1), 174–185 (2005). Also in MobiHoc 2001
Hurtado, F., Kano, M., Rappaport, D., Tóth, C.D.: Encompassing colored planar straight line graphs. Comput. Geom.: Theory Appl. 39(1), 14–23 (2008). Also in CCCG 2004
Kanj, I.A., Perkovic, L.: On geometric spanners of Euclidean and unit disk graphs. In: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science \((\)STACS\()\), pp. 409–420 (2008)
Li, X.: Algorithmic, geometric and graphs issues in wireless networks. Wirel. Commun. Mob. Comput. 3(2), 119–140 (2003)
Li, X., Călinescu, G., Wan, P.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies \((\)INFOCOM\()\), pp. 1268–1277 (2002)
Li, X., Wang, Y.: Efficient construction of low weighted bounded degree planar spanner. Int. J. Comput. Geom. Appl. 14(1–2), 69–84 (2004). Also in COCOON 2003
Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)
Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)
Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for Unit Disk Graphs. Comput. Geom.: Theory Appl. 45(7), 305–325 (2012). Also in WADS 2009
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Biniaz, A. (2019). Plane Hop Spanners for Unit Disk Graphs. In: Friggstad, Z., Sack, JR., Salavatipour, M. (eds) Algorithms and Data Structures. WADS 2019. Lecture Notes in Computer Science(), vol 11646. Springer, Cham. https://doi.org/10.1007/978-3-030-24766-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-24766-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24765-2
Online ISBN: 978-3-030-24766-9
eBook Packages: Computer ScienceComputer Science (R0)