Abstract
In this paper we investigate the limits of routing according to left- or right-hand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph. When used to recover from greedy routing failures, LHR guarantees success if implemented over planar graphs. This is often referred to as face-routing. In the current body of knowledge it is known that if planarity is violated then LHR is guaranteed only to eventually return to the point of origin. Our work begins with an analysis to enumerate all node configurations that cause intersections. A trace over each configuration reveals that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP) that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.
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
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM) (1999)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)
Chen, D., Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys & Tutorials 9(1), 50–67 (2007)
Chen, D., Varshney, P.K.: On-demand geographic forwarding for data delivery in wireless sensor networks. Elsevier Computer Communications 30(14-15), 2954–2967 (2007)
Fayed, M.M., Cairns, D.E., Mouftah, H.T.: An analysis of planarity in face-routing. Technical Report TR-184, Computing Science & Math, University of Stirling (2010)
Fler, H., Widmer, J., Ksemann, M., Mauve, M., Hartenstein, H.: Contention-Based Forwarding for Mobile Ad-Hoc Networks. Elsevier’s Ad Hoc Networks 1(4), 351–369 (2003)
Frey, H., Stojmenovic, I.: On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In: The 12th Annual International Conference on Mobile Computing and Networking (Mobicom), pp. 390–401 (2006)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Lazy cross-link removal for geographic routing. In: The 4th International Conference on Embedded Networked Sensor Systems (SenSys), pp. 112–124 (2006)
Heissenbttel, M., Braun, T., Bernoulli, T., Blr, M.W.A.: Beacon-less routing algorithm for mobile ad-hoc networks. Elseviers Computer Communications Journal (Special Issue) 27, 1076–1086 (2004)
Heissenbüttel, M., Braun, T., Wälchli, M., Bernoulli, T.: Evaluating the limitations of and alternatives in beaconing. Elsevier Ad Hoc Networks 5(5), 558–578 (2007)
Kalosha, H., Nayak, A., Ruhrup, S., Stojmenovic, I.: Select-and-protest-based beaconless georouting with guaranteed delivery in wireless sensor networks. In: IEEE 27th Conference on Computer Communications (INFOCOM), Pheonix, AZ, USA, pp. 346–350 (April 2008)
Karp, B.: Challenges in geographic routing: Sparse networks, obstacles, and tra ffic provisioning. Presented at DIMACS Workshop on Pervasive Networking (May 2001)
Karp, B., Kung, H.: Gpsr: Greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM MobiCom, Boston, MA (September 2000)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI), Boston, MA, USA (May 2005)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: On the pitfalls of geographic face routing. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 34–43 (2005)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric Ad-Hoc Routing: Of Theory and Practice. In: 22nd ACM Symposium on the Principles of Distributed Computing (PODC), Boston, Massachusetts, USA (July 2003)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically Optimal Geometric Mobile Ad-Hoc Routing. In: 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), Atlanta, Georgia (September 2002)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In: 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Annapolis, Maryland, USA (June 2003)
Leong, B., Liskov, B., Morris, R.: Geographic routing without planarization. In: Proceedings of the 3rd USENIX Symposium on Networked Systems Design and Implementation (NSDI), San Jose, CA, USA (May 2006)
Leong, B., Liskov, B., Morris, R.: Greedy virtual coordinates for geographic routing. In: Proceedings of the IEEE International Conference on Network Protocols (ICNP) (October 2007)
Lochert, C., Mauve, M., Fler, H., Hartenstein, H.: Geographic Routing in City Scenarios. ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 9(1), 69–72 (2005)
Sanchez, J., Marin-Perez, R., Ruiz, P.: Boss: Beacon-less on demand strategy for geographic routing in wireless sensor networks. In: IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 1–10 (October 2007)
Schindelhauer, C., Volbert, K., Ziegler, M.: Geometric spanners with applications in wireless networks. Computational Geometry: Theory and Applications 36(3), 197–214 (2007)
Seada, K., Helmy, A., Govindan, R.: On the effect of localization errors on geographic face routing in sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN), pp. 71–80 (2004)
Zhang, F., Li, H., Jiang, A., Chen, J., Luo, P.: Face tracing based geographic routing in nonplanar wireless networks. In: IEEE 26th Conference on Computer Communications (INFOCOM), Anchorage, AK, USA (May 2007)
Zhao, G., Liu, X., Sun, M.-T., Ma, X.: Energy-efficient geographic routing with virtual anchors based on projection distance. Elsevier Computer Communications 31(10) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Cairns, D., Fayed, M.M., Mouftah, H.T. (2013). Revisiting Planarity in Position-Based Routing for Wireless Networks. In: Zheng, J., Mitton, N., Li, J., Lorenz, P. (eds) Ad Hoc Networks. ADHOCNETS 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36958-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-36958-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36957-5
Online ISBN: 978-3-642-36958-2
eBook Packages: Computer ScienceComputer Science (R0)