TDSC
2011
13 years 6 months ago
2011
—In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among a...
WDAG
2010
Springer
13 years 10 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
JPDC
2010
13 years 10 months ago
2010
This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self- and the pseudo- stabilization. Our goal is to implement the self- and/...
IAJIT
2010
13 years 10 months ago
2010
: Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimens...
TC
1998
13 years 11 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
JUCS
2006
13 years 11 months ago
2006
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
DC
2010
13 years 12 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
DIALM
2010
ACM
14 years 28 days 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-...
SODA
2008
ACM
14 years 1 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 ...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...