123 search results - page 16 / 25 » Stable Leader Election |
SOFSEM
1997
Springer
13 years 12 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
ADHOCNOW
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...
EV
2006
13 years 9 months ago
2006
: This paper describes the direct relationship between the perception of citizenship and its material expression, with emphasis on how changing expression obliges a rethink of the ...
FTCS
1998
13 years 9 months ago
1998
Abstract-- We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and...
ICECCS
2010
IEEE
13 years 8 months ago
2010
IEEE
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...