Connected sensor cover self organization

Spatial query execution is a crucial functionality of sensor networks, focusing on gathering data from specific geographic regions. Reducing communication costs is vital, as it leads to efficient battery energy usage, which is limited in sensors. This study proposes a method to self-organize sensor networks in response to queries, utilizing algorithms that form a topology consisting of a minimal subset of necessary sensors. We introduce the concept of a connected sensor cover and design a centralized approximation algorithm that constructs a near-optimal topology. Our analysis demonstrates that the size of this constructed topology remains within an O(log n) factor of the optimal size, where n represents the network size. Additionally, we develop a distributed self-organization algorithm that enhances energy efficiency while minimizing communication overhead. We also present an alternative distributed algorithm based on node priorities, capable of lowering communication costs further but lacking guarantees on the size of the constructed sensor cover. Extensive simulations validate our algorithms, showcasing significant reductions in communication costs while executing spatial queries. These findings illustrate the effectiveness of self-organization in optimizing sensor network performance.