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

机会网络典型路由算法性能分析
引用本文:孙践知,刘乃瑞,张迎新,韩忠明,陈丹. 机会网络典型路由算法性能分析[J]. 计算机工程, 2011, 37(16): 86-89. DOI: 10.3969/j.issn.1000-3428.2011.16.030
作者姓名:孙践知  刘乃瑞  张迎新  韩忠明  陈丹
作者单位:1. 北京工商大学计算机与信息工程学院,北京,100048
2. 北京青年政治学院计算机系,北京,100102
基金项目:北京市教委科技计划基金资助面上项目,北京市科技新星计划基金资助项目
摘    要:通过对真实城市场景中行人移动行为的仿真,定量分析First Contact、Direct Delivery、Epidemic、Spray and Wait、Prophet和MaxProp6种机会网络典型路由算法在不同场景下的性能。在仿真过程中,以不同节点密度、不同节点移动模型和不同节点缓存大小设置多种场景,从传输能力、传输效率、网络资源开销和节点能耗4个方面对路由算法进行分析和比较。实验结果表明,节点移动模型、节点密度等因素会对路由算法产生显著影响,各路由算法在不同的场景下性能差距较大,每种算法都有其适用的特定场景。

关 键 词:机会网络  路由算法  节点移动模型  度量值

Performance Analysis of Typical Routing Algorithm in Opportunistic Network
SUN Jian-zhi,LIU Nai-rui,ZHANG Ying-xin,HAN Zhong-ming,CHEN Dan. Performance Analysis of Typical Routing Algorithm in Opportunistic Network[J]. Computer Engineering, 2011, 37(16): 86-89. DOI: 10.3969/j.issn.1000-3428.2011.16.030
Authors:SUN Jian-zhi  LIU Nai-rui  ZHANG Ying-xin  HAN Zhong-ming  CHEN Dan
Affiliation:1(1.College of Computer and Information Engineering,Beijing Technology and Business University,Beijing 100048,China;2.Department of Computer Science,Beijing Youth Politics College,Beijing 100102,China)
Abstract:Based on the simulation of human movement behavior in real city,this paper quantitatively analyzes six opportunistic network routing algorithms,such as First Contact,Direct Delivery,Epidemic,Spray and Wait,Prophet and MaxProp.In the simulation,different scenarios are set according to node density,node mobility model and the cache size of node.Delivery ratio,delivery delay,network overhead and energy consumption are selected to evaluate the performance of different routing algorithms.Experimental results show node mobility model,the network node density have significant impact on routing algorithms.Different routing algorithms perform better in some special scenarios.
Keywords:opportunistic network  routing algorithm  node mobility model  metric
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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