Publication

Network Coding with Computation Alignment

Publications associées (73)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Local Interference Can Accelerate Gossip Algorithms

Michael Christoph Gastpar

In this paper we show how interference can be exploited to perform gossip computations over a larger local neighborhood, rather than only pairs of nodes. We use a recently introduced technique called computation coding to perform reliable computation over ...

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

On Locating Byzantine Attackers

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setu ...

2008

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 are an essential part of the reported information. For instance, in environmental monitoring, the goal is to reconstruct physical quantities over space and time; ...

2008

Raptor Network Video Coding

Pascal Frossard, Nikolaos Thomos

In this paper, we consider the problem of streaming video information on lossy packet networks with path and source diversity, such as wireless mesh networks or more generally overlay architectures. We propose to distribute the video information between se ...

2007

Network Monitoring: it depends on your points of view

Christina Fragouli, Suhas Diggavi

End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given so ...

2007

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

Olivier Lévêque, Ayfer Özgür Aydin

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of 1/r^alpha as well as a random phase. We identify exactly ...

2007

On feedback for network coding

Christina Fragouli

In this paper we examine possible ways that feedback can be used, in the context of systems with network coding capabilities. We illustrate, through a number of simple examples, that use of feedback can be employed for parameter adaptation to satisfy QoS r ...

2007

Network Coding Fundamentals

Christina Fragouli, Emina Soljanin

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural q ...

2007

A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We show that network coding allows to realize energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critic ...

2006

Information flow decomposiiton for network coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

Institute of Electrical and Electronics Engineers2006