Browse > Article

Design and Specification of an Election Algorithm in Mobile Ad Hoc Distributed Systems  

Park, Sung-Hoon (충북대학교)
Publication Information
Journal of Digital Contents Society / v.11, no.4, 2010 , pp. 453-461 More about this Journal
Abstract
Specifying and designing the election algorithm in mobile ad hoc distributed systems is very difficult task. It is because mobile ad hoc systems are more prone to failures than conventional distributed systems. The aim of this paper is to propose a specification and design of the election algorithm in a specific ad hoc mobile computing environment. For this aim, we specify and design an election algorithm in this paper. In addition, we formally verify it and show that it is correct. This solution is based on the nodes detection algorithm that is a classical one for synchronous distributed systems.
Keywords
Synchronous Distributed Systems; Leader Election; Fault Tolerance; Mobile Ad Hoc Environment;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakas and R. "Tan. Fundamental Control Algorithms in Mobile Networks." In Proc. of 11th ACM SPAA, pages 251‐260, March 1999.
2 C. Lin and M. Gerla. "Adaptive Clustering for Mobile Wireless Networks." In IEEE Journal on Selected Areas in Communications, 15(7):1265‐75, 1997.   DOI   ScienceOn
3 P. Basu, N. Khan and T. Little. "A Mobility based metric for clustering in mobile ad hoc networks." In International Workshop on Wireless Networks and Mobile Computing, April 2001.
4 G. LeLann, "Distributed systems–towards a formal approach," in Information Processing 77, B. Gilchrist, Ed. North–Holland, 1977.
5 H. Garcia‐Molian, "Elections in a distributed computing system," IEEE Transactions on Computers, vol. C‐31, no. 1, pp. 49‐59, Han 1982.
6 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.   DOI   ScienceOn
7 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.   DOI   ScienceOn
8 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.   DOI   ScienceOn
9 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.   DOI   ScienceOn
10 David Powell, guest editor. "Special section on group communication." Communications of the ACM, 39(4):50‐97, April 1996.   DOI   ScienceOn
11 Pradhan D. K., Krichna P. and Vaidya N. H., "Recoverable mobile environments: Design and tradeoff analysis." FTCS‐26, June 1996.
12 N. Malpani, J. Welch and N. Vaidya. "Leader Election Algorithms for Mobile Ad Hoc Networks." In Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, MA, August 2000.