首页 | 本学科首页   官方微博 | 高级检索  
     

不同合作度下机会网络典型路由算法健壮性分析*
引用本文:孙践知,刘乃瑞,韩忠明,陈丹. 不同合作度下机会网络典型路由算法健壮性分析*[J]. 计算机应用研究, 2011, 28(11): 4266-4269. DOI: 10.3969/j.issn.1001-3695.2011.11.072
作者姓名:孙践知  刘乃瑞  韩忠明  陈丹
作者单位:1. 北京工商大学计算机与信息工程学院,北京,100048
2. 北京青年政治学院计算机系,北京,100102
基金项目:北京市教委科技计划面上项目(KM200810011008,KM201010011006);北京市科技新星计划资助项目(2006B10)
摘    要:机会网络路由算法在不同合作度下的健壮性是一个重要的但未被充分研究的问题,分析了机会网络中可能存在的节点间不合作的情况,定义了三种适用于不同场景的节点合作度,设计了评价方法及指标体系,通过对真实城市场景中带有智能蓝牙设备行人移动行为的仿真,定量分析了不同节点合作度下Direct Delivery、Epidemic、Spray and Wait、Prophet和MaxProp 五种典型路由算法的健壮性。结果表明Spray and Wait和MaxProp算法健壮性较差,Prophet 和Epidemic算法较

关 键 词:机会网络; 路由算法; 自私节点; 节点合作度; 健壮性

Robustness analysis of opportunistic network routing algorithm with different degree of node cooperation
SUN Jian-zhi,LIU Nai-rui,HAN Zhong-ming,CHEN Dan. Robustness analysis of opportunistic network routing algorithm with different degree of node cooperation[J]. Application Research of Computers, 2011, 28(11): 4266-4269. DOI: 10.3969/j.issn.1001-3695.2011.11.072
Authors:SUN Jian-zhi  LIU Nai-rui  HAN Zhong-ming  CHEN Dan
Affiliation:SUN Jian-zhi1,LIU Nai-rui2,HAN Zhong-ming1,CHEN Dan1(1.College of Computer & Information Engineering,Beijing Technology & Business University,Beijing 100048,China,2.Dept.of Computer Science,Beijing Youth Politics College,Beijing 100102,China)
Abstract: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.
Keywords:opportunistic network   routing algorithm   selfish node   degree of node cooperation   robustness
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号