Analysing the suitability of blockchain consensus algorithms in swarm robotics
by Theviyanthan Krishnamohan
International Journal of Blockchains and Cryptocurrencies (IJBC), Vol. 3, No. 4, 2022

Abstract: Swarm robotics integrates robotics with swarm intelligence. Consensus achievement is one of the major behaviours of swarm robotics. Strategies that solve the consensus-achievement problem have been shown to be vulnerable to Byzantine robots. Blockchain-based solutions have been shown to improve Byzantine fault tolerance. However, these solutions suffer from poor performance, excessive resource consumption, and vulnerability to the 51% attack due to the use of the proof-of-work consensus algorithm. This study surveys existing blockchain consensus algorithms and their suitability to swarm robotics. Consequently, a taxonomy is introduced consisting of three categories, namely proof of resource, proof of authority, and Byzantine agreement. The proof-of-resource algorithms are vulnerable to the 51% attack and consume excess resources. Proof of authority algorithms creates permissioned blockchains, which contravenes the principles of swarm robotics. Byzantine agreement algorithms introduce centralisation. Consequently, the need for a new consensus algorithm to be used in swarm robotics is postulated.

Online publication date: Wed, 08-Feb-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Blockchains and Cryptocurrencies (IJBC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com