期刊文献+

k-不相交路径的容错拓扑控制算法 被引量:2

Fault-Tolerant Topology Control Algorithm for k-Disjoint Paths
下载PDF
导出
摘要 针对无线传感器网络中拓扑控制算法优化目标单一的问题,提出一种既能优化网络能量效率,又能保证网络容错性的k-不相交路径的容错拓扑控制算法.首先,构建传感器节点到sink节点的k条不相交路径,通过增加冗余链路以提高网络的容错性;其次,选择路径能耗、路径中节点功率的标准差及路径跳数检测路径质量;最后,建立多目标规划,并利用智能优化算法对其进行求解,根据k值的不同对路径进行择优选择以达到降低网络能耗并延长网络寿命的目的.仿真实验结果表明,由该算法构造的网络拓扑能有效降低网络能耗,延长网络寿命并提高网络的容错性. Aiming at the problem of single objective optimization of topology control algorithm in wireless sensor networks, we proposed a fault-tolerant topology control algorithm for k-disjoint paths, which could not only optimize the network energy efficiency but also guarantee the network fault tolerance. Fristly, k-disjoint paths were constructed from sensor nodes to the sink node, and improving network fault tolerance by adding redundant links. Secondly, we selected energy consumption o{ the path, the standard deviation of the power of nodes in the path and the number of path hops as a measure of the path quality. Finally, a multi-objective programming was established, and intelligent optimization algorithm was used to solve the problem. According to the different k values, the path was selected to achieve the purpose of reducing the network energy consumption and prolonging the network lifetime. Simulation experiment results show that the network topology constructed by this algorithm can effectively reduce the network energy consumption, prolong the network lifetime and improve the network fault tolerance.
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2017年第3期635-640,共6页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:61373174) 中央高校基本科研业务费专项基金(批准号:JB150716)
关键词 无线传感器网络 拓扑控制 不相交路径 容错性 wireless sensor network topology control disjoint path fault tolerance
  • 相关文献

参考文献5

二级参考文献87

  • 1王良民,马建峰,王超.无线传感器网络拓扑的容错度与容侵度[J].电子学报,2006,34(8):1446-1451. 被引量:22
  • 2刘林峰,刘业.传感器网络中基于模拟退火算法的拓扑控制方案[J].通信学报,2006,27(9):71-77. 被引量:6
  • 3Ishida K, Kakuda Y, Kikuno T. A routing protocol for finding two node-disjoint paths in computer networks [C] // Int Conf on Network Protocols. Washington DC: IEEE, 1992:340-347.
  • 4Suurhalle J W, Disjoint paths in a network [J]. Networks, 1974, 4:125-145.
  • 5Suurhalle J W, Tarjan R E. A quick method for finding shortest pairs of disjoint paths [J]. Networks, 1984, 14(2) : 325-336.
  • 6Bhandari R. Optimal physical diversity algorithms and survivable networks [C] //Proc of the 2nd IEEE Symp on Computers and Communications 1997. Washington: IEEE, 1997:433-441.
  • 7Lee S J, Gerla M. Split multipath routing with maximally disjoint paths in ad hoe networks [C] //Proc of IEEE ICC 2001. Washington: IEEE, 2001:3201-3205.
  • 8Nasipuri A, Das S R. mobile ad hoc networks Washington: IEEE, 199 On-demand multi-path routing for [C] //Proc of IEEE ICCCN 1999. 9: 64-70.
  • 9Vutukury S, Garcia-Luna-Aceves J J. MDVA.. A distancevector multipath routing protocol [C] //Proc of IEEE INFOCOM 2001. Washington: IEEE, 2001:557-564.
  • 10Richard G Ogier, Nachum Shacham. A distributed algorithm for finding shortest pairs of disjoint paths [C]//Proc of IEEE INFOCOM 1989. Washington: IEEE, 1989:173-182.

共引文献35

同被引文献11

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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