传感技术学报2016，Vol.29Issue(3)：423-428,6.DOI:10.3969/j.issn.1004-1699.2016.03.020
基于三角形斯坦纳树的分区连通性恢复算法
Connectivity Recovery Algorithm in Partition Based on Triangle Steiner Tree
摘要
Abstract
Due to the consumption of energy as well as the impact of other external factors,nodes in wireless sensor networks(WSN)can easily encounter the problem of large-scale failure,thus getting the networks divided into sever⁃al independent partitions which can’t effectively communicate with each other. In order to restore the network and reconstruct the communication links between the partitions,a triangle steiner tree based connectivity restoration al⁃gorithm is proposed. The algorithm first employs a traditional algorithm to achieve partition connectivity ,and then by constructing triangle Steiner tree the number of deployed relay nodes can be reduced. Compared with some exist⁃ing algorithms,the topology of the network formed in this article can not only reduce the number of deployed relay nodes and make the partitions reconnected,but also is able to cut down the energy consumption of network commu⁃nication. The simulation results altogether indicate the proposed algorithm is more effective than traditional meth⁃ods in building the network topology.关键词
无线传感器网络/连通性/三角形斯坦纳树/分区Key words
wireless sensor network/connectivity/triangle steiner tree/partition分类
信息技术与安全科学引用本文复制引用
秦宁宁,吴德恩,余颖华..基于三角形斯坦纳树的分区连通性恢复算法[J].传感技术学报,2016,29(3):423-428,6.基金项目
江苏省“六大人才高峰”第十一批高层次人才项目（DZXX-026）；2014年国家公派高级研究学者及访问学者（含博士后）项目；国家自然科学基金项目（61304264）；江苏高校优势学科建设工程项目；江苏省产学研联合创新资金前瞻性联合研究项目（BY2014023-31）；中央高校基本科研业务费专项资金项目 （）
