Publication

Towards reliable communication and agreement in mobile ad-hoc networks

Publications associées (125)

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

Polynomial Filtering for Fast Convergence in Distributed Consensus

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 address the consensus averaging problem by distributed linear iter ...

2009

SCALAR Data Replication Performance in Mobile Ad hoc Applications

Emre Atsan

Data replication is an indispensable service for mobile ad hoc networks and it helps to increase data availability, reduce communication overhead, achieve fault-tolerance and load balancing. Our scalable and reactive data replication framework SCALAR opera ...

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

End-to-end adaptation scheme for ubiquitous remote experimentation

Denis Gillet, Christophe Salzmann, Philippe Müllhaupt

Remote experimentation is an effective e-learning paradigm for supporting hands-on education using laboratory equipment at distance. The current trend is to enable remote experimentation in mobile and ubiquitous learning. In such a context, the remote expe ...

2009

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

2008

Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks

André Schiper, Fatemeh Borran

Most papers addressing consensus in wireless ad hoc networks adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are poorly suited for wireless ad hoc netw ...

IEEE2008

Network Resource Allocation for Competing Multiple Description Transmissions

Suhas Diggavi

Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...

2008

Consensus in Wireless Ad hoc Networks

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 similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures ...

2008

Wireless Network Secrecy with Public Feedback

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we consider secret communication between two special nodes ("source" and "destination") in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) sec ...

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

Border effects, fairness, and phase transition in large wireless networks

Patrick Thiran, Olivier Dousse, Mathilde Durvy

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologie ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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