计算机工程2011，Vol.37Issue(16)：86-89,4.DOI:10.3969/j.issn.1000-3428.2011.16.030
机会网络典型路由算法性能分析
Performance Analysis of Typical Routing Algorithm in Opportunistic Network
摘要
Abstract
Based on the simulation of human movement behavior in teal 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分类
自科综合引用本文复制引用
孙践知,刘乃瑞,张迎新,韩忠明,陈丹..机会网络典型路由算法性能分析[J].计算机工程,2011,37(16):86-89,4.基金项目
北京市教委科技计划基金资助面上项目(KM200810011008,KM201010011006) （KM200810011008,KM201010011006）
北京市科技新星计划基金资助项目(2006B 10) （2006B 10）
