Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks

doi:10.13190/j.jbupt.2019-104

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (2): 29-39.doi: 10.13190/j.jbupt.2019-104

• PAPERS • Previous Articles Next Articles

Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks

WANG Meng-zhe¹, TENG Ying-lei¹, SONG Mei¹, HAN Dan-tao², ZHANG Yong¹

1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. Instrument Technology and Economy Institute, Beijing 100055, China

Received:2019-05-31 Published:2020-04-28

Abstract

Abstract: A distributed caching allocation algorithm based on mean-field game (MFG) and a distributed deleting allocation algorithm based on Lyapunov drift-plus-penalty (DPP) method were proposed to solve the problem of caching allocation algorithms' extremely high complexity caused by lots of devices in ultra-dense network and the problem of system instability caused by caching and deleting same content frequently. The caching allocation algorithm's complexity independent of the number of base stations is made by MFG. The time-correlated deleting allocation problem into problems each time slot is decoupled by DPP. Thereafter the deleting allocation policy for the tradeoff between system stability and minimizing network cost gets solved. Simulation shows that MFG can both make the network optimal control strategy converge quickly and save network cost obviously compared to baseline caching allocation method under ultra-dense scenario. Lyapunov DPP method can ensure network caching and deleting stability while minimizing network cost.

Key words: ultra-dense network, mean-field, mean-field game, Lyapunov theory, drift-plus-penalty

CLC Number:

TN929.53

WANG Meng-zhe, TENG Ying-lei, SONG Mei, HAN Dan-tao, ZHANG Yong. Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 29-39.

References

[1] Chun B G,Chaudhuri K, Wee H, et al. Selfish caching in distributed systems:a game-theoretic analysis[M]. New York:Association for Computing Machinery, 2004:21-30.
[2] Yang C, Li J, Semasinghe P, et al. Distributed interference and energy-aware power control for ultra-dense D2D networks:a mean field game[J]. IEEE Transactions on Wireless Communications, 2017, 16(2):1205-1217.
[3] Al-Zahrani A, Yu F R,Huang M. A joint cross-layer and co-layer interference management scheme in hyper-dense heterogeneous networks using mean-field game theory[J]. IEEE Transactions on Vehicular Technology, 2016, 65(3):1522-1535.
[4] Baillieul J, Samad T. Encyclopedia of systems and control[M]. London:Springer London, 2014:1-6.
[5] Hamidouche K, Saad W, Debbah M, et al. Mean-field games for distributed caching in ultra-dense small cell networks[C]//American Control Conference. Boston:[s. n.], 2016:4699-4704.
[6] Kim H,Park J, Bennis M, et al. Ultra-dense edge caching under spatio-temporal demand and network dynamics[C]//IEEE International Conference on Communications (ICC). Paris:[s. n.] 2017:1-7.
[7] Neely M J. Stochastic network optimization with application to communication and queueing systems[J]. Synthesis Lectures on Communication Networks, 2010, 3(1):1-211.
[8] Huang L, Neely M J. Utility optimal scheduling in processing networks[J]. Performance Evaluation, 2011, 68(11):1002-1021.
[9] Samarakoon S, Bennis M, Saad W, et al. Ultra dense small cell networks:turning density into energy efficiency[J]. IEEE Journal on Selected Areas in Communications, 2016, 34(5):1267-1280.
[10] 张琪. 联合缓存与无线传输的理论性能分析及优化策略研究[D]. 北京:北京邮电大学, 2018.
[11] Cao Y, Tao M, Xu F,et al. Fundamental storage-latency tradeoff in cache-aided MIMO interference networks[J]. IEEE Transactions on Wireless Communications,2017, 16(8):5061-5076.
[12] Gueant O, Lasry J, Lions P. Mean field games and applications[M]. Berlin, Germany:Springer Berlin Heidelberg, 2011:205-266.
[13] Bernt O. Stochastic differential equations[J]. IEEE Transactions on Automatic Control, 2006, 51(10):1731-1732.
[14] Debbah M, Couillet R, Perlaza S M, et al. Electrical vehicles in the smart grid:a mean field game analysis[J]. IEEE Journal on Selected Areas in Communications, 2012, 30(6):1086-1096.
[15] Aziz M, Caines P E. A mean field game computational methodology for decentralized cellular network optimization[J]. IEEE Transactions on Control Systems Technology, 2017, 25(2):563-576.
[16] Li J, Chen Y T,Chen G,et al. Computational partial differential equations using matlab (Chapman & Hall/CRC Applied Mathematics & Nonlinear Science)[M]. New York:Taylor & Francis, 2011.

Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Recommended Articles

Metrics

Comments

[1]	. Research on Resource Allocation and Task Offloading Joint Optimization for Mobile Edge Computing in Ultra-Dense Networks [J]. Journal of Beijing University of Posts and Telecommunications, 2023, 46(2): 50-56.
[2]	KANG Ling, WANG Yi, HU Yanjun, JIANG Fang, LI Liping. Clustering Algorithm Combined with Discriminant Function in Ultra Dense Network [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(2): 104-109.
[3]	XU Yan-ping, JIA Wen-jie, LI Xiao-jing, ZHANG Chang-sen, TIAN Xin-ji. An Improved Clustering and Resource Allocation Scheme for Ultra-Dense Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2019, 42(2): 77-82.
[4]	ZHANG Hai-bo, LI Hu, CHEN Shan-xue, ZOU Jian. A Cluster-Based Resource Allocation Under Hybrid Access Mode in Ultra-Dense Network [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(3): 69-74.