Influence of Topology-Fluctuations on Self-Stabilizing Algorithms

  • Self-stabilizing systems have in theory the unique and provable ability, to always return to a valid system state even in the face of failures. These properties are certainly desirable for domains like wireless ad-hoc networks with numerous unpredictable faults. Unfortunately, the time in which the system returns to a valid state is not predictable and potentially unbound. The failure rate typically depends on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of the states of its neighbors. When state changes are either too quick or too slow the system might never reach a state that is sufficiently stable for a specific task. In this paper, we investigate the influences of the error rate on the (stability) convergence time on the basis of topology information acquired in real network experiments. This allows us to asses the asymptotic behavior of relevant self-stabilizing algorithms in typical wireless networks.

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author: Stefan Lohs, Gerry Siegemund, Jörg Nolte, Volker Turau
ISBN:978-1-5090-1460-6
ISBN:978-1-5090-1461-3
Title of the source (English):International Conference on Distributed Computing in Sensor Systems (DCOSS)
Publisher:IEEE
Place of publication:Piscataway, NJ
Document Type:Conference publication peer-reviewed
Language:English
Year of publication:2016
Tag:Ad hoc networks; network topology; stability analysis; topology; wireless networks; wireless sensor networks
First Page:122
Last Page:124
Faculty/Chair:Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Verteilte Systeme und Betriebssysteme
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.