DocumentCode :
271673
Title :
Many-to-many matching games for proactive social-caching in wireless small cell networks
Author :
Hamidouche, Khaled ; Saad, Walid ; Debbah, Mérouane
Author_Institution :
Dept. of Flexible Radio, SUPELEC, Gif-sur-Yvette, France
fYear :
2014
fDate :
12-16 May 2014
Firstpage :
569
Lastpage :
574
Abstract :
In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers´ servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.
Keywords :
cache storage; cellular radio; game theory; pattern matching; video communication; backhaul links; many-to-many matching games; matching algorithm; proactive social-caching; random caching policy; service provider servers; small base stations; wireless small cell networks; Conferences; Games; Radio link; Scattering; Videos; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2014 12th International Symposium on
Conference_Location :
Hammamet
Type :
conf
DOI :
10.1109/WIOPT.2014.6850348
Filename :
6850348
Link To Document :
بازگشت