A novel centralized coded caching scheme for edge caching basestation

With the development of microprocessor technology, the base stations (BSs) are equipped with more and more powerful storage and computing ability and then can be used as edge servers in the edge computing network. As a result, there is an extreme pressure on transmission load in the edge computing network during the peak traffic time. Coded caching is regarded as an efficient technology to reduce the transmission load. In this paper, we focus on designing the coded caching scheme for any fixed subpacketization and dynamic number of users by constructing an appropriate matrix called placement delivery array (PDA) based on Maddah-Ali and Niesen (MN) scheme. In order to accommodate the dynamic number of users, we remove some columns from the right side of the well known conjugate MN PDA to obtain a new flexible PDA with dynamic column number. It is worth noting that when the number of columns deleted is in a certain range, the transmission load of the scheme realized by our obtained PDA is order optimal. In addition, when the number of columns deleted satisfies a certain condition, by means of combinatorial method we can obtain an improved PDA which leads to a smaller transmission load.

Automated summary

This article focuses on designing a coded caching scheme for fixed subpacketization and dynamic number of users by constructing an appropriate matrix. By removing columns, a new flexible PDA with dynamic column number is obtained, and the transmission load of the scheme is order optimal. Furthermore, an improved PDA can be obtained using combinatorial methods to reduce transmission load.