Abstract
In wireless networks, the planar embedding of the communication network is often used in applications such as topology control and routing. Typically, wireless networks are nonplanar and hence algorithms which use local information are often applied to create planar graphs. These algorithms provably yield a connected planar graph as long as the network obeys certain assumptions like Unit Disk Graph (UDG). In this paper we propose a new explicit localized graph planarization algorithm to planarize graphs that are more general than UDGs, i.e. graphs satisfying redundancy property and a new property introduced by us called coexistence property. This algorithm detects intersections locally and planarizes networks by removing them. A link addition phase ensures that the network remains connected after the planarization algorithm. Theoretical analysis shows that our algorithm provably creates planar graphs without disconnecting the network graph if it has redundancy and coexistence properties. We also show these planar graphs are weak c-spanners at least in UDG modeled networks. Empirical analysis shows that they are as good as the best state of the art localized planarization algorithm with respect to the spanning ratio.
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.
References
Barriére, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: DIALM 2001: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 19–27. ACM, New York (2001)
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: DIALM 1999: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48–55. ACM, New York (1999)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)
Frey, H.: Geographical cluster based multihop ad hoc network routing with guaranteed delivery. In: IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, pp. 509–519 (2005)
Frey, H., Görgen, D.: Planar graph routing on geographical clusters. Ad Hoc Networks 3(5), 560–574 (2005)
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: MobiHoc 2001: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 45–55. ACM, New York (2001)
Grünewald, M., Lukovszki, T., Schindelhauer, C., Volbert, K.: Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper). In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 935–946. Springer, Heidelberg (2002)
Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: MobiCom 2000: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254. ACM, New York (2000)
Kim, D., Maxemchuk, N.: Simple robotic routing in ad hoc networks. In: IEEE International Conference on Network Protocols, pp. 159–168 (2005)
Kim, Y.J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI 2005: Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, pp. 217–230. USENIX Association, Berkeley (2005)
Kim, Y.J., Govindan, R., Karp, B., Shenker, S.: Lazy cross-link removal for geographic routing. In: SenSys 2006: Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, pp. 112–124. ACM, New York (2006)
Kuhn, F., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: DIALM-POMC 2003: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 69–78. ACM, New York (2003)
Li, N., Hou, J., Sha, L.: Design and analysis of an mst-based topology control algorithm. In: INFOCOM 2003: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, March 30-April 3, vol. 3, pp. 1702–1712 (2003)
Li, X.Y., Calinescu, G., Wan, P.J., Wang, Y.: Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 14, 1035–1047 (2003)
Mathews, E., Frey, H.: A localized planarization algorithm for realistic wireless networks. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1–9 (June 2011)
Philip, S., Ghosh, J., Ngo, H., Qiao, C.: Routing on overlay graphs in mobile ad hoc networks. In: GLOBECOM 2006, IEEE Global Telecommunications Conference, pp. 1–6 (December 2006)
Rappaport, T.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall PTR, Upper Saddle River (2001)
Tejeda, H., Chávez, E., Sanchez, J.A., Ruiz, P.M.: Energy-Efficient Face Routing on the Virtual Spanner. In: Kunz, T., Ravi, S.S. (eds.) ADHOC-NOW 2006. LNCS, vol. 4104, pp. 101–113. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mathews, E., Frey, H. (2012). A Localized Link Removal and Addition Based Planarization Algorithm. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-25959-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25958-6
Online ISBN: 978-3-642-25959-3
eBook Packages: Computer ScienceComputer Science (R0)