针对现有算法恢复分区连通性存在容错性差的问题，提出了分区双连通性恢复算法DCRA。该算法旨在网络中心区域构建骨干多边形，分区以两条互不相交的路径与多边形连接，从而实现分区间的双连通。仿真实验表明，与现有一些双连通算法相比，所提算法不仅减少了部署中继节点的数量，而且算法的运行时间能够减少60%左右，可以快速确定部署的中继节点位置，从而快速恢复分区连通性。  

In order to solve the problem that the existing algorithms have poor fault tolerance when recovering the partition connectivity, we propose a double connectivity recovery algorithm in partition (DCRA). The algorithm aims at building a backbone polygon in the center area of the network and connecting partitions with the polygon by two disjoint paths to realize double connectivity between partitions. Simulation experiments show that compared with some existing double connectivity algorithms, the proposed algorithm cannot only reduce the number of deployed relay nodes and the running time of the algorithm by about 60%, but also quickly determine the location of the relay nodes so as to quickly recovery partition connectivity.
相关文章

[1]	曹敦1,2，雷正保1. 一种山区环境下车际网的中继节点选择方法[J]. 计算机工程与科学, 2017, 39(02): 297-302.
[2]	刘天明，张大方，曾 彬，谢 希，李明伟. 一种基于改进HyperCast的多播协议[J]. J4, 2010, 32(4): 14-17.
[3]	陈龙，李鹏. 一种基于完整性指示码的电子证据分散存储改进方法[J]. J4, 2010, 32(11): 60-62.
[4]	王国军 陈松乔 等. 具有大量错误结点的超立方体网络中并行路由算法[J]. J4, 2001, 23(5): 5-12.