DOI QR코드

DOI QR Code

Design and Analysis of Leader Election Algorithm in Wireless Network based on Fixed Stations

기지국 기반 무선 통신망에서 리더 선택 알고리즘의 설계 및 분석

  • 박성훈 (충북대학교 전자정보대학 컴퓨터공학과)
  • Received : 2014.06.24
  • Accepted : 2014.07.10
  • Published : 2014.07.31

Abstract

In recent years, several paradigms have been identified to simplify the design of fault-tolerant distributed applications in a conventional static system. Leader Election is among the most noticeable, particularly because it is closely related to group communication, which provides a powerful basis for implementing active replications among other uses. On the other hand, despite its usefulness, to our knowledge, no study has focused on this problem in a mobile computing environment. The aim of this paper was to propose an algorithm for the leader election protocol in a fixed station based wireless networks environment. The election algorithm is much more efficient than other election algorithms in terms of the fault tolerance.

최근에 기존의 컴퓨터 시스템에서 결함허용 분산 어플리케이션을 설계하는데 필요한 요소를 몇 개의 중요한 패러다임으로 구분하여 단순화 되어 왔다. 리더 선택 프로토콜은 그 중에서도 가장 눈에 띄고 비중 있는 프로토콜로 알려져 있다. 선택 프로토콜은 그룹통신이나, 데이터의 원자적인(atomic) 커밋(commit), 복제 데이터의 관리와 같은 프로토콜 코디네이터가 필요한 분야에서 기초적인 설계 초석으로 유용하게 이용 될 수 있기 때문이다. 그러나 이러한 유성성에도 불구하고 기지국 기반 무선 통신 환경에서 아직까지 리더 선택의 문제를 다룬 연구는 많지 않았다. 본 논문에서는 기지국 기반 무선 통신 환경에서 리더 선택 프로토콜을 위한 선택 알고리즘을 제시하고 설계하고자 한다. 또한 설계된 선택 알고리즘은 다른 알고리즘에 비해 결함허용 측면에서 매우 효율적임을 보인다.

Keywords

References

  1. G. LeLann, "Distributed systems-towards a formal approach," 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. DOI: http://dx.doi.org/10.1109/TC.1982.1675885
  3. L. Melit and N. Badache, "An Energy efficient leader Election algorithm for mobile ad hoc networks." IEEE Programming and Systems, 2011 10th international Symposium, pp. 54-59, April, 2011.
  4. Carlos Gomez-Calzado and Mikel Larrea, "An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems", 21st Euromicro International Conference on Parallel, Distributed and Network-Based Processing, pp. 180-188, February, 2013.
  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. DOI: http://dx.doi.org/10.1007/s004460050017
  6. M. Gholipour, M.S. Kordafshari, M. Jahanshahi and A.M. Rahmani, A New Approach for Election Algorithm in Distributed Systems, International Conference on Communication Theory, Reliability, and Quality of Service, pp. 70-74, July 2009. DOI: http://dx.doi.org/10.1109/CTRQ.2009.32
  7. Hsu-Chia Cahng and Chi-Chun Lo, "A Consensus-Based Leader Election Algorithm for Wireless Ad Hoc Networks", Computer, Consumer and Control, International Symposium, pp. 232-235, June 2012. DOI: http://dx.doi.org/10.1109/IS3C.2012.66
  8. Pradhan D. K., Krichna P. and Vaidya N. H., Recoverable mobile environments: Design and tradeoff analysis. FTCS-26, June 1996.
  9. Abdelouahid Derhab and Nadjib Badache, "A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks", IEEE Transactions on Parallel and Distributed Systems, pp. 926-939, July 2008. DOI: http://dx.doi.org/10.1109/TPDS.2007.70792
  10. Badache N., Mobility in Distributed Systems, Technical Report #962, IRISA, Rennes, Octor 1995.
  11. Hyun Chul Chung, Jennifer L. Welch and Peter Robinson, "Optimal regional consecutive leader election in mobile ad-hoc networks", Proceed -ings of the 7th ACM SIGACT/SIG MOBILE International Workshop on Foundations of Mobile Computing, pp. 52-61, June 2011. DOI: http://dx.doi.org/10.1145/1998476.1998485