A leader election algorithm for dynamic networks with causal clocks

DOI10.1007/S00446-013-0184-1MaRDI QIDQ360270zbMATH OpenOpenAlexFDO

Authors Rebecca Ingram, Tsvetomira Radeva, Saira Viqar, J. Walter, Patrick M. Shields, Jennifer L. Welch

Publication date 26 August 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/104874

zbMATH Keywords

dynamic networksdistributed algorithmsleader electionlink reversal

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Self-stabilizing leader election in dynamic networks
• An O(n)-time self-stabilizing leader election algorithm
• Leader election in sparse dynamic networks with churn
• A distributed leader election algorithm in crash-recovery and omissive systems
• Design and analysis of dynamic leader election protocols in broadcast networks

Cites work

• scientific article; zbMATH DE number 2006653 (Why is no real title available?)
• A jamming-resistant MAC protocol for single-hop wireless networks
• Design and analysis of dynamic leader election protocols in broadcast networks
• Finite-state self-stabilizing protocols in message-passing systems
• Introduction to Distributed Algorithms
• Optimal elections in faulty loop networks and applications
• Self-stabilization
• Time, clocks, and the ordering of events in a distributed system

Cited in

(3)

• Impact of knowledge on election time in anonymous networks
• Self-stabilizing leader election in dynamic networks
• The abstract MAC layer

This page was built for publication: A leader election algorithm for dynamic networks with causal clocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360270)