Skip to Main content Skip to Navigation
Conference papers

C4M: A Partition-Robust Consensus Algorithm for Blockgraph in Mesh Network

Abstract : Blockchain designed for Mobile Ad hoc Networks (MANET) and mesh networks is an emerging research topic which has to cope with the network partition problem. However, existing consensus algorithms used in blockchains have been designed to work in a fully connected network with reliable communication. As this assumption does not hold anymore in mobile wireless networks, we describe in this paper the problem of network partitions and its impact on blockchain. Then, we propose a new consensus algorithm called Consensus for Mesh (C4M) which inspires from RAFT as a solution to this problem. The C4M consensus algorithm is integrated in Blockgraph, a blockchain solution for MANET and mesh networks. We implemented our solution in NS-3 to analyze its performances through simulations. The simulation results show that the heartbeat interval and the election timeout have a great impact on the leader election time, especially in case of topology changes.
Document type :
Conference papers
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-03495769
Contributor : David Alexis Cordova Morales Connect in order to contact the contributor
Submitted on : Monday, December 20, 2021 - 11:54:10 AM
Last modification on : Tuesday, September 13, 2022 - 5:32:51 PM

Identifiers

Citation

David Cordova Morales, Pedro Velloso, Alexandre Laube, Thi-Mai-Trang Nguyen, Guy Pujolle. C4M: A Partition-Robust Consensus Algorithm for Blockgraph in Mesh Network. 2021 5th Cyber Security in Networking Conference (CSNet), Oct 2021, Abu Dhabi, United Arab Emirates. pp.82-89, ⟨10.1109/CSNet52717.2021.9614651⟩. ⟨hal-03495769⟩

Share

Metrics

Record views

26