An Approach to Reduce the Redundancy of Placement Delivery Array Schemes for Random Demands

作     者：Li, Xiaojun Zhang, Qiaoling Cheng, Minquan Wan, Kai 

作者机构：Guangxi Normal Univ Guangxi Key Lab Multisource Informat Min & Secur Guilin 541004 Peoples R China Huaguang Coll Quanzhou Quanzhou 362121 Peoples R China Tech Univ Berlin Elect Engn & Comp Sci Dept D-10587 Berlin Germany 

出 版 物：《IEEE WIRELESS COMMUNICATIONS LETTERS》 (IEEE Wireless Commun. Lett.)

年 卷 期：2021年第10卷第6期

页      面：1314-1318页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：NSFC Guangxi Collaborative Innovation Center of Multi-Source Information Integration and Intelligent Processing Guangxi Bagui Scholar Teams for Innovation and Research Project Guangxi Talent Highland Project of Big Data Intelligence and Application European Research Council European Research Council (ERC) Funding Source: European Research Council (ERC) 

主　　题：Handheld computers Manganese Servers Multicast algorithms Cache memory Technological innovation Information theory Coded caching placement delivery array multicast opportunities PDA-d graph transmission load 

摘      要：Centralized coded caching schemes have been widely studied in wireless networks. Placement delivery array (PDA) can be used to generate a coded caching scheme with low subpacketization when all the requested files are different. However, all existing schemes based on PDA design treat the request of each user as an independent file, without leveraging the multicast opportunities when one file is requested by several users. In this letter, for any existing scheme based on PDA design, after its coded multicast messages generation, we proposed an approach to remove the redundant multicast messages.