Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals

We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable links. We formulate a stochastic optimization problem aiming to minimize the sum average age of information (AAoI) of sources under per-slot transmission capacity constraints and a long-run average resource constraint. To solve the problem, we recast it as a constrained Markov decision process (CMDP) problem and adopt the Lagrangian method. We analyze the structure of an optimal policy for the resulting MDP problem that possesses a switching-type structure. We propose an algorithm that obtains a stationary deterministic near-optimal policy, establishing a benchmark for the system. Simulation results show the effectiveness of our algorithm compared to benchmark algorithms.

[1]  Branka Vucetic,et al.  Optimizing Information Freshness in Two-Hop Status Update Systems Under a Resource Constraint , 2020, IEEE Journal on Selected Areas in Communications.

[2]  Nikolaos Pappas,et al.  Optimizing Information Freshness in Two-Way Relay Networks , 2020, 2020 IEEE/CIC International Conference on Communications in China (ICCC).

[3]  M. Cenk Gursoy,et al.  Age-Energy Tradeoff in Fading Channels with Packet-Based Transmissions , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[4]  Yong Zhou,et al.  Optimizing Information Freshness for Cooperative IoT Systems With Stochastic Arrivals , 2021, IEEE Internet of Things Journal.

[5]  Linn I. Sennott,et al.  Constrained Average Cost Markov Decision Chains , 1993, Probability in the Engineering and Informational Sciences.

[6]  A. Makowski,et al.  Estimation and optimal control for constrained Markov chains , 1986, 1986 25th IEEE Conference on Decision and Control.

[7]  Harpreet S. Dhillon,et al.  On the Role of Age of Information in the Internet of Things , 2018, IEEE Communications Magazine.

[8]  Masoumeh Moradian,et al.  Age Of Information In Scheduled Wireless Relay Networks , 2020, 2020 IEEE Wireless Communications and Networking Conference (WCNC).

[9]  Eytan Modiano,et al.  Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals , 2017, IEEE Transactions on Mobile Computing.

[10]  Marian Codreanu,et al.  AoI Minimization in Status Update Control with Energy Harvesting Sensors , 2020 .

[11]  The Age of Incorrect Information: an Enabler of Semantics-Empowered Communication , 2020, ArXiv.

[12]  Marian Codreanu,et al.  Power Minimization for Age of Information Constrained Dynamic Control in Wireless Sensor Networks , 2020, IEEE Trans. Commun..

[13]  Eitan Altman,et al.  Forever Young: Aging Control For Smartphones In Hybrid Networks , 2010 .

[14]  Marian Codreanu,et al.  On the Age of Information in Multi-Source Queueing Models , 2020, IEEE Transactions on Communications.

[15]  Marian Codreanu,et al.  On the Age of Information in Status Update Systems With Packet Management , 2015, IEEE Transactions on Information Theory.

[16]  Ness B. Shroff,et al.  Age-optimal information updates in multihop networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[17]  L. Sennott.  Stochastic Dynamic Programming and the Control of Queueing Systems , 1998 .

[18]  F. Beutler,et al.  Optimal policies for controlled markov chains with a constraint , 1985 .

[19]  Sennur Ulukus,et al.  Timely Updates in Energy Harvesting Two-Hop Networks: Offline and Online Policies , 2018, IEEE Transactions on Wireless Communications.

[20]  E. Altman.  Constrained Markov Decision Processes , 1999 .

[21]  Zhou Su,et al.  Wireless Networks , 2020, Computernetze und Internet of Things.

[22]  Wan Choi,et al.  Optimal Scheduling Policy for Minimizing Age of Information with a Relay , 2020, ArXiv.

[23]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.