Design and analysis of an MST-based topology control algorithm

In this paper, we present a minimum spanning tree (MST)-based algorithm, called local minimum spanning tree (LMST), for topology control in wireless multihop networks. In this algorithm, each node builds its LMST independently and only keeps on-tree nodes that are one-hop away as its neighbors in the final topology. We analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the topology can be transformed into one with bidirectional links (without impairing the network connectivity) after removal of all unidirectional links. Simulation results show that LMST can increase the network capacity as well as reduce the energy consumption.

[1]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

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

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

[4]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[5]  Krishna M. Sivalingam,et al.  A Survey of Energy Efficient Network Protocols for Wireless Networks , 2001, Wirel. Networks.

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

[7]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[8]  Jennifer C. Hou,et al.  Topology control in heterogeneous wireless networks: problems and solutions , 2004, IEEE INFOCOM 2004.

[9]  Paolo Santi,et al.  A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks , 2002, MSWiM '02.

[10]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Teresa H. Y. Meng,et al.  Minimum energy mobile wireless networks , 1999, IEEE J. Sel. Areas Commun..

[12]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[13]  Paolo Santi,et al.  A probabilistic analysis for the range assignment problem in ad hoc networks , 2001, MobiHoc '01.

[14]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[15]  Seth Pettie,et al.  An optimal minimum spanning tree algorithm , 2000, JACM.

[16]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[18]  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).

[19]  Bradford W. Parkinson,et al.  Development of Indoor Navigation System using Asynchronous Pseudolites , 2000 .

[20]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[21]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.