Conference Paper

Service Composition in Service-Oriented Wireless Sensor Networks with Persistent Queries

Dept. of Comput. Sci., Univ. of Sci. & Technol. of China, Hefei
DOI: 10.1109/CCNC.2009.4784868 Conference: Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE
Source: arXiv


Service-oriented wireless sensor network (WSN) has been recently proposed as an architecture to rapidly develop applications in WSNs. In WSNs, a query task may require a set of services and may be carried out repetitively with a given frequency during its lifetime. A service composition solution shall be provided for each execution of such a persistent query task. Due to the energy saving strategy, some sensors may be scheduled to be in sleep mode periodically. Thus, a service composition solution may not always be valid during the lifetime of a persistent query. When a query task needs to be conducted over a new service composition solution, a routing update procedure is involved which consumes energy. In this paper, we study service composition design which minimizes the number of service composition solutions during the lifetime of a persistent query. We also aim to minimize the total service composition cost when the minimum number of required service composition solutions is derived. A greedy algorithm and a dynamic programming algorithm are proposed to complete these two objectives respectively. The optimality of both algorithms provides the service composition solutions for a persistent query with minimum energy consumption.

Download full-text


Available from: Zeyu Zheng, Mar 05, 2015
  • Source
    • "The eight requirement is the ability to select sensor nodes for application tasks. When multiple applications concurrently utilize a deployed WSN, selection of proper sensor nodes is very important because applications may have spatial and temporal requirements [21]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Networks (WSNs) are the key components of the emerging Internet-of-Things (IoT) paradigm. They are now ubiquitous and used in a plurality of application domains. WSNs are still domain specific and usually deployed to support a specific application. However, as WSN nodes are becoming more and more powerful, it is getting more and more pertinent to research how multiple applications could share a very same WSN infrastructure. Virtualization is a technology that can potentially enable this sharing. This paper is a survey on WSN virtualization. It provides a comprehensive review of the state-of-the-art and an in-depth discussion of the research issues. We introduce the basics of WSN virtualization and motivate its pertinence with carefully selected scenarios. Existing works are presented in detail and critically evaluated using a set of requirements derived from the scenarios. The pertinent research projects are also reviewed. Several research issues are also discussed with hints on how they could be tackled.
    Full-text · Article · Mar 2015 · IEEE Communications Surveys & Tutorials
  • Source
    • "Furthermore, they only consider the sleep scheduling design for the sensors in the service provider overlay network and neglect the routing cost of service data. Authors of [14] try to identify the service composition that is less likely to be invalid in the near future due to nodes going to sleep mode. The goal is to minimize the recomposition cost. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The service-oriented architecture is considered as a new emerging trend for the future of wireless sensor networks in which different types of sensors can be deployed in the same area to support various service requirements. The accuracy of the sensed data is one of the key criterions because it is generally a noisy version of the physical phenomenon. In this paper, we study the node selection problem with data accuracy guarantee in service-oriented wireless sensor networks. We exploit the spatial correlation between the service data and aim at selecting minimum number of nodes to provide services with data accuracy guaranteed. Firstly, we have formulated this problem into an integer nonlinear programming problem to illustrate its NP-hard property. Secondarily, we have proposed two heuristic algorithms, namely, Separate Selection Algorithm (SSA) and Combined Selection Algorithm (CSA). The SSA is designed to select nodes for each service in a separate way, and the CSA is designed to select nodes according to their contribution increment. Finally, we compare the performance of the proposed algorithms with extended simulations. The results show that CSA has better performance compared with SSA.
    Full-text · Article · Apr 2013 · International Journal of Distributed Sensor Networks
  • Source
    • "[6] the authors studied service composition design which minimizes the number of service composition solutions during the lifetime of a persistent query. In [7] the authors presented an approach to integrate WSNs seamlessly into business process environments using BPEL and Web Services while using only very few resources on the sensor nodes. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Service Oriented Architecture has gained significant attention as programming model for heterogeneous wireless sensor networks. Its key idea is to exploit the decoupling of service providers and consumers to enable platform independent applications that are dynamically bound to platform specific services. The promise of service oriented architecture is to enable the composition of new distributed applications/solutions: when no available service can satisfy a client request, available services can be composed in order to satisfy such a request. In this paper we explore a simple approach to create service graph on-demand for service composition in service oriented wireless sensor network based on input/output dependency between services. The proposed algorithm ASSG (Automatic Service Graph Generation) discovers abstract services that satisfies user constraints and identifies the relationship between these services. Based on this service graph is generated. The application of this method is discussed with an example. Simulation results prove that our proposed algorithm increases success ratio and reduces service composition time. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICCTSD 2011
    Full-text · Article · Dec 2012 · Procedia Engineering
Show more