检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江南大学物联网工程学院,江苏无锡214122 [2]中国水产科学研究院 淡水渔业研究中心 农业部淡水鱼类遗传育种和养殖生物学重点开放实验室,江苏无锡214081
出 处:《计算机工程与应用》2012年第17期129-133,共5页Computer Engineering and Applications
基 金:农业部淡水鱼类遗传育种和养殖生物学重点开放实验室开放基金资助项目(No.BZ2009-07)
摘 要:针对AdHoc网络易遭受黑洞攻击而造成大量丢包现象的安全问题,提出了一种基于非合作博弈理论的安全路由方法。以AdHoc网络节点和恶意节点为对象建立双人博弈模型,理论分析证明该模型存在纳什均衡点,即对博弈的双方均存在优势策略。AdHoc网络根据自己的优势策略选择路由进行防御和网络传输,恶意节点根据自己的优势策略采取网络攻击行为。分析和仿真结果表明,新方法能有效地选择比较安全的路由,从而减少了恶意节点对AdHoc网络进行黑洞攻击造成的影响,降低了路由开销和网络丢包率。To defend the Ad Hoc network against blackhole attacks which cause a significant number of dropped packets, a new approach based on non-cooperative game theory is presented. A two-player game theory model is made regarding the Ad Hoc network as one player and malicious nodes as the other. Theoretical analysis proves that there exists a Nash equilibrium point in the model. There are dominant strategies for both parts of the two players. According to their own dominant strategies, the Ad Hoc network selectes a route to defend and to transmit packets, and the malicious nodes launch blackhole attacks. Analysis and simulation results show that the proposed approach can efficiently select a secure route in order to reduce the influence of the attacks by the malicious nodes against Ad Hoc network, and thus reducing the route overhead and the packet loss rate.
关 键 词:黑洞攻击 无线自组网按需距离矢量路由协议(AODV) 博弈 纳什均衡
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.165.9