检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]计算机网络与信息安全教育部重点实验室(西安电子科技大学),西安710071
出 处:《计算机研究与发展》2011年第8期1406-1413,共8页Journal of Computer Research and Development
基 金:国家自然科学基金项目(60772136;61003300);国家"111"计划基金项目(B08038);中央高校基本科研业务费专项基金项目(JY10000901032;JY10000901025;JY10000901034)
摘 要:基于D-S证据理论,设计了一个MANET信任评估模型,为路由建立提供安全的网络环境.改进ARAN协议,提出安全的路由协议AE-ARAN.协议根据信任评估结果选择可信节点建立路由,并提出在路由表中存储节点匿名身份的Hash路由登记表,保证ARAN协议认证安全,实现匿名安全和提高路由查找效率,同时协议在路由建立过程中,完成会话密钥协商.理论分析和仿真结果表明,所提出的协议能有效地检测和隔离恶意节点,抵御攻击.协议可实现路由匿名性,提高网络的效率及安全性.We present an anonymous and efficiently routing protocol AE-ARAN for MANET based on Dempster-Shafer(D S) evidence theory. A trust evaluation model which is a system of trust valuation is given. It could discover malicious actions in networks dynamically and timely and isolate them efficiently, and resist attacks to some extent and improve the reliability, robustness and security of the over all network effectively. So it could provide a secure network environment for routing establishment. Meanwhile, the ARAN is modified and we present the anonymous identity of nodes by the way of the Hash routing, which stored in routing table. It can effectively ensure the anonymous of the networks and avoid launching a routing request repeatedly. Based on the Diffie-Hellman key agreement arithmetic, the protocol set up the key agreement at the time of routing. Theoritical analysis and simulation results show that the proposed scheme can detect and isolate malicious nodes efficiently and resist attacks. The protocol can achieve the anonymous and improve the efficiency and security of the all network.
关 键 词:密码学 路由协议 D-S证据理论 信任评估模型 移动自组织网络
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222