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
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
Socially-aware gateway-based content sharing and backup
Proceedings of the 2nd ACM SIGCOMM workshop on Home networks
Home networking as a distributed file system view
Proceedings of the 2nd ACM SIGCOMM workshop on Home networks
| Hi-index | 0.00 |
This paper addresses the need for content sharing and backup in household equipped with a home gateway that stores, tags and manages the data collected by the home users. Our solution leverages the interaction between remote gateways in a social way, i.e., by exploiting the users' social networking information, so that backup recipients are those gateways whose users are most likely to be interested in accessing the shared content. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution. We then propose a low-complexity, distributed heuristic algorithm and use simulation in a synthetic social network scenario to show that the final content placement among "friendly" gateways well approximates the optimal solution under different network settings.