Publication

Distributed Detection over Adaptive Networks: Refined Asymptotics and the Role of Connectivity

Related publications (41)

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.

Using End-to-End Data to Infer Lossy Links in Sensor Networks

Patrick Thiran, Xuan Hung Nguyen

Compared to wired networks, sensor networks pose two additional challenges for monitoring functions: they support much less probing traffic, and they change their routing topologies much more frequently. We propose therefore to use only end-to-end applicat ...

2006

Media Aware Routing in Large Scale Networks with Overlay

Pascal Frossard, Dan Jurca, Sofija Petrovic

This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first propose a model that reports the video distortion as a function of the encoding r ...

2005

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005

On the Throughput of Ad Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2005

Rate Performance Objectives of Multihop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing ad hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery-lifetime and power constraints. Commonly used metrics are total capacity (in ...

2004

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

On the Throughput of Ad-Hoc Networks using Connectivity Graphs

Christina Fragouli

2004

Rate Performance Objectives of Multi-hop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing adhoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...

2004

A Proven Delay Bound for a Network with Aggregate Scheduling

Jean-Yves Le Boudec

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and t ...

2000

Virtual Trunk Simulation

One of the activities of the ACTS project EXPERT is to perform trials demonstrating the use of advancedResource Management and Routing (RMR) algorithms in ATM networks. The RMR model chosen for those trials is based on the Virtual Trunk (VT) concept. In AT ...

1997