M. Abolpour, M. Salehi and A. Tölli, "Cache-Aided Communications in MISO Networks with Dynamic User Behavior: A Universal Solution," 2023 IEEE International Symposium on Information Theory (ISIT), Taipei, Taiwan, 2023, pp. 132-137, doi: 10.1109/ISIT54713.2023.10206827
Cache-aided communications in MISO networks with dynamic user behavior : a universal solution
|Author:||Abolpour, Milad1; Salehi, MohammadJavad1; Tölli, Antti1|
1Centre for Wireless Communications, University of Oulu, Oulu, Finland
|Online Access:||PDF Full Text (PDF, 0.5 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe20230929137869
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2023-09-29
A practical barrier to the implementation of cache-aided networks is dynamic and unpredictable user behavior. In dynamic setups, users can freely depart and enter the network at any moment. The shared caching concept has the potential to handle this issue by assigning K users to P caching profiles, where all η p users assigned to profile p store the same cache content defined by that profile. The existing schemes, however, cannot be applied in general and are not dynamic in the true sense as they put constraints on the transmitter-side spatial multiplexing gain α. Specifically, they work only if α ≤ min p η p or α≥η^, where in the latter case, γ is the normalized cache size of each user, η^is an arbitrary parameter satisfying 1≤η^≤maxpηp, and the extra condition of α ≥ Kγ should also be met. In this work, we propose a universal caching scheme based on the same shared-cache model that can be applied to any dynamic setup, extending the working region of existing schemes to networks with minpηp≤α≤η^ and removing any other constraints of existing schemes. We also derive the closed-form expressions for the achievable degrees-of-freedom (DoF) of the proposed scheme and show that it achieves the optimal DoF for uniform user distributions. Notably, it is the first scheme to achieve the optimal DoF of Kγ + α for networks with uniform user distribution, α>η^, and non-integer αη^, without imposing any other constraints. Finally, we use numerical simulations to assess how non-uniform user distribution impacts the DoF performance and illustrate that the proposed scheme provides a noticeable improvement over unicasting for uneven distributions.
IEEE International Symposium on Information Theory proceedings
|Pages:||132 - 137|
2023 IEEE International Symposium on Information Theory (ISIT)
IEEE International Symposium on Information Theory
|Type of Publication:||
A4 Article in conference proceedings
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This research has been supported by the Academy of Finland, 6G Flagship program under Grant 346208, 343586 (CAMAIDE), and by the Finnish-American Research and Innovation Accelerator (FARIA) program.
|Academy of Finland Grant Number:||
346208 (Academy of Finland Funding decision)
343586 (Academy of Finland Funding decision)
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.