Publication

Consensus with Unknown Participants or Fundamental Self-Organization

Publications associées (123)

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

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

In IR (Impulse Radio) network, the conventional synchronization (also called signal acquisition) method becomes inefficient and results in a certain failure of synchronization when concurrent transmissions are allowed without controlling their powers. The ...

2005

Efficient routing with small buffers in dense networks

Martin Vetterli, Guillermo Barrenetxea Kobas

The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson’s Theorem that give ...

2005

Evaluation of a Routing Architecture for Wireless Messaging Ad-Hoc Networks

Mark Felegyhazi, Megha Goel

The Short Messaging Service(SMS) which has become very popular in cellular networks is very highly priced. We show in this paper how self-organizing ad-hoc networks can be used to provide the short messaging service, at a much lower price. We propose a rou ...

2004

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures

Martin Vetterli, Guillermo Barrenetxea Kobas

We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upp ...

2004

Efficient, self-contained handling of identity in Peer-to-Peer systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique an ...

2004

Secure Positioning in Sensor Networks

Jean-Pierre Hubaux, Srdan Capkun

So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...

2004

Are two Classifiers performing equally? A treatment using Bayesian Hypothesis Testing

We consider here how to assess if two classifiers, based on a set of test error results, are performing equally well. This question is often considered in the realm of sampling theory, based on classical hypothesis testing. Here we present a simple Bayesia ...

IDIAP2004

Coping with misbehavior in mobile ad-hoc networks

Sonja Buchegger

In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...

EPFL2004

Coping With Misbehavior in Mobile Ad-hoc Networks

Sonja Buchegger

CRC Press2004

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Jean-Pierre Hubaux, Jun Luo

Many envisioned applications of ad hoc networks involve only small-scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are the primary requirements of VAGs. Existing designs for ...

2004