Lune

INFOCOM2021Top-tier venue

Aion: A Bandwidth Optimized Scheduler with AoI Guarantee

Qingyu Liu, Chengzhang Li, Y. Thomas Hou, Wenjing Lou, Sastry Kompella

Abstract

This paper investigates bandwidth minimization under AoI constraints - a fundamental problem that has not been studied in AoI research. The problem is of critical importance in bandwidth-limited IoT environment when AoI is used as a constraint. We present a novel fast algorithm called Aion that can construct a scheduler to satisfy AoI constraints with strong theoretical guarantee in terms of minimizing required bandwidth. Specifically, we prove that the bandwidth required by Aion is minimum if the AoI constraint vector meets a special mathematical structure called Fractional Consecutively Divisible (FCD). In the general case when the given AoI constraint vector is not FCD, we prove that the bandwidth required by Aion is tightly upper bounded by a factor of the minimum. The results from this paper lay the foundation for future research on bandwidth minimization with AoI guarantee.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

2 top-tier papers have cited it since. Know what they found before your reviewers do.

Questions to start from

Lune can draw on

the full paper · the top-tier papers that cite it · related work

Get the answer

Free to start. No credit card required.

Lineage

  • On Multi-Armed Bandit with Impatient Arms cites Eywa: A General Approach for Scheduler Design in AoI Optimization
  • Eywa: A General Approach for Scheduler Design in AoI Optimization cites AoI Scheduling with Maximum Thresholds
Builds onCited byLeft to right by year; the more cited, the higher.

Cited by top-tier papers2

  1. Eywa: A General Approach for Scheduler Design in AoI OptimizationChengzhang Li, Shaoran Li, Qingyu Liu, Y. Thomas Hou et al.INFOCOM 2023 · 14 citations
  2. On Multi-Armed Bandit with Impatient ArmsYuming Shao, Zhixuan FangICML 2024 · 1 citation

Builds on1

  1. AoI Scheduling with Maximum ThresholdsChengzhang Li, Shaoran Li, Yongce Chen, Y. Thomas Hou et al.INFOCOM 2020 · 48 citations

Related papers

  1. Ao2I: Minimizing Age of Outdated Information to Improve Freshness in Data CollectionQingyu Liu, Chengzhang Li, Y. Thomas Hou, Wenjing Lou et al.INFOCOM 2022 · 32 citations
  2. Age-Based Scheduling for Monitoring and Control Applications in Mobile Edge Computing SystemsXingqiu He, Sheng Wang, Xiong Wang, Shizhong Xu et al.INFOCOM 2022 · 39 citations
  3. Joint Near-Optimal Age-based Data Transmission and Energy Replenishment Scheduling at Wireless-Powered Network EdgeQuan Chen, Zhipeng Cai, Lianglun Cheng, Feng Wang et al.INFOCOM 2022 · 24 citations
  4. On the Minimum Achievable Age of Information for General Service-Time DistributionsJaya Prakash Champati, Ramana Reddy Avula, Tobias J. Oechtering, James GrossINFOCOM 2020 · 16 citations
  5. Minimizing the Number of Deployed UAVs for Delay-bounded Data Collection of IoT DevicesJunqi Zhang, Zheng Li, Wenzheng Xu, Jian Peng et al.INFOCOM 2021 · 47 citations
Dusk over the sea between two cliffs drawn in fine vertical lines