123 search results - page 3 / 25 » Stable Leader Election |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we study the election of multiple leaders for intrusion detection in the presence of selfish nodes in mobile ad hoc networks (MANETs). To balance the resource co...
IPPS
2005
IEEE
14 years 1 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 ...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
ENTCS
2000
13 years 7 months ago
2000
In this paper we consider two descriptions in Maude of the leader election protocol from the IEEE 1394 serial multimedia bus. Particularly, the time aspects of the protocol are st...