Optimizing Age of Information in Wireless Networks with Perfect Channel State Information

March 17, 2018 Β· Declared Dead Β· πŸ› International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rajat Talak, Sertac Karaman, Eytan Modiano arXiv ID 1803.06471 Category cs.IT: Information Theory Cross-listed cs.NI Citations 80 Venue International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks Last Checked 5 months ago
Abstract
Age of information (AoI), defined as the time elapsed since the last received update was generated, is a newly proposed metric to measure the timeliness of information updates in a network. We consider AoI minimization problem for a network with general interference constraints, and time varying channels. We propose two policies, namely, virtual-queue based policy and age-based policy when the channel state is available to the network scheduler at each time step. We prove that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most factor 4 away from optimality. Comparing with our previous work, which derived age optimal policies when channel state information is not available to the scheduler, we demonstrate a 4 fold improvement in age due to the availability of channel state information.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted