D2D Assisted Coded Caching Design for Multi-Access Networks

被引：0

作者：

Wu, Xianzhang ^{[1
]}

Cheng, Minquan ^{[2
,3
]}

Chen, Li ^{[4
]}

Wu, Rongteng ^{[5
]}

Chen, Shuwu ^{[1
]}

机构：

[1] Fujian Agr & Forestry Univ, Coll Comp & Informat Sci, Fuzhou 350002, Peoples R China

[2] Guangxi Normal Univ, Key Lab Educ Blockchain & Intelligent Technol, Minist Educ, Guilin 541004, Peoples R China

[3] Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin 541004, Peoples R China

[4] Sun Yat Sen Univ, Sch Elect & Informat Technol, Guangzhou 510006, Peoples R China

[5] Minjiang Univ, Sch Comp & Big Data, Fuzhou 350108, Peoples R China

来源：

IEEE WIRELESS COMMUNICATIONS LETTERS | 2024年 / 13卷 / 10期

基金：

中国国家自然科学基金;

关键词：

Device-to-device communication; Servers; Libraries; Vectors; Reviews; Arrays; Symbols; Coded caching; device-to-device communication; multi-access networks; transmission rate; DELIVERY ARRAY DESIGN; FUNDAMENTAL LIMITS; PLACEMENT;

D O I：

10.1109/LWC.2024.3441624

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This letter explores a device-to-device (D2D) assisted setting in the multi-access networks, where the users communicate with each other and each one can access multiple neighboring cache nodes in a cyclic wrap-around fashion. For such networks, we introduce two new combinatorial arrays namely the caching array and the delivery array to characterize the coded caching process. Based on this, a novel construction of caching array and delivery array is derived through a smart transform over the existing placement delivery array (PDA). The resulting coded caching scheme can achieve a small transmission rate under the case of uncoded placement. It is shown that the proposed scheme has advantages in both the transmission rate and the subpacketization level over the benchmark scheme.

引用

页码：2702 / 2706

页数：5

共 21 条

[1] Fundamental Limits of Combinatorial Multi-Access Caching [J].

Brunero, Federico ;

Elia, Petros .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (02) :1037-1056

[2] A Novel Transformation Approach of Shared-Link Coded Caching Schemes for Multiaccess Networks [J].

Cheng, Minquan ;

Wan, Kai ;

Liang, Dequan ;

Zhang, Mingming ;

Caire, Giuseppe .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (11) :7376-7389

[3]

Ghasemi H, 2015, IEEE INT SYMP INFO, P1696, DOI 10.1109/ISIT.2015.7282745

[4] Fundamental Limits of Caching: Improved Rate-Memory Tradeoff With Coded Prefetching [J].

Gomez-Vilardebo, Jesus .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (10) :4488-4497

[5] Coded Caching for Multi-level Popularity and Access [J].

Hachem, Jad ;

Karamchandani, Nikhil ;

Diggavi, Suhas N. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (05) :3108-3141

[6] Device-to-Device Coded-Caching With Distinct Cache Sizes [J].

Ibrahim, Abdelrahman M. ;

Zewail, Ahmed A. ;

Yener, Aylin .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (05) :2748-2762

[7] Fundamental Limits of Caching [J].

Maddah-Ali, Mohammad Ali ;

Niesen, Urs .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) :2856-2867

[8]

Mingyue Ji, 2017, 2017 IEEE International Symposium on Information Theory (ISIT), P2950, DOI 10.1109/ISIT.2017.8007070

[9] Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement [J].

Reddy, Kota Srinivas ;

Karamchandani, Nikhil .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (06) :3261-3274

[10]

Tebbi A, 2017, INT C ULTRA MOD TELE, P148, DOI 10.1109/ICUMT.2017.8255121

← 1 2 3 →