Approximate Byzantine consensus in sparse, mobile ad-hoc networks

摘要

We consider the problem of approximate consensus in mobile ad-hoc networks in the presence of Byzantine nodes. Due to nodes' mobility, the topology is dynamic. We propose a protocol based on the linear iteration method. The nodes collect information during several consecutive rounds: moving gives them the opportunity to gather progressively enough values. A novel sufficient and necessary condition guarantees the final convergence: from time to time only the correct nodes that own a value equal to (or very close to) either the minimum or the maximum value have to receive enough messages (quantity constraint) with either higher or lower values (quality constraint). Of course, nodes' motion should not prevent this requirement to be fulfilled. New concepts are introduced to prove the correctness of the protocol. Based on particular mobility scenarios, simulations are conducted to analyze the impact of some parameters on three variants of the protocol.