Sciweavers

INFOCOM
2003
IEEE

Design and Analysis of an MST-Based Topology Control Algorithm

13 years 9 months ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this algorithm, each node builds its local minimum spanning tree 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 bi-directional links (without impairing the network connectivity) after removal of all uni-directional links. These results are corroborated in the simulation study.
Ning Li, Jennifer C. Hou, Lui Sha
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where INFOCOM
Authors Ning Li, Jennifer C. Hou, Lui Sha
Comments (0)