A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
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
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
The age of gossip: spatial mean field regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimizing File Retrieval in Delay-Tolerant Content Distribution Community
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Deep-Space Transport Protocol: A novel transport scheme for Space DTNs
Computer Communications
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
IEEE/ACM Transactions on Networking (TON)
Impact of altruism on opportunistic communications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Distributed caching over heterogeneous mobile networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Recognizing exponential inter-contact time in VANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cost-effective multiperiod spraying for routing in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Supporting Cooperative Caching in Disruption Tolerant Networks
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Floating content: Information sharing in urban areas
PERCOM '11 Proceedings of the 2011 IEEE International Conference on Pervasive Computing and Communications
Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks
Computer Communications
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
Contact duration aware data replication in Delay Tolerant Networks
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
A Hybrid Pull-Based with Piggybacked Push Protocol for Cache Sharing
The Computer Journal
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
To improve the performance of information retrieval in Delay Tolerant Networks (DTN), multiple replicas of information are often deployed. In this paper, we mainly study dynamic information, which evolves with time. For simplicity, we use the information IM as an example. We use the discrete time model, and the time is divided into many slots. In each slot, a new version of the information is created. We say that one node's age is k if it receives a replica of the information IM k驴1 slots ago. Due to the constraint of the buffer or other factors, we cannot deploy too many replicas for a specific message. The goal of this paper is to study efficient ways for distributing the limited replicas to maximize the availability of the information. In particular, we consider two policies, which are source-control policy and destination-control policy, respectively. In the first one, if the source node encounters with one node whose age is k, it will forward a new version of the information to this node with probability p(k). In the second policy, if one node's age is k, it discards the replica with probability p(k). We prove that the optimal value of p(k) in both cases conforms to the threshold form. Simulations based on both synthetic and real motion traces show the accuracy of our model. Numerical results show that the destination-control policy is better.