WSN中能量有效的连通支配集构建算法  

Energy Efficient Algorithm of Constructing Connected Dominating Set in WSN

作　　者：吉福生[1] 吴晨[1] 刘乔寿[1] 

机构地区：[1]重庆邮电大学光通信与网络重点实验室,重庆400065

出　　处：《计算机工程》2017年第1期138-143,共6页Computer Engineering

基　　金：国家自然科学基金(61371097);国家物联网发展专项资金项目(工信部科函[2014]351号);重庆邮电大学青年基金(A201293)

摘　　要：现有的连通支配集构建算法大多过程复杂、步骤冗余、耗能较多,且不能适应网络动态拓扑的变化。为此,提出一种能量有效的构建算法。该算法通过单阶段快速构建能适应节点小范围移动的连通支配集,简化构建过程,其支配节点的选择考虑节点额外覆盖范围大小、节点剩余能量等因素,使得主干网生存时间大大延长,避免频繁构建主干网带来的能耗。仿真结果表明,与EEIA_CDS,Flooding等算法相比,该算法构建主干网的开销降低31%~46%,广播风暴发生概率降低52%~67%,网络生命周期延长约35.5%。The existing methods of constructing Connected Dominating Set （CDS） have some drawbacks,such as redundant steps,much more energy consumption,and not adapting to the changes of dynamic network topology.So this paper proposes an improved algorithm called Energy Efficient Algorithm of Constructing a Connected Dominating Set （EEIACDS）,which can quickly construct a CDS that is adaptable to the tiny movement of nodes just with a single phase.It simplifies the procedure of construction and reduces the energy consumption.Furthermore,this algorithm takes the additional coverage and remaining energy of sensor nodes into consideration while choosing domination nodes.So it prolongs the survival time of backbone network and avoids energy consumption of frequenting construction backbone network.Simulation result shows that compared with the EEIACDS,Flooding algorithms the backbone construction expenditure of the proposed algorithm is reduced by about 31% - 46% and the occurrence probability of the BSP is reduced by about 52% - 67% while network＆#39;s lifetime is increased by 35.5%.

关 键 词：无线传感器网络 连通支配集 能量有效 构建算法 主干网 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]