摘要
针对无线传感器网络中节点分布不均匀,局部区域内密度过高所造成网络局部范围内通信竞争激烈,从而导致过多能量损耗的情况,提出了一种基于最小生成树的局部自适应拓扑控制算法(local self-adaptivetopology control algorithm based on MST,LSAMST)。该算法首先利用邻近图理论中的经典MST模型,以网络中各链路的能量消耗为权值,按特定的要求选举一定数量的HEAD节点,运行本地MST算法,调整部分节点的邻居节点关系,得出相应的网络拓扑图;然后,调整部分节点的发射功率,在对网络连通性影响较小的同时,减少网络维持计算开销,降低节点之间的相互竞争干扰,减少能量消耗,延长网络寿命。实验仿真结果证明,该算法对网络的连通性影响较小,可有效降低网络中的局部竞争,且计算开销较小。
Due to the uneven distribution of the nodes in wireless sensor networks and the keen competition of telecommunication in local areas caused by the node density, the energy consumption becomes a problem. A distributed minimum spanning tree （MST） based algorithm called MST - based local self - adaptive topology control algorithm （LSAMST） was proposed. Based on the MST model, taking the power consumption of every link in the networks as the weight function, the HEAD node which runs the local MST algorithm was elected according to the specific requirement. By adjusting the neighboring relation a new topology was constructed. Then the transmission power to minimize the effect on the network connectivity was adjusted. The calculation overhead to maintain the network was reduced and the competition interference between nodes was decreased. The network lifetime was also prolonged. The experimental results demonstrate that this algorithm has little effect on the network connectivity, which effectively reduces the local competition with less calculation spending.
出处
《武汉理工大学学报（信息与管理工程版）》
CAS
2008年第2期180-184,共5页
Journal of Wuhan University of Technology：Information & Management Engineering
关键词
无线传感器网络
局部自适应
最小生成树
拓扑控制
wireless sensor networks
local adaptive
minimum spanning tree
topology control
