期刊文献+

基于可靠连通支配集的高效虚拟骨干网构建算法 被引量:2

Algorithm for constructing efficient virtual backbone network based on reliable connected dominating sets
下载PDF
导出
摘要 在概率性无线传感器网络模型中,提出了一种基于可靠连通支配集的高效虚拟骨干网构建算法(EVBP-RCDS)。在删除网络中低于节点递交概率阈值的连接基础上,通过递减节点递交概率和对比节点递交概率有效度(EDDP)之和构建出所提出的可靠连通支配集;非支配节点选取与其相邻的拥有最高递交概率的支配节点传输数据。仿真实验表明:与现有文献中的两种算法相比,EVBP-RCDS算法能高效扩展网络生存时间和降低网络延迟。 In probabilistic wireless sensor networks model( PNM),an algorithm for constructing efficient virtual backbones network based on reliability connected dominating sets( EVBP-RCDS) is proposed. On the basis of deleting the links whose delivery probability are lower than the delivery probability threshold,the reliability connected dominating sets are constructed by progressively decreasing the delivery probability and comparing the sum of the effective degree of delivery probability( EDDP). Last,each dominatee selects the neighbor dominators with the maximum delivery probability to transfer data. Through simulations,the EVBP-RCDS can efficiently prolong the network lifetime compared with existing algorithms in literatures and RMCDS-GA algorithm.
出处 《传感器与微系统》 CSCD 2017年第12期130-133,共4页 Transducer and Microsystem Technologies
基金 国家自然科学基金资助项目(61262081 61662042)
关键词 递交概率 递交概率阈值 递交概率有效度 可靠连通支配集 delivery probability delivery probability threshold effective degree of delivery probability reliability connected dominating sets
  • 相关文献

参考文献1

二级参考文献10

  • 1Tseng Y,Ni S,Chen Y,et al.The broadcast storm problem in a mobile Ad-Hoc network[J].Wireless Networks,2002,8(2/3):153-167.
  • 2Gao S,Vu C T,Li Y S.Sensor scheduling for k-coverage in wireless sensor networks[C]∥Proc of the MSN,2006:268-280.
  • 3Ravi Prakash.A routing algorithm for wireless Ad Hoc networks with unidirectional links[J].Wireless Networks,2001,7:617-625.
  • 4Alzoubi K M,Wan P J,Freider O.Distributed heuristics for connected dominating set in wireless Ad Hoc networks[J].IEEE Com Soc/KICS Journal on Communication Networks,2002,4(1):22-29.
  • 5Han Bo,Fu Haohuan,Lin Lidong,et al.Efficient construction of connected dominating set in wireless Ad Hoc networks[C]∥2004IEEE International Conference on Mobile Ad-Hoc and Sensor Systems,2004:570-572.
  • 6Gao Bo,Yang Yuhang,Ma Huiye.A new distributed approximation algorithm for constructing minimum connected dominating set in wireless Ad Hoc networks[C]∥Proceedings of the Second International Symposium on Parallel and Distributed Processing and Applications,ISPA 2004,Hong Kong,China,2004:3358.
  • 7廖飞雄,马良,范炳全.一种求解最小连通支配集的高效近似算法[J].小型微型计算机系统,2008,29(5):875-878. 被引量:8
  • 8卞永钊,于海斌,曾鹏.无线传感器网络中一种启发式最小连通支配集算法[J].信息与控制,2009,38(3):355-359. 被引量:4
  • 9孙超,尹荣荣,郝晓辰,刘彬.WSNs中基于能量代价的最小权和支配集拓扑控制算法[J].电子与信息学报,2010,32(4):857-863. 被引量:11
  • 10黄行波,程红举.无线传感器网络中使用连通支配集的最小能耗广播算法[J].小型微型计算机系统,2014,35(1):74-79. 被引量:4

共引文献1

同被引文献4

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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