Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen significantly speeds up communication efficiency by transmitting multicast messages simultaneously useful to multiple users. Most prior works on coded caching are based on the assumption that each user may request all content in the library. However, in many applications the users are interested only in a limited set of content items that depends on their location. For example, visitors in a museum may stream audio and video related to the artworks in the room they are visiting, or assisted self-driving vehicles may access super-high definition maps of the area through which they are travelling. Motivated by these considerations, this paper formulates the coded caching problem for location-based content with edge cache nodes. The considered problem includes a content server with access to N location-based files, K edge cache nodes located at different regions, and K users each of which is in the serving region of one cache node and can retrieve the cached content of this cache node with negligible cost. Depending on the location, each user only requests a file from a location-dependent subset of the library. The objective is to minimize the worst-case load transmitted from the content server among all possible demands. We propose a highly non-trivial converse bound under uncoded cache placement, which shows that a simple achievable scheme is optimal. In addition, this achievable scheme is generally order optimal within 3. Finally, we extend the coded caching problem for location-based content to the multiaccess coded caching topology, where each user is connected to L nearest cache nodes. When $L \geq 2$ we characterize the exact optimality on the worst-case load.
翻译:位于无线边缘节点的缓存是提高空间和光谱效率的一个有希望的方法,目的是减轻与内容相关的通信网络。 Maddah- Ali 和 Niesen 最初推出的代码缓存通过同时向多个用户发送多播信息而大大加快通信效率。 先前的编码缓存工作大多基于假设每个用户都可能索取图书馆的所有内容。 然而,在许多应用程序中,用户只对取决于其位置的有限内容项目感兴趣。 例如,博物馆的来访者可以流出与其所访问的房间的艺术作品有关的音频和视频。 由Maddah- Ali 和 Niesen 和 Niesen 最初推出的代码。 由Madddah- Ali 和 Niesen 和 Niesersen 提供的代码, 由同时提供最高级定义的图像定义, 由最精确的存储器路段和最精确的存储器路段, 由最精确的存储器路段 由每个最接近的存储器路段向最接近的存储器路段 。