Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Due to the technology of network has been grown up at an astounding speed. The topology of networks is trending to wireless. There are many properties of the wireless mobile network and they are different from the wired network. However, the mobile technology has brought about more conveniences. Comparative, it is more dangerous in this environment. For instance, processors have mobility and the illegal processors can intrude this network easily and proceed to any illegitimate behaviour. Thus, the wireless mobile network is hardly to handle and make sure of the security. It will also decrease the capability of fault tolerance in the system. There are a lot of researches and achievements about Byzantine Agreement for increasing the capability of fault tolerance in the wired network. It is worth noting that solving the BA problem in the wireless mobile network. In this paper, BA problem is re-examined under the wireless mobile network with the unreliable and unsafe environment. A simple, secure, and efficient protocol RAP is proposed. This protocol use only two rounds of message exchange to achieve an agreement and can tolerate maximum number of allowable faulty transmission media. It will also ensure the messages' security and increase the capability of fault tolerance of the system.