Designing the Concurrent Searching and Pathfinding Algorithm for Swarm Robotics

The problem of finding a target and forming a path to it is known and is well-explored in the field of swarm robotics. Using swarm intelligence, even swarms of simple robots are capable of solving this problem. However, often these works assume that two robots can perceive each other can physically reach each other, or that robots can detect any...

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum

In this work, we study the blockchain leader election problem. The purpose of such protocols is to elect a leader who decides on the next block to be appended to the blockchain, for each block proposal round. Solutions to this problem are vital for the security of blockchain systems. We introduce an efficient blockchain leader election method...

Attack resistant Leader Election in Social Overlay Networks by Leveraging Local Voting

Current leader election algorithms fail in the presence of Sybil attacks, i.e., one malicious entity inserting many nodes, network dynamics, and restricted knowledge about the graph. However, social overlay networks, i.e., peer-to-peer networks with links corresponding to social relationships, face all of the above challenges. Social overlay...