Publication

Power, Spatio-Temporal Bandwidth, and Distortion in Large Sensor Networks

Related publications (45)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Simple Converse of Burnashev's Reliability Function

Bixio Rimoldi, Emre Telatar, Peter Allan Berlin

In a remarkable paper published in 1976, Burna- shev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and It ...

2009

On Fidelity Per Unit Cost

Bixio Rimoldi, Marius Kleiner

We consider source coding with a ﬁdelity criterion, channel coding with a channel input constraint, and the combined problem of reproducing a source across a noisy channel. All three cases face a similar tradeoff between resource and performance, and the o ...

2009

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit---for instance, in many cases, sensors are used to detec ...

2009

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

The case for structured random codes in network communication theorems

Michael Christoph Gastpar

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits' and these bits are reliably communicated across the noisy channels. Random codin ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Separation theorems and partial orderings for sensor network problems

Michael Christoph Gastpar

In the absence of complexity and delay constraints, the quality of a noisy communication channel can be characterized by a single number, called its capacity and usually measured in bits. Shannon [1] showed that this number is universal in the sense that v ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Distributed routing algorithms for sensor networks

Guillermo Barrenetxea Kobas

Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...

EPFL2006

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

2005