Abstract
For context-aware systems, it is essential for the constituent components to react flexibly to changes happening in the surrounding environment. In distributed networks, a failure of some nodes might disrupt the whole system. Given the circumstances, it is necessary for the remaining nodes to find consensus on a new organizational structure. In this paper, we propose an approach for improving the convergence speed of a prominent algorithm for finding consensus: Ben-Or’s algorithm.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-05939-6_37
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing (1983)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 1–7 (1983)
Vavala, B., Neves, N., Moniz, H., Veríssimo, P.: Randomized consensus in wireless environments: a case where more is better. In: Proceedings of the 2010 Third International Conference on Dependability, pp. 7–12 (2010)
Nguyen, P.T., Schau, V., Rossak, W.R.: Towards an adaptive communication model for mobile agents in highly dynamic networks based on swarming behaviour. In: EUMAS 2011 European Workshop on Multi-agent Systems (2011)
Seeley, T.D., Kirk Visscher, P.: Choosing a home: how the scouts in a honey bee swarm perceive the completion of their group decision making. J. Behav. Ecol. Sociobiol. 54, 511–520 (2003)
Seeley, T.D., Kirk Visscher, P.: Group decision making in nest-site selection by honey bees. J. Apidologie 35, 101–116 (2004)
Seeley, T.D., Buhrman, S.C.: Nest-site selection in honey bees: how well do swarms implement the best-of-N decision rule? J. Behav. Ecol. Sociobiol. 49, 101–116 (2001)
Aguilera, M.K., Toueg, S.: The correctness proof of Ben-Or’s randomised consensus algorithm. Distrib. Comput. 25, 371–381 (2012)
Aspnes, J.: Randomized protocols for asynchronous consensus. J. Distrib. Comput. 16, 165–175 (2003)
Taylor, I., Downard, I., Adamson, B., Macker, J.: AgentJ: enabling java NS-2 simulations for large scale distributed multimedia applications. In: Second International Conference on Distributed Frameworks for Multimedia DFMA 2006, Penang, Malaysia, pp. 1–7 (2006)
The Network Simulator NS2. http://www.cs.virginia.edu/~cs757/slidespdf/cs757-ns2-tutorial1.pdf
Aspnes, J.: Fast deterministic consensus in a noisy environment. J. Algorithms 45(1), 16–39 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Nguyen, P.T. (2014). Building Consensus in Context-Aware Systems Using Ben-Or’s Algorithm: Some Proposals for Improving the Convergence Speed. In: Vinh, P., Alagar, V., Vassev, E., Khare, A. (eds) Context-Aware Systems and Applications. ICCASA 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 128. Springer, Cham. https://doi.org/10.1007/978-3-319-05939-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-05939-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05938-9
Online ISBN: 978-3-319-05939-6
eBook Packages: Computer ScienceComputer Science (R0)