全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

基于历史信息预测转发概率的DTN路由算法

Keywords: 容迟网络,路由算法,转发策略,预测

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了尽量减少网络先验知识的使用,提高消息转发成功率,提出了一种基于历史链接信息预测转发概率的算法,综合运用了冗余复制和相遇预测的转发策略,将消息逐步向到达目标节点传输预测概率较高的节点转发,通过二分法复制策略来增加消息转发成功的可能性,并采用了主动冗余消息删除机制.仿真实验表明,随着缓冲区的增大和节点规模的增大,该路由算法的性能明显优于Epidemic,PRoPHET和BSW算法,并且具有很好的网络适应性能.

References

[1]  Jones E P C;Li L;Ward P A S,Practical routing in delay-tolerant networks,Philadelphia,USA:ACM,2005.
[2]  Jain S;Fall K;Patra R,Routing in a delay tolerant network,Portland,USA:ACM,2004.
[3]  Conan, V. ;Leguay, J. ;Friedman, T.,Fixed point opportunistic routing in delay tolerant networks,IEEE Journal on Selected Areas in Communications?,2008, 26(5).
[4]  Fall, K. ;Farrell, S.,DTN: an architectural retrospective,IEEE Journal on Selected Areas in Communications?,2008, 26(5).
[5]  Spyropoulos T;Psounis K;Raghavendra C S,Spray and wait:an efficient routing scheme for intermittently connected mobile networks,Philadelphia,USA:[s.n.],2005.
[6]  Vahdat A;Becker D,Epidemic routing for partially connected Ad hoc networks,CS-200006,Durham,North Carolina,USA:Duke University,2000.
[7]  Lindgren A;Phanse K,Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks,New Delhi,India:IEEE,2006.
[8]  Spyropoulos, T. ;Psounis, K. ;Raghavendra, C. S.,Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case,IEEE/ACM Transactions on Networking?,2008, 16(1).
[9]  Lindgren A;Doria A;Schelén O,Probabilistic routing in intermittently connected networks,ACM SIGMOBILE-Mobile Computing and Communications Review,2003(03).

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133