DocumentCode
2395514
Title
Democratic Leader Finding Algorithm for Large Mobile Ad Hoc Networks
Author
Sharma, Shantanu ; Singh, Awadhesh Kumar
Author_Institution
Dept. of Comput. Eng., Nat. Inst. of Technol. Kurukshetra, Kurukshetra, India
fYear
2011
fDate
20-24 June 2011
Firstpage
304
Lastpage
312
Abstract
In order to monitor ad hoc applications, it is necessary for MANET to possess a coordinator. Hence, a large number of protocols have been proposed for coordinator election in MANETs. Although, most of the protocols focus on reducing the number of control messages, there have been very little attention on ensuring the high availability of leader in the event of various types of failures, e.g., leader crash and unreachability of leader, especially in the scenario like rescue and warfare, where absence of leader, even for a short duration, may lead to havoc. The motivation for the present article is to address this issue, especially for large MANETs where it is impossible for most applications to run in the absence of coordinator. The proposed protocol is inspired by prevailing parliamentary polity, followed in most of the democratic countries, which always ensures the existence of an executive in order to coordinate and monitor various activities in addition to taking decisions regarding affairs of the state.
Keywords
mobile ad hoc networks; protocols; MANET; democratic leader finding algorithm; mobile ad hoc networks; protocols; Availability; Computer crashes; Data structures; Heart beat; Mobile ad hoc networks; Nominations and elections; Protocols; Coordinator Election; Fault Tolerant; Higher Availability; Lower House; Mobile Ad Hoc Networks; Upper House;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems Workshops (ICDCSW), 2011 31st International Conference on
Conference_Location
Minneapolis, MN
ISSN
1545-0678
Print_ISBN
978-1-4577-0384-3
Electronic_ISBN
1545-0678
Type
conf
DOI
10.1109/ICDCSW.2011.50
Filename
5961504
Link To Document