Publication

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Related publications (373)

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.

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

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

Lattice Networks: Capacity Limits, Optimal Routing and Queueing Behavior

Martin Vetterli, Guillermo Barrenetxea Kobas

Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensor networks. Thus, limits on capacity, optimal routing policies, and performance with finite buffers are key issues and are add ...

2006

Variations of split-coloring in permutation graphs

Dominique de Werra, Tinaz Ekim

Combinatorial optimization problems related to permutations have been widely studied. Here, we consider different generalizations of the usual coloring problem in permutation graphs. A cocoloring is a partition of a permutation into increasing and decreasi ...

2006

VLSI implementation of the list sphere algorithm

Andreas Peter Burg, Matthieu Philippe Emmanuel Zellweger, Christoph Studer

Sphere decoding (SD) is widely considered as one of the most promising detection schemes for multiple-input multiple-output (MIMO) communication systems. The recently proposed list sphere-decoding (LSD) algorithm is an extension of the original SD algorith ...

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

Distributed Media Rate Allocation in Multipath Networks

Pascal Frossard, Dan Jurca

The paper addresses the media-specific rate allocation problem in multipath networks. The streaming rate on each path is determined such that the end-to-end media distortion is minimized, when the receiving client aggregates packets received via multiple n ...

2006

Fast Probabilistic Subsumption Checking for Publish/Subscribe Systems

Karl Aberer, Ivana Podnar, Oana Anca Jurca

Efficient subsumption checking, deciding whether a subscription or publication is subsumed (covered) by a set of previously defined subscriptions, is of paramount importance for publish/subscribe systems. It provides the core system functionality, and addi ...

2006

Data Management for a Smart Earth: The Swiss NCCR-MICS initiative

Karl Aberer

The Swiss National Competence Center for Research in mobile Information and Communication Systems (NCCR-MICS or MICS) is one of several research initiatives sponsored by the Swiss National Science Foundation to promote long term research projects in areas ...

2006

Branch-and-Price Algorithms for Vehicle Routing Problems

Matteo Salani

In this thesis we consider some routing problems and exact algorithms to solve them based on the branch-and-price framework. We consider three variants of the Vehicle Routing Problem (VRP): the Capacitated Vehicle Routing Problem (CVRP): is the basic and m ...

Università degli studi di Milano2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006