İçeriğe geç
akaturk Akademik ölçüm

Makale detayı · 2016

Minimizing the Age of Information in broadcast wireless networks

OpenAlex Atıf 250 Üst %1 Yüzdelik 99.9% FWCI 25.5
Yıl
2016
Tür
conference-paper

Veri kaynağı ayrımı

  • OpenAlex OpenAlex zenginleştirmesi (özet, atıf, konular)

Özet

OpenAlex · İngilizce

We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients. 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 scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. To the best of our knowledge, this is the first work to provide a scheduling policy that optimizes AoI in a wireless network with unreliable channels. The results are twofold: first, we show that a Greedy Policy, which transmits the packet with highest current age, is optimal for the case of symmetric networks. Then, for the general network case, we establish that the problem is indexable and obtain the Whittle Index in closed-form. Numerical results are presented to demonstrate the performance of the policies.

Konular

Atıflar

OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.

250 atıf

OpenAlex cited_by_count (önbellek / veritabanı)

Yazarlar

Yazar bilgisi yok.