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

作者：Li Guilin; Gao Xing^*; Liao Minghong; Han Bing

来源：International Journal of Embedded Systems, 2015, 7(1): 26-33.

DOI：10.1504/IJES.2015.066139

• In-network aggregation
• Iterative algorithm
• Top-k query
• Top-k query processing
• Trace backs

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.

• 出版日期2015
• 单位厦门大学