Abstract
The Election protocol can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. Mobile systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile hosts to choose a mobile host or a fixed host based on the their priority despite failures of both mobile computing and/or fixed hosts. In this paper, we describe a solution to the election problem from mobile computing systems. This solution is based on the Garcia Molina’s Bully algorithm.
This work supported by Ministry of Information & Communication Research Grant C1-2002-039-0-3 in Korea.
Chapter PDF
Similar content being viewed by others
References
G. LeLann, “Distributed systems-towards a formal approach,” in Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977.
H. Garcia-Molian, “Elections in a distributed computing system,” IEEE Transactions on Computers, vol. C-31, no. 1, pp. 49–59, Han 1982.
H. Abu-Amara and J. Lokre, “Election in asynchronous complete networks with intermittent link failures.” IEEE Transactions on Computers, vol. 43, no. 7, pp. 778–788, 1994.
H.M. Sayeed, M. Abu-Amara, and H. Abu-Avara, “Optimal asynchronous agreement and leader election algorithm for complete networks with byzantine faulty links.,” Distributed Computing, vol. 9, no. 3, pp. 147–156, 1995.
J. Brunekreef, J.-P. Katoen, R. Koymans, and S. Mauw, “Design and analysis of dynamic leader election protocols in broadcast networks,” Distributed Computing, vol. 9, no. 4, pp. 157–171, 1996.
G. Singh, “Leader election in the presence of link failures,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 231–236, March 1996.
David Powell, guest editor. Special section on group communication. Communications of the ACM, 39(4):50–97, April 1996.
Pradhan D. K., Krichna P. and Vaidya N. H., Recoverable mobile environments: Design and tradeoff analysis. FTCS-26, June 1996.
Alagar S., Venkatesan., Causally ordered massage delivery in mobile systems, in proc. Of Workshop on Mobile Computing Systems and Applications, Santacruz, CA, Dec. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SH. (2003). An Efficient Election Protocol in a Mobile Computing Environment. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Dongarra, J.J., Zomaya, A.Y., Gorbachev, Y.E. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44860-8_40
Download citation
DOI: https://doi.org/10.1007/3-540-44860-8_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40194-0
Online ISBN: 978-3-540-44860-0
eBook Packages: Springer Book Archive