Compressive Data Gathering Scheme Research Articles

Compressive Data Gathering With Generative Adversarial Networks for Wireless Geophone Networks

In modern seismic data acquisition, real-time data collection is a challenging task due to bandwidth limitations in wireless communications. In this letter, we propose a novel compressive data gathering scheme using generative adversarial networks, named GAN-CDG, to improve the efficiency of data gathering. Instead of collecting the originally acquired data, GAN-CDG gathers data projections in wireless geophone networks. Data compression and load-balanced relay transmission are utilized during the projection process. To speed up the formation of projections, the shortest path routing tree (SPRT) is constructed, which achieves the minimum end-to-end time delay. The sparse domain of seismic signals and its reconstruction mapping are learned by sparsity-constrained adversarial networks. The testing results demonstrate that projections with high compression ratios (e.g., 16) are gathered efficiently with the SPRT. Then, original seismic signals can be reconstructed accurately (over 30 dB) from the projections using the adversarial model, which outperforms the state-of-the-art method.

A Kernel-Based Compressive Sensing Approach for Mobile Data Gathering in Wireless Sensor Network Systems

The recent advances of compressive sensing (CS) have witnessed a great potential of efficient compressive data gathering (CDG) in wireless sensor network systems (WSNSs). However, most existing work on CDG mainly focuses on multihop relaying strategies to improve the performance of data gathering. In this paper, we propose a mobile CDG scheme including a random walk-based algorithm and a kernel-based method for sparsifying sensory data from irregular deployments. The proposed scheme allows a mobile collector to harvest data by sequentially visiting a number of nodes along a random path. More importantly, toward building the gap between CS and machine learning theories, we explore a theoretical foundation for understanding the feasibility of the proposed scheme. We prove that the CS matrices, constructed from the proposed random walk algorithm combined with a kernel-based sparsity basis, satisfy the restricted isometry property. Particularly, we also show that m = O(klog(n/k)) measurements collected by a mobile collector are sufficient to recover a k-sparse signal and t = O(klog(n/k)) steps are required to collect these measurements in a network with n nodes. Finally, we also present extensive numerical results to validate the effectiveness of the proposed scheme by evaluating the performance in terms of energy consumption and the impact of packet losses. The numerical results demonstrate that the proposed scheme is able to not only significantly reduce communication cost but also combat unreliable wireless links under various packet losses compared to the stateof-the-art schemes, which provides an efficient alternative to data relaying approaches for CDG in WSNS.

Data ferries based compressive data gathering for wireless sensor networks

The latest research progress of the theory of compressive sensing (CS) over graphs makes it possible that the advantage of CS can be utilized by data ferries to gather data for wireless sensor networks. In this paper, we leverage the non-uniform distribution of the sensing data field to significantly reduce the required number of data ferries, yet ensuring the recovered data quality. Specially, we propose an intelligent compressive data gathering scheme consisting of an efficient stopping criterion and a novel learning strategy. The proposed stopping criterion is based only on the gathered data, without relying on the priori knowledge on the sparsity of unknown sensing data. Our learning strategy minimizes the number of data ferries while guaranteeing the data quality by learning the statistical distribution of the gathered data. Simulation results show that the proposed scheme improves the reconstruction accuracy and stability compared to the existing ones.

Design of a compressive data gathering scheme with an energy efficient reconstruction algorithm for wsn

Design of a compressive data gathering scheme with an energy efficient reconstruction algorithm for wsn

An efficient privacy-preserving compressive data gathering scheme in WSNs

Because of the strict energy limitation and the common vulnerability of Wireless Sensor Networks (WSNs), providing efficient and secure data gathering in WSNs becomes an essential problem. Compressive data gathering, which is based on the recent breakthroughs in compressive sensing theory, has been proposed as a viable approach for data gathering in WSNs at low communication overhead. Nevertheless, compressive data gathering is susceptible to various attacks in the presence of the open wireless medium. In this paper, we propose a novel Efficient Privacy-Preserving Compressive Data Gathering Scheme, which exploits homomorphic encryption functions in compressive data gathering to thwart the traffic analysis/flow tracing and realize the privacy preservation. This allows the proposed scheme to possess the two important privacy-preserving features of message flow untraceability and message content confidentiality. Extensive performance evaluations and security analyses demonstrate the validity and efficiency of the proposed scheme.

Sparsest Random Scheduling for Compressive Data Gathering in Wireless Sensor Networks

Compressive sensing (CS)-based in-network data processing is a promising approach to reduce packet transmission in wireless sensor networks. Existing CS-based data gathering methods require a large number of sensors involved in each CS measurement gathering, leading to the relatively high data transmission cost. In this paper, we propose a sparsest random scheduling for compressive data gathering scheme, which decreases each measurement transmission cost from O(N) to O(log(N)) without increasing the number of CS measurements as well. In our scheme, we present a sparsest measurement matrix, where each row has only one nonzero entry. To satisfy the restricted isometric property, we propose a design method for representation basis, which is properly generated according to the sparsest measurement matrix and sensory data. With extensive experiments over real sensory data of CitySee, we demonstrate that our scheme can recover the real sensory data accurately. Surprisingly, our scheme outperforms the dense measurement matrix with a discrete cosine transformation basis over 5 dB on data recovery quality. Simulation results also show that our scheme reduces almost 10 × energy consumption compared with the dense measurement matrix for CS-based data gathering.