东北大学学报(自然科学版) ›› 2003, Vol. 24 ›› Issue (11): 1045-1048.DOI: -

• 论著 • 上一篇    下一篇

移动ad hoc网络可信路由发现算法

王翠荣;高远   

  1. 东北大学秦皇岛分校;东北大学秦皇岛分校 河北秦皇岛 066004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2003-11-15 发布日期:2013-06-24
  • 通讯作者: Wang, C.-R.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60073059)·

Discovery of trust routing for mobile ad hoc networks

Wang, Cui-Rong (1); Gao, Yuan (1)   

  1. (1) Sch. of Qinhuangdao, Northeastern Univ., Qinhuangdao 066000, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2003-11-15 Published:2013-06-24
  • Contact: Wang, C.-R.
  • About author:-
  • Supported by:
    -

摘要: 综述了移动adhoc网络环境下已有路由协议的研究现状,针对移动adhoc网络特点和已有协议在安全方面存在的缺陷,提出了一种新的可信路由发现算法,并将该算法加入到被IETF认可的DSR路由协议中得到实现,经NS2网络仿真工具仿真实验,证明该算法是行之有效的·使用信任度表示某个节点可以作为路由的下一跳的可能性,给出了信任度计算方法·决策者对一个证据的信任程度不仅与第三方对证据的建议有关,并且更重要的是与决策者本身的直接经验有关·对信任模型进行了形式化描述,该信任模型主要解决了没有认证中心的陌生者的信任管理问题,通讯节点可以提供不完整、不确定的信任证据,弥补了现有安全协议的缺陷·

关键词: 移动adhoc网络, 安全路由协议, 证据, 信任度, 仿真

Abstract: Reviewing the defects of existing ad hoc network route protocols, a new method searching trust routing for mobile ad hoc network was presented on the basis of the peculiarity of ad hoc network. The method was applied to DSR protocol approved by IETF. NS2 simulation experiment showed that the method is feasible and effective. Trust probability was suggested to describe the probability that a node may be acted as next hop, with an arithmetic given to calculate the trust probability. It's an empirical proof that how a rout designer trusted an evidence is dependent not only on recommendations from third parties but more important on his/her own experience. A trust model was thus formalized, which is available to manage the trust relation between strangers. The model can deal with incomplete and uncertain evidence so as to make up the defects of existing ad hoc route protocol.

中图分类号: