期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

不同合作度下机会网络典型路由算法健壮性分析

Robustness analysis of opportunistic network routing algorithm with different degree of node cooperation
下载PDF
导出
摘要 机会网络路由算法在不同合作度下的健壮性是一个重要的但未被充分研究的问题,分析了机会网络中可能存在的节点间不合作的情况,定义了三种适用于不同场景的节点合作度,设计了评价方法及指标体系,通过对真实城市场景中带有智能蓝牙设备行人移动行为的仿真,定量分析了不同节点合作度下Direct Delivery、Epi-demic、Spray and Wait、Prophet和MaxProp五种典型路由算法的健壮性。结果表明Spray and Wait和MaxProp算法健壮性较差,Prophet和Epidemic算法较为健壮,而Direct Delivery算法非常健壮。 Robustness of opportunistic network routing algorithms with different degree of node cooperation is an important issue but not yet thorough researches.This paper analyzed failures to cooperation of the nodes in opportunistic network briefly.It also proposed three degrees of node cooperation for different situations and designed the evaluation criteria.Then the method simulated the actions of the pedestrians with the intelligent bluetooth devices in the scene of the real city.On these bases,it analyzed the robustness of these five algorithms which were Direct Delivery,Epidemic,Spray and Wait,Prophet and MaxProp.The performance on the obtained experimental results demonstrate that Spray and Wait and MaxProp have poor robustness,and Direct Delivery is best.
作者 孙践知 刘乃瑞 韩忠明 陈丹
机构地区 北京工商大学计算机与信息工程学院 北京青年政治学院计算机系
出处 《计算机应用研究》 CSCD 北大核心 2011年第11期4266-4269,4295,共5页 Application Research of Computers
基金 北京市教委科技计划面上项目(KM200810011008 KM201010011006) 北京市科技新星计划资助项目(2006B10)
关键词 机会网络 路由算法 自私节点 节点合作度 健壮性 opportunistic network routing algorithm selfish node degree of node cooperation robustness
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献14

  • 1任智,黄勇,陈前斌.机会网络路由协议[J].计算机应用,2010,30(3):723-728. 被引量：47
  • 2肖明军,黄刘生.容迟网络路由算法[J].计算机研究与发展,2009,46(7):1065-1073. 被引量：32
  • 3NEKOVEE M. Epidemic algorithms for reliable and efficient information dissemination in vehicular [ J ]. Intelligent Transport Systems, 2009, 3(2) :104-110.
  • 4VAHDAD A, BECKER D. Epidemic routing for partially connected Ad hoc networks, CS2200006 [ R ]. Durham, NC : Duke University, 2000.
  • 5APOORVA J, KONSTANTINOS P. Performance analysis of epidemic routing under contention [ C ]//Proc of International Conference on Wireless Communications and Mobile Computing. New York: ACM Press,2006 : 539-544.
  • 6SPYROPOULOS T, PSOUNIS K, RAGItAVENDRA C S. Spray and Wait: an efficient routing scheme for intermittently connected mobile networks[ C]//Proc of ACM SIGCOMM Workshop on Delay-tolerant Networking. New York : ACM Press, 2005 : 252-259.
  • 7SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Spray and Wait : efficient mobility assisted routing for heterogeneous and correlated mobility [ C ]//Proc of IEEE PerCom. Piscataway, NJ: IEEE Computer Society, 2007 : 79- 85.
  • 8LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks [ C ]//Prnc of the 4th ACM International Symposium on Mobile Ad hoc Networking and Computing. Annapolis. New York:ACM Press, 2003:19-20.
  • 9BURGESS J, GALLAGHER B, JENSEN D, et al. Maxprop : routing for vehicle-based disruption-tolerant networks [ C ]//Proc of the 25th IEEE International Conference on Computer Communications. Washington DC: IEEE Press, 2006: 1-11.
  • 10JOHN B, GEORGE D B, MARK D C. Surviving attacks on disruption-tolerant networks without authentication [ C ]//Proc of the 8th ACM International Symposium on Mobile Ad hoc Networking and Computing. New York : ACM Press ,2007:61-70.

二级参考文献72

  • 1Cerf V,Burleigh V,Hooke A,et al.Delay-tolerantnetworking architecture.[2007-06-01].http://tools.ietf.org/html/draft-irt f-dmrg-arch-08.
  • 2Fall K.A delay-tolerant network architecture for challenged lnternets[C] //Proc of the ACM SIGCOMM 2003.New York,ACM,2003:27-34.
  • 3Abdulla M,Simon R.The impact of the mobility model on delay tolerant networking performance analysis[C]//Proc of the 40th Annual Simulation Syrup (ANSS07).Piscataway,NJ:IEEE,2007:177-184.
  • 4Jones E P C,Ward P A S.Routing strategies for delaytolerant networks[OL].[2008-07-26].http://www.tct.hut.fi/opetus/s383151/articles/dtn-routing-survey.pdf.
  • 5Gong Y,Xiong Y,Zhang Q,et al.Anycast routing in delay tolerant networks[C/OL]//Proc of the IEEE GLOBECOM 2006.Piscataway,NJ.IEEE,2006[2008-07-28].http:// ieeexplore,ieee.org/stamp/stamp,jsp?tp = &arnumber=4151590 &isnumber = 4150630.
  • 6Zhao W,Ammar M,Zegura E.Multicasting in delay tolerant networks:Semantic models and routing algorithms[C] //Proc of the ACM SIGCOMM Workshop on DelayTolerant Networking (WDTN 2005).New York:ACM,2005:268-275.
  • 7Ye Q,Cheng L,Chuah M C,et al.OS-multicast:Ondemand situation-aware multicssting in disruption tolerant networks[C]//Proc of the IEEE Vehicular Technology Conf (VTC 2006).Piscataway,NJ:IEEE,2006:96-100.
  • 8Chen Y,Yang J,Zhao W,et al.Multicasting in sparse MANETs using message ferrying[C] //Proe of the IEEE Wireless Communications and Networking Conf (WCNC 2006).Piscataway,NJ:IEEE,2006:691-696.
  • 9Zhang Z.Routing in intermittently connected mobile ad hoe networks and delay tolerant networks:Overview and challenges[J].IEEE Communications Surveys and Tutorials,2006,8(1):24-37.
  • 10Liu C,Wu J.Scalable routing in delay tolerant networks[C] //Proc of the ACM MOBIHOC 2007.New York:ACM,2007:51-60.

共引文献76

计算机应用研究
2011年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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