Logo image
A graph based approach to supporting reconfiguration in wireless sensor networks
Conference paper   Open access

A graph based approach to supporting reconfiguration in wireless sensor networks

W. Horré, K. Lee, D. Hughes, S. Michiels and W. Joosen
2009 First International Conference on Networks & Communications, pp.326-331
IEEE
GRAPH-HOC 09: First Workshop on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks (Chennai, India, 27/12/2009–29/12/2009)
2009
pdf
graph_based_approach_to_supporting_reconfiguration.pdfDownloadView
Published (Version of Record) Open Access
url
Link to Published Version *Subscription may be requiredView

Abstract

Considerable research has been performed in applying run-time reconfigurable component models to Wireless Sensor Networks. The ability to dynamically deploy or update software components has clear advantages in sensor network deployments, which are typically large in scale and expected to operate for long periods in dynamic environments. Realizing distributed reconfiguration in Wireless Sensor Networks is complicated by the inherently asynchronous and unreliable nature of these systems. In such an environment, achieving quiescence is both costly and impossible to guarantee. Additionally, the success of reconfiguration actions cannot be determined with certainty. This paper advocates for a hierarchical, adaptive, graph-based approach to supporting reconfiguration. We argue that application developers should specify only high level reconfiguration graphs, which are then compiled, partitioned and enacted in an adaptive manner by a context aware distributed reconfiguration engine.

Details

Metrics

347 File views/ downloads
97 Record Views
Logo image