首页 | 本学科首页   官方微博 | 高级检索  
     

动态Ad Hoc网络关键节点识别*
引用本文:李鹏飞,雷迎科.动态Ad Hoc网络关键节点识别*[J].计算机应用研究,2017,34(5).
作者姓名:李鹏飞  雷迎科
作者单位:电子工程学院 安徽 合肥,电子工程学院 安徽 合肥
基金项目:国家自然科学基金资助项目(61272333);国防科技重点实验室基金(9140C130502140C13068);总装预研项目基金(9140A33030114JB39470);安徽省自然科学基金资助项目(1308085QF99)
摘    要:针对传统关键节点识别方法不能适应Ad Hoc网络拓扑动态性、计算复杂度高等问题,本文提出一种基于网络连通性和节点删除法相结合的关键节点识别方法。该方法首先根据Ad Hoc网络信息传播特点,给出Ad Hoc网络连通性定义,其次提出一种新的最短距离计算方法求解网络连通性,达到降低算法时间复杂度的目的,最后根据节点删除后对网络连通性造成的破坏程度对节点进行关键性排序。实验结果表明,本文提出的识别方法比传统的识别方法更能适应动态Ad Hoc网络关键节点识别,具有一定的应用价值。

关 键 词:关键节点  Ad  Hoc网络  动态拓扑  网络连通性  最短距离
收稿时间:2016/2/29 0:00:00
修稿时间:2017/3/3 0:00:00

Identification method for critical nodes in dynamic Ad Hoc network
Peng-fei Li and Ying-ke Lei.Identification method for critical nodes in dynamic Ad Hoc network[J].Application Research of Computers,2017,34(5).
Authors:Peng-fei Li and Ying-ke Lei
Affiliation:Electronic Engineering Institute,Electronic Engineering Institute
Abstract:In order to identify the critical nodes in dynamic Ad Hoc network effectively, a new method based on deletion and network connectivity was proposed. Firstly, the connectivity of Ad Hoc network was defined according to the transmission characteristics. Secondly, in order to reduce the complexity of the algorithm, a new method of calculating the shortest distance for network connectivity was proposed. Finally, the rank of nodes was given according to the damage to the network connectivity caused by deleted nodes. The result shows that our method is effective and adaptable to the critical nodes detection in Ad Hoc network.
Keywords:critical nodes  Ad Hoc network  dynamic topology  network connectivity  shortest distance
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号