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
Scoop: decentralized and opportunistic multicasting of information streams
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| 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 show that Psephos maximizes the system's social welfare. To the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner.