Design and analysis of a leader election algorithm for mobile ad hoc networks

Vasudevan, Subramanyan; Kurose, Jim; Towsley, Don

doi:10.1109/icnp.2004.1348124

Cited by 133 publications

(113 citation statements)

References 22 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…The protocol we consider, hereafter called LE, is the static version of a distributed leader-election protocol pre-sented in [24]. It operates on an arbitrary topology of nodes with distinct identifiers and it elects as the leader of the network the node with the maximum identifier.…”

Section: The Leader-election Protocolmentioning

confidence: 99%

“…In particular we specify and verify a messagepassing leader-election protocol [24] with static membership and fault-free components. The choice of the protocol was made based on two facts: (a) the leader election problem is a fundamental problem in distributed computing and hence, an interesting problem to consider, and (b) the protocol is simple enough to focus on its specification and verification rather than on its understanding, but at the same time complex enough to enable us to evaluate the two frameworks and draw conclusions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Gelastou

Georgiou

Philippou

2008

2008 Seventh IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relative capabilities, strengths and usability. To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols.

show abstract

Section: The Leader-election Protocolmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Gelastou

Georgiou

Philippou

2008

2008 Seventh IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

show abstract

“…In the context of MANETs such protocols should consider arbitrary topology changes, and aim at finding a unique leader which is the most-valued node within a connected component [25]. Let leader (id , lid ) indicate that a node with address id has found its leader with address lid , and let node A be the most-valued node.…”

Section: Protocol Analysis With Cactlmentioning

confidence: 99%

Model Checking MANETs with Arbitrary Mobility

Ghassemi

Ahmadi

Fokkink³

et al. 2013

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multihop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing power for CLTSs as our logical framework.

show abstract

“…The reactive property of the routing protocol implies that it only requests a route when it needs one and does not require that the mobile nodes maintain routes to destinations that are not communicating [5,6]. AODV guarantees loop-free routes by using sequence numbers that indicate how new, or fresh, a route is.…”

Section: Aodv Routing Protocolmentioning

confidence: 99%

“…On the other hand, on-demand routing protocols don't exchange routing information periodically. Instead, they discover a route only when it is needed for the communication between two nodes [1,6,7]. Due to dynamic change of net-work on ad hoc networks, links between nodes are not permanent.…”

Section: Introductionmentioning

confidence: 99%

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Hemant¹

2015

IJRITCC

View full text Add to dashboard Cite

Abstract-Failure of communication link in mobile ADHOC network is major issue. For the failure of link the performance of network is degraded. Due to mobility of mobile node brake the communication link and path of routing is failed. For the repairing of routing node used various algorithm such as leader election, distributed and selection algorithm. The failure of link decease the performance of routing protocol in mobile ad-hoc network, for the improvement of quality of service in mobile ad-hoc network various authors proposed a different model and method for prediction of link. The prediction of link decreases the failure rate of mobile node during communication. The leader election algorithm plays a major role in link failure prediction algorithm the process of link failure prediction implied in form of distributed node distribution. Proposed a new link stability prediction method based on current link-related or user-related information in shadowed environments. The modified protocol acquired the process of thresholds priority Oder on the basic of neighbor's node. The selection of neighbor node deepens on the mode operation in three sections. According to order of state create cluster of priority of group. After creation of group calculate average threshold value and compare each group value with minimum threshold value and pass the control message for communication. Through this process mode of activation state of node is minimized the time of route establishment and maintenance. The selection of proper node in minimum time and other node in sleep mode the consumption of power is reduces. We modified SBRP protocol for selection of node during on demand request node according to sleep and activation mode of communication. Each node locally assigned priority value of node. For the evaluation of performance used network simulator NS-2.35. And simulate two protocol one is AODV-LE protocol, these protocol patch are available for the simulation purpose. And another protocol is AODV-LE-ME. AODV-LE-ME protocol is modified protocol of leader election protocol for the selection of mobile node during the communication.

show abstract

Design and analysis of a leader election algorithm for mobile ad hoc networks

Cited by 133 publications

References 22 publications

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Model Checking MANETs with Arbitrary Mobility

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Contact Info

Product

Resources

About