摘要: 通过对真实城市场景中行人移动行为的仿真,定量分析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
中图分类号:
孙践知, 刘乃瑞, 张迎新, 韩忠明, 陈丹. 机会网络典型路由算法性能分析[J]. 计算机工程, 2011, 37(16): 86-89.
SUN Jian-Zhi, LIU Ai-Rui, ZHANG Ying-Xin, HAN Zhong-Meng, CHEN Dan. Performance Analysis of Typical Routing Algorithm in Opportunistic Network[J]. Computer Engineering, 2011, 37(16): 86-89.