The budgeted maximum coverage problem
Information Processing Letters
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Cimbiosys: a platform for content-based partial replication
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Joint interest- and locality-aware content dissemination in social networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Find me if you can: improving geographical prediction with social and spatial proximity
Proceedings of the 19th international conference on World wide web
Walking in facebook: a case study of unbiased sampling of OSNs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient social-aware content placement in opportunistic networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
PodBase: transparent storage management for personal devices
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Distributed content backup and sharing using social information
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
| Hi-index | 0.00 |
The amount of data that home users generate, store, and share with their friends via a multitude of devices has grown significantly in the past few years. In our paper, we assume that every household is equipped with a home gateway that stores and manages the data collected by the home users. To accelerate the content sharing and backup for such users, we propose an efficient backup scheme that hinges upon gateway interactions exploiting the users' social networking in- formation. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution under a synthetic social network scenario. Then, we compare it with two different content placement strategies for gateways with various quota sizes, in a realistic synthetic social network.