Version Age-Optimal Cached Status Updates in a Gossiping Network with Energy Harvesting Sensor

November 03, 2023 Β· 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 Erfan Delfani, Nikolaos Pappas arXiv ID 2311.01909 Category cs.IT: Information Theory Cross-listed cs.NI Citations 32 Venue International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks Last Checked 6 months ago
Abstract
In this work, we consider a real-time IoT monitoring system in which an energy harvesting sensor with a finite-size battery measures a physical process and transmits the status updates to an aggregator. The aggregator, equipped with caching capabilities, can serve the external requests of a destination network with either a stored update or a fresh update from the sensor. We assume the destination network acts as a gossiping network in which the update packets are forwarded among the nodes in a randomized setting. We utilize the Markov Decision Process framework to model and optimize the network's average Version Age of Information (AoI) and obtain the optimal policy at the aggregator. The structure of the optimal policy is analytically demonstrated and numerically verified. Numerical results highlight the effect of the system parameters on the average Version AoI. The simulations reveal the superior performance of the optimal policy compared to a set of baseline 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 β€” Information Theory

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