
Multi-Leader Election Algorithm Based On VORONOI Partition for Self-Stabilization in MANETs
Author(s) -
T. Madhu,
Sanjay E. Sarma,
Jayant Murthy
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.f1188.0886s19
Subject(s) - network partition , leader election , partition (number theory) , mobile ad hoc network , computer science , voronoi diagram , stability (learning theory) , representation (politics) , process (computing) , topology (electrical circuits) , wireless sensor network , distributed computing , computer network , algorithm , mathematics , political science , machine learning , combinatorics , geometry , network packet , politics , law , operating system
Electing a leader in Mobile Adhoc Networks (MANETs) is the basic problem in providing the stabilization. Many current research outcomes study multi-leader election concept in the static networks and single leader in dynamic networks. The article mainly focusses on multi leader election in dynamic sensor networks where the nodes were installed randomly. This proposed concept elect an exclusive leader when the topology changes occurred eventually over the network. Furthermore, a basic representation used for the process. Also provided accurate proof for the proposed algorithm and shown the way of satisfying the stability condition through ensured results.