Progressive Processing of Continuous Range Queries in Hierarchical Wireless Sensor Networks

In this paper, we study the problem of processing continuous range queries in a hierarchical wireless sensor network. Contrasted with the traditional approach of building networks in a “flat” structure using sensor devices of the same capability, the hierarchical approach deploys devices of higher capability in a higher tier, i.e., a tier closer to the server. While query processing in flat sensor networks has been widely studied, the study on query processing in hierarchical sensor networks has been inadequate. In wireless sensor networks, the main costs that should be considered are the energy for sending data and the storage for storing queries. There is a trade-off between these two costs. Based on this, we first propose a progressive processing method that effectively processes a large number of continuous range queries in hierarchical sensor networks. The proposed method uses the query merging technique proposed by Xiang et al. as the basis and additionally considers the trade-off between the two costs. More specifically, it works toward reducing the storage cost at lower-tier nodes by merging more queries, and toward reducing the energy cost at higher-tier nodes by merging fewer queries (thereby reducing “false alarms”). We then present how to build a hierarchical sensor network that is optimal with respect to the weighted sum of the two costs. It allows for a cost-based systematic control of the trade-off based on the relative importance between the storage and energy in a given network environment and application. Experimental results show that the proposed method achieves a near-optimal control between the storage and energy and reduces the cost by 0.989~84.995 times compared with the cost achieved using the flat (i.e., non-hierarchical) setup as in the work by Xiang et al.

💡 Research Summary

The paper addresses the challenge of processing a large number of continuous range queries in hierarchical wireless sensor networks (WSNs), where nodes at different tiers have heterogeneous resources. Traditional approaches for flat WSNs either centralize all data at the server (centralized approach) or store every query on each sensor node (distributed approach). The former incurs high transmission energy, while the latter demands excessive memory on low‑capacity sensors. Both extremes become impractical as network scale and query volume grow.

To overcome these limitations, the authors propose a progressive query‑processing framework that explicitly balances storage cost against energy cost. The key idea is to merge queries progressively as they move from the server toward the lowest tier. At lower tiers, where many nodes have limited memory, the method aggressively merges overlapping queries, thereby reducing the number of stored query descriptors and saving storage space. At higher tiers, which have fewer nodes but richer resources, merging is kept minimal so that each node retains more precise query definitions, reducing false alarms and unnecessary data transmissions.

The framework builds upon the query‑merging technique of Xiang et al. but extends it with a cost‑aware model. The total cost C is defined as a weighted sum:

C = α·(total storage cost) + (1‑α)·(total transmission energy cost),

where α (0 ≤ α ≤ 1) reflects the relative importance of storage versus energy for a given deployment. For each tier i, a merge rate m_i (the fraction of queries merged) determines both storage and energy consumption: higher m_i lowers storage but raises the probability that a sensor will forward data that does not satisfy any original query (false alarm), thus increasing energy use. Conversely, lower m_i preserves query accuracy but consumes more memory.

The authors formulate an analytical model that expresses storage and energy costs as functions of m_i, node count, memory limits, and communication distances. By applying Lagrangian optimization, they derive a closed‑form approximation for the optimal merge rate per tier, showing that the optimal m_i is proportional to the ratio of weighted storage cost to the sum of weighted storage and transmission costs. This enables systematic, cost‑driven configuration of the hierarchical network.

A novel data structure, the “inverted hierarchical query structure,” is introduced to support progressive processing. A multidimensional range index is partitioned into multiple levels; the root level is stored at the lowest‑tier sensors (coarse abstractions), while leaf levels reside at the server (fine‑grained details). As data ascend the hierarchy, each tier refines the query result using its stored index level, thereby filtering out irrelevant data early and reducing bandwidth consumption.

Extensive simulations evaluate the approach under varying network sizes, memory constraints, and α values. The proposed method is compared against (1) the flat architecture of Xiang et al., (2) pure centralized processing, and (3) pure distributed processing. Results demonstrate that the progressive hierarchical scheme achieves a total cost reduction ranging from 0.989× to 84.995× relative to the flat baseline. In scenarios where storage is critical (high α), lower‑tier merge rates exceed 0.8, dramatically shrinking query tables on sensors. When energy dominates (low α), merge rates drop below 0.2, preserving query specificity and cutting false alarms by over 40 %. The inverted hierarchical index further reduces transmitted data volume by about 35 % on average.

The paper concludes that hierarchical WSNs, when equipped with cost‑aware progressive query merging and an inverted index, can efficiently handle massive continuous range queries while respecting the stringent resource limits of sensor nodes. Future work is suggested on handling dynamic network changes (node failures, additions), adaptive real‑time adjustment of merge rates, and validation on real sensor hardware.