一种能量均衡的最小连通支配集构造算法

发布时间：2018-10-22 15:22

【摘要】：针对无线传感器网络中没有固定的基础设施问题,提出一种能量均衡的最小连通支配集构造算法,该算法首先为网络构造一个极大独立集,然后选择最少的连接节点使极大独立集连通,并在使极大独立集连通时加入了修剪规则,使连通支配集规模更小,最后,针对网络拓扑变化导致连通支配集重构问题,提出了局部构造最小连通支配集算法.通过优先选择能量多、度数大的节点来构造连通支配集,并考虑了连通支配集重构问题,使网络中节点能量消耗更加均衡,从而有效地延长了网络寿命.理论分析和实验结果表明,与相关的分布式算法相比,本文算法产生的连通支配集在规模上更优,网络寿命更长.
[Abstract]:To solve the problem that there is no fixed infrastructure in wireless sensor networks, a minimum connected dominating set construction algorithm for energy balance is proposed. The algorithm constructs a maximal independent set for the network. Then we select the least connected node to make the maximal independent set connected, and add the pruning rule to make the maximum independent set connected, so that the scale of the connected dominating set is smaller. Finally, for the network topology change, the connected dominating set is reconstructed. A local algorithm for constructing minimal connected dominating sets is proposed. The connected dominating set is constructed by preferential selection of nodes with more energy and larger degrees, and the problem of reconstructing connected dominating sets is considered, which makes the energy consumption of nodes in the network more balanced, thus effectively prolonging the network lifetime. Theoretical analysis and experimental results show that compared with the related distributed algorithms, the connected dominating set generated by the proposed algorithm is better in scale and the network lifetime is longer.
【作者单位】：苏州大学计算机科学与技术学院;
【基金】：国家自然科学基金项目(61170021)资助高等学校博士学科点专项科研基金项目(20103201110018)资助江苏省高校青蓝工程项目资助苏州大学科技创新团队(SDT2012B02)资助
【分类号】：TN929.5;TP212.9

【参考文献】