Title: An iterative algorithm to process the top-k query for the wireless sensor networks

Authors: Guilin Li; Xing Gao; Minghong Liao; Bing Han

Addresses: School of Software, Xiamen University, Xiamen, Fujian, China ' School of Software, Xiamen University, Xiamen, Fujian, China ' School of Software, Xiamen University, Xiamen, Fujian, China ' School of Software, Xiamen University, Xiamen, Fujian, China

Abstract: The top-k query is an important type of query for the wireless sensor network. In this paper, we present an iterative algorithm to process the top-k query, which is a distributed algorithm combining the in-network aggregation and the trace back techniques. By using the in-network aggregation technique, the iterative algorithm calculates the current maximum value in the network. By using the trace back technology, the maximum value just calculated is removed from the network. The two steps are repeated k times. As the current maximum value in the network is selected per round, the answer to a top-k query can be obtained after k repetitions. Experimental results show that the iterative algorithm can reduce the number of messages transmitted during the procedure of the top-k query processing.

Keywords: top-k queries; in-network aggregation; trace back; iterative algorithm; wireless sensor networks; WSNs; query processing.

DOI: 10.1504/IJES.2015.066139

International Journal of Embedded Systems, 2015 Vol.7 No.1, pp.26 - 33

Received: 17 Apr 2014
Accepted: 22 Apr 2014

Published online: 03 Dec 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article