作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (16): 86-89. doi: 10.3969/j.issn.1000-3428.2011.16.030

• 网络与通信 • 上一篇    下一篇

机会网络典型路由算法性能分析

孙践知 1,刘乃瑞 2,张迎新 1,韩忠明 1,陈 丹 1   

  1. (1. 北京工商大学计算机与信息工程学院,北京1000482. 北京青年政治学院计算机系,北京 100102)

  • 收稿日期:2011-03-02 出版日期:2011-08-20 发布日期:2011-08-20
  • 作者简介:孙践知(1967-),男,副教授、硕士,主研方向:网络安全,信息安全;刘乃瑞,讲师、硕士;张迎新,副教授、硕士,韩忠明(通讯作者),副教授、博士后;陈 丹,副教授、硕士
  • 基金资助:
    北京市教委科技计划基金资助面上项目(KM200810011008, KM201010011006);北京市科技新星计划基金资助项目(2006B10)

Performance Analysis of Typical Routing Algorithm in Opportunistic Network

SUN Jian-zhi 1, LIU Nai-rui 2, ZHANG Ying-xin 1, HAN Zhong-ming 1, CHEN Dan 1   

  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)
  • Received:2011-03-02 Online:2011-08-20 Published:2011-08-20

摘要: 通过对真实城市场景中行人移动行为的仿真,定量分析First Contact、Direct Delivery、Epidemic、Spray and Wait、Prophet和MaxProp 6种机会网络典型路由算法在不同场景下的性能。在仿真过程中,以不同节点密度、不同节点移动模型和不同节点缓存大小设置多种场景,从传输能力、传输效率、网络资源开销和节点能耗4个方面对路由算法进行分析和比较。实验结果表明,节点移动模型、节点密度等因素会对路由算法产生显著影响,各路由算法在不同的场景下性能差距较大,每种算法都有其适用的特定场景。

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

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.

Key words: opportunistic network, routing algorithm, node mobility model, metric

中图分类号: