A selection algorithm for composing Web services in sensor network

Abstract

Web services and sensor networks have been undergoing tremendous growth during the past few years. Integrating web services technology to sensor networks domain offers many advantages. For example, the existing Internet protocols can be used instead of designing proprietary ones, 3rd party can deliver value-added web services to end users easily, etc. However, wireless sensor networks are constrained by limited system resources, such as memory, power, and computation capacity. In this thesis, we propose a web service selection algorithm by introducing QoS-based cost function concept. The mechanism we used is choosing only a few web services from each service community according to their cost function. Then we compose them together to find the optimal composite service. The proposed selection algorithm consumes only limited system resources and has the characteristics of efficiency, dynamics, and fault tolerance. It guarantees the composed web service has the optimal performance in terms of cost function.