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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 19; číslo 7; s. 926 - 939
Hlavní autoři:	Derhab, A., Badache, N.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!