Sciweavers

TCS
2008
13 years 11 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
DIALM
2010
ACM
146views Algorithms» more  DIALM 2010»
14 years 19 days ago
Regional consecutive leader election in mobile ad-hoc networks
In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the ever-changing environment of mobile ad-...
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
STACS
2005
Springer
14 years 5 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...
IPPS
2005
IEEE
14 years 5 months ago
Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
We have identified a fundamental operator in wireless networks that we named the local leader election in which the goal is to select a node in a spatially close neighborhood. We ...
Gilbert Chen, Joel W. Branch, Boleslaw K. Szymansk...
SSS
2007
Springer
108views Control Systems» more  SSS 2007»
14 years 5 months ago
Robust Stabilizing Leader Election
Abstract. In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustness is the aptitude of an algorithm to withstand permanent fa...
Carole Delporte-Gallet, Stéphane Devismes, ...