Implementing top-k query in duty-cycled wireless sensor networks

Abstract

Top-k query is a very useful and important query in wireless sensor networks (WSNs), aiming to find the k nodes with highest readings among the sensor nodes. In WSNs, there are generally two kinds of networks: always-on WSNs (AO-WSNs) in which sensors always keep awake and duty-cycled WSNs (DC-WSNs) where sensors dynamically sleep and wake. To the best of our knowledge, there are a lot of work about top-k query in AO-WSNs but little research has been done regarding top-k query in DC-WSNs. However, DC-WSN is a very practical network model in which energy consumption can be greatly saved. In this paper, we analyze the research issues when implementing top-k query in DC-WSNs and propose the DCDC-WSNs (DC-WSNs with data replication (DR) and connected k-neighborhood (CKN)) to implement top-k query. Further theoretical analysis and simulation results show that implementing top-k query in DCDC-WSNs can achieve the best tradeoff with respect to query data accessibility and query cost (total energy consumption, query response time), compared with AO-WSNs and DCC-WSNs (DC-WSNs with only CKN).