首页 | 本学科首页   官方微博 | 高级检索  
     

一种传感器网络容错拓扑控制算法
引用本文:李长庚,宁新鲜,朱芝靖,陈娟. 一种传感器网络容错拓扑控制算法[J]. 传感器与微系统, 2009, 28(4): 23-26
作者姓名:李长庚  宁新鲜  朱芝靖  陈娟
作者单位:中南大学物理科学与技术学院,湖南,长沙,410083
摘    要:
基于对局部最小生成树拓扑控制算法的研究,提出了对该算法改进的容错拓扑控制算法。通过广播来收集节点的局部信息构造局部最小生成树,并通过深度优先搜索算法使得任意两节点间至少存在K(K=2,3)条内部节点互不相交的路径,保证网络的K连通和容错特性。仿真结果表明:该算法降低了网络的功耗,提高例了网络的容量,网络的容错性能和生存能力都有了较大的提高。

关 键 词:无线传感器网络  容错  拓扑控制  最小生成树  深度优先搜索

Fault-tolerant topology control algorithm in wireless senor networks
LI Chang-geng,NING Xin-xian,ZHU Zhi-jing,CHEN Juan. Fault-tolerant topology control algorithm in wireless senor networks[J]. Transducer and Microsystem Technology, 2009, 28(4): 23-26
Authors:LI Chang-geng  NING Xin-xian  ZHU Zhi-jing  CHEN Juan
Affiliation:(School of Physics Science and Technology, Central South University, Changsha 410083, China)
Abstract:
Based on the study of local minimum spanning tree (LMST), a new topology control algorithms--faulttolerant topology control algorithm based on LMST(FLMST) is propose. The algorithm constructs LMST by locally collected information, then it makes the network exsit at least K( K =2,3 )pairwise-vertex-disjoint paths amongest the nodes by executing depth-first search algorithm. This algorithm preserves K connectivity and fault-tolerant property. Simulation results indicate that compared with existing topology control algorithms FLMST not only reduces power consumption and increases network capacity, but also the net fault-tolerance and surviving time are much improved.
Keywords:wireless senor networks (WSNs)  fanh-tolerant  topology control  minimum spanning tree  depthfirst search
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号