基于信誉推荐的Ad Hoc网络虫洞防御方案  

A Wormhole Defense Method for Ad Hoc Network Based on Credibility Recommendation

作　　者：郭华娟[1] 曹晓梅[1,2] 朱杰[1] 

机构地区：[1]南京邮电大学计算机与软件学院,江苏南京210003 [2]江苏省无线传感网高技术研究重点实验室,江苏南京210003

出　　处：《计算机技术与发展》2016年第8期83-87,共5页Computer Technology and Development

基　　金：国家自然科学青年基金(61202353);国家自然科学基金资助项目(60873231)

摘　　要：虫洞攻击是一种针对Ad Hoc网络路由协议的典型恶意攻击。两个恶意节点进行合谋协同攻击,从而吸引大量数据包达到控制网络和紊乱路由机制的目的。为了解决这一问题,提出信誉推荐算法—CRPFA(Credibility Recommended Path Flow Algorithm),主要以三个步骤实现虫洞的防御,包括信誉计算、节点聚类、节点推荐,构建了新虫洞防御方法。该算法既不需要额外的硬件设备,也不需要定位恶意节点具体位置,且有效地克服了节点的自私性、欺骗性,保证了数据包的安全传输。仿真结果表明,该算法在传输距离、节点密度得到保证的情况下,能够高效地防止恶意节点参加路由选择,保证了数据包的有效传递。与CERep机制的仿真结果进行对比,结果进一步验证了该方法的可行性和有效性。The wormhole attack is a typical malicious attacks against Ad Hoe routing protocols. Two malicious nodes are conspiring to co- ordinated attack, attracting a large number of data packets to achieve the objective of controlling network and disordering routing mecha- nism. In order to solve this problem,a CRPFA （Credibility Recommended Path Flow Algorithm） is proposed which mainly divides into three steps to achieve the defense of the wormhole, including credit calculation, node aggregation and recommendation, construction of the new wormhole defense. This algorithm does not need additional hardware devices, also not need to locate malicious node location, and ef- fectively overcomes the selfish and deceptive node, ensuring the safety of data packet transmission. The simulation results show that on the condition of guaranteeing in the transmission distance and the density of nodes, the algorithm proposed can efficiently prevent malicious nodes to participate in the routing and ensure effective transmission of the data packets. Compared with the CERep mechanism,the results show that the feasibility and validity of the method is further verified.

关 键 词：AD HOC网络 虫洞攻击 信誉 聚类算法 推荐值 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]