全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

基于梯度的DTN路由算法

DOI: 10.13190/jbupt.201102.63.duanpr, PP. 63-66

Keywords: 容迟网络,概率路由,部分连通网络,梯度

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对容迟网络(DTN)中多副本消息传递造成网络资源浪费的问题,提出了一种基于概率和新鲜度的梯度路由(PFG)算法.该算法通过概率梯度和新鲜度梯度来构建目标节点的历史轨迹与目标节点信号覆盖所形成的势场.在节点相遇时,将消息传递给更新鲜、概率更高的节点,尽力避免网络资源的浪费.仿真实验结果表明,PFG路由算法在满足相同消息传递完成率和消息平均时延的条件下,可减少消息传递的副本数,提高系统性能.

References

[1]  Fall K. A delay-tolerant network architecture for challenged Internets//ACM SIGCOMM 2003. Karlsruhe: ACM Press, 2003: 27-34.
[2]  Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: the single-copy case[J]. IEEE Trans on Network, 2008, 16(1): 63-76.
[3]  Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing Communications Review, 2003, 7(3): 19-20.
[4]  Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: the multiple-copy case[J]. IEEE Trans on Network, 2008, 16(1): 77-90.
[5]  LeBrun J, Chuah C N, Ghosal D, et al. Knowledge-based opportunistic forwarding in vehicular wireless Ad hoc networks//VTC 2005-Spring. Stockholm: IEEE Press, 2005: 2289-2293.
[6]  Utku Günay Acer. Weak state routing for large scale dynamic networks//ACM MobiCom 2007. Montreal: ACM Press, 2007: 290-301.
[7]  Musolesi M, Mascolo C. CAR: context-aware adaptive routing for delay tolerant mobile networks[J]. IEEE Trans on Mobile Computing, 2009, 8(2): 246-260.
[8]  Jacquet P, Mans B. Routing in intermittently connected networks: age rumors in connected components//PERCOMW 2007. New York: IEEE Press, 2007: 53-58.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133