A solution to the split & merge problem for blockchain-based applications in ad hoc networks

Abstract

In recent years, studies have been conducted to evaluate the performance of blockchain-based technologies to solve various problems. In this paper, we present a proof of concept in which we evaluate the robustness of a blockchain-based application in an ad hoc network confronted with split merge problems that may be caused by node mobility. We highlight how a blockchain should behave according to the network state and we measure its cost in terms of network load. We show that the measurements depend greatly on the mining algorithm used to solve the consensus.