Abstract
In densely deployed wireless sensor networks, spatial data correlations are introduced by the observations of multiple spatially proximal sensor nodes on a same phenomenon or event. These correlations bring significant potential advantages for the development of efficient strategies for reducing energy consumption. In this paper, spatial data correlations are exploited to design clusterbased routing algorithms of high data aggregation efficiency. We define the problem of selecting the set of cluster heads as the weighted connected dominating set problem. Then we develop a set of centralized approximation algorithms to select the cluster heads. Simulation results demonstrate the effectiveness and efficiency of the designed algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
