Localized low-weight graph and its applications in wireless ad hoc networks

We propose a new localized structure, namely, Incident MST and RNG Graph (IMRG), for topology control and broadcasting in wireless ad hoc networks. In the construction algorithm, each node first builds a modified relative neighborhood graph (RNG'), and then informs its one-hop neighbors its incident edges in RNG'. Each node then collects all its one-hop neighbors and the two-hop neighbors who have RNG edges to some of its one-hop neighbors, and builds an Euclidean minimum spanning tree of these nodes. Each node u keeps an edge uv only if uv is in the constructed minimum spanning tree. We analytically prove that the node degree of the IMRG is at most 6, it is connected and planar, and more importantly, the total edge length of the IMRG is within a constant factor of that of the minimum spanning tree. To the best of our knowledge, this is the first algorithm that can construct a structure with all these properties using small communication messages (at most 13n total messages, each with O(logn) bits) and small computation cost, where n is the number of wireless nodes. Test results are corroborated in the simulation study.

[1]  Xiang-Yang Li,et al.  Efficient Construction of Low Weight Bounded Degree Planar Spanner , 2003, COCOON.

[2]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

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

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

[5]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

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

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

[8]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[9]  Limin Hu,et al.  Topology control for multihop packet radio networks , 1993, IEEE Trans. Commun..

[10]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[11]  Shay Kutten,et al.  A sub-linear time distributed algorithm for minimum-weight spanning trees , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Michalis Faloutsos.  Creating Optimal Distributed Algorithms for Minimum Spanning Trees , 1995 .

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

[14]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[15]  Xiang-Yang Li,et al.  Approximate MST for UDG Locally , 2003, COCOON.

[16]  Andrea E. F. Clementi,et al.  Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.

[17]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

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

[19]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[21]  Vaduvur Bharghavan,et al.  Transmission power control for multiple access wireless packet networks , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

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

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

[24]  P. R. Kumar,et al.  Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol , 2002 .

[25]  Tamás Lukovszki,et al.  New results on geometric spanners and their applications , 1999 .

[26]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[27]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[28]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[29]  Andrzej Pelc,et al.  Power Consumption in Packet Radio Networks (Extended Abstract) , 1997, STACS.

[30]  Paramvir Bahl,et al.  Distributed Topology Control for Wireless Multihop Ad-hoc Networks , 2001, INFOCOM.

[31]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.

[32]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[33]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[34]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

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

[36]  Gruia Calinescu.  Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks , 2003, ADHOC-NOW.

[37]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

[38]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

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

[40]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..

[41]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[42]  Xiang-Yang Li,et al.  Localized Construction of Low Weighted Structure and Its Applications in Wireless Ad Hoc Networks , 2005, Wirel. Networks.