The mobile Byzantine agreement problem on general network is investigated for the first time. We first show that the problem is unsolvable on any network with the order n and the vertex connectivity d, if n ≤ 6t or d ≤ 4t, where t is an upper bound on the number of faulty processes. Assuming full synchronization and the existence of a permanently non-faulty process, we next propose two t-resilient mobile Byzantine agreement algorithms for some families of not fully connected networks. They are optimal on some networks, in the sense that they correctly work if n > 6t and d > 4t. © 2013 Springer International Publishing.
CITATION STYLE
Sasaki, T., Yamauchi, Y., Kijima, S., & Yamashita, M. (2013). Mobile Byzantine agreement on arbitrary network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8304 LNCS, pp. 236–250). https://doi.org/10.1007/978-3-319-03850-6_17
Mendeley helps you to discover research relevant for your work.