A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks

The classical definition of a self-stabilizing algorithm assumes generally that there are no faults in the system long enough for the algorithm to stabilize. Such an assumption cannot be applied to ad hoc mobile networks characterized by their highly dynamic topology. In this paper, we propose a sel...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 19; no. 7; pp. 926 - 939
Main Authors: Derhab, A., Badache, N.
Format: Journal Article
Language:English
Published: New York IEEE 01.07.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Ad hoc networks
Algorithm/protocol design and analysis
Algorithms
Change detection algorithms
Computational modeling
Computer networks
Convergence
Dynamical systems
Dynamics
Elections
Fault tolerance
Heuristic algorithms
Mathematical analysis
Mobile communication systems
Mobile environments
Network Protocols
Network topology
Networks
Nominations and elections
Partitioning algorithms
Routing
Topology
Fault tolerance
Network topology
Algorithm/protocol design and analysis
Mobile communication systems
Mobile environments
Network Protocols
ISSN:1045-9219, 1558-2183
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The classical definition of a self-stabilizing algorithm assumes generally that there are no faults in the system long enough for the algorithm to stabilize. Such an assumption cannot be applied to ad hoc mobile networks characterized by their highly dynamic topology. In this paper, we propose a self-stabilizing leader election algorithm that can tolerate multiple concurrent topological changes. By introducing the time-interval-based computation concept, the algorithm ensures that a network partition can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that our algorithm can ensure that each node has a leader over 99 percent of the time. We also give an upper bound on the frequency at which network components merge to guarantee the convergence.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2007.70792