Sciweavers

Share
TDSC
2011
7 years 10 months ago
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET
—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...
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad De...
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
8 years 1 months ago
Leader Election Problem versus Pattern Formation Problem
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...
Yoann Dieudonné, Franck Petit, Vincent Vill...
JPDC
2010
97views more  JPDC 2010»
8 years 1 months ago
Stabilizing leader election in partial synchronous systems with crash failures
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/...
Carole Delporte-Gallet, Stéphane Devismes, ...
IAJIT
2010
88views more  IAJIT 2010»
8 years 1 months ago
Leader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure
: 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...
Mohammed Refai, Ahmad Sharieh, Fahad Alshammari
TC
1998
8 years 2 months ago
Optimal Elections in Faulty Loop Networks and Applications
—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...
Bernard Mans, Nicola Santoro
JUCS
2006
124views more  JUCS 2006»
8 years 3 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
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...
Wan Fokkink, Jun Pang
DC
2010
8 years 3 months ago
A knowledge-based analysis of global function computation
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...
Joseph Y. Halpern, Sabina Petride
DIALM
2010
ACM
146views Algorithms» more  DIALM 2010»
8 years 4 months 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
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
8 years 4 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
8 years 5 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
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...
M. C. Dharmadeep, K. Gopinath
books