Programming Wireless Sensor Networks in a Self-Stabilizing Style

Wireless sensor networks operate in an unstable environment and thus are subject to arbitrary transient faults. Self-stabilization is a promising technique to add tolerance against transient faults in a self-contained non-masking way. A core factor for the applicability of a given self-stabilizing a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SENSORCOMM 2009 : proceedings : the third International Conference on Sensor Technologies and Applications : 18-23 June 2009 : Athens/Glyfada, Greece s. 610 - 616
Hlavní autoři: Weyer, C., Turau, V., Lagemann, A., Nolte, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2009
Témata:
Algorithm design and analysis
Clustering algorithms
Concurrent computing
Convergence
Fault tolerance
Model Transformation
Runtime environment
Scheduling algorithm
Self Stabilization
Sensor systems and applications
Upper bound
Wireless sensor networks
ISBN:9780769536699, 0769536697
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!
Popis
Shrnutí:Wireless sensor networks operate in an unstable environment and thus are subject to arbitrary transient faults. Self-stabilization is a promising technique to add tolerance against transient faults in a self-contained non-masking way. A core factor for the applicability of a given self-stabilizing algorithm is its convergence time. This paper analyses the average stabilization time of three algorithms commonly regarded as central building blocks for wireless sensor networks. The analysis is accomplished with SelfWISE, a framework providing programming abstractions for self-stabilizing algorithms. The performed analysis considers the target models as well as network size and density. This demonstrates the usability of SelfWISE for evaluating self-stabilizing algorithms under a wide range of models.
ISBN:9780769536699
0769536697
DOI:10.1109/SENSORCOMM.2009.100