[PDF][PDF] A genetic based leader election algorithm for IoT cloud data processing
In IoT networks, nodes communicate with each other for computational services, data
processing, and resource sharing. Most of the time huge data is generated at the network …
processing, and resource sharing. Most of the time huge data is generated at the network …
[HTML][HTML] Correlating node centrality metrics with node resilience in self-healing systems with limited neighbourhood information
A Rodríguez, A Diaconescu, J Rodríguez… - Future Generation …, 2025 - Elsevier
Resilient systems must self-heal their components and connections to maintain their
topology and function when failures occur. This ability becomes essential to many …
topology and function when failures occur. This ability becomes essential to many …
Head node selection algorithm in cloud computing data center
Cloud computing provides multiple services such as computational services, data
processing, and resource sharing through multiple nodes. These nodes collaborate for all …
processing, and resource sharing through multiple nodes. These nodes collaborate for all …
PALE: Time bounded practical agile leader election
B Sidik, R Puzis, P Zilberman… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise
environments with bring-your-own-device policy, require central coordination by a leader …
environments with bring-your-own-device policy, require central coordination by a leader …
Centrality-based eventual leader election in dynamic networks
This paper presents CEL, a new distributed eventual leader election algorithm for dynamic
networks, which exploits topological information to improve the choice of a central leader …
networks, which exploits topological information to improve the choice of a central leader …
Voting in the presence of byzantine faults
L Tseng - 2017 IEEE 22nd Pacific Rim International …, 2017 - ieeexplore.ieee.org
Voting (or election) algorithms are used widely in many safety-critical systems to mask
errors. Most systems only tolerate malicious (or Byzantine) voters-these systems assume the …
errors. Most systems only tolerate malicious (or Byzantine) voters-these systems assume the …
Impact of knowledge on election time in anonymous networks
Y Dieudonné, A Pelc - Proceedings of the 29th ACM Symposium on …, 2017 - dl.acm.org
Leader election is one of the basic problems in distributed computing. This is a symmetry
breaking problem: all nodes of a network must agree on a single node, called the leader. If …
breaking problem: all nodes of a network must agree on a single node, called the leader. If …
Homascow: a holonic multi-agent system for cooperative work
Assistance tools for actors of cooperative systems, which are often centralized are
increasingly designed to adhere to the system organization using a distributed architecture …
increasingly designed to adhere to the system organization using a distributed architecture …
PALE: partially asynchronous agile leader election
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise
environments with bring-your-own-device policy, require central coordination by a leader …
environments with bring-your-own-device policy, require central coordination by a leader …
Leader election and computation of a spanning tree in dynamic distributed networks using local computations and mobile agents
Leader election problem is among the important problems in distributed computing. The
continued evolution of distributed systems keeps the distributed computing an open area of …
continued evolution of distributed systems keeps the distributed computing an open area of …