TY - GEN
T1 - Efficient Online Collaborative Caching in Cellular Networks with Multiple Base Stations
AU - Ostovari, Pouya
AU - Wu, Jie
AU - Khreishah, Abdallah
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/1/11
Y1 - 2017/1/11
N2 - These days we are witnessing a tremendous increase in the popularity of wireless devices, e.g. smartphones and tablets. These devices are typically connected to the Internet through cellular connections, such as LTE/4G. Because of the popularity of the wireless devices, a large portion of the traffic on the Internet goes through the cellular base stations. Caching the contents at the base stations brings the contents closer to the users, reduces the traffic on the Internet, and reduces the cost of providing the contents. In this paper, we study the problem of collaborative caching in cellular networks among a set of base stations. Motivated by the emergence of cloudlets, we consider unlimited cache space in our model, and our objective is to minimize the aggregated caching and download cost. We show that in the case of knowing the popularity of the contents, this optimization has a submodular property, and a greedy algorithm can achieve an approximation ratio of 2 for this optimization. We also provide an online algorithm that does not require any knowledge about the future requests and the content popularity. In order to evaluate our online algorithm, we compare its performance against the optimal solution through simulations.
AB - These days we are witnessing a tremendous increase in the popularity of wireless devices, e.g. smartphones and tablets. These devices are typically connected to the Internet through cellular connections, such as LTE/4G. Because of the popularity of the wireless devices, a large portion of the traffic on the Internet goes through the cellular base stations. Caching the contents at the base stations brings the contents closer to the users, reduces the traffic on the Internet, and reduces the cost of providing the contents. In this paper, we study the problem of collaborative caching in cellular networks among a set of base stations. Motivated by the emergence of cloudlets, we consider unlimited cache space in our model, and our objective is to minimize the aggregated caching and download cost. We show that in the case of knowing the popularity of the contents, this optimization has a submodular property, and a greedy algorithm can achieve an approximation ratio of 2 for this optimization. We also provide an online algorithm that does not require any knowledge about the future requests and the content popularity. In order to evaluate our online algorithm, we compare its performance against the optimal solution through simulations.
KW - Collaborative caching
KW - approximation
KW - cellular network
KW - online algorithm
KW - wireless networks
UR - http://www.scopus.com/inward/record.url?scp=85013335950&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85013335950&partnerID=8YFLogxK
U2 - 10.1109/MASS.2016.027
DO - 10.1109/MASS.2016.027
M3 - Conference contribution
AN - SCOPUS:85013335950
T3 - Proceedings - 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
SP - 136
EP - 144
BT - Proceedings - 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
Y2 - 10 October 2016 through 13 October 2016
ER -