Journal of Digital Contents Society (디지털콘텐츠학회 논문지)

Digital Contents Society (한국디지털콘텐츠학회)
권호 표지

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

모바일 애드 혹 분산 시스템에서 선출 알고리즘의 명세 및 설계

  • Received : 2010.10.04
  • Accepted : 2010.12.27
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

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

References

  1. G. LeLann, "Distributed systems–towards a formal approach," in Information Processing 77, B. Gilchrist, Ed. North–Holland, 1977.
  2. H. Garcia‐Molian, "Elections in a distributed computing system," IEEE Transactions on Computers, vol. C‐31, no. 1, pp. 49‐59, Han 1982.
  3. 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. https://doi.org/10.1109/12.293257
  4. 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. https://doi.org/10.1007/s004460050016
  5. 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. https://doi.org/10.1007/s004460050017
  6. 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. https://doi.org/10.1109/71.491576
  7. David Powell, guest editor. "Special section on group communication." Communications of the ACM, 39(4):50‐97, April 1996. https://doi.org/10.1145/227210.227225
  8. Pradhan D. K., Krichna P. and Vaidya N. H., "Recoverable mobile environments: Design and tradeoff analysis." FTCS‐26, June 1996.
  9. 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.
  10. 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.
  11. C. Lin and M. Gerla. "Adaptive Clustering for Mobile Wireless Networks." In IEEE Journal on Selected Areas in Communications, 15(7):1265‐75, 1997. https://doi.org/10.1109/49.622910
  12. 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.