面向服务的无线传感器网络中的服务组合
Service Composition in Service-Oriented Wireless Sensor Networks with Persistent Queries
摘要：
面向服务的无线传感器网络（WSN）是近年来提出的一种快速发展应用的体系结构。在无线传感器网络中，查询任务可能需要一组服务，并且可以在其生命周期内以给定的频率重复执行。对于这种持久查询任务的每次执行，应提供服务组合解决方案。由于节能策略，一些传感器可以被周期性地调度为处于睡眠方式。因此，服务组合解决方案在持久查询的生命周期内可能并不总是有效的。当一个查询任务需要在一个新的服务组合解决方案进行，路由更新过程涉及消耗能量。在本文中，我们研究的服务组合设计，最大限度地减少服务组合解决方案的数量在一个持久查询的生命周期。我们的目标也是最小化的总服务组合成本时，所需的服务组合解决方案的最小数量。分别提出了贪心算法和动态规划算法来完成这两个目标。这两种算法的最优性提供了服务组合解决方案的持久性查询，以最小的能量消耗。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
