Minimum Length Scheduling for Multi-cell Full Duplex Wireless Powered Communication Networks

TL;DR

This paper develops optimal and heuristic algorithms for minimizing schedule length in multi-cell full duplex wireless powered networks, considering power control, concurrent transmission, and rate models, with extensive simulation validation.

Contribution

It introduces polynomial time optimal power control algorithms and heuristic scheduling methods for constant and continuous rate models in complex wireless networks.

Findings

Proposed algorithms outperform random scheduling methods.

Optimal power control solutions are derived using Perron-Frobenius and bisection methods.

Heuristic algorithms effectively maximize concurrent transmissions and minimize schedule length.

Abstract

In this paper, we investigate a novel minimum length scheduling problem to determine the optimal power control, and scheduling for constant and continuous rate models, while considering concurrent transmission of users, energy causality, maximum transmit power and traffic demand constraints. The formulated optimization problems are shown to be non-convex and combinatorial in nature, thus, difficult to solve for the global optimum. As a solution strategy, first, we propose optimal polynomial time algorithms for the power control problem considering constant and continuous rate models based on the evaluation of Perron-Frobenius conditions and usage of bisection method, respectively. Then, the proposed optimal power control solutions are used to determine the optimal transmission time for a subset of users that will be scheduled by the scheduling algorithms. For the constant rate 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. For the continuous rate scheduling problem, we define a penalty function representing the advantage of concurrent transmission over individual transmission of the users. Following the optimality analysis of the penalty metric and demonstration of the equivalence between schedule length minimization and minimization of the sum of penalties, we propose a heuristic algorithm based on the allocation of the concurrently transmitting users with the goal of minimizing the sum penalties over the schedule. Through extensive simulations, we demonstrate that the proposed algorithm outperforms the successive transmission and concurrent transmission of randomly selected users for different HAP transmit powers, network densities and network size.