2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | N.8.3 | ||
| Paper Title | Partial Updates: Losing Information for Freshness | ||
| Authors | Melih Bastopcu, Sennur Ulukus, University of Maryland, United States | ||
| Session | N.8: Timely Updates | ||
| Presentation | Lecture | ||
| Track | Networking and Network Coding | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | We consider an information updating system where a source produces updates as requested by a transmitter. The transmitter further processes these updates in order to generate \emph{partial updates}, which have smaller information compared to the original updates, to be sent to a receiver. We study the problem of generating partial updates, and finding their corresponding real-valued codeword lengths, in order to minimize the average age experienced by the receiver, while maintaining a desired level of mutual information between the original and partial updates. This problem is NP hard. We relax the problem and develop an alternating minimization based iterative algorithm that generates a pmf for the partial updates, and the corresponding age-optimal real-valued codeword length for each update. We observe that there is a tradeoff between the attained average age and the mutual information between the original and partial updates. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
