Routing Schemes for Delay-Tolerant Networks - An Applications Perspective
Routing Schemes for Delay-Tolerant Networks - An Applications Perspective
复制标题
DOI:
--
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
Ashraf E. Al-Fagih;H. Hassanein
中科院分区:
文献类型:
--
作者:
Ashraf E. Al-Fagih;H. Hassanein
Delay Tolerant Networks (DTNs) represent a class of wireless networks that experience frequent and long lasting partitions due to sparse distribution of nodes in the topology. A traditional TCP/IP setting assumes the definite existence of a contemporaneous end-to-end path between any source-destination pair in the network. Any setting that violates this assumption may be considered as a potential application for the DTN architecture. To cope with this situation, DTN nodes utilize a store-carry-forward approach in which messages are buffered for extended intervals of time until an appropriate forwarding opportunity is recognized. Numerous studies have tackled the challenging problem of routing in DTNs. Routing proposals include stochastic approaches such as random, spray-and-wait and epidemic routing, or deterministic approach such as history-based, model-based, coding-based and variations of these approaches. The number of routing schemes in the literature is increasing rapidly without a clear mapping of which is more suitable for any of the vast array of potential DTN application. This document surveys the main routing schemes in the DTN literature. It provides a detailed insight to the DTN approach and describes in some depth the policies and strategies proposed to manage buffers and queues in DTN nodes. Then, the predominant DTN real-life applications are presented and discussed. The aim of this document is to create a classification basis for the most prominent DTN applications and to map major DTN routing schemes to these categories according to some influential network attributes and characteristics that are related particularly to the type of application in hand.