DocumentCode
1809607
Title
Dynamic Composition of Services in Sensor Networks
Author
Geyik, Sahin Cem ; Szymanski, Boleslaw K. ; Zerfos, Petros ; Verma, Dinesh
Author_Institution
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
fYear
2010
fDate
5-10 July 2010
Firstpage
242
Lastpage
249
Abstract
Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes is error-prone and unreliable. Such a dynamic environment requires a continuous adaptation of the composition of services. In this paper, we first propose a graph-based model of sensor services that maps to the operational model of sensor networks and is amenable to analysis. Based on this model, we formulate the process of sensor service composition as a cost-optimization problem, which is NP-complete. We then propose two heuristic methods for its solution, the top-down and the bottom-up, and discuss their centralized and distributed implementations. Using simulations, we evaluate their performance.
Keywords
computational complexity; costing; graph theory; optimisation; wireless sensor networks; NP complete problem; Web services; cost optimization problem; dynamic services composition; graph based model; sensor networks; Adaptation model; Algorithm design and analysis; Analytical models; Data models; Heuristic algorithms; Network topology; Reliability; Sensor Networks; Service Composition; Service Modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Services Computing (SCC), 2010 IEEE International Conference on
Conference_Location
Miami, FL
Print_ISBN
978-1-4244-8147-7
Electronic_ISBN
978-0-7695-4126-6
Type
conf
DOI
10.1109/SCC.2010.26
Filename
5557238
Link To Document