dc.contributor.author | Kadota, Igor | |
dc.contributor.author | Modiano, Eytan H | |
dc.date.accessioned | 2020-07-22T13:42:00Z | |
dc.date.available | 2020-07-22T13:42:00Z | |
dc.date.issued | 2019-08 | |
dc.identifier.issn | 1063-6692 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/126302 | |
dc.description.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 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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant AST-1547331) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant CNS-1713725) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant CNS-1701964) | en_US |
dc.description.sponsorship | United States. Army Research Office (Grant W911NF-17-1-0508) | en_US |
dc.language.iso | en | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.relation.isversionof | 10.1109/TNET.2019.2918736 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Kadota, Igor, Abhishek Sinha and Eytan Modiano. “Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints.” IEEE/ACM Transactions on Networking, vol. 27, no. 4 © 2019 The Author(s) | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.relation.journal | IEEE/ACM Transactions on Networking | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2019-10-30T16:40:27Z | |
dspace.date.submission | 2019-10-30T16:40:31Z | |
mit.journal.volume | 27 | en_US |
mit.journal.issue | 4 | en_US |
mit.metadata.status | Complete | |