Geographic Routing in $d$-Dimensional Spaces With Guaranteed Delivery and Low Stretch

Almost all geographic routing protocols have been designed for 2-D. We present a novel geographic routing protocol, named Multihop Delaunay Triangulation (MDT), for 2-D, 3-D, and higher dimensions with these properties: 1) guaranteed delivery for any connected graph of nodes and physical links, and 2) low routing stretch from efficient forwarding of packets out of local minima. The guaranteed delivery property holds for node locations specified by accurate, inaccurate, or arbitrary coordinates. The MDT protocol suite includes a packet forwarding protocol together with protocols for nodes to construct and maintain a distributed MDT for routing. We present the performance of MDT protocols in 3-D and 4-D as well as performance comparisons of MDT routing versus representative geographic routing protocols for nodes in 2-D and 3-D. Experimental results show that MDT provides the lowest routing stretch in the comparisons. Furthermore, MDT protocols are specially designed to handle churn, i.e., dynamic topology changes due to addition and deletion of nodes and links. Experimental results show that MDT's routing success rate is close to 100% during churn, and node states converge quickly to a correct MDT after churn.

[1]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[2]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[3]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[4]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

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

[6]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[7]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

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

[9]  Geometric spanner for routing in mobile networks , 2001, MobiHoc.

[10]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[11]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[12]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[13]  Guoliang Xing,et al.  On greedy geographic routing algorithms in sensing-covered networks , 2004, MobiHoc '04.

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

[15]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .

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

[17]  Dario Pompili,et al.  Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks , 2006, MobiCom '06.

[18]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional networks , 2006, MobiCom '06.

[19]  Antony I. T. Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM.

[20]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[21]  V. Turau,et al.  Geographic Routing in 3D , 2007 .

[22]  Simon S. Lam,et al.  Protocol Design for Dynamic Delaunay Triangulation , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[23]  Roger Wattenhofer,et al.  Randomized 3D Geographic Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[24]  Yu Wang,et al.  Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks , 2008, WASA.

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

[26]  Simon S. Lam,et al.  Efficient and accurate protocols for distributed delaunay triangulation under churn , 2008, 2008 IEEE International Conference on Network Protocols.

[27]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[28]  Xiaohua Jia,et al.  Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks , 2009 .

[29]  Jie Wu,et al.  Efficient Geometric Routing in Three Dimensional Ad Hoc Networks , 2009, IEEE INFOCOM 2009.

[30]  Xiaohua Jia,et al.  Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks , 2006, IEEE Transactions on Communications.

[31]  Yu Chen,et al.  Practical 3D geographic routing for wireless sensor networks , 2010, SenSys '10.

[32]  Yunhao Liu,et al.  Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With Holes , 2007, IEEE/ACM Transactions on Networking.

[33]  Hongyi Wu,et al.  Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks , 2011, MobiHoc '11.

[34]  Cédric Westphal,et al.  Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.

[35]  Chen Qian,et al.  Greedy Distance Vector Routing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[36]  Chen Qian,et al.  ROME: Routing on metropolitan-scale Ethernet , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[37]  Chen Qian,et al.  Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch , 2013, TNET.