University of Oulu

M. Moltafet, M. Leinonen, M. Codreanu and N. Pappas, "Power Minimization for Age of Information Constrained Dynamic Control in Wireless Sensor Networks," in IEEE Transactions on Communications, vol. 70, no. 1, pp. 419-432, Jan. 2022, doi: 10.1109/TCOMM.2021.3124949.

Power minimization for age of information constrained dynamic control in wireless sensor networks

Saved in:
Author: Moltafet, Mohammad1; Leinonen, Markus1; Codreanu, Marian2;
Organizations: 1Centre for Wireless Communications–Radio Technologies, University of Oulu, 90014 Oulu, Finland
2Department of Science and Technology, Linköping University, Sweden
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 3.7 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2021121060075
Language: English
Published: Institute of Electrical and Electronics Engineers, 2021
Publish Date: 2021-12-10
Description:

Abstract

We consider a status update system where multiple sensors communicate timely information about various random processes to a sink. The sensors share orthogonal sub-channels to transmit such information in the form of status update packets. A central controller can control the sampling actions of the sensors to trade-off between the transmit power consumption and information freshness which is quantified by the Age of Information (AoI). We jointly optimize the sampling action of each sensor, the transmit power allocation, and the sub-channel assignment to minimize the average total transmit power of all sensors, subject to a maximum average AoI constraint for each sensor. To solve the problem, we develop a dynamic control algorithm using the Lyapunov drift-plus-penalty method and provide optimality analysis of the algorithm. According to the Lyapunov drift-plus-penalty method, to solve the main problem, we need to solve an optimization problem in each time slot which is a mixed integer non-convex optimization problem. We propose a low-complexity sub-optimal solution for this per-slot optimization problem that provides near-optimal performance and we evaluate the computational complexity of the solution. Numerical results illustrate the performance of the proposed dynamic control algorithm and the performance of the sub-optimal solution for the per-slot optimization problem versus the different parameters of the system. The results show that the proposed dynamic control algorithm achieves more than 60% saving in the average total transmit power compared to a baseline policy.

see all

Series: IEEE transactions on communications
ISSN: 0090-6778
ISSN-E: 1558-0857
ISSN-L: 0090-6778
Volume: 70
Issue: 1
Pages: 419 - 432
DOI: 10.1109/TCOMM.2021.3124949
OADOI: https://oadoi.org/10.1109/TCOMM.2021.3124949
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: This research has been financially supported in part by Infotech Oulu, the Academy of Finland (grant 323698), and Academy of Finland 6Genesis Flagship (grant 318927). The work of M. Leinonen has also been financially supported in part by the Academy of Finland (grant 319485). M. Codreanu would like to acknowledge the support of the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 793402 (COMPRESS NETS). The work of N. Pappas was supported in part by the Swedish Research Council (VR), ELLIIT, and CENIIT.
Academy of Finland Grant Number: 323698
318927
319485
Detailed Information: 323698 (Academy of Finland Funding decision)
318927 (Academy of Finland Funding decision)
319485 (Academy of Finland Funding decision)
Copyright information: © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.