Publication

A lower bound to the scaling behavior of sensor networks

Related publications (64)

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.

Sensing reality and communicating bits: A dangerous liaison

Martin Vetterli, Michael Christoph Gastpar, Pier Luigi Dragotti

The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental questions concerns the sufficiency of discrete approximations in time, space, an ...

2006

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

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

One-Step Conversion of Cellobiose to C6-Alcohols Using a Ruthenium Nanocluster Catalyst

Paul Joseph Dyson, Cheng Zhao, Ning Yan, Huizhen Liu

The one-step conversion of cellulose to C6-alcs. via green and energy efficient approaches has, as far as we are aware, not been reported. Such a process presents a considerable challenge, the two key problems being (1) finding a suitable solvent that diss ...

2006

An improved approximation algorithm for virtual private network design

Friedrich Eisenbrand

Virtual private network design deals with the reservation of capacities in a network, such that the nodes can share communication. Each node in the network has associated upper bounds on the amount of flow that it can send to the network and receive from t ...

2005

Networked Slepian-Wolf: Theory, Algorithms and Scaling Laws

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weig ...

2005

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

On the role of feedback in large sensor networks

Michael Christoph Gastpar

Feedback can considerably simplify the task of approaching and achieving the performance limits predicted by information theory. This paper determines some of the potential offered by feedback in a typical sensor network situation that could be termed moni ...

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

Efficient decentralized communications in sensor networks

Razvan Cristescu

This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a sha ...

EPFL2004

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