A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimal Age over Erasure Channels
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. ...
In this paper, given a source that produces a letter every T_s seconds and an erasure channel that can be used every T_c seconds, we ask what is the coding strategy that minimizes the time-average age ...
The set R = {( , D); D ≥ ∆ and ∈ [0, 1]} forms the set of achievable average ages over all erasure channels.
III. ...
arXiv:1901.01573v7
fatcat:iinvnp24fbbcjk5ehlrkzed7su
On the Age of Information in Erasure Channels with Feedback
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
By utilizing the age of information (AoI) metric, the freshness of status update over an erasure channel is investigated. ...
In this paper, we find the optimal failure tolerance when the erasure probability (ϵ) is in the regime ϵ→ 0 and also provide a lower and an upper bound for the average AoI for all erasure probabilities ...
Now, we optimize over l. ...
arXiv:1911.05840v1
fatcat:noyw2ke7qzadbkxcblxnbqm2xu
Online Timely Status Updates with Erasures for Energy Harvesting Sensors
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An energy harvesting sensor that is sending status updates to a destination through an erasure channel is considered, in which transmissions are prone to being erased with some probability q, independently ...
The setting is online, in which energy arrival times are only revealed causally after being harvested, and the goal is to design transmission times such that the long term average age of information (AoI ...
CONCLUSION The long term average age-minimal online policy has been derived for an energy harvesting sensor with unit-sized battery, communicating with a destination over an erasure channel, without erasure ...
arXiv:1811.04912v1
fatcat:zbrbaifi7ncstkvthl5goxp4eq
Timely Status Updating Over Erasure Channels Using an Energy Harvesting Sensor: Single and Multiple Sources
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A status updating system is considered in which data from multiple sources are sampled by an energy harvesting sensor and transmitted to a remote destination through an erasure channel. ...
The goal is to deliver status updates of all sources in a timely manner, such that the cumulative long-term average age-of-information (AoI) is minimized. ...
an erasure channel. ...
arXiv:2109.06855v1
fatcat:4xbaojlcpzfozf4uihojreomre
Timely Updates over an Erasure Channel
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/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. ...
However, the FR system does require the redundancy to be carefully optimized in response to the channel erasure rate. ...
arXiv:1704.04155v4
fatcat:wsvhzvkei5b7fdubtbhie7t3fa
Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
channel. ...
The optimal threshold-greedy policy is then analytically derived. ...
The effect of noise on the status updates is considered via modeling the communication channel as an erasure channel: an erasure event occurs independently for each update transmission with some probability ...
arXiv:1901.08577v2
fatcat:udoqk3ef3bgxpjlg7ojv5cs3ku
Age-Optimal Transmission of Rateless Codes in an Erasure Channel
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we examine a status updating system where updates generated by the source are sent to the monitor through an erasure channel. ...
We adopt the metric "Age of Information" (AoI) to measure the freshness of information at the destination, where the AoI is defined as the age of the latest decoded update at the destination. ...
In this paper, we focus on AoI optimization for an erasure channel with rateless codes. ...
arXiv:1904.13048v1
fatcat:cvzedabrvnhzzgb4wo2il6ct2m
On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we derive an exactly optimal scheduling policy for this problem in a downlink cellular system with erasure channels. ...
We also establish that the resulting Age-process is positive recurrent under the optimal policy, and has an exponentially light tail, with the optimal large-deviation exponent. ...
In this paper, we study the problem of optimal joint scheduling of Type-I and Type-II UEs over wireless erasure channels. ...
arXiv:1904.00647v1
fatcat:4fy7nhyas5a2bovx6vesutd2d4
Timely updates over an erasure channel
2017
2017 IEEE International Symposium on Information Theory (ISIT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/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. ...
However, the FR system does require the redundancy to be carefully optimized in response to the channel erasure rate. ...
doi:10.1109/isit.2017.8006541
dblp:conf/isit/YatesNSZ17
fatcat:72al6rb3tjefrnixs2rfjcfnxq
Optimization of the index assignments for multiple description vector quantizers
2003
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the simulations, the index-optimized multiple description vector quantizer achieves significant gains in source SNR over scalar multiple description schemes. ...
The optimization criterion and a practically feasible new algorithm is stated for the optimization of the index assignments of a multiple description unconstrained vector quantizer with an arbitrary number ...
an erasure channel. ...
doi:10.1109/tcomm.2003.809727
fatcat:7s6liootdzcsxg5eryiqbuomri
On Timely Channel Coding with Hybrid ARQ
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The goal is to realize timely delivery of fresh data over time, which is assessed by an age-of-information (AoI) metric. ...
A status updating communication system is examined, in which a transmitter communicates with a receiver over a noisy channel. ...
[15] follows an informationtheoretic approach to analyze age-minimal coding design in erasure channels without feedback, for given update generation and channel usage rates, and source and channel alphabets ...
arXiv:1905.03238v1
fatcat:t3gyjzsoqfbk5p35rlxbm2nqgq
Coded Status Updates in an Energy Harvesting Erasure Channel
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel, where each status update is of length k symbols. ...
In order to combat the effects of the erasures in the channel and the uncertainty in the energy arrivals, we use channel coding to encode the status update symbols. ...
The transmitter collects measurements and sends updates to the receiver over an erasure channel. ...
arXiv:1802.00431v1
fatcat:6hi5s2zu5jadhndosypquixbvq
A Systematic Approach to Incremental Redundancy over Erasure Channels
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Specifically, this work extends a powerful methodology termed sequential differential optimization to choose near-optimal block sizes for hybrid ARQ over erasure channels. ...
As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue ...
SEQUENTIAL DIFFERENTIAL OPTIMIZATION In this section, we apply sequential differential optimization (SDO) to incremental redundancy in the context of random codes over erasure channels [10] . ...
arXiv:1805.03235v1
fatcat:sko7o7wonrb47misixmqmefve4
Erasure List-Decodable Codes from Random and Algebraic Geometry Codes
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
1-R-ϵ of erasures, i.e., a random linear code achieves the information-theoretic optimal trade-off between information rate and fraction of erasure errors. ...
Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. ...
Compared with other communication channels such as adversarial noise channel, erasure channel is much simpler. ...
arXiv:1401.2716v1
fatcat:nsposwsm4rfqdofuurbmmx4m3i
Interactive Coding Resilient to an Unknown Number of Erasures
2020
International Conference on Principles of Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider distributed computations between two parties carried out over a noisy channel that may erase messages. ...
Namely, in case the channel erases T transmissions, the coding scheme will take N + 2T transmissions using an alphabet of size 4 (alternatively, using 2N + 4T transmissions over a binary channel) to correctly ...
By saying that Π simulates π over an erasure channel with (unbounded) T corruptions, we mean the following. ...
doi:10.4230/lipics.opodis.2019.13
dblp:conf/opodis/GellesI19
fatcat:fxrhlthmz5awhj6xbdvbzglxum
« Previous
Showing results 1 — 15 out of 3,449 results