On the public citation graph
Design and analysis of dynamic leader election protocols in broadcast networks
0 signed · 101 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51687-5_41openalex-snapshot
Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
inferredcites →https://doi.org/10.1007/3-540-51803-7_28openalex-snapshot
Specifying message passing systems requires extending temporal logic
inferredcites →https://doi.org/10.1007/3-540-57271-6_34openalex-snapshot
Optimal time self stabilization in dynamic systems
inferredcites →https://doi.org/10.1007/978-1-4471-2120-6_15openalex-snapshot
Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-642-77572-7_13openalex-snapshot
Process Algebra with Signals and Conditions
inferredcites →https://doi.org/10.1007/bf00290707openalex-snapshot
Electing a leader in a ring with link failures
inferredcites →https://doi.org/10.1007/bf01553900openalex-snapshot
Efficient elections in chordal ring networks
inferredcites →https://doi.org/10.1007/bf01782775openalex-snapshot
An improved upperbound for distributed election in bidirectional rings of processors
inferredcites →https://doi.org/10.1007/bfb0019814openalex-snapshot
Constructing efficient election algorithms from efficient traversal algorithms
inferredcites →https://doi.org/10.1007/bfb0022445openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1007/bfb0042321openalex-snapshot
A theoretician's view of fault tolerant distributed computing
inferredcites →https://doi.org/10.1016/0020-0190(86)90025-6openalex-snapshot
Election in a complete network with a sense of direction
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(83)90014-xopenalex-snapshot
An assertional correctness proof of a distributed algorithm
inferredcites →https://doi.org/10.1016/0167-6423(84)90009-1openalex-snapshot
Fault-tolerant broadcasts
inferredcites →https://doi.org/10.1016/0169-7552(87)90084-5openalex-snapshot
An introduction to Estelle: A specification language for distributed systems
inferredcites →https://doi.org/10.1016/0169-7552(92)90109-4openalex-snapshot
Temporal logic and applications—a tutorial
inferredcites →https://doi.org/10.1016/0169-7552(93)90094-kopenalex-snapshot
Protocol verification made simple: a tutorial
inferredcites →https://doi.org/10.1016/0743-7315(89)90034-8openalex-snapshot
Reliable election in broadcast networks
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferredcites →https://doi.org/10.1017/cbo9780511721625openalex-snapshot
Algebraic Specification of Communication Protocols
inferredcites →https://doi.org/10.1109/12.2189openalex-snapshot
Fault-tolerant distributed algorithm for election in complete networks
inferredcites →https://doi.org/10.1109/32.54293openalex-snapshot
Optimal distributed t-resilient election in complete networks
inferredcites →https://doi.org/10.1109/71.80121openalex-snapshot
Broadcast protocols for distributed systems
inferredcites →https://doi.org/10.1109/icdcs.1991.148712openalex-snapshot
Efficient distributed algorithms for leader election in complete networks
inferredcites →https://doi.org/10.1109/tcom.1983.1095720openalex-snapshot
Modular Verification of Computer Communication Protocols
inferredcites →https://doi.org/10.1109/tse.1984.5010247openalex-snapshot
Broadcasting Sequential Processes (BSP)
inferredcites →https://doi.org/10.1137/0220023openalex-snapshot
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
inferredcites →https://doi.org/10.1145/135419.135457openalex-snapshot
Leader election in complete networks
inferredcites →https://doi.org/10.1145/359104.359108openalex-snapshot
An improved algorithm for decentralized extrema-finding in circular configurations of processes
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/41840.41856openalex-snapshot
Specifying message passing systems requires extending temporal logic
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/77606.77610openalex-snapshot
A modular technique for the design of efficient distributed leader finding algorithms
inferredcites →https://doi.org/10.1145/800017.800516openalex-snapshot
Temporal verification of carrier-sense local area network protocols
inferredcites →https://doi.org/10.1145/800222.806747openalex-snapshot
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
inferredcites →https://doi.org/10.21236/ada611781openalex-snapshot
An Election Algorithm for a Distributed Clock Synchronization Program
inferredcites →https://doi.org/10.3233/fi-1990-13202openalex-snapshot
A Process Specification Formalism1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_6openalex-snapshot
A Probabilistically Correct Leader Election Protocol for Large Groups
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_19openalex-snapshot
About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_40openalex-snapshot
An Efficient Election Protocol in a Mobile Computing Environment
inferred← citeshttps://doi.org/10.1007/3-540-45785-2_22openalex-snapshot
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_14openalex-snapshot
Process Specification in a UNITY Format
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_15openalex-snapshot
Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_4openalex-snapshot
Inductive Proofs with Sets, and some Applications in Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_108openalex-snapshot
A Message Efficient Group Membership Protocol in Synchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-54978-1_34openalex-snapshot
A Cluster Membership Protocol Based on Termination Detection Algorithm in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-61176-1_2openalex-snapshot
Resilient Reference Monitor for Distributed Access Control via Moving Target Defense
inferred← citeshttps://doi.org/10.1007/978-3-319-73712-6_1openalex-snapshot
LOGO: A New Distributed Leader Election Algorithm in WSNs with Low Energy Consumption
inferred← citeshttps://doi.org/10.1007/978-3-540-27820-7_12openalex-snapshot
Neighborhood-Based Topology Recognition in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_10openalex-snapshot
Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_23openalex-snapshot
A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13568-2_18openalex-snapshot
Leader Election in Anonymous Radio Networks: Model Checking Energy Consumption
inferred← citeshttps://doi.org/10.1007/s00224-017-9758-9openalex-snapshot
Self-Stabilizing Leader Election in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s00446-013-0184-1openalex-snapshot
A leader election algorithm for dynamic networks with causal clocks
inferred← citeshttps://doi.org/10.1007/s00453-022-01068-xopenalex-snapshot
Leader Election in Well-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00500-020-05259-yopenalex-snapshot
Ambient self-powered cluster-based wireless sensor networks for industry 4.0 applications
inferred← citeshttps://doi.org/10.1007/s11227-018-2258-0openalex-snapshot
An election protocol based on group membership detection algorithm in mobile ad hoc distributed systems
inferred← citeshttps://doi.org/10.1016/j.pmcj.2013.10.003openalex-snapshot
Top K -leader election in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.simpat.2013.04.005openalex-snapshot
LEADMesh: Design and analysis of an efficient leader election protocol for wireless mesh networks
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00034-2openalex-snapshot
Specification and verification of various distributed leader election algorithms for unidirectional ring networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00256-3openalex-snapshot
Formal verification of a leader election protocol in process algebra
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01186-2openalex-snapshot
Chapter 2: Road Traffic Regulation
inferred← citeshttps://doi.org/10.1109/32.815321openalex-snapshot
A highly available local leader election service
inferred← citeshttps://doi.org/10.1109/compsac.2013.89openalex-snapshot
Verification and Implementation of the Protocol Standard in Train Control System
inferred← citeshttps://doi.org/10.1109/dese.2017.11openalex-snapshot
BROGO: A New Low Energy Consumption Algorithm for Leader Election in WSNs
inferred← citeshttps://doi.org/10.1109/discex.2003.1194890openalex-snapshot
Leader election algorithms for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237106openalex-snapshot
Subordination: Cluster management without distributed consensus
inferred← citeshttps://doi.org/10.1109/icc.2007.577openalex-snapshot
An Efficient Leader Election Protocol for Wireless Quasi-Static Mesh Networks: Proof of Correctness
inferred← citeshttps://doi.org/10.1109/icccn.2008.ecp.35openalex-snapshot
Top K-Leader Election in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icnp.2004.1348124openalex-snapshot
Design and analysis of a leader election algorithm for mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/icsens.2015.7370618openalex-snapshot
Energy efficient routing scheme using leader election in ambient energy harvesting wireless ad-hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/icsens.2017.8234162openalex-snapshot
A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT
inferred← citeshttps://doi.org/10.1109/icsens.2017.8234400openalex-snapshot
A revised BROGO algorithm for leader election in wireless sensor and IoT networks
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161028openalex-snapshot
An asynchronous leader election algorithm for dynamic networks
inferred← citeshttps://doi.org/10.1109/itng.2009.61openalex-snapshot
An Election Protocol in Mobile Ad Hoc Distributed Systems
inferred← citeshttps://doi.org/10.1109/itng.2011.168openalex-snapshot
Notice of Violation of IEEE Publication Principles: A stable election protocol based on an unreliable failure detector in distributed systems
inferred← citeshttps://doi.org/10.1109/itng.2014.83openalex-snapshot
The Design of an Election Protocol in Wireless Cellular Networks
inferred← citeshttps://doi.org/10.1109/iwsm.1996.534156openalex-snapshot
Using multicast-SNMP to coordinate distributed management agents
inferred← citeshttps://doi.org/10.1109/tc.2013.214openalex-snapshot
Design and Evaluation of a Parallel Invocation Protocol for Transactional Applications over the Web
inferred← citeshttps://doi.org/10.1109/ucc63386.2024.00084openalex-snapshot
Energy-Efficient Leader Election in IoT Networks: A Cloud Storage Perspective
inferred← citeshttps://doi.org/10.1145/1143549.1143775openalex-snapshot
An efficient leader election protocol for mobile networks
inferred← citeshttps://doi.org/10.1145/1860684.1860701openalex-snapshot
Regional consecutive leader election in mobile ad-hoc networks
inferred← citeshttps://doi.org/10.1145/3212734.3212754openalex-snapshot
Leader Election in Well-Connected Graphs
inferred← citeshttps://doi.org/10.1145/3644713.3644740openalex-snapshot
A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use Case
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i34/85284openalex-snapshot
A Message Efficient Group Membership Protocol in Mobile Ad Hoc Distributed Systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2572235/v1openalex-snapshot
A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use Case
inferred← citeshttps://doi.org/10.5120/8470-2396openalex-snapshot
Comparison of Various Election Algorithms in Distributed System
inferred← citeshttps://doi.org/10.5120/8539-2083openalex-snapshot
A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems
inferred← citeshttps://doi.org/10.5392/ijoc.2011.7.4.030openalex-snapshot
On Relationship between Safety and Liveness of Election Problem in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.5392/jkca.2008.8.12.053openalex-snapshot
Design of an Leader Election Protocol in Mobile Ad Hoc Distributed Systems
inferred← citeshttps://doi.org/10.5755/j01.eie.23.2.18005openalex-snapshot
Formal Specification of Spanning Tree Protocol Using ACP
inferred← citeshttps://doi.org/10.5762/kais.2014.15.7.4554openalex-snapshot
Design and Analysis of Leader Election Algorithm in Wireless Network based on Fixed Stations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.