Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Opportunistic content distribution in an urban setting
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
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
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Relays, base stations, and meshes: enhancing mobile networks with infrastructure
Proceedings of the 14th ACM international conference on Mobile computing and networking
Optimal routing and scheduling for deterministic delay tolerant networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
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
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Contacts between mobile users provide opportunities for data updates that supplement infrastructure-based mechanisms. While the benefits of such opportunistic sharing are intuitive, quantifying the capacity increase they give rise to is challenging because both contact rates and contact graphs depend on the structure of the social networks users belong to. Furthermore, social connectivity influences not only users' interests, i.e., the content they own, but also their willingness to share data with others. All these factors can have a significant effect on the capacity gains achievable through opportunistic contacts. This paper's main contribution is in developing a tractable model for estimating such gains in a content update system, where content originates from a server along multiple channels, with blocks of information in each channel updated at a certain rate, and users differ in their contact graphs, interests, and willingness to share content, e.g., only to the members of their own social networks. We establish that the added capacity available to improve content consistency through opportunistic sharing can be obtained by solving a convex optimization problem. The resulting optimal policy is evaluated using traces reflecting contact graphs in different social settings and compared to heuristic policies. The evaluation demonstrates the capacity gains achievable through opportunistic sharing, and the impact on those gains of the structure of the underlying social network.