摘要
Abstract
The optimal deployment of overlay network, which involves constructing overlay model, extracting multi-object function and designing optimal deployment algorithm, is one of the important parts in overlay network research. Generally speaking, the ranges of overlay network are often irregular closed graphs because of multifarious barriers. Consequently, we hope to put forward a fast algorithm based on marginal fitting to overcome a mass of wasting when calculating cover area. Sig-nificantly, the optimal deployment of overlay network in real world should take more aspects into consideration, including cover area, detection probability, and threaten degree of near link path which are different to formers. More attention, the near link path is aimed to analyze the relationship between dispersed remain areas in order to find out the probability of being a relative closed path which is uncovered by the overlay network. Finally, we put forward an optimal deployment algorithm based on NSGA-Ⅱ to deal with this problem, within different genetic operators such as attractive jumping, gene reversing and attractive overlapping to generate new candidates, and using global temperature to control generation and selection of candidates as Simulated Annealing. The marginal fitting algorithm was found highly accurate and fast for calculating the cover area, and the near link path discovered a different novel request in deployment, and the optimal deployment algorithm was proved to suit for overlay network deployment.关键词
优化部署/NSGA-Ⅱ算法/干扰环境/全局覆盖系数Key words
optimal deployment/NSGA-Ⅱ/jamming/global overlap index分类
信息技术与安全科学
