Concept

Topologie mesh

Publications associées (240)

A Deterministic Approach to Wireless Network Error Correction

In this paper we consider communication between two special nodes ("source" and "destination") in a wireless relay network, which has malfunctioning or malicious nodes (inserting errors). We develop the model for wireless network communication in the prese ...

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

Self-Stabilizing Robot Formations over Unreliable Networks

Seth Gilbert

We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to impl ...

2009

Gaussian Diamond Network with Adversarial Jammer

Suhas Diggavi, Soheil Mohajerzefreh

In this paper we consider communication from a source to a destination over a wireless network with the help of a set of authenticated relays. We focus on a special ``diamond'' network, where there is no direct link between the source and the destination; ...

2009

Combinatorial algorithms for wireless information flow

Christina Fragouli, Aurore Amaudruz

A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts t ...

2009

On Noise Insertion Strategies for Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

We provide lower and upper bounds on the optimal rate for reliable and secret transmission of a message from one node to another in an arbitrary wireless network with deterministic signal interaction. Certain relay nodes are allowed to insert noise into th ...

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

Network coding: from theory to media streaming

Pascal Frossard, Nikolaos Thomos

Network coding has recently emerged as an alternative to traditional routing algorithms in communication systems. In network coding, the network nodes can combine the packets they receive before forwarding them to the neighbouring nodes. Intensive research ...

2009

Network coding: from theory to media streaming

Pascal Frossard, Nikolaos Thomos

2009

Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Julien Freudiger, Maxime Raya

Pervasive communications bring along new privacy challenges, fueled by the capability of mobile devices to communicate with, and thus "sniff on", each other directly. We design a new mechanism that aims at achieving location privacy in these forthcoming mo ...

2009

An analytic finite capacity queueing network model capturing the propagation of congestion and blocking

Michel Bierlaire, Carolina Osorio Pizano

Analytic queueing network models often assume infinite capacity queues due to the difficulty of grasping the between-queue correlation. This correlation can help to explain the propagation of congestion. We present an analytic queueing network model which ...

2009

Ad-Hoc Wireless Sensor Networks For Exploration Of Solar-System Bodies

Mihai Adrian Ionescu, Herbert Shea, Pierre-André Farine, Cyril Botteron, Valentin Mitev

In this work, we evaluate the exploration of the Solar system by ad-hoc wireless sensor networks (WSN), i.e. networks where all nodes (either moving or stationary) can both provide and relay data. The two aspects of self-organization and localization are t ...

Elsevier2009

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