Optimal forwarding in Delay Tolerant Networks with Multiple Destinations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE/ACM Transactions on Networking Year : 2013

Optimal forwarding in Delay Tolerant Networks with Multiple Destinations

Abstract

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the message and the number of destinations that have received the message. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.
Fichier principal
Vignette du fichier
singh.pdf (398.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00918679 , version 1 (14-12-2013)

Identifiers

Cite

Chandramani Singh, Eitan Altman, Anurag Kumar, Rajesh Sundaresan. Optimal forwarding in Delay Tolerant Networks with Multiple Destinations. IEEE/ACM Transactions on Networking, 2013, 21 (6), pp.1812 - 1826. ⟨10.1109/TNET.2012.2233494⟩. ⟨hal-00918679⟩
176 View
163 Download

Altmetric

Share

Gmail Facebook X LinkedIn More