Service composition in service-oriented wireless sensor networks with persistent queries

Authors:
Xiumin Wang;Jianping Wang;Zeyu Zheng;Yinlong Xu;Mei Yang
Affiliations:
Department of Computer Science, University of Science and Technology of China, China and Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, University of Science and Technology of China, China;Department of Computer Science, University of Science and Technology of China, China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Electrical and Computer Engineering, University of Nevada, Las Vegas
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 6
Cited 0

QoS-Assured Service Composition in Managed Service Overlay Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Operator placement for in-network stream query processing

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Greedy is Good: On Service Tree Placement for In-Network Stream Processing

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Cross-layer application-specific wireless sensor network design with single-channel CSMA MAC over sense-sleep trees

Computer Communications
Service-Oriented Sensor-Actuator Networks [Ad Hoc and Sensor Networks]

IEEE Communications Magazine
A service-centric model for wireless sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.