Browse > Article
http://dx.doi.org/10.5762/KAIS.2014.15.7.4554

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

Park, Sung-Hoon (Dept. of Computer Engineering, Chungbuk National University)
Publication Information
Journal of the Korea Academia-Industrial cooperation Society / v.15, no.7, 2014 , pp. 4554-4561 More about this Journal
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.
Keywords
Fault Tolerance; Leader Election; Fixed-Station based Wireless Network; Synchronous Distributed Systems;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI   ScienceOn
2 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.
3 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.
4 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   DOI   ScienceOn
5 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   DOI   ScienceOn
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   DOI
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   DOI
8 Pradhan D. K., Krichna P. and Vaidya N. H., Recoverable mobile environments: Design and tradeoff analysis. FTCS-26, June 1996.
9 Badache N., Mobility in Distributed Systems, Technical Report #962, IRISA, Rennes, Octor 1995.
10 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   DOI
11 G. LeLann, "Distributed systems-towards a formal approach," Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977.