Simplifying Wireless Social Caching via Network Coding

Social groups open up the opportunity for a new form of caching. This paper investigates how a social group of users can jointly optimize bandwidth usage, by each caching network-coded parts of the data demand, and then opportunistically share these parts among themselves upon meeting. First, the pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2018-11, Vol.66 (11), p.5512-5525
Main Authors: Karmoose, Mohammed, Cardone, Martina, Fragouli, Christina
Format: Article
Language:English
Subjects:
Algorithms
Bandwidth
Bandwidths
Caching
Complexity theory
Device-to-device communication
Heuristic
Heuristic methods
Network coding
Optimization
polynomial-time heuristic
Polynomials
Routing
Servers
set-cover
Social networks
Wireless communication
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Social groups open up the opportunity for a new form of caching. This paper investigates how a social group of users can jointly optimize bandwidth usage, by each caching network-coded parts of the data demand, and then opportunistically share these parts among themselves upon meeting. First, the problem is formulated as a linear program (LP) with exponential complexity in the number of users. Then, a heuristic algorithm is proposed, which is inspired by the bipartite set-cover problem and operates in polynomial time. For some scenarios, a worst-case performance guarantee of the heuristic with respect to the optimal LP solution is proved. Finally, the performance of the algorithm is assessed using real-world mobility traces synthesized using the SWIM model and from the MIT Reality Mining project data set. The proposed heuristic offers bandwidth savings up to 65% for a waiting time of 30 minutes and up to 28% performance gains with respect to the alternative solutions. These benefits make the algorithm a feasible candidate solution for bandwidth savings.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2018.2854786