TCS
2008
14 years 13 days ago
2008
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...
DIALM
2010
ACM
14 years 1 months ago
2010
ACM
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-...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
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...
IPPS
2005
IEEE
14 years 6 months ago
2005
IEEE
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 ...
SSS
2007
Springer
14 years 6 months ago
2007
Springer
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...