Sciweavers

104 search results - page 1 / 21
» Latency-aware leader election
Sort
View
TDSC
2011
12 years 11 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...
IPL
2011
91views more  IPL 2011»
12 years 8 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
DSN
2008
IEEE
13 years 11 months ago
A robust and lightweight stable leader election service for dynamic systems
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
Nicolas Schiper, Sam Toueg
TCS
2008
13 years 4 months ago
Election and rendezvous with incomparable labels
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...
Jérémie Chalopin
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 4 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar