全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种运行轨迹驱动的移动自组织网络路由算法

DOI: 10.13190/j.jbupt.2014.06.026, PP. 125-128

Keywords: 移动自组织网络,单副本路由,多副本路由,轨迹驱动

Full-Text   Cite this paper   Add to My Lib

Abstract:

在移动自组织网络(MANETs)中常见路由算法的基础上,如单副本路由和泛洪路由,提出了一种基于轨迹相似度的单副本路由算法.针对单副本路由和泛洪路由中存在的问题,如单副本路由中的大传输延迟、泛洪路由中的过量网络资源消耗及由此导致的数据丢失,提出了基于历史轨迹记录相似度的多副本路由算法.通过仿真实验,对所提算法在转发成功率、转发延时及转发次数等性能参数方面进行了评估.实验结果表明,与现有的路由算法相比,所提出的算法具有更好的性能表现,达到了预期的设计目标.

References

[1]  Lindgren A, Doria A, Schel'en O. Probabilistic routing in intermittently connected networks [J]. SIGMOBILE Mobile Computting Communications Review, 2003, 7(3): 19-20.
[2]  Wu Jie, Wang Yunsheng. A non-replication multicasting scheme in delay tolerant networks [C]//IEEE. Mobile Ad hoc and Sensor Systems(MASS). San Francisco, CA: IEEE, 2010: 89-98.
[3]  Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks [R]. Technical Report CS-200006, Duke University, 2000.
[4]  Spyropoulos T, Psounis K, Raghavendra C. Spray and wait: an efficient routing scheme for intermittently connected mobile networks [C]//ACM. SIGCOMM Workshop on Delaytolerant Networking. New York, USA: ACM, 2005: 252-259.
[5]  Spyropoulos T, Psounis K, Raghavendra C. Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility [C]//IEEE. Pervasive Computting and Communications Workshops. White Plains, NY: IEEE, 2007: 79-85.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133