Topology Control Algorithm Based on Bottleneck Node for Large-Scale WSNs

Abstract

For large-scale wireless sensor networks(WSNs), a three-layer topology architecture and an algorithm of topology control for its key communication layer are proposed in this paper. In the algorithm, the base station of the network leads the ring periodically to discover the minimum power cost links from base station to each sinks, and a minimum spanning tree will be constructed. This tree will be regarded as the routing tree in the top layer of the monitoring network. To improving routing efficiency and prolonging the lifetime of the tree, the algorithm will then to find all of the bottleneck nodes(BN) in the tree under the energy consumption estimation model and eliminates these nodes by introducing some movable relay nodes in paths of the tree. Our OPNET-based simulation experiment indicates that this topology control algorithm can reduce the communication energy consumption significantly of the sinks, and the energy level of the sinks can be balanced dynamically further.

DOI: 10.1109/CIS.2009.11

8 Figures and Tables

Cite this paper

@article{Fan2009TopologyCA, title={Topology Control Algorithm Based on Bottleneck Node for Large-Scale WSNs}, author={Yiming Fan and Qingzhang Chen and Jianjun Yu}, journal={2009 International Conference on Computational Intelligence and Security}, year={2009}, volume={1}, pages={592-597} }