City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science  >
CS - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: The temporal issues in query processing in wireless sensor networks
Other Titles: Wu xian chuan gan qi wang luo zhong cha xun chu li de shi xu wen ti
Authors: Pang, Chi Wai (彭志偉)
Department: Dept. of Computer Science
Degree: Master of Philosophy
Issue Date: 2005
Publisher: City University of Hong Kong
Subjects: Sensor networks
Wireless LANs
Notes: CityU Call Number: TK7872.D48.P36 2005
Includes bibliographical references (leaves 79-82)
Thesis (M.Phil.)--City University of Hong Kong, 2005
ix, 82 leaves : ill. ; 30 cm.
Type: Thesis
Abstract: In this thesis, we study the important issues in query processing in a wireless sensor system in which sensor nodes are distributed to monitor the events occurred in the environment. Each sensor node maintains a database, called sensor database [MFH02], for the sensor data of its own as well as aggregated/derived data. The processing issues of various types of queries, such as real-time queries and continuous queries, are studied. In this thesis, we focus on the correctness issues in query results and the issues of minimizing data aggregation cost in query processing. We first study the correctness issue in processing continuous monitoring queries (CMQ) on sensor data values. Sensor data values are continuously generated from a sensor node. To ensure the correctness of query results, we adopt temporal consistency as the correctness criterion in accessing sensor data values from different sensor nodes. Then we propose a sequential aggregation scheme to minimize the aggregation overhead and processing overhead for data aggregation in execution of a CMQ. To demonstrate the efficiency of the proposed sequential aggregation scheme and study the implementation issue of this scheme, we have developed a prototype system using MICA Motes in which the sequential scheme is implemented and compared with a parallel aggregation scheme. Since the main purpose of an important application of sensor query processing is to generate timely reaction to respond to the critical events occurred in the system environment, real-time query is commonly used in such environment. Each real-time query is associated with a deadline on its completion time and it is an important performance objective to meet the deadline. Otherwise, the generation of timely responses can not be guaranteed. We extend the temporal consistency model and propose the Parallel Data Shipping with Priority Transmission (PAST) to meet the deadline of query and at the same time to maintain temporal consistency in its execution with minimum data transmission cost. Finally, we study the reliability issue in aggregating data versions for execution of real-time queries in a wireless sensor network in which the probability of data loss is high due to noises. In order to increase the reliability in aggregating data versions, we extend the Parallel Data Shipping with Priority Transmission (PAST) scheme to be workload sensitive (the new algorithm is called PAST with Workload Sensitivity (PAST-WS)) in selecting the coordinator node and the paths for transmitting the data from the participating nodes to the coordinator node for execution. PAST-WS considers the workload at each relay node to minimize the total cost and delay in data transmission.
Online Catalog Link:
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer