当前位置: X-MOL 学术IEEE Trans. Wirel. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Stochastic Design and Analysis of User-Centric Wireless Cloud Caching Networks
IEEE Transactions on Wireless Communications ( IF 10.4 ) Pub Date : 2020-07-01 , DOI: 10.1109/twc.2020.2988559
Seyed Mohammad Azimi-Abarghouyi , Masoumeh Nasiri-Kenari , Merouane Debbah

This paper develops a stochastic geometry-based approach for the modeling, analysis, and optimization of wireless cloud caching networks comprised of multiple-antenna radio units (RUs) inside clouds with coordinated multi-point transmissions and guard zones. We consider Poisson cluster processes to model RUs and users, and the probabilistic content placement to cache files in RUs. Accordingly, we study the exact hit probability for a user of interest for two strategies; closest selection, where the user is served by the closest RU that has its requested file, and best power selection, where the serving RU having the requested file provides the maximum instantaneous received power at the user. As key steps for the analyses, the Laplace transform of out of cloud interference, the desired link distance distribution in the closest selection, and the desired link received power distribution in the best power selection are derived. Also, we approximate the derived exact hit probabilities for both the closest and the best power selections in such a way that the related objective functions for the content caching design of the network can lead to tractable concave optimization problems. Solving the optimization problems, we propose algorithms to efficiently find their optimal content placements. Finally, we investigate the impact of different parameters on the caching performance.

中文翻译:

以用户为中心的无线云缓存网络的随机设计与分析

本文开发了一种基于随机几何的方法,用于无线云缓存网络的建模、分析和优化,该网络由云内具有协调多点传输和保护区的多天线无线电单元 (RU) 组成。我们考虑泊松集群进程来对 RU 和用户进行建模,以及在 RU 中缓存文件的概率内容放置。因此,我们研究了两种策略对感兴趣用户的准确命中概率;最接近选择,其中用户由具有其请求文件的最近 RU 服务,以及最佳功率选择,其中具有请求文件的服务 RU 在用户处提供最大瞬时接收功率。作为分析的关键步骤,云外干扰的拉普拉斯变换,最近选择中所需的链路距离分布,并推导出最佳功率选择中所需的链路接收功率分布。此外,我们近似推导出最接近和最佳功率选择的精确命中概率,使得网络内容缓存设计的相关目标函数可以导致易于处理的凹优化问题。解决优化问题,我们提出算法来有效地找到他们的最佳内容位置。最后,我们研究了不同参数对缓存性能的影响。我们近似推导出最接近和最佳功率选择的精确命中概率,这样网络内容缓存设计的相关目标函数可以导致易处理的凹优化问题。解决优化问题,我们提出算法来有效地找到他们的最佳内容位置。最后,我们研究了不同参数对缓存性能的影响。我们近似推导出最接近和最佳功率选择的精确命中概率,这样网络内容缓存设计的相关目标函数可以导致易处理的凹优化问题。解决优化问题,我们提出算法来有效地找到他们的最佳内容位置。最后,我们研究了不同参数对缓存性能的影响。
更新日期:2020-07-01
down
wechat
bug