Both wireless sensor networks and service-oriented architectures (SOA) are very popular distributed computing paradigm. Web\r\nservice is a widely accepted implementation of SOA. However, web service is based on Internet protocols and requires adaptation\r\nto suit the restrictions posed by WSNs. The development of Internet of Things has triggered research of web services of WSNs\r\nwhich made the consolidation of these technologies possible. At the same time, web service integration enables the support of\r\nmore functionalities since many applications rely on not just one web service, but a whole school of them.Thus, how to compose\r\nand integrate different web services efficiently to provide complicated services becomes an essential topic. This paper investigates a\r\nproblem which minimizes the number of hops of web services while integrating these web services to finish a set of tasks.We call\r\nthis problemMinimumHops of Service Integration Problem. It is proved that, when there are no precedence relationships between\r\nthe tasks, the decision problem is NP-complete. This implies that this web services integration problem is NP-hard. For the case\r\nwhen the relationships between the tasks are in linear order, a polynomial-time, optimal web service integration algorithm, using\r\ngreedy strategy, is provided.
Loading....