Data Aggregation Scheme based on Compressed Sensing in Wireless Sensor Network

@inproceedings{Yang2012DataAS,
  title={Data Aggregation Scheme based on Compressed Sensing in Wireless Sensor Network},
  author={Guangsong Yang and Mingbo Xiao and Shuqin Zhang},
  booktitle={J. Networks},
  year={2012}
}
Wireless sensor network (WSN) consisting of a large number of nodes, are usually deployed in a large region for environmental monitoring, security and surveillance. The data collected through high densely distributed WSN is immense. To improve measure accuracy and prolong network lifetime, reducing data traffic is needed. Compressive sensing (CS) is a novel approach to achieve much lower sampling rate for sparse signals . In order to reduce the number of data transmissions and save more energy… 

Figures from this paper

Performance Analysis of Threshold Based Compressive Sensing Algorithm in Wireless Sensor Network
TLDR
Results indicate that compressive sensing with suitable threshold selection improves transmission and bandwidth efficiency in case of low correlated one dimensional sensor data and a suitable basis improves the quality of transmission for image sensorData and hence the overall lifetime of sensor network can be increased.
Lifting Wavelet Compression Based Data Aggregation in Big Data Wireless Sensor Networks
TLDR
A novel energy-efficient dynamic clustering algorithm by utilizing spatial correlation, which can achieve a distributed compressive data aggregation in each cluster head and a distributed fast data compression approach based on eliminable lifting wavelet to reduce the amount of raw data.
Design and Analysis of Compressive Data Persistence in Large-Scale Wireless Sensor Networks
TLDR
This paper addresses the data persistence problem in wireless sensor networks (WSNs) where static sinks are not present and the sensed data have to be temporarily but resiliently stored in the network and discovers that there is a trade-off between the number of random walk instances and steps.
Energy-Efficient Distributed Compressed Sensing Data Aggregation for Cluster-Based Underwater Acoustic Sensor Networks
TLDR
This paper introduces a distributed compressed sensing model for a cluster-based underwater acoustic sensor network in which spatial and temporal correlations are both considered and proposes two schemes, namely, BUTM-DCS and BDM-DCS, based on the design of observation matrix with strictly restricted isometric property.
Dealing with Dynamic-Scale of Events: Matrix Recovery Based Compressive Data Gathering for Sensor Networks
TLDR
Results with real sensor datasets indicate that the proposed method could recover the original data with event readings almost unaltered, and generally achieve SNR 10 times better than typical compressive sensing method, while keeping the communication overhead as low as compressing sensing based data gathering method.
Analysis of suitable modulation scheme for compressive sensing algorithm in wireless sensor network
TLDR
This work concentrated on the algorithm performance with different modulation schemes and different channel conditions to find out the use of compressive sensing (CS) algorithm for wireless sensor networks (WSNs).
Compressed sensing for optimising connectivity in FANET architecture
TLDR
In this paper, sparsity in form of number of UAVs is exploited and compressed sensing is implemented on coordination information which is shared between nodes.
MRCS: matrix recovery-based communication-efficient compressive sampling on temporal-spatial data of dynamic-scale sparsity in large-scale environmental IoT networks
TLDR
A new attempt to tackle both problems at the same time from theoretical design to practical experiments and validate in real environmental datasets by exploiting data correlation at both temporal and spatial domains and providing a cross-domain basis to collect data and a low-rank matrix recovery design to recover the data.
MOBILE SINK BASED NLEACH PROTOCOL BY USING ANT COLONY OPTIMIZATION
TLDR
Inter-cluster ACO algorithm will be used that build upon ACO algorithms for routing of data packets in the network and an attempt has been made to minimize the efforts wasted in transferring the redundant data sent by the sensors which lie in the performance of NLEACH protocol.
Compression based Energy aware routing algorithm
TLDR
This paper analyzes the performance of compression based energy aware routing algorithm for wireless sensor networks by using data compression as it has the highest effect on the energy usage.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Compressive data gathering for large-scale wireless sensor networks
TLDR
This paper presents the first complete design to apply compressive sampling theory to sensor data gathering for large-scale wireless sensor networks and shows the efficiency and robustness of the proposed scheme.
Energy efficient information collection in wireless sensor networks using adaptive compressive sensing
TLDR
An adaptive algorithm is proposed, based on the recently developed theory of adaptive compressive sensing, to collect information from WSNs in an energy efficient manner and to perform “projections” iteratively to maximise the amount of information gain per energy expenditure.
Does Compressed Sensing Improve the Throughput of Wireless Sensor Networks?
TLDR
This paper proposes two different ways (plain-CS and hybrid-CS) of applying CS to WSNs at the networking layer, in the form of a particular data aggregation mechanism, and illustrates two crucial insights: first, applying CS naively may not bring any improvement, and secondly, the hybrids can achieve significant improvement in throughput.
The application of compressed sensing in wireless sensor network
TLDR
The compressed sensing theory is introduced and the delay in this system is analyzed to improve the prior classical formulas due to the great advantage of capabilities of compressing data in large scale wireless network.
Compressive wireless sensing
TLDR
This paper proposes a distributed matched source-channel communication scheme, based in part on recent results in compressive sampling theory, for estimation of sensed data at the fusion center and analyzes the trade-offs between power, distortion and latency.
Compressed data aggregation for energy efficient wireless sensor networks
  • Liu Xiang, Jun Luo, A. Vasilakos
  • Computer Science
    2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
  • 2011
TLDR
This paper investigates the application of CS to data collection in wireless sensor networks, and aims at minimizing the network energy consumption through joint routing and compressed aggregation, and proposes a mixed-integer programming formulation along with a greedy heuristic.
Sparse Data Aggregation in Sensor Networks
TLDR
This work shows how to build nearly optimal aggregation structures that can further deal with network volatility and compensate for the loss or duplication of data by exploiting probabilistic techniques.
Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks
TLDR
It is shown that joint reconstruction provides significantly better reconstruction than independent reconstruction, and a metric of energy overlap between clusters and basis functions that allows us to characterize the gains of joint reconstruction for different basis functions is proposed.
Wireless Sensor Network -A Survey
TLDR
In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network.
Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks
TLDR
The algorithm is effective at finding everywhere sparse, asymptotically optimal, integral solutions to the MLDA problem, when the initial available energy of the sensors is sufficient for supporting optimal system lifetime which is ω(<i>n</i>).
...
...