The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications 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
On the latency for information dissemination in mobile wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Assessing the VANET's local information storage capability under different traffic mobility
INFOCOM'10 Proceedings of the 29th conference on Information communications
On space-time capacity limits in mobile and delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A reaction-diffusion model for epidemic routing in sparsely connected MANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
A mobile peer-to-peer system for opportunistic content-centric networking
Proceedings of the second ACM SIGCOMM workshop on Networking, systems, and applications on mobile handhelds
Random Walk: A Modern Introduction
Random Walk: A Modern Introduction
Forward correction and fountain codes in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In an opportunistic content sharing system referred to as floating content, information is copied between mobile nodes upon node encounters inside an area which is called the anchor zone. We study the conditions under which information can be sustained in such a system. The anchor zone is assumed to be a circular disk, and a random walk type mobility model is adopted. First, we consider the one-speed case where all the nodes have a common velocity. Using the transport equation, adopted from nuclear reactor theory, we derive the criticality condition that defines a lower limit for the product of node density, communication distance and the radius of the anchor zone necessary for information floating. The dependence of this criticality parameter on the mean step size of the random walk is numerically established. Complemented by the asymptotic behavior, found by diffusion theory, an accurate approximation formula is derived. While the velocity of the nodes does not appear at all in the criticality condition of the one-speed system, in general, the shape of the velocity distribution has an important effect: the higher the spread of the distribution, the lower the criticality threshold is. This effect is analyzed and discussed.