期刊文献+

移动自组网中兼顾通信可靠性和链路长度的可信路由协议 被引量:1

Trusted routing protocol under consideration with communication reliability and path length in mobile Ad-hoc network
下载PDF
导出
摘要 不同于以往只考虑最短路径或只依靠转发行为评价信任或基于信誉推荐机制的传统路由算法,提出了一种兼顾通信可靠性和路径长度的主观信任路由模型.该模型借鉴人类信任关系建立模式,通过引入属性相似度概念将邻居选择、信任评估、数据转发等路由环节紧密相连,在陌生节点间建立信任关系,从而实现了一种兼顾通信可靠性和链路长度的可信路由协议.仿真结果表明,提出的信任路由模型较传统的动态源路由协议协议具有较高的抵抗恶意节点存在的能力,并研究了通信半径和移动速度等参数对模型效率的影响. Different from most of past routing algorithms which only considered shortest path first, or evaluated the trust level solely on the forwarding behavior, or were dependent on reputation recommendation mechanism, we proposed a novel subjective trusted routing model under consideration to both communication reliability and path length. Inspired by the establishment pattern of trust relationships in human life, we introduce the concept of attribute similarity to inherently bind neighbor selection, trust evaluation, packet forwarding, and other routing processes. Simulations show that the proposed trust routing model behaves better than dynamic source routing protocol on defending against malicious nodes. Also we provided some numerical results about the impacts of different communication ranges, moving speeds and node numbers on performance.
作者 梁广民 王健
出处 《南京大学学报(自然科学版)》 CAS CSCD 北大核心 2012年第2期206-213,共8页 Journal of Nanjing University(Natural Science)
基金 深圳市科技计划项目(QK200608)
关键词 移动自组网 恶意节点 信任路由 动态源路由协议 mobile Ad-hoc networks, malicious nodes, trusted routing, dynamic source routing
  • 相关文献

参考文献16

  • 1Mui L,Mohtashemi M,Halberstadt A. A computational model of trust and reputation[A].Big Island,Ha waii,USA,2002.188-,196.
  • 2Raya M,Hubaux J P. Securing vehicular Ad- hoc networks[J].Journal of Computer Security,2007,(01):39-68.
  • 3Adibi S,Agnew G B. Multilayer flavored dy- namic source routing in mobile ad-hoc net- works[J].The Institution of Engineering and Technology Communications,2008,(05):690-707.
  • 4Johnson D,Maltz D. Dynamic source routing in Ad-hoc wireless networks[A].Norwell:Kluwer Aca- demic Publishers,1996.153-181.
  • 5Perkins C,Belding E,Das S. Ad-hoc on-de- mand distance vector,(AODV) routing[M].Internet Engineering Task Force Request for Comments,2003.561.
  • 6张强,胡光明,陈海涛,龚正虎.MANET基于客观信任度建模的分簇算法与分析[J].通信学报,2009,30(2):12-21. 被引量:6
  • 7PengSC,Jia W J,Wang G J. Trusted routing based on dynamic trust mechanism in mobile ad-hoc networks[J].The Institute of Elec- tronics Information and Communication Engi- neers Transactions on Information and Systems,2010,(03):510-517.
  • 8Pirzada A A,McDonald C. Establishing trust in pure ad-hoc networks[J].Proceedings of Aus- tralasian Conference on Computer Science,2004.47-54.
  • 9Anantvalee T,Wu J. Reputation-based system for encouraging the cooperation of nodes in mo- bile Ad-hoc networks[A].2007.3383-3388.
  • 10Peng S C,Jia W J,Wang G J. Voting-based clustering algorithm with subjective trust and stability in mobile ad-hoc networks[J].Proceed- ings of IEEE/IFIP International Conference on Embedded and Ubiquitous Computing,2008.3-9.

二级参考文献34

  • 1赵春晓,王光兴.一种δ-度约束的自组网成簇算法[J].计算机研究与发展,2005,42(5):818-822. 被引量:3
  • 2VARADHARAJAN V, SHANKARAN R, HITCHENS M. Security for cluster based ad hoc networks[J]. Computer Communications, 2004, 27(5): 488-501.
  • 3EPHREMIDES A, WIESELTHIER J E, BAKER D J. A design concept for reliable mobile radio networks with frequency hopping signaling[A]. Proceedings of IEEE[C]. 1987.56-73.
  • 4GERLA M, TSAI J. TC. Multicluster, mobile, multimedia radio network[J]. Wireless Networks, 1995,1 (3): 255-265.
  • 5PAREKH A.K. Selecting routers in ad-hoc wireless networks[A]. Proceedings of the SBT/IEEE International Tele[C]. Symposium, 1994. 420-424.
  • 6BASAGNI S, Distributed clustering for ad hoc networks[A]. Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks[C]. 1999.310-315.
  • 7CHATTERJEE M ,DAS S K, TURGUT D. WCA: a weighted clustering algorithm for mobile ad hoc networks[J]. Journal of Cluster computing, Special Issue on Mobile Ad hoc Networking, 2002, 5: 193-204.
  • 8CHATTERJEE M ,DAS S K, TURGUT D. An on-demand weighted clustering algorithm (WCA) for ad hoc networks[A]. Proceedings of IEEE GLOBECOM 2000[C]. San Francisco, 2000. 1697-1701.
  • 9KRISHNA P, VAIDYA N H, CHATTERJEE M, et al. A cluster based approach for routing in dynamic networks[J]. ACM SIGCOMM Computer Communication Review (CCR), 1997, 27.
  • 10AMIS A D, PRAKASH R, VUONG T H, HUYNH D T. Max-Min D-cluster formation in wireless ad hoc networks[A]. Proceedings IEEE INFOCOM '00[C]. Tel A viv, Israel, 2000.32-41.

共引文献6

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部