Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Measure Theory and Probability Theory (Springer Texts in Statistics)
Measure Theory and Probability Theory (Springer Texts in Statistics)
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Optimal activation and transmission control in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Power Law and Exponential Decay of Intercontact Times between Mobile Devices
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
We study the tradeoff 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 ordinary differential equation (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.