Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers
Abstract: In a communication setting where multiple sources share a single channel to provide status updates to a remote monitor, source transmissions need to be scheduled appropriately to maintain timely communication between each of the sources and the monitor. We consider age-agnostic scheduling policies which are advantageous due to their simplicity of implementation. Further, we focus on a special class of age-agnostic policies, called cyclic schedulers, where each source is scheduled based on a fixed cyclic pattern. We use weighted average age of information (AoI) to quantify the timeliness of communication. We develop a Markov chain formulation to compute the exact mean AoI for the case of two-source cyclic schedulers. Based on the obtained age expression, we develop an algorithm that generates near-optimal cyclic schedulers to minimize the weighted average AoI for two heterogeneous sources, in the presence of channel errors.
- Age of information: An introduction and survey. IEEE Journal on Selected Areas in Communication, 39(5):1183–1210, May 2021.
- The age of information: Real-time status updating by multiple sources. IEEE Transactions on Information Theory, 65(3):1807–1827, March 2019.
- R. D. Yates. Lazy is timely: Status updates by an energy harvesting source. In IEEE ISIT, June 2015.
- Optimal sampling and scheduling for timely status updates in multi-source networks. IEEE Transactions on Information Theory, 67(6):4019–4034, June 2021.
- Age-optimal updates of multiple information flows. In IEEE Infocom, April 2018.
- Y. Sun and S. Kompella. Age-optimal multi-flow status updating with errors: A sample-path approach. Journal of Communications and Networks, 25(5):570–584, October 2023.
- H. B. Beytur and E. Uysal-Biyikoglu. Minimizing age of information for multiple flows. In IEEE BlackSeaCom, June 2018.
- Scheduling policies for minimizing age of information in broadcast wireless networks. IEEE/ACM Transactions on Networking, 26(6):2637–2650, December 2018.
- On the optimality of the Whittle’s index policy for minimizing the age of information. IEEE Transactions on Wireless Communications, 20(2):1263–1277, February 2021.
- On the optimality of the Whittle’s index policy for minimizing the age of information. IEEE Transactions on Information Theory, 68(1):572–600, January 2022.
- Age of information for periodic status updates under sequence based scheduling. IEEE Transactions on Communications, 71(10):5963–5978, October 2023.
- On scheduling with AoI violation tolerance. In IEEE Infocom, May 2021.
- Eywa: A general approach for scheduler design in AoI optimization. In IEEE Infocom, May 2023.
- Minimizing weighted sum age of information with open-loop cyclic scheduling. Available online at arXiv:2311.18791.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.