Journal Home > Volume 26 , Issue 6
Tsinghua Science and Technology 2021, 26(6): 857-868 https://doi.org/10.26599/TST.2020.9010044
Open Access | Issue | Published: 09 June 2021

A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

Show Author's Information Kaihang Yu,  Zhonggui Ma( ),  Runyu Ni,  Tao Zhang
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China
Key Lab of Information Network Security, Ministry of Public Security, Shanghai 201204, China
Keywords:
caching strategy, Device-to-Device (D2D) networks, Gauss determinantal point process, many-to-many matching game
Cite this article:
Yu K, Ma Z, Ni R, et al. A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks. Tsinghua Science and Technology, 2021, 26(6): 857-868. https://doi.org/10.26599/TST.2020.9010044
Download citation
EndNote(RIS)
BibTeX

531

Views

38

Downloads

Citations

8

Crossref

7

WoS

10

Scopus

0

CSCD

Abstract Full text About this article

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device (D2D) networks. We model the D2D User Equipments (DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy. (1) It can cache other contents besides high popularity contents. (2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used (LRU), Equal Probability Random Cache (EPRC), and the Most Popular Content Cache (MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.


menu
Abstract
Full text
Outline
About this article

A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

Show Author's information Kaihang Yu, Zhonggui Ma( ), Runyu Ni, Tao Zhang
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China
Key Lab of Information Network Security, Ministry of Public Security, Shanghai 201204, China

Abstract

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device (D2D) networks. We model the D2D User Equipments (DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy. (1) It can cache other contents besides high popularity contents. (2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used (LRU), Equal Probability Random Cache (EPRC), and the Most Popular Content Cache (MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

Keywords: caching strategy, Device-to-Device (D2D) networks, Gauss determinantal point process, many-to-many matching game

References(42)

[1]
Cisco, Cisco Annual Internet Report (2018-2023) White Paper, https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html, 2020.
[2]
Z. J. Duan, M. Y. Yan, Q. L. Han, L. J. Li, and Y. S. Li, IoT-based cost saving offloading system for cellular networks, Tsinghua Science and Technology, vol. 22, no. 4, pp. 379-388, 2017.
DOI Google Scholar
[3]
H. J. Zhang, Y. Qiu, X. L. Chu, K. P. Long, and V. C. M. Leung, Fog radio access networks: Mobility management, interference mitigation, and resource optimization, IEEE Wirel. Commun., vol. 24, no. 6, pp. 120-127, 2017.
DOI Google Scholar
[4]
H. J. Zhang, Y. Qiu, K. P. Long, G. K. Karagiannidis, X. B. Wang, and A. Nallanathan, Resource allocation in NOMA-based fog radio access networks, IEEE Wirel. Commun., vol. 25, no. 3, pp. 110-115, 2018.
DOI Google Scholar
[5]
M. Waqas, G. A. S. Sidhu, T. Jabeen, M. A. Ahmad, and M. A. Javed, Transmit power optimization for relay-aided multi-carrier D2D communication, Tsinghua Science and Technology, vol. 23, no. 1, pp. 65-74, 2018.
DOI Google Scholar
[6]
F. Jameel, Z. Hamid, F. Jabeen, S. Zeadally, and M. A. Javed, A survey of device-to-device communications: Research issues and challenges, IEEE Commun. Surv. Tut., vol. 20, no. 3, pp. 2133-2168, 2018.
DOI Google Scholar
[7]
L. Y. Li, G. D. Zhao, and R. S. Blum, A survey of caching techniques in cellular networks: Research issues and challenges in content placement and delivery strategies, IEEE Commun. Surv. Tut., vol. 20, no. 3, pp. 1710-1732, 2018.
DOI Google Scholar
[8]
D. Lee, J. Choi, H. Choe, S. H. Noh, S. Min, and Y. Cho, Implementation and performance evaluation of the LRFU replacement policy, in Proc. 23rd Euromicro Conf. New Frontiers of Information Technology-Short Contributions, Budapest, Hungary, 1997, pp. 106-111.
[9]
F. Miao, D. Chen, and L. B. Jin, Multi-level PLRU cache algorithm for content delivery networks, presented at 2017 10th Int. Symp. Computational Intelligence and Design (ISCID), Hangzhou, China, 2017, pp. 320-323.
DOI
[10]
M. J. Yu, R. Li, Y. Q. Liu, and Y. Q. Li, A caching strategy based on content popularity and router level for NDN, presented at 2017 7th IEEE Int. Conf. Electronics Information and Emergency Communication (ICEIEC), Macau, China, 2017, pp. 195-198.
DOI
[11]
Y. Mo, J. X. Bao, S. B. Wang, Y. X. Ma, H. Liang, J. B. Huang, P. Lu, and J. C. Chen, CCPNC: A cooperative caching strategy based on content popularity and node centrality, presented at 2019 IEEE Int. Conf. Networking, Architecture and Storage (NAS), Enshi, China, 2019, pp. 1-8.
DOI
[12]
M. Y. Ji, G. Caire, and A. F. Molisch, Fundamental limits of caching in wireless D2D networks, IEEE Trans. Inf. Theory, vol. 62, no. 2, pp. 849-869, 2016.
DOI Google Scholar
[13]
S. B. Zhang, W. Sun, and J. J. Liu, An optimized spatially cooperative caching strategy for heterogeneous caching network, presented at 2019 15th Int. Wireless Communications & Mobile Computing Conf. (IWCMC), Tangier, Morocco, 2019, pp. 1685-1689.
DOI
[14]
S. N. Li, X. Q. Qin, Y. Z. Tao, B. L. Liu, and P. Zhang, Age-constrained content access strategy in D2D-assisted wireless caching networks, presented at 2019 IEEE/CIC Int. Conf. Communications in China (ICCC), Changchun, China, 2019, pp. 287-292.
DOI
[15]
R. Bi, Y. S. Li, and X. Zheng, An optimal content caching framework for utility maximization, Tsinghua Science and Technology, vol. 21, no. 4, pp. 374-384, 2016.
DOI Google Scholar
[16]
Y. Li, C. Zhong, M. C. Gursoy, and S. Velipasalar, Learning-based delay-aware caching in wireless D2D caching networks, IEEE Access, vol. 6, pp. 77 250-77 264, 2018.
DOI Google Scholar
[17]
Z. J. Lin, Y. Wang, Y. J. Lin, L. H. Wu, and Z. F. Chen, Analysis and optimization of RLNC-based cache placement in 5G D2D networks, IEEE Access, vol. 6, pp. 65 179-65 188, 2018.
DOI Google Scholar
[18]
N. Zhao, X. N Liu, Y. F. Chen, S. Zhang, Z. Li, B. C. Chen, and M. S. Alouini, Caching D2D connections in small-cell networks, IEEE Trans. Veh. Technol., vol. 67, no. 12, pp. 12 326-12 338, 2018.
DOI Google Scholar
[19]
H. Hsu and K. C. Chen, A resource allocation perspective on caching to achieve low latency, IEEE Commun. Lett., vol. 20, no. 1, pp. 145-148, 2016.
DOI Google Scholar
[20]
M. C. Lee and A. F. Molisch, Caching policy and cooperation distance design for base station-assisted wireless D2D caching networks: Throughput and energy efficiency optimization and tradeoff, IEEE Trans. Wirel. Commun., vol. 17, no. 11, pp. 7500-7514, 2018.
DOI Google Scholar
[21]
L. Xiang, D. W. K. Ng, R. Schober, and V. W. S. Wong, Cache-enabled physical layer security for video streaming in backhaul-limited cellular networks, IEEE Trans. Wirel. Commun., vol. 17, no. 2, pp. 736-751, 2018.
DOI Google Scholar
[22]
J. C. Yang, C. F. Ma, J. B. Man, H. F. Xu, G. Zheng, and H. B. Song, Cache-enabled in cooperative cognitive radio networks for transmission performance, Tsinghua Science and Technology, vol. 25, no. 1, pp. 1-11, 2020.
DOI Google Scholar
[23]
Y. Liu, D. P. Liu, and G. X. Yue, BGMM: A body gauss-Markov based mobility model for body area networks, Tsinghua Science and Technology, vol. 23, no. 3, pp. 277-287, 2018.
DOI Google Scholar
[24]
W. Zhang, D. Wu, W. D. Yang, and Y. M. Cai, Caching on the move: A user interest-driven caching strategy for D2D content sharing, IEEE Trans. Veh. Technol., vol. 68, no. 3, pp. 2958-2971, 2019.
DOI Google Scholar
[25]
T. Deng, G. Ahani, P. Z. Fan, and D. Yuan, Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches, IEEE Trans. Wirel. Commun., vol. 17, no. 5, pp. 3082-3094, 2018.
DOI Google Scholar
[26]
J. Lee, S. H. Lee, M. Rim, and C. G. Kang, System-level spatiotemporal offloading with inter-cell mobility model for device-to-device (D2D) communication-based mobile caching in cellular network, IEEE Access, vol. 8, pp. 51 570-51 581, 2020.
DOI Google Scholar
[27]
B. W. Wang, Y. J. Sun, Q. Cao, S. Li, and Z. Sun, Bandwidth slicing for socially-aware D2D caching in SDN-enabled networks, IEEE Access, vol. 6, pp. 50 910-50 926, 2018.
DOI Google Scholar
[28]
W. Wang, R. N. Lan, J. X. Gu, A. P. Huang, H. G. Shan, and Z. Y. Zhang, Edge caching at base stations with device-to-device offloading, IEEE Access, vol. 5, pp. 6399-6410, 2017.
DOI Google Scholar
[29]
R. Chai, Y. Y. Li, and Q. B. Chen, Joint cache partitioning, content placement, and user association for D2D-enabled heterogeneous cellular networks, IEEE Access, vol. 7, pp. 56 642-56 655, 2019.
DOI Google Scholar
[30]
Y. L. Zhang, Y. H. Xu, Q. H. Wu, X. Liu, K. L. Yao, and A. Anpalagan, A game-theoretic approach for optimal distributed cooperative hybrid caching in D2D networks, IEEE Wirel. Commu. Lett., vol. 7, no. 3, pp. 324-327, 2018.
DOI Google Scholar
[31]
P. Li, X. M. Wang, J. L. Lu, L. C. Zhang, and Z. B. He, Optimization-based fragmental transmission method for video data in opportunistic networks, Tsinghua Science and Technology, vol. 22, no. 4, pp. 389-399, 2017.
DOI Google Scholar
[32]
K. Wu, L. Zhao, M. Jiang, X. J. Huang, and Y. Qian, Competition analysis of diverse request-aware packet caching policy for D2D communication, IEEE Trans. Commun., vol. 68, no. 11, pp. 7039-7053, 2020.
DOI Google Scholar
[33]
N. Woolsey, R. R. Chen, and M. Y. Ji, Towards finite file packetizations in wireless device-to-device caching networks, IEEE Trans. Commun., vol. 68, no. 9, pp. 5283-5298, 2020.
DOI Google Scholar
[34]
B. Blaszczyszyn, M. Haenggi, P. Keeler, and S. Mukherjee, Stochastic Geometry Analysis of Cellular Networks. Cambridge, MA, USA: Cambridge University Press, 2018.
DOI
[35]
Z. G. Ma, N. Nuermaimaiti, and L. L. Wang, Performance analysis of D2D-aided underlaying cellular networks based on Poisson hole cluster process, Wirel. Personal Commun., vol. 111, no. 4, pp. 2369-2389, 2020.
DOI Google Scholar
[36]
M. Z. Weng, Y. L. Shang, and Y. Tian, The design and implementation of LRU-based web cache, presented at 2013 8th Int. Conf. Communications and Networking in China (CHINACOM), Guilin, China, 2013, pp. 400-404.
[37]
S. Tamoor-ul-Hassan, M. Bennis, P. H. J. Nardelli, and M. Latva-Aho, Modeling and analysis of content caching in wireless small cell networks, presented at 2015 Int. Symp. Wireless Communication Systems (ISWCS), Brussels, Belgium, 2015, pp. 765-769.
DOI
[38]
X. L. Wang, Y. N. Bao, X. Liu, and Z. S. Niu, On the design of relay caching in cellular networks for energy efficiency, presented at 2011 IEEE Conf. Computer Communications Workshops (INFOCOM WKSHPS), Shanghai, China, 2011, pp. 259-264.
[39]
B. Q. Chen and C. Y. Yang, Caching policy for cache-enabled D2D communications by learning user preference, IEEE Trans. Commun., vol. 66, no. 12, pp. 6586-6601, 2018.
DOI Google Scholar
[40]
Z. G. Ma, N. Nuermaimaiti, H. J. Zhang, H. Zhou, and A. Nallanathan, Deployment model and performance analysis of clustered D2D caching networks under cluster-centric caching strategy, IEEE Trans. Commun., vol. 68, no. 8, pp. 4933-4945, 2020.
DOI Google Scholar
[41]
Y. Wang, X. F. Tao, X. F. Zhang, and Y. Gu, Cooperative caching placement in cache-enabled D2D underlaid cellular network, IEEE Commun. Lett., vol. 21, no. 5, pp. 1151-1154, 2017.
DOI Google Scholar
[42]
W. Jiang, G. Feng, and S. Qin, Optimal cooperative content caching and delivery policy for heterogeneous cellular networks, IEEE Trans. Mobile Comput., vol. 16, no. 5, pp. 1382-1393, 2017.
DOI Google Scholar
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 05 August 2020
Accepted: 22 September 2020
Published: 09 June 2021
Issue date: December 2021

Copyright

© The author(s) 2021.

Acknowledgements

This work was supported by the Fundamental Research Funds for the Central Universities (Nos. FRF-DF-20-12 and FRF-GF-18-017B).

Rights and permissions

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return