Spatial queries in IoT-enabled Wireless Sensor Networks enable the interrogation of specific areas using various geometric shapes such as rectangles or circles. Based on how spatial queries have been designed to be processed, the numerous approaches proposed to tackle this issue can be categorized into parallel and serial querying. On one hand, serial approaches have been proven to be more efficient in this context, but on the other hand, they are unable to handle deployments with communication voids. In particular, they fail to visit all nodes located inside the targeted windows, and thus fail to guarantee query completeness/accuracy. To fill this gap, which to the extent of our knowledge has not been addressed by any of the state-of-the-art approaches, we present in this paper, a novel serial approach that has been designed to handle all network topologies, including sparse, dense, large, hole-free, and more specifically topologies with communication voids. The obtained simulation results demonstrate the efficiency of the proposed approach in terms of time and energy, and show that it can ensure the accuracy of window queries under various topology conditions and changes.