Distributed Cooperative Caching in Social Wireless Networks

Abstract

This paper introduces cooperative caching policies for minimizing electronic content provisioning cost in Social Wireless Networks (SWNET). SWNETs are formed by mobile devices, such as data enabled phones, electronic book readers etc., sharing common interests in electronic content, and physically gathering together in public places. Electronic object caching in such SWNETs are shown to be able to reduce the content provisioning cost which depends heavily on the service and pricing dependences among various stakeholders including content providers (CP), network service providers, and End Consumers (EC). Drawing motivation from Amazon's Kindle electronic book delivery business, this paper develops practical network, service, and pricing models which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. The paper constructs analytical and simulation models for analyzing the proposed caching strategies in the presence of selfish users that deviate from network-wide cost-optimal policies. It also reports results from an Android phonebased prototype SWNET, validating the presented analytical and simulation results.

Exploiting Caching and Multicast for 5G Wireless Networks

“…The user demand for a set of popular files and within a certain time period is assumed to be known in advance, as in [17]- [20], [25]- [28] which is possible using learning techniques [29], [30]. Let I indicate that collection of files, with I = |I|.…”

“…The idea of leveraging storage for improving network performance is gaining increasing interest with applications in content distribution [25], [26], IPTV [27], social [28] and heterogeneous cellular networks [17]- [20], [41], [42]. Caching popular files at the SBSs has been studied from an optimization [17]- [20] and a game theoretic point of view [41], [42] with the results spanning a wide range of techniques, such as discrete/convex optimization, content-centric networking algorithms, facility location algorithms, coalition formation and matching games.…”

Performance Analysis and Optimization of Cache-Enabled Small Cell Networks

“…Theorem 2: In the cache-enabled mmWave tier, the SCDP is given by (16) where P mm,L j,SCD pb j q and P mm,N j,SCD pb j q denote that probabilities that the content j is successfully delivered when the mmWave UE is connected to its serving mmWave SBS via LOS link and NLOS link, and are given by P mm,L j,SCD pb j q 1 ¡ e ¡pmin pDL,dLqq Proof 2: Based on (2) and (4), the SCDP for a LOS mmWave link can be derived as…”

“…The problem (23) is non-convex, and finding its global optimal solution is challenging. To obtain an efficient caching placement solution, we first use the following approximations [16] 6 9 9 9 9 9 9 8 9 9 9 9 9 9 7…”

Socially aware integrated centralized infrastructure and opportunistic networking: a powerful content dissemination catalyst

“…We model an MU's interest in a specific piece of content C i by the probability Pr(C i ) of this MU requesting C i from the CI. If we have a range of contents C i |i = 1, … M, their corresponding requesting probabilities Pr(C i )|i = 1, …, M} obey the Zipf distribution [7].…”