An iterative algorithm to process the top-k query for the wireless sensor networks
by Guilin Li; Xing Gao; Minghong Liao; Bing Han
International Journal of Embedded Systems (IJES), Vol. 7, No. 1, 2015

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.

Online publication date: Wed, 03-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com