Publication

Network coded multipath and related techniques

Related publications (69)

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.

Over the past years there has been an increasing interest in developing distributed computation methods over wireless networks. A new communication paradigm has emerged where distributed algorithms such as consensus have played a key role in the developmen ...

IEEE2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

, ,

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goa ...

Assoc Computing Machinery2013

Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems

Paolo Ienne, David Novo Bruna

Fixed-point arithmetic leads to efficient implementations. However, the optimization process required to size each of the implementation signals can be prohibitively complex. In this paper, we introduce a new divide-and-conquer method that is able to appro ...

Ieee2013

Creating Shared Secrets out of Thin Air

Christina Fragouli, Suhas Diggavi, Iris Safaka

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Assoc Computing Machinery2012

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

Hierarchical Beamforming for Large One-Dimensional Wireless Networks

Olivier Lévêque, Alla Merzakreeva

We consider a wireless network with a large number of source-destination pairs distributed over a line. Under line-of-sight propagation, this network has only one degree of freedom for communication. At high SNR, this one degree of freedom can be readily a ...

Ieee2012

, , , ,

We present a structured Quantize-Map-and- Forward (QMF) scheme for cooperative communication over wireless networks, that employs LDPC ensembles for the node operations and message-passing algorithms for decoding. We demonstrate through extensive simulatio ...

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

Enhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks

Patrick Thiran, Julien Pierre Sacha Herzen, Ruben Merz, Adel Aziz

The goal of jointly providing efficiency and fairness in wireless networks can be seen as the problem of maximizing a given utility function. In contrast with wired networks, the capacity of wireless networks is typically time-varying and not known explici ...

2011