Optimal control theory with economic applications
Optimal control theory with economic applications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
NECTAR: a DTN routing protocol based on neighborhood contact history
Proceedings of the 2009 ACM symposium on Applied Computing
Design and field experimentation of an energy-efficient architecture for DTN throwboxes
IEEE/ACM Transactions on Networking (TON)
Optimal activation and transmission control in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks
NAS '10 Proceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage
A mean field approach for optimization in discrete time
Discrete Event Dynamic Systems
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Universal scheme improving probabilistic routing in delay-tolerant networks
Computer Communications
| Hi-index | 0.00 |
In this work, we investigate the use of epidemic routing in energy constrained Delay Tolerant Networks (DTNs). In DTNs, connected paths between source and destination rarely materialize due to the mobility and sparse density of nodes. Epidemic routing is well-suited for these environments due to its simplicity and fully distributed implementation. In epidemic routing, messages are relayed by intermediate nodes at contact opportunities, i.e., when pairs of nodes come within transmission range. Each node needs to decide whether to forward its message upon contact with a new node based on its residual energy level and the age of that message. We mathematically characterize the fundamental trade-off between energy conservation and forwarding efficacy as a heterogeneous dynamic energy-dependent optimal control problem. We prove, somewhat surprisingly given the complex nature of the problem, that in the mean field regime, the optimal dynamic forwarding decisions follow simple threshold-based structures in which the forwarding threshold for each node depends on its current remaining energy. We analytically establish this result under generalized classes of utility functions for DTNs. We then characterize the dependence of these thresholds on current energy reserves in each node.