Geometric Spanners for Wireless Ad Hoc Networks

We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. Priori arts showed that both structures can be constructed locally with bounded communication costs. This new spanner has these following attractive properties: 1) the backbone is a planar graph, 2) the node degree of the backbone is bounded from above by a positive constant, 3) it is a spanner for both hops and length, 4) it can be constructed locally and is easy to maintain when the nodes move around, and 5) moreover, the communication cost of each node is bounded by a constant. Simulation results are also presented for studying its practical performance.

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

[2]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[3]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

[4]  RNG and internal node based broadcasting algorithms for wireless one-to-one networks , 2001, MOCO.

[5]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[6]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

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

[8]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[9]  Maw-Sheng Chern,et al.  An efficient distributed algorithm for minimal connected dominating set problem , 1991, [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications.

[10]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[11]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[12]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[14]  Peng-Jun Wan,et al.  Virtual backbones in wireless ad hoc networks , 2002 .

[15]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  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.

[17]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[18]  Xiang-Yang Li,et al.  Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks , 2002, DIALM '02.

[19]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[20]  Siu Man Lui,et al.  Participation incentive mechanisms in peer-to-peer subscription systems , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[21]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

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

[23]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[24]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[25]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[26]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[27]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[28]  Ravi Prakash,et al.  Load-balancing clusters in wireless ad hoc networks , 2000, Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology.

[29]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[30]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[31]  Young Ko,et al.  Using Location Information to Improve Routing in Ad Hoc Networks , 1997 .

[32]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

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

[34]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

[35]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[36]  Jie Wu,et al.  Domination and its applications in ad hoc wireless networks with unidirectional links , 2000, Proceedings 2000 International Conference on Parallel Processing.

[37]  André Schumacher.  Dominating Set Based Routing , 2003 .

[38]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

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