WSN中能量有效的连通支配集构建算法
发布时间:2018-07-02 10:25
本文选题:无线传感器网络 + 连通支配集 ; 参考:《计算机工程》2017年01期
【摘要】:现有的连通支配集构建算法大多过程复杂、步骤冗余、耗能较多,且不能适应网络动态拓扑的变化。为此,提出一种能量有效的构建算法。该算法通过单阶段快速构建能适应节点小范围移动的连通支配集,简化构建过程,其支配节点的选择考虑节点额外覆盖范围大小、节点剩余能量等因素,使得主干网生存时间大大延长,避免频繁构建主干网带来的能耗。仿真结果表明,与EEIA_CDS,Flooding等算法相比,该算法构建主干网的开销降低31%~46%,广播风暴发生概率降低52%~67%,网络生命周期延长约35.5%。
[Abstract]:Most of the existing algorithms for constructing connected dominating sets are complex, redundant and energy-consuming, and can not adapt to the change of network dynamic topology. Therefore, an energy efficient construction algorithm is proposed. The algorithm can quickly construct the connected dominating set which can adapt to the small scale movement of nodes, and simplify the construction process. The selection of the dominating nodes takes into account the additional coverage of nodes, the residual energy of nodes, and so on. The survival time of backbone network is prolonged greatly, and energy consumption caused by building backbone network frequently is avoided. The simulation results show that compared with EEIAA CDSU flooding algorithm, the cost of constructing the main network is reduced by 31 / 46, the probability of broadcasting storm is reduced by 52 / 67, and the network life cycle is prolonged by 35. 5%.
【作者单位】: 重庆邮电大学光通信与网络重点实验室;
【基金】:国家自然科学基金(61371097) 国家物联网发展专项资金项目(工信部科函[2014]351号) 重庆邮电大学青年基金(A201293)
【分类号】:TP212.9;TN929.5
【相似文献】
相关期刊论文 前10条
1 马娅婕;田翔川;;网络拓扑聚合的带宽加权支配集算法研究[J];小型微型计算机系统;2007年04期
2 张e,
本文编号:2089818
本文链接:https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2089818.html