基于连通支配树的异构传感器网络拓扑修复算法Topologyrestoration.PDF

第33 卷第10 期 通 信 学 报 Vol.33 No. 10 2012 年10 月 Journal on Communications October 2012 doi:10.3969/j.issn.1000-436X.2012.10.010 基于连通支配树的异构传感器网络拓扑修复算法 史庭俊，方旭明，杨云 (扬州大学 信息工程学院，江苏扬州 225009) 摘 要：由于目前缺乏对异构传感器网络拓扑修复算法的研究，提出了一种基于连通支配树的异构传感器网络拓 扑修复算法(HSNTR) 。首先，算法以很小的代价构造出用于数据转发的虚拟骨干网，然后，当节点失效时，算法 对骨干网进行动态地局部修复以使其仍然连通和覆盖所有节点。理论分析证明了算法在构造和修复骨干网时使用 的最大节点数。仿真分析表明了算法在能效性、扩展性和可靠性等方面都优于其他算法。 关键词：异构传感器网络；拓扑修复；连通支配树；虚拟骨干网 中图分类号：TP393 文献标识码：A 文章编号：1000-436X(2012)10-0077-09 Topology restoration algorithm for heterogeneous sensor networks based on connected dominating tree SHI Ting-jun, FANG Xu-ming, YANG Yun (College of Information Engineering, Yangzhou University, Yangzhou 225009, China) Abstract: For currently lacking the study of the topology restoration algorithm for heterogeneous sensor networks, a topology restoration algorithm for heterogeneous sensor networks based on connected dominating tree (HSNTR) was proposed. Firstly the algorithm constructed a virtual backbone forwarding data at very low cost, and secondly when a node fails, the algorithm would dynamically locally restore the backbone to make it still connect and cover all nodes. Theoretical analysis proved the maximum number of nodes the algorithm uses during constructing and restoring the backbone. Simulation analysis showed that the algorithm is better than other algorithms in terms of energy efficiency, scalability and reliability. Key words: heterogeneous sensor networks; topology restoration; connected dominating tree