Show simple item record

dc.contributor.authorKadota, Igor
dc.contributor.authorModiano, Eytan H
dc.date.accessioned2020-07-22T13:42:00Z
dc.date.available2020-07-22T13:42:00Z
dc.date.issued2019-08
dc.identifier.issn1063-6692
dc.identifier.urihttps://hdl.handle.net/1721.1/126302
dc.description.abstractAge 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.sponsorshipNational Science Foundation (U.S.) (Grant AST-1547331)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-1713725)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-1701964)en_US
dc.description.sponsorshipUnited States. Army Research Office (Grant W911NF-17-1-0508)en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/TNET.2019.2918736en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleScheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraintsen_US
dc.typeArticleen_US
dc.identifier.citationKadota, 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.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.relation.journalIEEE/ACM Transactions on Networkingen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2019-10-30T16:40:27Z
dspace.date.submission2019-10-30T16:40:31Z
mit.journal.volume27en_US
mit.journal.issue4en_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record