Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

The Design of an Election Protocol based on Mobile Ad-hoc Network Environment

  • Park, Sung-Hoon (Dept. of Computer Engineering, Chungbuk National Univ.) ;
  • Kim, Yeong-Mok (Dept. of Computer Engineering, Chungbuk National Univ.) ;
  • Yoo, Su-Chang (Dept. of Computer Engineering, Chungbuk National Univ.)
  • Received : 2016.06.20
  • Accepted : 2016.07.21
  • Published : 2016.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an election protocol based on mobile ad-hoc network. In distributed systems, a group of computer should continue to do cooperation in order to finish some jobs. In such a system, an election protocol is especially practical and important elements to provide processes in a group with a consistent common knowledge about the membership of the group. Whenever a membership change occurs, processes should agree on which of them should do to accomplish an unfinished job or begins a new job. The problem of electing a leader is very same with the agreeing common predicate in a distributed system such as the consensus problem. Based on the termination detection protocol that is traditional one in asynchronous distributed systems, we present the new election protocol in distributed systems that are based on MANET, i.e. mobile ad hoc network.

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, April 1982.
  3. N. Mohammed, H. Otrok, W. Lingyu, M. Debbabi, and P. Bhattacharya, Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET, IEEE Transactions on Dependable and Secure Computing, vol.8, no.1, pp.89-103, March 2011 https://doi.org/10.1109/TDSC.2009.22
  4. R. Ali, S. Lor, R. Benouaer, M. Rio, Cooperative Leader Election Algorithm for Master/Slave Mobile Ad Hoc Network, 2nd IFIP Wireless Days (WD), Paris, pp. 1-5, 15-17 December 2009.
  5. Masum, S. M., Ali, A. A., Bhuiyan, M. T. I.: Asynchronous Leader Election in Mobile Ad Hoc Networks. AINA 06, 827-831, 2006.
  6. S. Lee, M. Rahman, and C. Kim, A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks, Embedded Software and Systems, Lecture Notes in Computer Science, Vol. 4523, pp: 728-738, Springer Berlin / Heidelberg 2007.
  7. M. Lima, A. dos Santos, and G. Pujolle, A Survey of Survivability in Mobile Ad Hoc Networks, IEEE Communications Surveys & Tutorials, 11 (1): 66-75, First Quarter 2009. https://doi.org/10.1109/SURV.2009.090106
  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 AdHoc Networks. InFourth 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. InProc. 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.