Abstract
Among various data aggregation approaches proposed for wireless sensor networks (WSNs), the one based on compressive sensing (CS) has the merit of low traffic cost. The key step to design a CS-based data aggregation protocol is to construct a measurement matrix ${\Phi }$ based on the network structure and to assign each node a unique column vector of ${\Phi }$ . Assuming an expanded scenario, where some new nodes join in the network, the data aggregation scheme has to entirely re-generate a new matrix ${\Phi ^{\prime }}$ with a larger size to meet the node number and CS property simultaneously. Apparently, it is energy-consuming to reallocate the weight vectors from the new measurement matrix to all the nodes. Thus, we propose an approach which aims to keep the weight vectors of existing sensors unchanged but assign only optimized measurement vectors to the newly added nodes. In order to solve the relevant non-convex optimization problem, two efficient methods with good data aggregation performance are proposed. Numeric experiments validate the effectiveness of our proposed methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.