Design and analysis of an MST-based topology control algorithm
Ning Li
Hou, J.C.
Sha, L.
Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL, USA;
This paper appears in: Wireless Communications, IEEE Transactions on
Publication Date: May 2005
Volume: 4,
Issue: 3
On page(s): 1195- 1206
ISSN: 1536-1276
INSPEC Accession Number: 8593531
Digital Object Identifier: 10.1109/TWC.2005.846971
Current Version Published: 2005-05-09
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
