English
Related papers

Related papers: Coded Status Updates in an Energy Harvesting Erasu…

200 papers

A status updating system is considered in which multiple data sources generate packets to be delivered to a destination through a shared energy harvesting sensor. Only one source's data, when available, can be transmitted by the sensor at a…

Information Theory · Computer Science 2021-09-16 Christopher Daniel , Ahmed Arafa

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…

Information Theory · Computer Science 2007-07-13 Alexandros G. Dimakis , P. Brighten Godfrey , Martin J. Wainwright , Kannan Ramchandran

In this paper, we propose two novel physical layer aware adaptive network coding and coded modulation schemes for time variant channels. The proposed schemes have been applied to different satellite communications scenarios with different…

Information Theory · Computer Science 2017-04-18 Ala Eddine Gharsellaoui , Samah A. M. Ghanem , Daniele Tarchi , Alessandro Vanelli-Coralli

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…

Information Theory · Computer Science 2018-02-21 Michael Heindlmaier , Shirin Saeedi Bidokhti

We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in…

Information Theory · Computer Science 2018-08-07 N. Prakash , Muriel Medard

In this paper, short-term throughput optimal power allocation policies are derived for an energy harvesting transmitter with energy storage losses. In particular, the energy harvesting transmitter is equipped with a battery that loses a…

Information Theory · Computer Science 2015-03-20 Kaya Tutuncuoglu , Aylin Yener

We consider data transmission over a network where each edge is an erasure channel and where the inner nodes transmit a random linear combination of their incoming information. We distinguish two channel models in this setting, the row and…

Information Theory · Computer Science 2017-10-18 Heide Gluesing-Luerssen , Anna-Lena Horlemann-Trautmann

We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a…

Information Theory · Computer Science 2016-11-17 Derek Leong , Tracey Ho

We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…

Information Theory · Computer Science 2009-01-05 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to…

Information Theory · Computer Science 2021-09-29 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Mohammad Reza Aref

We consider a status update system in which the update packets need to be processed to extract the embedded useful information. The source node sends the acquired information to a computation unit (CU) which consists of a master node and…

Information Theory · Computer Science 2019-10-09 Baturalp Buyukates , Sennur Ulukus

This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which…

Information Theory · Computer Science 2018-12-07 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

In this paper, we consider an information update system where a wireless sensor sends timely updates to the destination over an erasure channel with the supply of harvested energy and reliable backup energy. The metric Age of…

Information Theory · Computer Science 2022-07-27 Lixin Wang , Fuzhou Peng , Xiang Chen , Shidong Zhou

This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel…

Information Theory · Computer Science 2009-09-30 Arunkumar Subramanian , Steven W. McLaughlin

We examine lossless data compression from an average delay perspective. An encoder receives input symbols one per unit time from an i.i.d. source and submits binary codewords to a FIFO buffer that transmits bits at a fixed rate to a…

Information Theory · Computer Science 2018-02-27 Jing Zhong , Roy D. Yates

In this paper, we consider an information update system where wireless sensor sends timely updates to the destination over a random blocking terahertz channel with the supply of harvested energy and reliable energy backup. The paper aims to…

Information Theory · Computer Science 2021-10-19 Lixin Wang , Fuzhou Peng , Xiang Chen , Shidong Zhou

This paper considers the sum rate maximization problem of a two-user multiple-input single-output interference channel with receivers that can scavenge energy from the radio signals transmitted by the transmitters. We first study the…

Information Theory · Computer Science 2013-01-29 Chao Shen , Wei-Chiang Li , Tsung-Hui Chang

The popularity of Energy Harvesting Devices (EHDs) has grown in the past few years, thanks to their capability of prolonging the network lifetime. In reality, EHDs are affected by several inefficiencies, e.g., energy leakage, battery…

Information Theory · Computer Science 2016-03-14 Alessandro Biason , Michele Zorzi

An erasure channel with a fixed alphabet size $q$, where $q \gg 1$, is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming…

Information Theory · Computer Science 2008-06-06 Shervan Fashandi , Shahab Oveis Gharan , Amir K. Khandani

The increase in data storage and power consumption at data-centers has made it imperative to design energy efficient Distributed Storage Systems (DSS). The energy efficiency of DSS is strongly influenced not only by the volume of data,…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-25 Akshay Kumar , Ravi Tandon , T. Charles Clancy