MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Convex Optimization
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Fair and efficient scheduling in data ferrying networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Potential for collaborative caching and prefetching in largely-disconnected villages
Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions
The age of gossip: spatial mean field regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
On the stability and optimality of universal swarms
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the stability and optimality of universal swarms
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
An update-based step-wise optimal cache replacement for wireless data access
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility increases the connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
CEDO: content-centric dissemination algorithm for delay-tolerant networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Optimal management of dynamic information in Delay Tolerant Networks
The Journal of Supercomputing
| Hi-index | 0.00 |
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is typically limited; therefore, identifying which content a user should store in her cache is a fundamental problem in the operation of any such content distribution system. In this work, we propose Psephos, a novel mechanism for determining the caching policy of each mobile user. Psephos is fully distributed: users compute their own policies individually, in the absence of a central authority. Moreover, it is designed for a heterogeneous environment, in which demand for content, access to resources, and mobility characteristics may vary across different users. Most importantly, the caching policies computed by our mechanism are optimal: we rigorously show that Psephos maximizes the system's social welfare. Our results are derived formally using techniques from stochastic approximation and convex optimization; to the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner.