论文标题

基于PD-Noma的Hetnets中的联合无线电资源分配和合作缓存

Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets

论文作者

Moghimi, Maryam, Zakeri, Abolfazl, Javan, Mohammad Reza, Mokari, Nader, Ng, Derrick Wing Kwan

论文摘要

在本文中,我们提出了一种新型的联合资源分配和合作缓存方案,用于电源域非正交多访问(PD-NOMA)基于基于的异质网络(HETNETS)。在我们的方案中,如果将所请求的内容从边缘填充在基本站(BSS)之一的存储中,则直接从边缘获取,否则可以通过回程进行提取。我们的方案由两个阶段组成:1。缓存阶段,其中内容保存在BSS的存储中,以及2。交付阶段,其中所请求的内容交付给用户。我们对无线电资源和内容放置变量提出了一个新的优化问题。我们旨在最大程度地减少受服务质量(QoS),缓存,子载波分配和电力分配约束的基础的网络成本。通过利用高级优化方法,例如替代搜索方法(ASM),匈牙利算法,连续的凸近似(SCA),我们获得了优化问题的有效的亚最佳解决方案。数值结果表明,与最受欢迎的缓存和随机的缓存政策相比,我们通过拟议的资源管理算法通过拟议的资源管理算法平均成本大大降低了我们的千古缓存政策。此外,我们合作的NOMA计划在总体上的成本上,其合作成本的增长量提高了。

In this paper, we propose a novel joint resource allocation and cooperative caching scheme for power-domain non-orthogonal multiple access (PD-NOMA)-based heterogeneous networks (HetNets). In our scheme, the requested content is fetched directly from the edge if it is cached in the storage of one of the base stations (BSs), and otherwise is fetched via the backhaul. Our scheme consists of two phases: 1. Caching phase where the contents are saved in the storage of the BSs, and 2. Delivery phase where the requested contents are delivered to users. We formulate a novel optimization problem over radio resources and content placement variables. We aim to minimize the network cost subject to quality-of-service (QoS), caching, subcarrier assignment, and power allocation constraints. By exploiting advanced optimization methods, such as alternative search method (ASM), Hungarian algorithm, successive convex approximation (SCA), we obtain an efficient sub-optimal solution of the optimization problem. Numerical results illustrate that our ergodic caching policy via the proposed resource management algorithm can achieve a considerable reduction on the total cost on average compared to the most popular caching and random caching policy. Moreover, our cooperative NOMA scheme outperforms orthogonal multiple access (OMA) in terms of the delivery cost in general with an acceptable complexity increase.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源