摘要
针对传统关键节点识别方法不能有效适应大规模Ad Hoc网络关键节点识别问题,提出一种基于删除法和网络连通可靠性相结合的关键节点识别方法.该方法首先识别出k跳范围内所有网络分割点,然后综合考虑节点删除后剩余网络离散程度、节点数和分支数对网络连通可靠性的影响,给出所有分割点的关键性排序.实验分析表明,该方法有效可行,能够利用局部范围信息识别出全局关键节点,比中介性方法的时间复杂度低,对大规模Ad Hoc网络的关键节点识别具有理想的计算能力,比k跳删除法识别结果更精确,并且当3≤k≤7时,对动态Ad Hoc网络关键节点识别具有良好的适应性.
In order to identify the critical nodes of the large-scale Ad Hoc network effectively, a new method based on deletion and network connectivity was proposed. The method first identified all network segmentation points in k-hop range, then given the rank of segmentation points taking the network dispersion degree, the number of nodes and branches as impact factors for network connectivi- ty. The result shows that the method is more effective than k-hop node deletion as it can use local information to identify the global critical nodes, and the time complexity of the method is lower than betweenness to identify the critical nodes in large-scale Ad Hoc net- work, in addition, the method detects the critical node faster and more reliably when the k-hop range between 3-7.
出处
《小型微型计算机系统》
CSCD
北大核心
2017年第6期1198-1202,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61272333)资助
国防科技重点实验室基金项目(9140C130502140C13068)资助
总装预研基金项目(9140A33030114JB39470)资助
安徽省自然科学基金项目(1308085QF99)资助