KOR

e-Article

Dynamic Scheduling for Minimizing Age Penalty in Resource-Constrained Classified WBANs With Energy Harvesting
Document Type
Periodical
Source
IEEE Sensors Journal IEEE Sensors J. Sensors Journal, IEEE. 23(19):23638-23652 Oct, 2023
Subject
Signal Processing and Analysis
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Robotics and Control Systems
Sensors
Dynamic scheduling
Resource management
Heuristic algorithms
Sensor systems
RF signals
Protocols
Age of information (AoI)
dynamic scheduling
energy harvesting (EH)
Lyapunov optimization
wireless body area networks (WBANs)
Language
ISSN
1530-437X
1558-1748
2379-9153
Abstract
With the increasing demand for real-time health monitoring applications, the timeliness and accuracy of sampling information in wireless body area networks (WBANs) are the focus of current research. In this article, we apply a general age penalty function, developed from the age of information (AoI), to express the level of dissatisfaction with data staleness in classified WBANs with bidirectional energy and information transmission system. The sensors in classified WBANs are grouped according to the type of sampled information and send the updated information to the access point (AP) by time division multiple access (TDMA). To minimize the weighted sum age penalty function of the system, we construct an optimization problem subject to the average AoI and transmit power constraints for each sensor. To solve this optimization problem with the nonconvex structure, we apply the Lyapunov optimization theory to transform the original problem into solving the stability of the system and propose a dynamic scheduling algorithm based on the drift-plus-penalty function (DS-DPP). For acquiring the optimal solution, we first obtain the transmission probability of the sensor based on the set throughput threshold and develop a multivariable joint optimization algorithm to maximize the transmission probability. Then, based on the maximum transmission probability obtained, a node selection algorithm is proposed. The simulation results show that under the same conditions, the DS-DPP algorithm reduces the age penalty function of the system by about 61.5% and 8.9%, respectively, compared with the random scheduling and the fair scheduling algorithms.