Title
Timely updates over an erasure channel
Abstract
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which the transmission of a k-symbol update continues until k symbols are received. This system is then compared to a fixed redundancy (FR) system in which each update is transmitted as an n symbol packet and the packet is successfully received if and only if at least k symbols are received. If fewer than k symbols are received, the update is discarded. Unlike the IIR system, the FR system requires no feedback from the receiver. For a single monitor system, we show that tuning the redundancy to the symbol erasure rate enables the FR system to perform as well as the IIR system. As the number of monitors is increased, the FR system outperforms the IIR system that guarantees delivery of all updates to all monitors.
Year
DOI
Venue
2017
10.1109/ISIT.2017.8006541
2017 IEEE International Symposium on Information Theory (ISIT)
Keywords
DocType
Volume
binary erasure channel,age-of-information metric,AoI metric,coded update transmission,average status update age,infinite incremental redundancy system,IIR system,k-symbol update,symbol packet,fixed redundancy system,FR system,symbol erasure rate
Conference
abs/1704.04155
ISBN
Citations 
PageRank 
978-1-5090-4097-1
22
0.87
References 
Authors
6
4
Name
Order
Citations
PageRank
Roy D. Yates11889266.12
Elie Najm229937.92
Emina Soljanin370861.35
Jing Zhong4476.21