Publication

Broadcast, relay and feedback in Gaussian channels

Related publications (118)

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.

Improving Fast Paxos: being optimistic with no overhead

André Schiper

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...

2006

Reputation in Self-Organized Communication Systems and Beyond (Invited Paper)

Jean-Yves Le Boudec, Jochen Mundinger

Efficiently handling reputation is important in dealing with free-riding, malicious attacks and random failures in self-organized communication systems. At the same time, work in this context is often found to be relevant in many other disciplines, in part ...

ACM2006

Slowing light in optical fibres sees fast progress

Luc Thévenaz

Slowing down light to produce optical delay lines for communication networks has advanced enormously in the last year. Luc Thévenaz and Miguel Gonzalez-Herraez chart this recent progress and describe the new challenges facing developers of practical device ...

IOP Publishing2006

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006

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

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through an imperfect observation process. The sensors can communicate back to a central data collector over a noisy channel. The key pa- rameters i ...

Institute of Electrical and Electronics Engineers2005

Architectural Issues of JMS Compliant Group Communication

Nils Richard Ekwall, Arnas Kupsys

Group communication provides one-to-many communication primitives that simplify the development of highly available services. Despite advances in research and numerous prototypes, group communication stays confined to small niches. To facilitate the accept ...

2005

Efficient error correction solutions for OFDM based digital video

Mauro Lattuada

The robustness of the delivery of digital compressed video streams has always been one of the main topic of the standardization bodies to assure the Quality of the Service (QoS). The MPEG standard which is nowadays the reference for digital television defi ...

EPFL2005

Adaptive Distributed Algorithms for Power-Efficient Data Gathering in Sensor Networks

Razvan Cristescu, Jugoslava Acimovic

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a si ...

2005

Efficient Distributed Multiresolution Processing for Data Gathering in Sensor Networks

Razvan Cristescu, Jugoslava Acimovic

We consider large sensor networks where the cost of collecting data from the network nodes to the data gathering sink is critical.~We propose several algorithms that use limited local communication and distributed signal processing to make communication mo ...

2005

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004