Asset Details
Do you wish to reserve the book?
Compressive sensing techniques based on secure data aggregation in WSNs
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Compressive sensing techniques based on secure data aggregation in WSNs
Do you wish to request the book?
Compressive sensing techniques based on secure data aggregation in WSNs
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Compressive sensing techniques based on secure data aggregation in WSNs
2025
Overview
This research paper presents an efficient data collection scheme for Wireless Sensor Networks (WSNs) that simultaneously compresses and encrypts sensor data to extend network lifespan. To address WSN resource limitations, the scheme combines Compressive Sensing (CS) with Elliptic Curve Cryptography (ECC) and Elliptic Curve Diffie–Hellman (ECDH) key exchange. Sensor data is securely compressed and encrypted using ECC-based public key mechanisms, mitigating CS-related attacks during aggregation and transmission. The measurement matrix seed serves as a private key that is exchangeed between sensor nodes and the base station, enhancing both security and efficiency. A prime-number-based Tree Path Identifier (TPID) routing and Cluster Head (CH) selection strategy is employed to optimize communication. Seven CS algorithms—including Orthogonal Matching Pursuit (OMP), Binary Compressive Sensing (BCS), Subspace Pursuits (SP), Approximate Message Passing (AMP), Split Bregman Iterative (SBI), Basis Pursuit (BP) and Compressive Sampling Matching Pursuit (CoSaMP) algorithms—are evaluated across various data sparsity levels. Results show that SP, AMP, and SBI algorithms outperform others in preserving energy, extending network life, and delaying the First Dead Node (FDN) appearance. Performance metrics include residual energy, network lifetime, total energy dissipation, and throughput. Energy savings confirm the superiority of the proposed hybrid scheme over traditional CS algorithms.
Publisher
Nature Publishing Group UK,Nature Publishing Group,Nature Portfolio
