Leader election algorithms for mobile ad hoc networks

Malpani, Navneet; Welch, Jennifer L.; Vaidya, Nitin H.

doi:10.1145/345848.345871

Cited by 240 publications

(144 citation statements)

References 4 publications

Supporting

Mentioning

143

Contrasting

Unclassified

Order By: Relevance

“…The authors of [16] proposed two algorithms for mobile ad hoc networks. The algorithms viewed the ad hoc network as Directed Acyclic Graph (DAC) and impose that each connected component of the graph should have a single leader.…”

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

“…The algorithms proposed in [6], [13] and [14] require large number of messages to perform leader election, have a single-point-of-failure problem, and rely on unrealistic assumptions that make it hard to be deployed in MANETs. The approach of [15] is exposed to frequent link breakages and failures of nodes that can occur during or after election, while the two protocols proposed in [16] have been provided with no proofs of correctness. The approaches provided in [17] and [18] are both impractical since the former assumes that all nodes that participate in election process have the same evaluation function, while the later assumes that all nodes (without any exception) are required to exchange information in order to elect a leader, and this is not realistic!…”

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

See 1 more Smart Citation

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

Alwidian¹,

Alslaity²

2012

IJCA

View full text Add to dashboard Cite

Leader election process is known as the task of selecting a particular node or a process to be a unique leader of the distributed system. Many algorithms were proposed for leader election in classical, wired distributed systems. However, with the advent of wireless communication technology, the domain of distributed computing becomes much wide, and the concept of leader election in such environments has been changed due to the dynamic topology resulted from nodes' mobility. The existing classical leader election algorithms do not adapt well in mobile ad hoc environments. In this paper, we propose a new leader election algorithm that is conscious about nodes' mobility and the dynamic topology of ad hoc networks. The main idea of our algorithm is to select a subset of the nodes to participate in the election process, the selected nodes should ensure coverage of other nodes and that are of low mobility. We show through mathematical analysis that our proposed algorithm, the "Stable CoveringSet-Based Leader Election Algorithm (SCLEA)" outperforms any other algorithm that depends on the simple flooding to perform leader election. The enhancement of our algorithm is advent in terms of reducing the message overhead associated with leader election process and minimizing the number of redundant ELECTION messages as much as possible.

show abstract

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

Alwidian¹,

Alslaity²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…However, since it is difficult, if not impossible at all, to synchronize clocks across all nodes in a WANET, the synchronous clock assumption cannot be satisfied in general. Several methods for electing a global leader in WANETs have been proposed [31,32]. The term "local leader election" has also been referred to as the problem of finding leaders in partitioned systems [33], where broken links cause the network to split into a number of disconnected sub-networks.…”

Section: Related Workmentioning

confidence: 99%

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

2006

View full text Add to dashboard Cite

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node's delay of transmitting a signal is dependent on the probability of the node's ability to best perform a pertinent task and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding named Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.Keywords -Wireless ad hoc networks, wireless networks, ad hoc routing, ad hoc flooding, leader election INTRODUCTIONWireless ad hoc networks (WANETs) [1] are used to provide on-demand network infrastructures. They are usually composed of small portable clients (or nodes), but they lack consistent topologies. They range in size from small Bluetooth piconets [2] used for device synchronization to large-scale networks used for supporting military and emergency-response applications. Perhaps the most popular WANET applications recently have been wireless sensor networks [3], which are most often used for the pervasive and remote monitoring of environmental or spatial phenomena.To date, a plethora of research efforts have addressed some significant challenges introduced by various aspects of WANET operation, perhaps the most fundamental being fault-tolerant and energy-efficient communication. Since communication is typically the most costly operation in WANETs because of the overhead of transceiver operation, innovative and efficient approaches to basic communication algorithms such as flooding and routing are in strong demand. Fortunately, the communication primitive in WANETs, broadcast, offers some interesting possibilities.As an instructive example, let us consider a lecture hall with a lecturer and student audience. If the lecturer wants to identify a student with a certain property (e.g., the least number of credits taken at the university) in a lecture hall with n students, it seems that n communications (verbal in this case) would be needed. However, if the lecturer and students use the broadcast nature of verbal communication, they can accomplish this task in just two communications. In the first broadcast, the lecturer asks all students to announce their total number of completed credits after a delay (in seconds, start...

show abstract

“…Leader election algorithms for mobile ad hoc networks have been proposed in [9] [10]. As noted earlier, we are interested in an extrema-finding algorithm, because it is desirable to elect a leader with some system-related attributes such as maximum battery life or maximum computation power.…”

Section: Introductionmentioning

confidence: 99%

“…As noted earlier, we are interested in an extrema-finding algorithm, because it is desirable to elect a leader with some system-related attributes such as maximum battery life or maximum computation power. The algorithms in [9] are not extrema-finding and cannot be extended to perform extrema finding. Although, extrema-finding leader election algorithms for mobile ad hoc networks have been proposed in [10], these algorithms are unrealistic as they require nodes to meet and exchange information in order to elect a leader and are not well-suited to the applications discussed earlier.…”

Section: Introductionmentioning

confidence: 99%

Design of an Leader Election Protocol in Mobile Ad Hoc Distributed Systems

Park¹

2008

The Journal of the Korea Contents Association

View full text Add to dashboard Cite

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.

show abstract

Leader election algorithms for mobile ad hoc networks

Cited by 240 publications

References 4 publications

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

Design of an Leader Election Protocol in Mobile Ad Hoc Distributed Systems

Contact Info

Product

Resources

About