Abstract

There is a surge of need for fresh information with the overwhelming proliferation of the Internet of Things (IoT) applications. To characterize the information freshness perceived by the destination, age of information (AoI) has been proposed. In this paper, we consider an IoT system with multiple IoT devices sending time-sensitive information to a central controller through time-correlated Markov channels. Our goal is to design a user scheduling policy that minimizes the time-average of AoI under a scheduling constraint. We formulate the AoI minimization problem by the restless multi-armed bandit. With Lagrangian relaxation, we establish the indexability and obtain Whittle's index in closed-form. A scheduling policy is further proposed based on the Whittle's index. Simulation results show that the proposed scheduling policy can achieve comparable performance with the optimal policy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.