Fair and Efficient Scheduling for Sensor Networks via Online Whittle Index Policy
Sokipriala Jonah, Seong Ki Yoo, Saurav Sthapit, Anita Khadka

TL;DR
This paper introduces an online learning-based scheduling policy for sensor networks that reduces energy consumption by prioritizing informative updates using the AoII metric, without prior knowledge of process dynamics.
Contribution
It proposes the WAoII and FWAoII policies that adaptively schedule sensor node polling based on AoII, addressing unknown process dynamics in WUR sensor networks.
Findings
Reduces packet transmissions by up to 70% compared to round robin.
Maintains acceptable RMSE levels for remote monitoring.
Demonstrates effectiveness on real-world and synthetic datasets.
Abstract
Wake-Up Radio (WUR) enables resource-constrained, battery-powered sensor nodes to remain in a low-power deep sleep state while continuously listening for a Wake-Up Signal (WUS). Sensor nodes only wake and transmit data after receiving the WUS, significantly reducing energy consumption. However, polling nodes whose transmitted data provides little or no meaningful update to the remote monitor can still result in unnecessary energy usage and increased storage overhead. To address this issue, this paper uses the Age of Incorrect Information (AoII) metric to prioritise the polling of nodes that provide informative updates to the remote monitor. Determining the optimal set of nodes to poll based on AoII can be formulated as a Restless Multi-Armed Bandit (RMAB) problem, which traditionally requires prior knowledge of the monitored process transition dynamics. Since such dynamics are often…
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.
