4.7 Article

Power Minimization for Age of Information Constrained Dynamic Control in Wireless Sensor Networks

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 70, Issue 1, Pages 419-432

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2021.3124949

Keywords

Age of information (AoI); Lyapunov optimization; power minimization; stochastic optimization; wireless sensor networks (WSNs)

Funding

  1. Infotech Oulu
  2. Academy of Finland [323698, 318927, 319485]
  3. European Union [793402]
  4. Swedish Research Council (VR)
  5. ELLIIT
  6. CENIIT
  7. Marie Curie Actions (MSCA) [793402] Funding Source: Marie Curie Actions (MSCA)

Ask authors/readers for more resources

This article presents a status update system where multiple sensors transmit information about random processes to a sink. By optimizing the sampling action, transmit power allocation, and sub-channel assignment, the trade-off between power consumption and information freshness is achieved. A dynamic control algorithm and a sub-optimal solution are proposed and their performance is evaluated through numerical results.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available