Message-Loss-Tolerant Byzantine Consensus for Mobile Ad-Hoc Networks

We present Rûm, a randomized asynchronous multivalued byzantine consensus algorithm designed for mobile ad hoc networks, operating under the message omission/loss model of Santoro-Widmayer. Rûm is optimal with respect to the byzantine fault bound, and makes progress in rounds where the number of message omissions is bounded, while always ensuring safety. Through network simulations conducted in ns-3, Rûm's performance is evaluated against Turquois and Ezhilchelvan et al. 's multivalued consensus algorithm, demonstrating its ability to achieve consensus in the presence of byzantine faults and message loss. The results indicate that Rûm can efficiently handle message omissions and byzantine faults, maintaining reliable decision-making processes, making it a suitable solution for consensus in mobile ad hoc networks.