Efficient caching strategy based on graph coloring for moving users in ultra dense networks

doi:10.19682/j.cnki.1005-8885.2019.0011

The Journal of China Universities of Posts and Telecommunications ›› 2019, Vol. 26 ›› Issue (3): 1-7.doi: 10.19682/j.cnki.1005-8885.2019.0011

• Wireless • Next Articles

Efficient caching strategy based on graph coloring for moving users in ultra dense networks

Xi LI ²,Zhang Heli

Received:2018-08-01 Revised:2019-01-07 Online:2019-06-30 Published:2019-06-30

Abstract

Abstract: Caching popular files in small-cell base stations (SBSs) is considered as a promising technique to meet the demand of ever growing mobile data traffic in ultra dense networks (UDNs). Considering the limited cache capacity and dense deployment of SBSs, how to support uninterrupted and successful caching downloading for moving users is still a challenging problem. In this paper, a graph-coloring-based caching (GCC) algorithm in UDN for moving user under limited SBS storage capacities is proposed. Firstly, considering there may be downloading interruption or even failure due to the random moving of users and small coverage of SBSs, graph coloring algorithm （GCA） is employed for grouping the SBS to cache fragments of several files. Then, the problem of how to conduct caching placement on SBSs is formulated aiming to maximize the amount of data downloaded from SBSs. Finally, an efficient heuristic solution is proposed to get an optimal result. Simulation results show that the algorithm performs better than other caching strategies in prior work, in terms of reducing both backhaul traffic and user download delay.

Key words: ultra dense network, graph coloring, caching, moving user, download delay

Xi LI Zhang Heli. Efficient caching strategy based on graph coloring for moving users in ultra dense networks [J]. The Journal of China Universities of Posts and Telecommunications, 2019, 26(3): 1-7.

References

1. Cisco visual networking index: Global mobile data traffic forecast update, 2016-2021 White Paper. San Jose, CA, USA: Cisco, 2017.

2. Huang X Y, Zhao Z F, Zhang H G. Cooperate caching with multicast for mobile edge computing in 5G networks. Proceedings of the IEEE 85th Vehicular Technology Conference (VTC Spring’17), Jun 4-7, 2017, Sydney, Australia. Piscataway, NJ, USA: IEEE, 2017: 6p.

3. De Pellegrini F, Massaro A, Goratti L, et al. Competitive caching of contents in 5G edge cloud networks. Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt’17), May 15-19, 2017, Paris, France. Piscataway, NJ, USA: IEEE, 2017: 8p.

4. Shen G, Pei L, Pan Z W, et al. Machine learning based small cell cache strategy for ultra dense networks. Proceedings of the 9th International Conference on Wireless Communications and Signal Processing (WCSP’17), Oct 11-13, 2017, Nanjing, China. Piscataway, NJ, USA: IEEE, 2017: 6p.

5. Li L Y, Zhao G D, Blum R S. A survey of caching techniques in cellular networks: Research issues and challenges in content placement and delivery strategies. IEEE Communications Surveys and Tutorials, 2018, 20(3): 1710-1732.

6. Farahat H, Hassanein H. Optimal caching for producer mobility support in named data networks. Proceedings of the 2016 IEEE International Conference on Communications (ICC’16), May 22-27, 2016, Kuala Lumpur, Malaysia. Piscataway, NJ, USA: IEEE, 2016: 6p.

7. Liu T, Zhou S, Tsinghua Z N. Mobility-aware coded-caching scheme for small cell network. Proceedings of the 2017 IEEE International Conference on Communications (ICC’17), May 21-25, 2017, Paris, France. Piscataway, NJ, USA: IEEE, 2017: 6p.

8. Chen M, Hao Y X, Hu L, et al. Green and mobility-aware caching in 5G networks. IEEE Transactions on Wireless Communications, 2017, 16(12): 8347–8361.

9. Zhan C, Yao G. Optimizing caching placement for mobile users in heterogeneous wireless network. Proceedings of the IEEE 42nd Conference on Local Computer Networks (LCN’17), Oct 9-12, 2017, Singapore. Piscataway, NJ, USA: IEEE, 2017: 175–178.

10. Chen L, Xia H L, Feng C Y, et al. Clustering-based co-tier interference coordination in dense small cell networks. Proceedings of the IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC’15), Aug 30-Sept 2, 2015, Hong Kong, China. Piscataway, NJ, USA: IEEE, 2015: 1878–1882.

11. Chen H S, Zhou P. An ant algorithm for solving the four-coloring map problem. Proceedings of the 9th International Conference on Natural Computation (ICNC’13), Jul 23-25, 2013, Shenyang, China. Piscataway, NJ, USA: IEEE, 2013: 491–495.

12. Ozfatura E, Gndz D. Mobility and popularity-aware coded small cell caching. IEEE Communications Letters, 2018, 22(2): 288–291.

13. Wu T H, Li X, Ji H, et al. An edge caching strategy for minimizing user download delay. Quality, Reliability, Security and Robustness in Heterogeneous Systems: Proceedings of the 13th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine’17), Dec 16-17, 2017, Dalian, China. LNICST 234. Berlin, Germany: Springer-Verlag, 2017: 120-130.

14. Gabry F, Bioglio V, Land I. On energy-efficient edge caching in heterogeneous networks. IEEE Journal on Selected Areas in Communications, 2016, 34(12): 3288–32986.

Metrics

Comments

Copyright © 2020 The Journal of China Universities of Posts and Telecommunications
　 Adress: P.O. Box 231,Beijing University of Posts and Telecommunications,10 Xi Tucheng Road,Beijing 100876,P.R.China　Post Code: 100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
Support by: Beijing Magtech Co.Ltd

Efficient caching strategy based on graph coloring for moving users in ultra dense networks

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments