A Practical AoI Scheduler in IoT Networks with Relays
Biplav Choudhury, Prasenjit Karmakar, Vijay K. Shah, Jeffrey H. Reed

TL;DR
This paper introduces a scalable, adaptive AoI scheduling algorithm for two-hop IoT networks with relays, leveraging a novel voting mechanism based PPO that outperforms existing methods in dynamic conditions.
Contribution
It proposes a practical, scalable AoI scheduler using v-PPO with a voting mechanism, addressing limitations of existing DRL approaches in large, dynamic IoT networks.
Findings
v-PPO scheduler outperforms traditional and ML-based schedulers
Maintains linear action space for scalability
Adapts effectively to changing network conditions
Abstract
Internet of Things (IoT) networks have become ubiquitous as autonomous computing, communication and collaboration among devices become popular for accomplishing various tasks. The use of relays in IoT networks further makes it convenient to deploy IoT networks as relays provide a host of benefits, like increasing the communication range and minimizing power consumption. Existing literature on traditional AoI schedulers for such two-hop relayed IoT networks are limited because they are designed assuming constant/non-changing channel conditions and known (usually, generate-at-will) packet generation patterns. Deep reinforcement learning (DRL) algorithms have been investigated for AoI scheduling in two-hop IoT networks with relays, however, they are only applicable for small-scale IoT networks due to exponential rise in action space as the networks become large. These limitations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT Networks and Protocols · IoT and Edge/Fog Computing · Advanced MIMO Systems Optimization
