Coded Status Updates in an Energy Harvesting Erasure Channel

02/01/2018
by   Abdulrahman Baknina, et al.
0

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. The energy arrivals and the channel erasures are independent and identically distributed (i.i.d.) and Bernoulli distributed in each slot. 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. We consider two types of channel coding: maximum distance separable (MDS) codes and rateless erasure codes. For each of these models, we study two achievable schemes: best-effort and save-and-transmit. In the best-effort scheme, the transmitter starts transmission right away, and sends a symbol if it has energy. In the save-and-transmit scheme, the transmitter remains silent in the beginning in order to save some energy to minimize energy outages in future slots. We analyze the average age of information (AoI) under each of these policies. We show through numerical results that as the average recharge rate decreases, MDS coding with save-and-transmit outperforms all best-effort schemes. We show that rateless coding with save-and-transmit outperforms all the other schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2018

Sending Information Through Status Updates

We consider an energy harvesting transmitter sending status updates rega...
research
10/12/2018

Optimal Source Codes for Timely Updates

A transmitter observing a sequence of independent and identically distri...
research
05/01/2019

Adaptive Coding for Information Freshness in a Two-user Broadcast Erasure Channel

In this paper, we investigate the impact of coding on the Age of Informa...
research
02/23/2022

State Amplification and Masking While Timely Updating

In status update systems, multiple features carried by the status updati...
research
12/31/2020

Achievable Rates for Binary Two-hop Channel with Energy Harvesting Relay With Finite Battery

We study the problem of joint information and energy transfer in a binar...
research
05/08/2018

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit

An additive white Gaussian noise (AWGN) energy-harvesting (EH) channel i...
research
12/22/2022

Coding Gain for Age of Information in a Multi-source System with Erasure Channel

In our work, we study the age of information () in a multi-source system...

Please sign up or login with your details

Forgot password? Click here to reset