动态Ad hoc网络关键节点识别  

Identification method for critical nodes in dynamic Ad hoc network

作　　者：李鹏飞[1,2] 雷迎科[1,2] 

机构地区：[1]电子工程学院,合肥230037 [2]通信信息控制和安全技术重点实验室,浙江嘉兴314033

出　　处：《计算机应用研究》2017年第5期1473-1475,1495,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61272333);国防科技重点实验室基金资助项目(9140C130502140C13068);总装预研基金资助项目;安徽省自然科学基金资助项目(1308085QF99)

摘　　要：针对传统关键节点识别方法不能适应Ad hoc网络拓扑动态性、计算复杂度高等问题,提出一种基于网络连通性和节点删除法相结合的关键节点识别方法。该方法根据Ad hoc网络信息传播特点,给出Ad hoc网络连通性定义,提出一种新的最短距离计算方法求解网络连通性,达到降低算法时间复杂度的目的,最后根据节点删除后对网络连通性造成的破坏程度对节点进行关键性排序。实验结果表明,该方法比节点收缩法和半局部中心度法具有更好的识别效果,比中介性方法时间复杂度低,能够适应Ad hoc网络拓扑动态性。因此,该方法具有一定的应用价值,对动态Ad hoc网络关键节点识别具有重要的指导意义。In order to identify the critical nodes in dynamic Ad hoc network effectively,this paper proposed a new method based on deletion and network connectivity. Firstly,according to the transmission characteristics of Ad hoc network,the method defined the connectivity of network. Secondly,in order to reduce the complexity of the algorithm,this paper proposed a new method to calculate the shortest distance for network connectivity. Finally,the method ranked all nodes according to the damage of the network connectivity caused by deleted nodes. The results show that the method is more effective than deletion and semi-local centrality,and has a lower time complexity than betweenness centrality,and can adapt to the dynamic topology of Ad hoc network. So this method is valuable in application,and has guiding significances to the critical nodes identification in Ad hoc network.

关 键 词：关键节点 ADHOC网络 动态拓扑 网络连通性 最短距离 

分 类 号：TN915.02[电子电信—通信与信息系统]