LAUSR

As a traditional research topic, consensus is one of the foundational building blocks in distributed systems and networks, by which all agents can reach an agreement in the judgments, opinions, and actions for some events. In this article, we study the fault-tolerant consensus problem in mobile networks, considering that the faults and mobility of agents are common and nearly ineluctable in mobile networks. Specifically, a distributed algorithm is proposed to achieve the fault-tolerant consensus in mobile networks with Byzantine faults. When designing our algorithm, the NOMA technique in 5G is adopted to facilitate the transmissions between agents, which makes our algorithm efficient in runtime. Both the theoretical analysis and extensive simulation are included in this article to evaluate the performance of our algorithm. By designing an algorithm such as the one in this article, we not only want to show an efficient solution for the fault-tolerant consensus problem, but also hope to shed light on how to design resilient algorithms in mobile networks.