|
Dynamic power control for time-critical networking with heterogeneous traffic
|
Authors: Emmanouil Fountoulakis, Nikolaos Pappas, Anthony Ephremides
Status: Final
Date of publication: 15 March 2021
Published in: ITU Journal on Future and Evolving Technologies, Volume 2 (2021), Issue 1, Pages 1-12
Article DOI : https://doi.org/10.52953/SAGV1643
|
 | Abstract:
Future wireless networks will be characterized by heterogeneous traffic requirements. Examples can be low-latency or minimum-througput requirements. Therefore, the network has to adjust to different needs. Usually, users with low-latency requirements have to deliver their demand within a specific time frame, i.e., before a deadline, and they coexist with throughput oriented users. In addition, mobile devices have a limited-power budget and therefore, a power-efficient scheduling scheme is required by the network. In this work, we cast a stochastic network optimization problem for minimizing the packet drop rate while guaranteeing a minimum throughput and taking into account the limited-power capabilities of the users. We apply tools from Lyapunov optimization theory in order to provide an algorithm, named Dynamic Power Control (DPC) algorithm, that solves the formulated problem in real time. It is proved that the DPC algorithm gives a solution arbitrarily close to the optimal one. Simulation results show that our algorithm outperforms the baseline Largest-Debt-First (LDF) algorithm for short deadlines and multiple users. |
|
Keywords: Deadline-constrained traffic, dynamic algorithms, heterogeneous traffic, Lyapunov optimization, power-efficient algorithms, scheduling
Rights: © International Telecommunication Union, available under the CC BY-NC-ND 3.0 IGO license.
|
|
| Detalle del artículo | Artículo | Precio | |
|---|
| 0
| Gratuito | Descargar |
|
|
| |
