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

发布时间：2018-04-17 16:17

本文选题：关键节点 + Ad　；参考：《计算机应用研究》2017年05期

【摘要】：针对传统关键节点识别方法不能适应Ad hoc网络拓扑动态性、计算复杂度高等问题,提出一种基于网络连通性和节点删除法相结合的关键节点识别方法。该方法根据Ad hoc网络信息传播特点,给出Ad hoc网络连通性定义,提出一种新的最短距离计算方法求解网络连通性,达到降低算法时间复杂度的目的,最后根据节点删除后对网络连通性造成的破坏程度对节点进行关键性排序。实验结果表明,该方法比节点收缩法和半局部中心度法具有更好的识别效果,比中介性方法时间复杂度低,能够适应Ad hoc网络拓扑动态性。因此,该方法具有一定的应用价值,对动态Ad hoc网络关键节点识别具有重要的指导意义。
[Abstract]:Aiming at the problem that the traditional key node identification method can not adapt to the topology dynamics and high computational complexity of Ad hoc network, a key node identification method based on the combination of network connectivity and node deletion is proposed.According to the characteristics of information transmission in Ad hoc network, the definition of connectivity in Ad hoc network is given, and a new shortest distance computing method is proposed to solve the connectivity of Ad hoc network, which can reduce the time complexity of the algorithm.Finally, the nodes are ranked according to the degree of damage to the network connectivity caused by node deletion.The experimental results show that the proposed method is more effective than the node contraction method and the semi-local centrality method, and has lower time complexity than the intermediary method, and can adapt to the topology dynamics of Ad hoc networks.Therefore, this method has certain application value, and has the important guiding significance to the dynamic Ad hoc network key node identification.
【作者单位】：电子工程学院;通信信息控制和安全技术重点实验室;
【基金】：国家自然科学基金资助项目(61272333) 国防科技重点实验室基金资助项目(9140C130502140C13068) 总装预研基金资助项目安徽省自然科学基金资助项目(1308085QF99)
【分类号】：TN929.5

【相似文献】