Solving the consensus problem in a mobile environment

Badache, Nadjib; Hurfin, Michel; Macêdo, Raimundo José de Araújo

doi:10.1109/pccc.1999.749417

Cited by 16 publications

(15 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concerning the problem of consensus, Badache et al were the first to present a protocol specifically for wireless environments [17]. Their solution considers that mobile hosts (MHs) are connected to fixed mobile support stations (MSSs), which are assumed to be fully connected.…”

Section: Related Workmentioning

confidence: 99%

“…of Badache et al [17]. The clusterheads gather the initial values of their associated nodes and execute consensus using a P failure detector.…”

Section: Related Workmentioning

confidence: 99%

“…The first case is as follows (lines [10][11][12][13][14][15][16][17][18]. When the condition is met (line 10), node p i updates the state to match the state of the received message, with a slight exception.…”

Section: Turquois: Byzantine K-consensusmentioning

confidence: 99%

See 2 more Smart Citations

Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks

Moniz

Neves

Correia³

2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Wireless ad hoc networks, due to their inherent unreliability, pose significant challenges to the task of achieving tight coordination amongst nodes. The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failure of the entire system. This paper presents an asynchronous Byzantine consensus protocol -called Turquois -specifically designed for resource-constrained wireless ad hoc networks. The key to its efficiency is the fact that it tolerates dynamic message omissions, which allows an efficient utilization of the wireless broadcasting medium. The protocol also refrains from computationally expensive public-key cryptographic during its normal operation. The protocol is safe despite the arbitrary failure of f < n 3 nodes from a total of n nodes, and unrestricted message omissions. Progress is ensured in rounds where the number of omissions is σ ≤ n−t 2 (n − k − t) + k − 2, where k is the number of nodes required to terminate and t ≤ f is the number of nodes that are actually faulty. These characteristics make Turquois the first consensus protocol that simultaneously circumvents the FLP and the Santoro-Widmayer impossibility results, which is achieved through randomization. Finally, the protocol was prototyped and subject to a comparative performance evaluation against two well-known Byzantine fault-tolerant consensus protocols. The results show that, due to its design, Turquois outperforms the other protocols by more than an order of magnitude as the number of nodes in the system increases.

show abstract

Section: Related Workmentioning

confidence: 99%

“…of Badache et al [17]. The clusterheads gather the initial values of their associated nodes and execute consensus using a P failure detector.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks

Moniz

Neves

Correia³

2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…One of the earliest solution to the consensus problem for a cellular network was proposed by Badache et al [2]. The solution relies on a traditional fixed infrastructure of Mobile Support Station (MSS), and consensus is basically solved among the MSS using the Chandra-Toueg consensus protocol with the failure detector ♦S [8].…”

Section: Related Workmentioning

confidence: 99%

“…2 We use the terms node and process interchangeably. Each node in the network has a single wireless transceiver through which it can communicate with other nodes.…”

Section: System Modelmentioning

confidence: 99%