Home // SENSORCOMM 2015, The Ninth International Conference on Sensor Technologies and Applications // View article

Self-Stabilizing Structures for Data Gathering in Wireless Sensor Networks

Authors:
Sandra Beyer
Stefan Lohs
Jörg Nolte
Reinhardt Karnapke
Gerry Siegemund

Keywords: Wireless Sensor Networks; Self-Stabilization; Routing Structures

Abstract:
Wireless Sensor Networks (WSN) enable a number of applications, with monitoring of habitats, office buildings, or restricted areas most prominent among them. All of these applications have one thing in common: the need to commu- nicate. However, the nature of the wireless medium results in quite a few problems. Lossy communication links with transient faults require acknowledgments, retransmissions, and route re- pair mechanisms. Tree- or similar structures for data gathering scenarios lead to increased load closer to the sink, with congestion, higher buffer space requirements, and energy drain as results. The second problem is often addressed by aggregation and reduction schemes. These schemes are bound to fail, however, when the underlying structure is compromised due to changes in the connectivity between nodes. Therefore, it is necessary to focus on the structures first of all. We address the problem of transient faults by using the inherent fault tolerance of self- stabilizing algorithms when building and using tree- or tiers (communication-) structures. In this paper we show that self- stabilizing structures are suitable for data gathering scenarios in WSN by comparison of the connectivity achieved by our self- stabilizing tiers algorithm and the tree algorithm from Dolev with that of Collection Tree Protocol (CTP), the standard data- gathering protocol for TinyOS.

Pages: 71 to 76

Copyright: Copyright (c) IARIA, 2015

Publication date: August 23, 2015

Published in: conference

ISSN: 2308-4405

ISBN: 978-1-61208-425-1

Location: Venice, Italy

Dates: from August 23, 2015 to August 28, 2015