Improving Data Integrity with Randomness – A Compressive Sensing Approach
نویسندگان
چکیده
Data loss in wireless sensor systems is inevitable, either due to exogenous (such as transmission medium impediments) or endogenous (such as faulty sensors) causes. While there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensing (CS) enable a new perspective. Since many natural signals are compressible, it is possible to employ CS, not only to reduce the effective sampling rate, but to improve the robustness of the system at a given Quality of Information (QoI). This is possible because reconstruction algorithms for compressively sampled signals are not hampered by the stochastic nature of wireless link disturbances and sensor malfunctions, which has traditionally plagued attempts at proactively handling the effects of these errors. In this paper, we show how reconstruction error remains unchanged despite extreme independent data losses by marginally increasing the average sampling rate. We also show that a simple re-ordering of samples prior to communication could enable successful reconstruction when losses display bursty behavior. The problem we seek to address is acquiring an n-length vector f ∈ R at a sensor node such that it can be recovered accurately at a base station one or more wireless hops away. Realistically, data losses creep into the system owing to two inevitable circumstances – wireless link quality variations because of noise and interference and temporary sensor faults1. To cope with these issues, reactive schemes like retransmissions (end-to-end or hop-by-hop) have been popularly employed. Proactive schemes such as error correcting codes have also been used, though in a limited sense. In this short paper, we introduce how recent developments in the area of Compressive Sensing (CS) [2] enable a low-encoding complexity, proactive sensing approach that can easily be made robust to even extreme data losses. Utilizing the fact that CS strategies make inherent use of randomness within the sensing process, we surmise that data lost through the stochastic nature of an erasure channel is indistinguishable from an a priori lower sensing rate at the fusion center. We verify this conjecture empirically and show that it is sufficient to proactively increase the sampling rate in order to maintain reconstruction accuracy.
منابع مشابه
STCS-GAF: Spatio-Temporal Compressive Sensing in Wireless Sensor Networks- A GAF-Based Approach
Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to t...
متن کاملWhen is missing data recoverable?
Suppose a non-random portion of a data vector is missing. With some minimal prior knowledge about the data vector, can we recover the missing portion from the available one? In this paper, we consider a linear programming approach to this problem, present numerical evidence suggesting the effectiveness and limitation of this approach, and give deterministic conditions that guarantee a successfu...
متن کاملWireless Sensing, Active Learning, and Compressive Sampling
Wireless sensor networks promise a fundamentally new approach for gathering information about the physical world via a distributed network of sensors that can communicate with each other and/or with a (usually distant) fusion center through radio-frequency wireless links. Limited energy resources make power conservation essential in these envisioned sensing systems. Thus, it becomes crucial to ...
متن کاملSwarm Intelligent Compressive Routing in Wireless Sensor Networks
This paper proposes a novel algorithm to improve the lifetime of a wireless sensor network. This algorithm employs Swarm Intelligence algorithms in conjunction with compressive sensing theory to build up the routing trees and to decrease the communication rate respectively. The main contribution of this paper is to extend Swarm Intelligence algorithms to build a routing tree in such a way that ...
متن کاملCompressive Sensing Based Approach to the Design of Linear Robust Sparse Antenna Arrays with Physical Size Constraint
In sparse arrays, the randomness of antenna locations avoids the introduction of grating lobes, while allowing adjacent antenna spacings to be greater than half a wavelength. This means a larger array size can be implemented using a relatively small number of antennas. However, careful consideration has to be given to antenna locations to ensure that an acceptable performance level is achieved....
متن کامل