Department of Electrical Engineering, National University of Technology, Islamabad 44000, Pakistan.
Department of Electrical and Electronics Engineering, Kadir Has University, Istanbul 34083, Turkey.
Sensors (Basel). 2021 Oct 2;21(19):6599. doi: 10.3390/s21196599.
Wireless powered communication networks (WPCNs) will be a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. These MTC networks will be deployed by using low-power transceivers and a very limited set of transmission configurations. We investigate a novel minimum length scheduling problem for multi-cell full-duplex wireless powered communication networks to determine the optimal power control and scheduling for constant rate transmission model. The formulated optimization problem is combinatorial in nature and, thus, difficult to solve for the global optimum. As a solution strategy, first, we decompose the problem into the power control problem (PCP) and scheduling problem. For the PCP, we propose the optimal polynomial time algorithm based on the evaluation of Perron-Frobenius conditions. For the scheduling problem, we propose a heuristic algorithm that aims to maximize the number of concurrently transmitting users by maximizing the allowable interference on each user without violating the signal-to-noise-ratio (SNR) requirements. Through extensive simulations, we demonstrate a 50% reduction in the schedule length by using the proposed algorithm in comparison to unscheduled concurrent transmissions.
无线供电通信网络（WPCN）将成为大规模机器类型通信（MTC）的主要推动者，这是 5G 及以后系统的主要服务领域。这些 MTC 网络将使用低功率收发器和非常有限的传输配置进行部署。我们研究了一种用于多小区全双工无线供电通信网络的新的最短长度调度问题，以确定恒速率传输模型的最佳功率控制和调度。所提出的优化问题本质上是组合的，因此难以找到全局最优解。作为一种解决方案策略，首先，我们将问题分解为功率控制问题（PCP）和调度问题。对于 PCP，我们提出了一种基于佩尔-弗罗贝尼乌斯条件评估的最优多项式时间算法。对于调度问题，我们提出了一种启发式算法，旨在通过在不违反信噪比（SNR）要求的情况下最大化每个用户的允许干扰，最大化同时传输用户的数量。通过广泛的仿真，我们证明与未调度的并发传输相比，使用所提出的算法可以将调度长度减少 50%。
