Coded caching is an effective technology to reduce traffic load. While, existing works rarely consider secure coded caching scheduling, with concerning time-varying wireless channels and dynamic user's request. In this paper, we study the adaptive secure scheduling for coded caching system in a vehicle network, where a vehicular eavesdropper (VE) intends to intercept the signals transmitted by the base station (BS), and the BS serves legitimate vehicular users (VUs) by exploiting physical layer security (PLS) technique to avoid the information leakage. On the basis, we formulate a long-term averaged power minimization problem subject to the dynamic content requests of users and secure transmission requirement. By exploiting Lyapunov optimization framework, the formulated problem is transformed and decomposed into a series of online optimization problems for every time slot. By solving them, we obtain the adaptive coded caching scheme with adaptive scheduling and resource allocation, based on the instantaneous channel and buffer state information. Lastly, numerical results are presented to validate the effectiveness of the adaptive coded caching scheme, and to unveil the inherent tradeoff between the cache size and the power consumption.
On the Adaptive Secure Coded Caching Scheme in Vehicle Networks
2024-06-24
342019 byte
Conference paper
Electronic Resource
English
Coded caching over realistic and scalable wireless networks
DataCite | 2020
|Decentralized Asynchronous Coded Caching in Fog-RAN
IEEE | 2018
|