论文部分内容阅读
针对传统关键节点识别方法不能有效适应大规模Ad Hoc网络关键节点识别问题,提出一种基于删除法和网络连通可靠性相结合的关键节点识别方法.该方法首先识别出k跳范围内所有网络分割点,然后综合考虑节点删除后剩余网络离散程度、节点数和分支数对网络连通可靠性的影响,给出所有分割点的关键性排序.实验分析表明,该方法有效可行,能够利用局部范围信息识别出全局关键节点,比中介性方法的时间复杂度低,对大规模Ad Hoc网络的关键节点识别具有理想的计算能力,比k跳删除法识别结果更精确,并且当3≤k≤7时,对动态Ad Hoc网络关键节点识别具有良好的适应性.
Aiming at the problem that the traditional key node identification method can not effectively adapt to the key node identification in large-scale Ad Hoc networks, this paper proposes a key node identification method based on the combination of deletion method and network connection reliability. This method first identifies all network segments in k- And then consider the influence of remaining network dispersion, the number of nodes and the number of branches on the reliability of network connectivity after node deletion, and give the key ordering of all the segmentation points.Experimental analysis shows that this method is effective and feasible, and can use local range information Identifying the global key nodes is less time consuming than the intermediate ones, and has the ideal computing ability for the key node identification of large-scale Ad Hoc networks, which is more accurate than the k-hop deletion method. When 3≤k≤7 , It has a good adaptability to the key node identification in dynamic Ad Hoc network.