Curve-based planar graph routing with guaranteed delivery in multihop wireless networks

Abstract Localized geographic routing schemes operating on planar graphs promise scalability for use within large multihop wireless networks. However, none of the existing schemes is flexible enough to adapt the sequence of faces visited by the constructed path. Thus, real-world constraints may severely impact the network performance. To address this problem, we extend planar graph routing to allow the algorithm to forward packets along a sequence of faces intersected by any arbitrary curve. We analytically prove that this extended scheme is loop free and allows for guaranteed delivery. Furthermore, we investigate schemes for choosing curves dealing with imperfections in the network.

[1]  Ivan Stojmenovic,et al.  On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks , 2010, IEEE Transactions on Computers.

[2]  Murat Yuksel,et al.  An implementation framework for trajectory-based routing in ad-hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[4]  B. R. Badrinath,et al.  Trajectory based forwarding and its applications , 2003, MobiCom '03.

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

[6]  Murat Yuksel,et al.  Minimizing multi-hop wireless routing state under application-based accuracy constraints , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[7]  B. R. Badrinath,et al.  Localized positioning in ad hoc networks , 2003, Ad Hoc Networks.

[8]  David G. Kirkpatrick,et al.  On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2008, Wirel. Networks.

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

[10]  Ralf Steinmetz,et al.  GeoSec: quarantine zones for mobile ad hoc networks , 2009, Secur. Commun. Networks.

[11]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[12]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[13]  Hannes Frey,et al.  Curve-based planar graph routing with guaranteed delivery in multihop wireless networks , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).

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

[15]  Hannes Frey,et al.  A localized planarization algorithm for realistic wireless networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[16]  Yih-Chun Hu,et al.  A survey of secure wireless ad hoc routing , 2004, IEEE Security & Privacy Magazine.

[17]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[18]  Xianliang Lu,et al.  Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing , 2010, IEEE Transactions on Mobile Computing.

[19]  Antonio Alfredo Ferreira Loureiro,et al.  Data dissemination based on the energy map , 2005, IEEE Communications Magazine.

[20]  Jean-Yves Le Boudec,et al.  Self Organized Terminode Routing , 2002, Cluster Computing.

[21]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.