期刊文献+

基于频率域多目标MANETs可信路由决策研究 被引量:1

Research on MANETs Trusted Routing Decision Based on Multi-objective in Frequency Domain
在线阅读 下载PDF
导出
摘要 移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。 Mobile Ad-hoc Networks(MANETs) have their fundamental characteristics,such as open medium,dynamic topology,distributed cooperation,and constrained capability.Due to the anonymous and self-organization nature of mobile nodes in the network,intermediate nodes on a communication path are expected to forward packets of other nodes so that nodes can communicate beyond their wireless transmission range.In this paper,a trusted routing selection algorithm based on multi-objectives in frequency-domain for MANETs is proposed.It is distinctly different with most of routing algorithms that select routing based on a single-objective in the time-domain.The proposed algorithm tries to analyze the secure and trusted routing based on probability theory to reduce the computation complex with the mutual transformation of probability functions between time-domain and frequency-domain.It solves the problem of finding secure and trusted routing for MANETs in the case of the lack of physical security,untrustworthy scenario and low trust levels among nodes in MANETs and malicious nodes colluding with one another to disrupt the network operation.Extensive analysis is carried out to evaluate the design of the algorithm.
出处 《电子与信息学报》 EI CSCD 北大核心 2010年第7期1602-1607,共6页 Journal of Electronics & Information Technology
基金 国家863计划项目(2009AA01Z435)资助课题
关键词 移动自组织网络 可信路由 频率域 Mobile Ad-hoc NETworks(MANETs) Trusted routing Frequency-domain
  • 相关文献

参考文献13

  • 1Prayag N, Sanjay Kumar D, and Sudip M, et al.. Security in mobile Ad-hoc networks using soft encryption and trust-based multi-path routing [J]. Computer Communications, 2008, 31(4): 760-769.
  • 2Vasantha V and Manimegalai D. Mitigating routing misbehaviors using subjective trust model in mobile Ad hoc networks [C]. International Conference on Computational Intelligence and Multimedia Applications, Sivakasi, Tamil Nadu, India, December 13-15, 2007: 417-422.
  • 3Neeraj N, Patel R B, and Bhat V K. Trust aware routing with load balancing in ad hoc network using mobile agent [C]. 15th International Conference on Advanced Computing and Communications, Guwahati, India, December 18-21, 2007: 454-459.
  • 4Wang Kun, Wu Meng, and Shen Su bin. A trust evaluation method for node cooperation in mobile ad hoc networks [C]. 5th International Conference on Information Technology, Nevada, USA, April 7-9, 2008: 1000-1005.
  • 5Bounpadith, Hidehisa N, and Nei K, et al.. A study of a routing attack in OLSR-based mobile ad hoc networks [J]. International Journal of Communication Systems, 2007, 20(11): 1245-1261.
  • 6Satyanarayana A. Unified formula for analysis of some network reliability problems [J]. IEEE Transactions on Reliability, 1982, R-31(1): 23-32.
  • 7Kannhavong Bounpadith, Nakayama Hidehisa, and Nemoto Yoshiaki, et al.. A survey of routing attacks in mobile Ad hoc networks[J]. IEEE Wireless Communications, 2007, 14(5): 85-91.
  • 8Katsuhiko O. System Dynamics (Fourth Edition) [M]. New Jersey, Prentice Hall, August 23, 2003: 350-480.
  • 9Andel Todd R and Yasinsac Alec. Adaptive threat modeling for secure Ad hoc routing protocols [J]. Electronic Notes in Theoretical Computer Science, 2008, 197(2): 3-14.
  • 10Zouridaki Charikleia, Brian M L, and Marek H. Byzantine robust trust establishment for mobile Ad hoc networks [J]. Telecommunication Systems, 2007, 35(3-4): 189-206.

二级参考文献6

  • 1王进发,李励.军事供应链管理[M].北京:国防大学出版社,2004:191,351-354.
  • 2米尔斯切特.数学建模方法与分析[M].北京:机械工业出版社,2005-06.
  • 3Bollobas B.Modern Graph Theory[M].New York:Springer,1998.
  • 4Ford L R,Fulkerson D R.Flows in Networks[M].USA:Princeton University Press,1962.
  • 5Xu Jiefeng,James P K.A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem[J].Transportation Science,1996,30(4):379-393.
  • 6Gerla M.A Cut Saturation for Topological Design of Packet Switched Communication Network[C]//Proc.of Nat.Telecommun.Conf.,1974:1 074-1 085.

共引文献5

同被引文献5

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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