Name
Abstract | ||
|---|---|---|
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 three 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 and a Whittle's Index policy, and show that they are guaranteed to be within a factor of two, four and eight, respectively, away from the minimum AoI possible. In contrast, simulation results show that Max-Weight outperforms the other policies, both in terms of AoI and throughput, in every network configuration simulated, and achieves near optimal performance. |
Year | Venue | Field |
|---|---|---|
2018 | IEEE INFOCOM | Base station,Wireless network,Computer science,Performance metric,Network packet,Computer network,Network configuration,Throughput,Transmission scheduling,Information Age |
DocType | ISSN | Citations |
Conference | 0743-166X | 9 |
PageRank | References | Authors |
0.58 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Kadota | 1 | 85 | 6.61 |
| Abhishek Sinha | 2 | 90 | 9.94 |
| Eytan Modiano | 3 | 3714 | 314.44 |