scispace - formally typeset
Proceedings ArticleDOI

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

Sudarshan Vasudevan, +2 more
- pp 350-360
TLDR
This work presents a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks and shows that each node has a leader approximately 97-99% of the time in a variety of operating conditions.
Abstract: 
Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing solutions to leader election do not handle frequent topology changes and dynamic nature of mobile networks. We present a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks. The algorithm is based on finding an extrema and uses diffusing computations for this purpose. We show, using linear-time temporal logic, that the algorithm is "weakly" self-stabilizing and terminating. We also simulate the algorithm in a mobile ad hoc setting. Through our simulation study, we elaborate on several important issues that can significantly impact performance of such a protocol for mobile ad hoc networks such as choice of signaling, broadcast nature of wireless medium etc. Our simulation study shows that our algorithm is quite effective in that each node has a leader approximately 97-99% of the time in a variety of operating conditions.

read more

Citations
More filters
Proceedings ArticleDOI

Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks

TL;DR: This paper presents an interference-aware channel assignment algorithm and protocol for multi-radio wireless mesh networks that address this interference problem and demonstrates its practicality through the evaluation of a prototype implementation in a IEEE 802.11 testbed.
Patent

Modular monitor service for smart item monitoring

TL;DR: In this paper, a core monitor service and any monitor service modules are mapped to specific ones of the devices, based on requirements of other services and/or relevant device metadata (e.g., capabilities).
Patent

System monitor for networks of nodes

TL;DR: In this paper, the authors describe a system monitor component for a sensor network, which may include a server component that is continuously running and monitoring zero or more networks consisting of (possibly wireless) devices, where each network may be executing a different communications protocol, such as a proprietary, platform-dependent protocol.
Journal ArticleDOI

Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET

TL;DR: In this article, a leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs) is studied, where the authors propose a solution based on mechanism design theory.
Journal ArticleDOI

A process calculus for Mobile Ad Hoc Networks

TL;DR: A formal operational semantics of the @w-calculus is given in terms of labeled transition systems and it is proved that the state reachability problem is decidable for finite-control @w -processes and that late bisimulation equivalence is a congruence.
References
More filters
Proceedings ArticleDOI

Energy-efficient communication protocol for wireless microsensor networks

TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.

Energy-efficient communication protocols for wireless microsensor networks

TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Proceedings ArticleDOI

GPSR: greedy perimeter stateless routing for wireless networks

TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Book

Distributed algorithms

Nancy Lynch
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Related Papers (5)