Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints

Age of Information (AoI) is a performance metric that captures the freshness of the information from the perspective of the destination. The AoI measures the time that elapsed since the generation of the packet that was most recently delivered to the destination. In this paper, we consider a single-...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 27; číslo 4; s. 1359 - 1372
Hlavní autoři: Kadota, Igor, Sinha, Abhishek, Modiano, Eytan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Age of information
Algorithms
Computer simulation
Drift
Freshness
Information age
Monitoring
Nodes
Optimization
Policies
quality of service
Radio equipment
Scheduling
Sensors
Throughput
Weight
Wireless communication
Wireless networks
Wireless sensor networks
ISSN:1063-6692, 1558-2566
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í:Age of Information (AoI) is a performance metric that captures the freshness of the information from the perspective of the destination. The AoI measures the time that elapsed since the generation of the packet that was most recently delivered to the destination. In this paper, we consider a single-hop wireless network with a number of nodes transmitting time-sensitive information to a base station and address the problem of minimizing the expected weighted sum AoI of the network while simultaneously satisfying timely-throughput constraints from the nodes. We develop four low-complexity transmission scheduling policies that attempt to minimize AoI subject to minimum throughput requirements and evaluate their performance against the optimal policy. In particular, we develop a randomized policy, a Max-Weight policy, a Drift-Plus-Penalty policy, and a Whittle's Index policy, and show that they are guaranteed to be within a factor of two, four, two, and eight, respectively, away from the minimum AoI possible. The simulation results show that Max-Weight and Drift-Plus-Penalty outperform the other policies, both in terms of AoI and throughput, in every network configuration simulated, and achieve near-optimal performance.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2019.2918736