Makale detayı · 2018
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
Dergi
IEEE/ACM Transactions on Networking- Yıl
- 2018
- Tür
- article
Veri kaynağı ayrımı
- YÖKSİS dergi adı IEEE/ACM Transactions on Networking
- OpenAlex OpenAlex zenginleştirmesi (özet, atıf, konular)
Özet
OpenAlex · İngilizce
In this paper, we consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. We first show that in symmetric networks, a greedy policy, which transmits the packet for the client with the highest current age, is optimal. For general networks, we develop three low-complexity scheduling policies: a randomized policy, a Max-Weight policy and a Whittle's Index policy, and derive performance guarantees as a function of the network configuration. To the best of our knowledge, this is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels. Numerical results show that both the Max-Weight and Whittle's Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.
Konular
Atıflar
OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.
645 atıf
OpenAlex cited_by_count (önbellek / veritabanı)
Yerel katalogda bu makaleye atıf yapan 35 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).
- Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees 2019
- Age Minimization of Multiple Flows using Reinforcement Learning 2019
- Pull or Wait: How to Optimize Query Age of Information 2023
- Minimizing Age of Information for Multiple Flows 2018
- Goal-Oriented Communications for Remote Inference Under Two-Way Delay with Memory 2024
- Optimization of AoII and QAoII in Multi-User Links 2023
- Is proportional fair scheduling suitable for age-sensitive traffic? 2023
- Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems 2024
- Age of Information in Practice 2023
- Exact Analytical Model of Age of Information in Multi-Source Status Update Systems With Per-Source Queueing 2022