期刊文献+

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

Energy Efficient Algorithm of Constructing Connected Dominating Set in WSN
在线阅读 下载PDF
导出
摘要 现有的连通支配集构建算法大多过程复杂、步骤冗余、耗能较多,且不能适应网络动态拓扑的变化。为此,提出一种能量有效的构建算法。该算法通过单阶段快速构建能适应节点小范围移动的连通支配集,简化构建过程,其支配节点的选择考虑节点额外覆盖范围大小、节点剩余能量等因素,使得主干网生存时间大大延长,避免频繁构建主干网带来的能耗。仿真结果表明,与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's lifetime is increased by 35.5%.
出处 《计算机工程》 CAS CSCD 北大核心 2017年第1期138-143,共6页 Computer Engineering
基金 国家自然科学基金(61371097) 国家物联网发展专项资金项目(工信部科函[2014]351号) 重庆邮电大学青年基金(A201293)
关键词 无线传感器网络 连通支配集 能量有效 构建算法 主干网 energy efficiency construction algorithm backbone network
  • 相关文献

参考文献6

二级参考文献74

  • 1阎新芳,孙雨耕,胡华东.基于极大权的最小连通支配集启发式算法[J].电子学报,2004,32(11):1774-1777. 被引量:24
  • 2张静,孙雨耕,房朝晖.能量有效的最小连通支配集近似算法[J].传感技术学报,2004,17(4):603-606. 被引量:7
  • 3YAO Kung.Sensor Networking: Concepts, Applications, and Challenges[J].自动化学报,2006,32(6):839-845. 被引量:8
  • 4唐勇,周明天.基于极大独立集的最小连通支配集的分布式算法[J].电子学报,2007,35(5):868-874. 被引量:21
  • 5Zhao T, Cai W D, and Liu G. Topology control for wireless sensor networks[C]. 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007. Dalian, China. Sep 18-21 2007: 343-348.
  • 6Jardosh S and Ranjan P. A survey: Topology control for wireless sensor networks[C]. International Conference on Signal Processing Communications and Networking, ICSCN 2008, Chennai, India, Jan 4-6 2008: 422-427.
  • 7Navid N and Christian B. Topology management for improving routing and network performances in mobile ad hoc networks[J]. Mobile Networks and Applications, 2004, 9(6): 583-594.
  • 8Ruan L, Du H W, and Jia X H, et al.. A greedy approximation for minimum connected dominating sets[J]. Theoretical Computer Science, 2004, 329(1): 325-330.
  • 9Qian J S and Sun Y J. Construction of distributed connected dominating sets in growth-bounded graphs[C]. 2008 3rd IEEE Conference on Industrial Electronics and Applications, ICIEA 2008, Singapore, Singapore, Jun 3-5 2008: 1430-1434.
  • 10Khaled A, Li X Y, and Wang Y, et al.. Geometric spanners for wireless ad hoc networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2003, 14(4): 408-421.

共引文献48

同被引文献10

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部