Issue No. 04 - Oct.-Dec. (2013 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2012.26
Sahin Cem Geyik , Rensselaer Polytechnic Institute, Troy
Boleslaw K. Szymanski , Rensselaer Polytechnic Institute, Troy
Petros Zerfos , IBM T.J. Watson Research Center, Hawthorne
Service modeling and service composition are software architecture paradigms that have been used extensively in web services where there is an abundance of resources. They mainly capture the idea that advanced functionality can be realized by combining a set of primitive services provided by the system. Many efforts in web services domain focused on detecting the initial composition, which is then followed for the rest of service operation. In sensor networks, however, communication among nodes is error-prone and unreliable, while sensor nodes have constrained resources. This dynamic environment requires a continuous adaptation of the composition of a complex service. In this paper, we first propose a graph-based formulation for modeling 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 and show that it is NP-complete. Two heuristic methods are proposed to solve the composition problem: the top-down and the bottom-up approaches. We discuss centralized and distributed implementations of these methods. Finally, using ns-2 simulations, we evaluate the performance and overhead of our proposed methods.
Web services, Robustness, Cameras, Adaptation models, Bandwidth, Optimization, Heuristic algorithms
S. C. Geyik, B. K. Szymanski and P. Zerfos, "Robust Dynamic Service Composition in Sensor Networks," in IEEE Transactions on Services Computing, vol. 6, no. 4, pp. 560-572, 2013.