Optimal Status Updating for an Energy Harvesting Sensor with a Noisy Channel

March 05, 2018 Β· Declared Dead Β· πŸ› Conference on Computer Communications Workshops

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Songtao Feng, Jing Yang arXiv ID 1803.01462 Category cs.NI: Networking & Internet Cross-listed cs.IT Citations 58 Venue Conference on Computer Communications Workshops Last Checked 5 months ago
Abstract
Consider an energy harvesting sensor continuously monitors a system and sends time-stamped status update to a destination. The destination keeps track of the system status through the received updates. Under the energy causality constraint at the sensor, our objective is to design an optimal online status updating policy to minimize the long-term average Age of Information (AoI) at the destination. We focus on the scenario where the the channel between the source and the destination is noisy, and each transmitted update may fail independently with a constant probability. We assume there is no channel state information or transmission feedback available to the sensor. We prove that within a broadly defined class of online policies, the best-effort uniform updating policy, which was shown to be optimal when the channel is perfect, is still optimal in the presence of update failures. Our proof relies on tools from Martingale processes, and the construction of a sequence of virtual policies.
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 β€” Networking & Internet

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