Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?

March 22, 2018 Β· Declared Dead Β· πŸ› International Test Conference

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zhiyuan Jiang, Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu arXiv ID 1803.08189 Category cs.IT: Information Theory Cross-listed cs.NI Citations 89 Venue International Test Conference Last Checked 4 months ago
Abstract
In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexability thereof. Compared with existing work, we extend the index policy for AoI optimization to incorporate stochastic packet arrivals and optimal packet management (buffering the latest packet). Inspired by the index policy which has near-optimal performance but is centralized by nature, a decentralized status update scheme, i.e., the index-prioritized random access policy (IPRA), is further proposed, achieving universally near-optimal AoI performance and outperforming state-of-the-arts in the literature.
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