Download the full-sized PDF of Efficient and Reliable In-Network Query Processing in Wireless Sensor NetworksDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

Efficient and Reliable In-Network Query Processing in Wireless Sensor Networks Open Access


Other title
Query Processing
Wireless Sensor Networks
Top-k Query
Failure Recovery
Link Failures
Type of item
Degree grantor
University of Alberta
Author or creator
Malhotra, Baljeet Singh
Supervisor and department
Nikolaidis, Ioanis (Computing Science, University of Alberta)
Nascimento, Mario (Computing Science, University of Alberta)
Examining committee member and department
Rafiei, Davood (Computing Science, University of Alberta)
Musilek, Petr (Electrical and Computer Engineering, University of Alberta)
Harms, Janelle (Computing Science, University of Alberta)
Labrinidis, Alexandros (Computer Science, University of Pittsburgh)
Department of Computing Science

Date accepted
Graduation date
Doctor of Philosophy
Degree level
The Wireless Sensor Networks (WSNs) have emerged as a new paradigm for collecting and processing data from physical environments, such as wild life sanctuaries, large warehouses, and battlefields. Users can access sensor data by issuing queries over the network, e.g., to find what are the 10 highest temperature values in the network. Typically, a WSN operates by constructing a logical topology, such as a spanning tree, built on top of the physical topology of the network. The constructed logical topology is then used to disseminate queries in the network, and also to process and return the results of such queries back to the user. A major challenge in this context is prolonging the network's lifetime that mainly depends on the energy cost of data communication via wireless radios, which is known to be very expensive as compared to the cost of data processing within the network. In this research, we investigate some of the core problems that deal with the different aspects of in-network query processing in WSNs. In that context, we propose an efficient filtering based algorithm for the top-k query processing in WSNs. Through a systematic study of the top-k query processing in WSNs we propose several solutions in this thesis, which are applicable not only to the top-k queries, but also to in-network query processing problems in general. Specifically, we consider broadcasting and convergecasting, which are two basic operations that are required by many in-network query processing solutions. Scheduling broadcasting and convergecasting is another problem that is important for energy efficiency in WSNs. Failure of communication links, which are common in WSNs, is yet another important issue that needs to be addressed. In this research, we take a holistic approach to deal with the above problems while processing the top-k queries in WSNs. To this end, the thesis makes several contributions. In particular, our proposed solutions include new logical topologies, scheduling algorithms, and an overall sophisticated communication framework, which allows to process the top-k queries efficiently and with increased reliability. Extensive simulation studies reveal that our solutions are not only energy efficient, saving up to 50% of the energy cost as compared to the current state-of-the-art solutions, but they are also robust to link failures.
License granted by Baljeet Malhotra ( on 2010-08-27T09:07:08Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 1018361
Last modified: 2015:10:12 20:05:45-06:00
Filename: thesis.pdf
Original checksum: ff6a8b869d097e8bb35dda582396cf3d
Well formed: true
Valid: true
Page count: 138
Activity of users you follow
User Activity Date