摘要
针对现有算法恢复分区连通性存在容错性差的问题,提出了分区双连通性恢复算法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.
出处
《计算机工程与科学》
CSCD
北大核心
2017年第4期673-677,共5页
Computer Engineering & Science
基金
江苏省"六大人才高峰"第十一批高层次人才项目(DZXX-026)
2014年国家公派高级研究学者及访问学者(含博士后)项目
国家自然科学基金(61304264)
江苏高校优势学科建设工程资助项目(PAPD)
江苏省产学研联合创新资金前瞻性联合研究项目(BY2014023-31)
中央高校基本科研业务费专项资金(JUSRP51510)
关键词
双连通
容错性
骨干多边形
中继节点
double connectivity
fault tolerance
backbone polygon
relay node