A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Proceedings of the 5th international conference on Emerging networking experiments and technologies
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Distributed caching over heterogeneous mobile networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal channel choice for collaborative ad-hoc dissemination
INFOCOM'10 Proceedings of the 29th conference on Information communications
MobiTrade: trading content in disruption tolerant networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
Performance modeling of epidemic routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Delay Tolerant Networks: Protocols and Applications
Delay Tolerant Networks: Protocols and Applications
SLAW: self-similar least-action human walk
IEEE/ACM Transactions on Networking (TON)
Traffic analysis of a Web proxy caching hierarchy
IEEE Network: The Magazine of Global Internetworking
Message Drop and Scheduling in DTNs: Theory and Practice
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
Emerging challenged networks require new protocols and strategies to cope with a high degree of mobility, high delays and unknown, possibly non-existing routes within the network. Researchers have proposed different store-carry-and-forward protocols for data delivery in challenged networks. These have been complemented with appropriate drop and scheduling policies that deal with the limitations of the nodes' buffers and the limited duration of opportunistic encounters in these networks. Nevertheless, the vast majority of these protocols and strategies are designed for end-to-end transmissions. Yet, a paradigm shift from the traditional way of addressing the endpoints in the network has been occurring towards content-centric networking. To this end, we present CEDO, a content-centric dissemination algorithm for challenged networks. CEDO aims at maximizing the total delivery-rate of distributed content in a setting where a range of contents of different popularity may be requested and stored, but nodes have limited resources. It achieves this by maintaining a delivery-rate utility per content that is proportional to the content miss rate and that is used by the nodes to make appropriate drop and scheduling decisions. This delivery-rate utility can be estimated locally by each node using unbiased estimators fed by sampled information on the mobile network obtained by gossiping. Both simulations and theory suggest that CEDO achieves its set goal, and outperforms a baseline LRU-based policy by 72%, even in relatively small scenarios. The framework followed by CEDO is general enough to be applied to other global performance objectives as well.