基于三角形斯坦纳树的分区连通性恢复算法

无线传感器网络中的节点由于自身能量的消耗，及外部因素影响会导致节点出现大规模的失效，从而把无线传感器网络分割成几个独立的不能相互通信的分区。为恢复网络，重建分区之间的通信链路，提出基于三角形斯坦纳树连通恢复算法。该算法首先利用传统算法实现分区连通，然后通过构建三角形斯坦纳树以减少部署的中继节点数量。与现有的一些算法相比，该方法形成的网络拓扑不仅减少了部署中继节点的数量，能够使分区重新连通，而且能够减少网络通信的能量消耗。实验结果表明，所提方法相对于传统算法在构建网络拓扑时更加有效。

Connectivity Recovery Algorithm in partition based on Triangle Steiner Tree

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.