A graph based approach to supporting reconfiguration in wireless sensor networks
Horré, W., Lee, K., Hughes, D., Michiels, S. and Joosen, W. (2009) A graph based approach to supporting reconfiguration in wireless sensor networks. In: GRAPH-HOC 09: First Workshop on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks, 27 - 29 December, Chennai, India pp. 326-331.
*Subscription may be required
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.
|Publication Type:||Conference Paper|
|Copyright:||© 2009 IEEE|
|Notes:||Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Appears in Proceedings of the First International Conference on Networks & Communications (NetCoM-2009), pp 326 - 331|
|Item Control Page|
Downloads per month over past year