Aion: A Bandwidth Conserving Scheduler With Data Freshness Guarantee

This paper investigates a bandwidth minimization problem with Age of Information (AoI) constraints-a fundamental problem that has not been studied in AoI research. The problem is of critical importance in bandwidth-limited IoT environment while, at the same time, there is an expectation of AoI requi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on mobile computing Ročník 23; číslo 1; s. 1 - 15
Hlavní autoři: Liu, Qingyu, Li, Chengzhang, Hou, Y. Thomas, Lou, Wenjing, Reed, Jeffrey H., Kompella, Sastry
Médium: Magazine Article
Jazyk:angličtina
Vydáno: Los Alamitos IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1536-1233, 1558-0660
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper investigates a bandwidth minimization problem with Age of Information (AoI) constraints-a fundamental problem that has not been studied in AoI research. The problem is of critical importance in bandwidth-limited IoT environment while, at the same time, there is an expectation of AoI requirement on the application side. We present a novel polynomial-time 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 show that the bandwidth required by Aion is tightly upper bounded by a factor of the minimum. We validate the performance of Aion through a large number of simulations and all results confirm our theoretical findings. The results from this paper lay a foundation for future research on bandwidth minimization with AoI guarantee.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1536-1233
1558-0660
DOI:10.1109/TMC.2022.3215934