Reasonable routing in delay/disruption tolerant networks

被引:0
作者
Haizheng Yu
Jianfeng Ma
Hong Bian
机构
[1] Xinjiang University,College of Mathematics and System Sciences
[2] Xidian University,Key Laboratory of Computer Network and Information Security
[3] Xinjiang Normal University,School of Mathematical Sciences
来源
Frontiers of Computer Science in China | 2011年 / 5卷
关键词
delay/disruption tolerant networks (DTN); routing algorithm; Markov chain; message redundancy;
D O I
暂无
中图分类号
学科分类号
摘要
Delay/disruption tolerant networking (DTN) is an approach to networking where intermittent connectivity exists: it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live (TTL) and antipacket methods, in both redundancy and delivery success efficiency.
引用
收藏
页码:327 / 334
页数:7
相关论文
共 31 条
[1]  
Fall K.(2008)Dtn: an architectural retrospective IEEE Journal on Selected Areas in Communications 26 828-836
[2]  
Farrell S.(2009)Delay- and disruption-tolerant networking IEEE Internet Computing 13 82-87
[3]  
McMahon A.(2006)Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges IEEE Communications Surveys and Tutorials 8 24-37
[4]  
Farrell S.(2008)Efficient routing in intermittently connected mobile networks: the single-copy case IEEE/ACM Transactions on Networking 16 63-76
[5]  
Zhang Z.(2008)Efficient routing in intermittently connected mobile networks: the multiple-copy case IEEE/ACM Transactions on Networking 16 77-90
[6]  
Spyropoulos T.(2008)(p,q)-epidemic routing for sparsely populated mobile ad hoc networks IEEE Journal on Selected Areas in Communications 26 783-793
[7]  
Psounis K.(2003)Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks Ad Hoc Networks 1 215-233
[8]  
Raghavendra C. S.(2009)Selective message forwarding in delay tolerant networks Mobile Networks and Applications 14 387-400
[9]  
Spyropoulos T.(2007)Storage routing for DTN congestion control Wireless Communications and Mobile Computing 7 1183-1196
[10]  
Psounis K.(2005)The message delay in mobile ad hoc networks Performance Evaluation 62 210-228