Call for Paper - August 2022 Edition
IJCA solicits original research papers for the August 2022 Edition. Last date of manuscript submission is July 20, 2022. Read More

Leader Election Algorithm using Fibonacci Heap Structure in Mobile Ad hoc Network

Print
PDF
IJCA Proceedings on Technical Symposium on Emerging Technologies in Computer Science
© 2016 by IJCA Journal
TSETCS 2016 - Number 2
Year of Publication: 2016
Authors:
Kshama Tiwari
Brajesh Kumar Umrao

Kshama Tiwari and Brajesh Kumar Umrao. Article: Leader Election Algorithm using Fibonacci Heap Structure in Mobile Ad hoc Network. IJCA Proceedings on Technical Symposium on Emerging Technologies in Computer Science TSETCS 2016(2):5-8, June 2016. Full text available. BibTeX

@article{key:article,
	author = {Kshama Tiwari and Brajesh Kumar Umrao},
	title = {Article: Leader Election Algorithm using Fibonacci Heap Structure in Mobile Ad hoc Network},
	journal = {IJCA Proceedings on Technical Symposium on Emerging Technologies in Computer Science},
	year = {2016},
	volume = {TSETCS 2016},
	number = {2},
	pages = {5-8},
	month = {June},
	note = {Full text available}
}

Abstract

Mobile Ad hoc network is a self-configured network of devices connected using a wireless medium. Ad hoc network is a temporary network connection created for a specific purpose. MANET can be seen as a distributed computing environment, where Leader Election mechanism is used, for the purpose of synchronization. Election algorithms are used to find the leader for Distributed System. Various election algorithms are already proposed for electing a leader. In this paper, the main challenge is to find the new leader in lesser time with minimum number of message communication. In this paper, an algorithm is proposed to find the leader in lesser amount of time and messages through the use of Fibonacci Heap structure. The better time complexity of operations using Fibonacci heap structure makes it suitable for the leader election in Mobile Ad Hoc Network, as compared to other tree structures.

References

  • Sinha, P. K. Distributed Operating Systems Concepts and Design; Prentice-Hall: Upper SaddleRiver, NJ, USA, 2002; pp. 332–334.
  • Tiwari, Kshama, & Umbrae Brajesh Comparative analysis of various leader election approaches, JACOTEH, 2015
  • Garcia-Molina, H. Elections in a distributed computing system. IEEE Trans. Comput. 1982, C-13, 48-59.
  • Mamun, Q. E. K. ; Masum, S. M. ; Mustafa, M. A. R. Modified Bully Algorithm for Electing Coordinator in Distributed Systems. In Proceedings of the 3rd WSEAS International Conference on Software Engineering, Parallel and Distributed Systems, Salzburg, Austria, 13–15 February 2004.
  • S. Vasudevan, J. Kurose, and D. Towsley, "Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks," ICNP'04, 2004.
  • G. Singh, "Leader Election in the Presence of Link Failures," IEEE Transactions on Paralle and Distributed Systems, vol. 7, no. 3, March 1996. .
  • 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.
  • Sepehri M. , Goodarzi M. , ³Leader Election Algorithm Using Heap Structure´,12th WSEAS International Conference on Computers, Heraklion, Greece, July 25, 2008
  • Jain, Arihant Kumar, Sharma Ramshanhar, "Leader Election Algorithms in Wireless Environments using Fibonacci Heap Structure", May-June 2102.
  • Spector, A. z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender,