El M. Sammou, “Routing in ‘Delay Tolerant Networks’ (DTN): Improved Routing with MAXPROP and the Model of ‘Transfer by Delegation’ (Custody Transfer),” International Journal of Computer Science and Network Security, Vol. 4. No.1, 2011.E. Sammou and A. Abdali. "Routing in Delay ...
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that...
In conventional networks, routing problem can be modeled as the design of an efficient source-to-destination route based on persistent end-to-end paths. However, in a delay tolerant network (DTN), nodes are intermittently connected and thus, the end-to-end paths will not always exist, in wh...
Routing in a delay tolerant network. In Proceedings of the ACM SIGCOMM, pp. 145–158. Henriksson, D., Abdelzaher, T. F., & Ganti, R. K. (2007). A caching-based approach to routing in delay-tolerant networks. In Proceedings of the international conference on computer communications and ...
In a delay-tolerant network, the end-to-end delay has four com- ponents. First, the message must wait for the next contact to arrive (waiting time). Next, the data queued ahead of the current mes- sage must be delivered (queuing delay). The message must then be transmitted (transmissi...
Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. ACM SIGCOMM 34(4):145–158 Article Google Scholar Karp B, Kung HT (2000) Gpsr: greedy perimeter stateless routing for wireless networks. In: ACM Mobicom. New York, USA, pp 243–254 Keränen AO, Kärkkäinen ...
In this paper, we address the problem of routing in delay tolerant networks (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and destination at any time, especially when the destination is not i
Vellaiyan, "Delay tolerant networking routing as a game theory problem--an overview," International Journal of Computer Networks, vol. 2, no. 3, pp. 152-172, 2010.Laveen Sundararaj, Palanisamy Vellaiyan, "Delay Tolerant Networking routing as a Game Theory problem - An Overview", ...
Previous delay-tolerant network (DTN) routing algorithms exploit either past encounter records or social network properties to derive a node's probability of delivering packets to their destinations. However, they only have a local view of the network, which limits the routing efficiency. Also, when...
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes' probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one...