CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
HYBRID ANN AND FIREWORKS ALGORITHM FOR REAL-TIME SOFTWARE RELIABILITY PREDICTION

Ivy Botchway Felix Larbi Aryeh Boniface Kayode Alese
Random Articles
Reseach Article

A K-Neighbor-based, Energy Aware Leader Election Algorithm (KELEA) for Mobile Ad hoc Networks

by Alaa N. Alslaity, Sanaa A. Alwidian
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 59 - Number 19
Year of Publication: 2012
Authors: Alaa N. Alslaity, Sanaa A. Alwidian
10.5120/9803-4403

Alaa N. Alslaity, Sanaa A. Alwidian . A K-Neighbor-based, Energy Aware Leader Election Algorithm (KELEA) for Mobile Ad hoc Networks. International Journal of Computer Applications. 59, 19 ( December 2012), 38-43. DOI=10.5120/9803-4403

@article{ 10.5120/9803-4403,
author = { Alaa N. Alslaity, Sanaa A. Alwidian },
title = { A K-Neighbor-based, Energy Aware Leader Election Algorithm (KELEA) for Mobile Ad hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { December 2012 },
volume = { 59 },
number = { 19 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 38-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume59/number19/9803-4403/ },
doi = { 10.5120/9803-4403 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:04:41.330766+05:30
%A Alaa N. Alslaity
%A Sanaa A. Alwidian
%T A K-Neighbor-based, Energy Aware Leader Election Algorithm (KELEA) for Mobile Ad hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 59
%N 19
%P 38-43
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Leader election is the process of electing a node as a coordinator or a leader to the whole distributed system. This paper proposes a new leader election algorithm called: "K-neighbor-based, Energy Aware Leader Election Algorithm (KELEA)" that works efficiently in the ad hoc distributed systems. KELEA is an energy-efficient algorithm which aims to save energy by reducing the number of exchanged messages. The main idea is to assign every node in the ad hoc network with a unique ID, where the ID represents a performance value such as density and energy. Then maintain a descending-ordered list of nodes according to their IDs. When a node detects a leader crash, it instantiates a leader election process by sending an ELECTION message to only a specific number of neighbouring nodes (K) to participate further in the election process, where K represents a ratio of the whole number of nodes. The paper shows through mathematical analysis and a practical example that the proposed algorithm KELEA outperforms other algorithms that perform election using traditional flooding (i. e. by sending messages to the entire neighbouring nodes). KELEA reduces the message overhead and minimizes energy consumption in comparison with other flooding-based algorithms.

References
  1. Mehdi Mirakhorli, Amir A. Sharifloo, Maghsoud Abbaspour, "A Novel Method for Leader Election Algorithm". The 7th IEEE International Conference on Computer and Information Technology (CIT 2007), pp. 452-456, October 2007.
  2. Mina Shirali, Abolfazl Haghighat Toroghi, and Mehdi Vojdani "Leader election algorithms: History and novel schemes". Third 2008 International Conference on Convergence and Hybrid Information Technology(ICCIT'08),pp. 1001-1006, November 2008.
  3. Scott D. Stoller. "Leader Election in Asynchronous Distributed Systems". IEEE Transaction on Computers Journal, volume 49, no. 3 pp. 283- 284, March 2000.
  4. G. L. Lann, "Distributed Systems - Towards a Formal Approach", in Proc. IFIP Congress, pp. 155-160, 1977.
  5. Randolph Franklin "An improved algorithm for decentralized extrema-finding in circular configurations of processes". Communications of the ACM Magazine. pp. 336–337, May 1982.
  6. H. Garcia Molina "Election in a distributed Computing System". IEEE Trans. Comp, 1982, vol31, no. 1, pp. 48-59. 1982
  7. Nourddine E, Mohammed K, Amine B. "Enhancing AODV Performance based on Statistical Mobility Quantification". The IEEE International Conference on Information & Communication Technology (ICTTA06), pp. 2455-2460, 2006.
  8. Quazi Ehsanul Kabir Mamun, Salahuddin Mohammad Masum, and Mohammad Abdur Rahim Mustafa. "Modified bully algorithm for electing coordinator in distributed systems". WSEAS Transactions on Computers, Issue 4, Volum 3, pp. 948-953, October 2004.
  9. Muneer Bani Yassein, Ala'a N Alslaity and Sana'a A Alwidian "An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems. " International Journal of Computer Applications, volume 49 no. 6, pp: 10-15, July 2012.
  10. M. Gholipour, M. S. Kordafshari, M. Jahanshahi, A. M. Rahman. A New Approach For Election Algorithm in Distributed Systems. Second International Conference on Communication Theory, Reliability, and Quality of Service. IEEE (2009).
  11. Sung-Hoon Park . A Stable Election Protocol based on an Unreliable Failure Detector in Distributed Systems. Eighth International Conference on Information Technology: New Generations. IEEE 2011
  12. G. L. Lann, "Distributed Systems - Towards a FormaApproach", in Proc. IFIP Congress, pp. 155-160, 1977.
  13. Leila Melit, Nadjib Badache. An Energy Efficient Leader Election Algorithm for Mobile Ad Hoc Networks. 10th International Symposium on Programming and Systems (ISPS), IEEE 2011.
  14. Sudarshan Vasudevan, Jim Kurose, Don Towsley. Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks. Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP'04). 2004.
  15. M. A. Haddar, A. Hadj Kacem, Y. M´etivier, M. Mosbah, and M. Jmaiel. Electing a Leader in the Local Computation Model Using Mobile Agents. International Conference on Computer Systems and Applications, ICCSA 2008. IEEE/ACS.
  16. N. Malpani, J. Welch and N. Vaidya. "Leader Election Algorithms for Mobile Ad Hoc Networks". DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, Boston, MA, pp. 96-103, August 2000.
  17. V. D. Park and Scott. M. Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks", INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, pp. 1405, 1997.
  18. Neepa Biswas, Leader Election In Mobile Ad-Hoc Networks. [Disseration]. Bengal Engineering And Science University, Shibpur. April 2010.
  19. Sanaa A. Alwidian , Alaa N. Alslaity. A Stable Covering Set-based Leader Election Algorithm (SCLEA) for Mobile Ad-hoc Distributed Systems Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems" International Journal of Computer Applications, Vol 54, no. 2, pp. :25-32, September 2012.
  20. Paul Rogers, & Nael Abu-Ghazaleh (2005), Robustness of network-wide broadcasts in MANETs. Proc. of the 2nd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2005), Vol. 3, Nov. 2005, pages 161-185
  21. Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, & Jang-Ping Sheu (2002), The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 8 (2), pages 153-167.
  22. Z. Qi and D. P. Agrawal, "Analysis of Leveled Probabilistic Routing in Mobile Ad hoc Networks," presented at The IEEE International Conference on Communications (ICC'04), Paris, France, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Systems MANETs Leader Leader Election ELECTION message energy efficient

Powered by PhDFocusTM