Efficient localized routing for wireless ad hoc networks

We consider a wireless ad hoc network consisting of n points randomly distributed In a two-dimensional plane. We show that, with high probability, we can locally find a path for any pair of nodes such that the length of the path is no more than a constant factor of the minimum. By assuming each node knows its position, the method decides where to forward the message purely based on the positions of current node, its neighbors, and the positions of the source and the target. Our method is based on a novel structure called localized Delaunay triangulation [1] and an efficient localized routing method [2] that guarantees that the distance traveled by the packets is no more than a small constant factor of the minimum when the Delaunay triangulation of wireless nodes are known. Our experiments show that the delivery rates of existing localized routing protocols are increased when localized Delaunay triangulation is used instead of several previously proposed topologies, and the localized routing protocol based on Delaunay triangulation works well in practice. We also conducted extensive simulations of another localized routing protocol, FACE method [3]. The path found by this protocol is also reasonably good compared with previous one although it cannot guarantee a constant approximation on the length of the path traveled theoretically.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  David Eppstein.  Beta-skeletons have unbounded dilation , 2002, Comput. Geom..

[3]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[4]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2002, Int. J. Comput. Geom. Appl..

[5]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[6]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[7]  Xiang-Yang Li,et al.  Distributed spanner with bounded degree for wireless ad hoc networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[9]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[10]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[11]  YU WANG,et al.  Distributed Spanners with Bounded Degree for Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[12]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[13]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

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

[15]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[16]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

[18]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[19]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[20]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[21]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..

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

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

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

[25]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

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

[27]  P. Bose,et al.  Online routing in geometric graphs , 2001 .

[28]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.