Minimizing Age of Information with Soft Updates

December 19, 2018 Β· Declared Dead Β· πŸ› Journal of Communications and Networks

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Melih Bastopcu, Sennur Ulukus arXiv ID 1812.08148 Category cs.IT: Information Theory Cross-listed cs.NI, cs.SI, eess.SP, math.OC Citations 35 Venue Journal of Communications and Networks Last Checked 6 months ago
Abstract
We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but $instantaneously$ in both cases, here updates start taking effect right away but $gradually$ over time. We coin this setting $soft$ $updates$. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of age is proportional to the current age, and in the second model, the rate of decrease of age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and optimum durations of the updates, subject to the constraints on the number of update periods and the total update duration.
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