Concept

Réseau tolérant aux délais

Publications associées (88)

On broadcast and agreement in mobile ad hoc networks

This thesis studies communication and agreement protocols in wireless ad hoc networks from both theoretical and practical perspectives. The last decade has given rise to the rapid growth of wireless telecommunications such as cellular mobile phone networks ...

EPFL2007

Gossip-Based Peer Sampling

Rachid Guerraoui, Anne-Marie Kermarrec

Gossip-based communication protocols are appealing in large-scale distributed applications such as information dissemination, aggregation, and overlay topology management. This paper factors out a fundamental mechanism at the heart of all these protocols: ...

2007

Accelerating Distributed Consensus Using Extrapolation

Pascal Frossard, Effrosyni Kokiopoulou

In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature attack this problem by distributed linear iterative algorithms, wi ...

2007

Airline Disruptions: Aircraft Recovery with Maintenance Constraints

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

In this paper we consider the recovery of an airline schedule after an unforeseen event, commonly called disruption, that makes the planned schedule unfeasible. In particular we consider the aircraft recovery problem for an heterogeneous fleet of aircrafts ...

2007

Consensus Problem in Wireless Ad hoc Networks: Addressing the Right Issues

André Schiper, Fatemeh Borran

Solving consensus in wireless ad hoc networks has started to be addressed in several papers. Most of these papers adopt system models developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are po ...

2007

Column generation methods for disrupted airline schedules

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

2007

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

Olivier Lévêque, Ayfer Özgür Aydin

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of 1/r^alpha as well as a random phase. We identify exactly ...

2007

Column Generation Methods for Disrupted Airline Schedules

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

We consider the recovery of an airline schedule after an unforeseen event, commonly called disruption, that makes the planned schedule unfeasible. In particular we consider the aircraft recovery problem for a heterogeneous fleet of aircrafts, made of regul ...

2007

Infrastructure for data processing in large-scale interconnected sensor networks

Karl Aberer, Manfred Hauswirth, Ali Salehi

With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sensor networks will typically not remain isolated but the need of interconnecting them on ...

IEEE Computer Society2007

DRIFT: Efficient message ordering in ad hoc networks using virtual flooding

André Schiper, Stefan Pleisch

We present DRIFT --- a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding --- a way of using unrel ...

2006

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