Prohibitive-link Detection and Routing Protocol

In the current body of knowledge, planarity is necessary in order to recover from routing holes using left- or right-hand rule (LHR). This is often referred to as face-routing. In this paper we introduce the Prohibitive-link Detection and Routing Protocol (PDRP). PDRP is a position-based wireless protocol that, when faced with a routing hole, can recover using left-hand rule in a non-planar environment. As the name implies, the protocol detects and circumvents the prohibitive links that hamper LHR. The goal of PDRP is to provide the same levels of service as GPSR-like protocols, while avoiding the prohibitive transmissions of cooperative protocols such as CLDP. Initial results are promising, revealing the same level of service as face-routing protocols despite preserving most intersecting links in the network.

[1]  Pramod K. Varshney,et al.  On-demand Geographic Forwarding for data delivery in wireless sensor networks , 2007, Comput. Commun..

[2]  Brad Karp,et al.  Challenges in geographic routing: sparse networks, obstacles, and traffic provisioning , 2001 .

[3]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[4]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[5]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[6]  Torsten Braun,et al.  Evaluating the limitations of and alternatives in beaconing , 2007, Ad Hoc Networks.

[7]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[8]  Pedro M. Ruiz,et al.  BOSS: Beacon-less On Demand Strategy for Geographic Routing inWireless Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[9]  Young-Jin Kim,et al.  On the pitfalls of geographic face routing , 2005, DIALM-POMC '05.

[10]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[11]  Christian Schindelhauer,et al.  Geometric spanners with applications in wireless networks , 2007, Comput. Geom..

[12]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

[13]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[14]  Jörg Widmer,et al.  Contention-based forwarding for mobile ad hoc networks , 2003, Ad Hoc Networks.

[15]  Ivan Stojmenovic,et al.  Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[16]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[17]  Xiaoli Ma,et al.  Energy-efficient geographic routing with virtual anchors based on projection distance , 2008, Comput. Commun..

[18]  Pramod K. Varshney,et al.  A survey of void handling techniques for geographic routing in wireless networks , 2007, IEEE Communications Surveys & Tutorials.

[19]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[20]  Torsten Braun,et al.  BLR: beacon-less routing algorithm for mobile ad hoc networks , 2004, Comput. Commun..

[21]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[22]  Martin Mauve,et al.  Geographic routing in city scenarios , 2005, MOCO.

[23]  Young-Jin Kim,et al.  Lazy cross-link removal for geographic routing , 2006, SenSys '06.