期刊文献+

移动自组网络中多径路由的匿名安全 被引量:14

Anonymous Secure Multipath Routing in Mobile Ad-Hoc Networks
下载PDF
导出
摘要 多路径为移动自组网络提供的容错、负载均衡与QoS支持较单路径更有效可行,所以在战术无线自组网等类似系统中采用多径路由策略更能满足系统的实际需求.另外,这类系统对安全性的要求除了基本的通信内容机密、完整与可用等特性外,还要求通信者的身份与位置对敌人保密,为通信者及其使命提供保护.鉴于现有的移动自组网络的匿名路由协议都不是实用的多径路由协议,且未能有效防御被动攻击、拜占庭行为以及匿名的不充分性,本文设计了一种新型安全匿名的多径路由协议,其特点是:在移动自组网络中采用单私钥多公钥密码体制、Bloom Filter与轻型洋葱盲化算法,来实现通信者身份匿名、位置隐藏与路由不可追踪;为源节点提供充分的路由信息,基于充分的信息使用强化学习算法来提高系统抵御被动攻击与拜占庭攻击等路由安全攻击的能力,并增强数据传输的可靠性.通过仿真与分析,显示了算法有较好的性能并达到了所定义的匿名安全要求. Multipath Routing is more suitable than single route for systems such as tactical radio networks because it can efficiently support fault-tolerance, load balancing and QoS. In addtion, anonymity should be one important part of overall solution for those in which confidentiality, integrity and availability should be realized as basic security. Whereas those anonymous secure routing proto- cols known in MANET can't protect muting from passive attacks and byzantine behavior and can't provide mutilpath either,we adopt incomparable public keys cryptosystem, Bloom Filter, lightweight onion shufile algorithm and reinforcement learning paradigm to design anonymous secure multipath muting protocol. We validate the effectiveness of our design using extensive simulation and detailedly ana- lyze the securitv and anonvmitv as defined.
出处 《电子学报》 EI CAS CSCD 北大核心 2005年第11期2022-2030,共9页 Acta Electronica Sinica
基金 国家863高技术研究发展计划(No.2005AA123110)
关键词 多径路由 强化学习 BLOOM FILTER 多公钥密码体制 匿名性 移动自组网络 multipath routing reinforcement learning Bloom Filter incomparable public keys cryptosystem Anonymity MANET
  • 相关文献

参考文献13

  • 1K El-Khatib,L Korba,R Song,G Yee.Secure dynamic distributed routing algorithm for ad hoc wireless networks[A].In Inter national Conference on Parallel Processing Workshops (ICPPW'03)[C].Kaohsiung,Taiwan:IEEE Computer Society,2003.359-366.
  • 2J Kong,X Hong.ANODR:ANonymous on demand routing with untraceable routes for mobile ad-hoc networks[A].In Fourth ACM Inter national Symposium on Mobile Ad HocNetworking and Computing (MobiHoc'03)[C].Annapolis,Md,USA:ACM,2003.291-302.
  • 3Bo Zhu,Zhiguo Wan,et al.Anonymous Secure Routing in Mobile Ad-hoc Networks[A].the 29th Annual IEEE inter national Conference on Local Computer Networks[C].Tampa,USA:IEEE Computer Society,2004.102-108.
  • 4Y C Hu,D B Johnson,A Perrig.SEAD:Secure efficient distance vector routing for mobile wireless ad hoc networks[A].In Proceedings of the 4th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2002)[C].NY,USA:IEEE Computer Society,2002.3-13.
  • 5Y-C Hu,A Perrig,D B Johnson.Ariadne:A secure ondemand routing protocol for ad hoc networks[A].In Proceedings of the Eighth Annual Inter national Conference on Mobile Computing and Networking (MobiCom 2002)[C].Georgia,USA:ACM,2002.12-23.
  • 6A Nasipuri,S R Das.On-Demand Multipath Routing for Mobile Ad Hoc Networks[A].Proceedings of IEEE ICCCN'99[C].Boston,USA:IEEE Computer Society,1999.64-70.
  • 7J Raju,J J Garcia-Luna-Aceves.A New Approach to On-demand Loop-Free Multipath Routing[A].Proceedings of IEEE ICCCN'99[C].Boston,USA:IEEE Computer Society,1999.522-527.
  • 8Sung-Ju Lee,Mario Gerla.Split Multipath Routing with Maximally Disjoint Paths in Ad hoc Networks[A].In Proceedings of the IEEE ICC,2001[C].Helsinki:IEEE Computer Society,2001.3201-3205.
  • 9Baruch Awerbuch David Holmer Herbert Rubens.Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Lear ning[R].Technical Report Version 1,May 16,2003.Computer Science Department,Johns Hopkins University.
  • 10Nicolao Cesa-Bianchi,Yoav Freund,David P Helmbold,David Haussler,Robert E Schapire,Manfred K Warmuth.How to use expert advice[J].Jour nal of the Association for Com-puting Machinery,1993.382-391.

二级参考文献18

  • 1[1]Perkins CE, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing for mobile computers. In: ACM SIGCOMM Symp. on Communication, Architectures and Protocols. New York: ACM Press, 1994. 234~244.
  • 2[2]Murthy S, Garcia-Luna-Aceves JJ. An efficient routing protocol for wireless networks. ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, 1996,1(2):183~197.
  • 3[3]Johnson DB, Maltz DA. Dynamic Source Routing in Ad Hoc Wireless Networks. New York: Kluwer Academic Publishers, 1996. 153~181.
  • 4[4]Hu Y-C, Johnson DB. Caching strategies in on-demand routing protocols for wireless ad hoc networks. In: Annual Int'l Conf. on Mobile Computing and Networking (MOBICOM). New York: ACM Press, 2000. 231~242.
  • 5[5]Perkins CE, Royer EM. Ad-Hoc on demand distance vector routing. In: IEEE Work-Shop on Mobile Computing Systems and Applications (WMCSA). New Orleans, 1999. 90~100.
  • 6[6]Park VD, Corson MS. A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc. of the IEEE INFOCOM'97. Washington DC: IEEE Computer Society, 1997. 1405~1413.
  • 7[7]Broch J, Johnson DB, Maltz DA. The dynamic source routing protocol for mobile ad hoc networks. Internet-Draft, draft-ietf-manet-dsr-09.txt, April 2003.
  • 8[8]Lee SJ, Gerla M. AODV-BR: Backup routing in ad hoc networks. In: Proc. of the IEEE WCNC 2000. Chicago, 2000. 1311~1316.
  • 9[9]Marina MK, Das SR. On-Demand multipath distance vector routing for ad hoc networks. In: Proc. of the Int'l Conf. for Network Procotols (ICNP). Riverside, 2001. 14~23.
  • 10[10]Nasipuri A, Das SR. On-Demand multipath routing for mobile ad hoc networks. In: Proc. of the 8th Int'l Conf. on Computer Communications and Networks (IC3N). Boston, 1999. 64~70.

共引文献21

同被引文献104

引证文献14

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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