Efficient compressive sampling of spatially sparse fields in wireless sensor networks
 Stefania Colonnese^{1},
 Roberto Cusani^{1},
 Stefano Rinauro^{1}Email author,
 Giorgia Ruggiero^{1} and
 Gaetano Scarano^{1}
https://doi.org/10.1186/168761802013136
© Colonnese et al.; licensee Springer. 2013
Received: 17 January 2013
Accepted: 18 July 2013
Published: 12 August 2013
Abstract
Wireless sensor networks (WSNs), i.e., networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, we present a novel bandwidth/energyefficient compressive sampling (CS) scheme for the acquisition of spatially sparse fields in a WSN. The paper contribution is twofold. Firstly, we introduce a sparse, structured CS matrix and analytically show that it allows accurate reconstruction of bidimensional spatially sparse signals, such as those occurring in several surveillance application. Secondly, we analytically evaluate the energy and bandwidth consumption of our CS scheme when it is applied to data acquisition in a WSN. Numerical results demonstrate that our CS scheme achieves significant energy and bandwidth savings with respect to stateoftheart approaches when employed for sensing a spatially sparse field by means of a WSN.
Keywords
1 Introduction
Wireless sensor networks (WSN) consist of autonomous, cooperative sensors spatially deployed over a geographical area, with applications ranging from surveillance [1] and localization systems [2, 3], to environmental monitoring for physical field sensing and disaster prevention [4, 5]. WSN nodes typically acquire the data and communicate them to a node named fusion center (FC), which stores the sensors’ readings or forwards them through wired network infrastructures for further processing.
The availability of energyefficient algorithms for data gathering towards the FC is particularly relevant when the monitoring network is deployed on a large geographical area (e.g., a forest), where highly efficient routing protocols are required for a sustainable network lifetime. Energy efficiency is also relevant in those environments where battery recharge or substitution may be unworkable (e.g., in underwater networks) [6, 7]. On the other hand, efficient exploitation of available bandwidth is an important concern in bandwidthlimited or interferencelimited environments.
The unifying sampling and compression approach of compressive sampling (CS) [8] is definitely well suited to resourcelimited WSNs’ applications. CSbased techniques for energyefficient WSN data gathering have been recently investigated, with particular reference to the tradeoff between reconstruction accuracy and data gathering cost [9]. A highly efficient approach is provided by random sensing (RS), where at each observation time, only a randomly drawn subset of sensors acquires data and transmits them to the FC, typically using singlehop links. From a theoretical point of view, RS and CS share conditions and procedures for signal reconstruction. An energy and bandwidthefficient RS procedure appears in [10].
WSN monitoring applications are often faced with acquisition of spatially sparse signals. A typical example is that of temperaturemonitoring sensor networks for anomalous event (e.g., fire) detection: in the early stages of abnormal system behavior, in which the event is hopefully detected, the field is characterized by one or more small spots at levels largely different from the surroundings, and it can be modeled as a spatially sparse signal. RS schemes, such as those analyzed in [10], poorly perform in sampling signals that are naturally sparse in the spatial domain since the actual number of measurements required to reconstruct the field increases and the RS bandwidth/energy efficiency deteriorates.

We introduce a novel CS matrix and analytically demonstrate that it satisfies the CS conditions for sparse signal reconstruction.

We analytically evaluate the performance, in terms of energy and bandwidth efficiency, of a WSN data gathering scheme based on the CS matrix presented herein.

We show that, on spatially sparse fields, our CS scheme outperforms selected RS and CS stateoftheart ones in terms of both energy and bandwidth efficiency.
The remainder of the paper is organized as follows: Section 2 describes the WSN system model, Section 3 briefs the CS basics, and Section 4 discusses related works on CS/RS acquisition in WSN. In Section 5 we illustrate our original CS scheme, and in Section 6 we apply it to a WSN and analyze the related energy consumption and bandwidth occupancy. Section 7 presents numerical results assessing that our CS scheme outperforms stateoftheart approaches in terms of bandwidth/energy efficiency. Section 8 concludes the paper.
2 System model and network scenario
where, for the sake of simplicity, we have dropped the temporal variable and have set the horizontal and vertical intersensor distances equal to d. Then, the sensors implement a suitable dissemination protocol to forward the measured value to the FC. The FC collects all the data from the sensors so as to reconstruct a representation of the overall field z [n _{1},n _{2}].
Efficient data dissemination towards the FC is widely debated in the literature since energy efficiency affects the network lifetime, especially relevant in scenarios where the deployment of sensors is difficult or expensive, whereas bandwidth efficiency enables WSN monitoring in bandwidthlimited media, e.g., underwater, or in geographical areas where different sensor networks coexist. CS and RS paradigms provide a theoretical framework for highly efficient field monitoring, provided that the monitored data are sparse in a suitable domain. We briefly recall in Sections 3 and 4 the basics of CS and the related work on CS and RS application in WSN, respectively.
3 An introduction to compressive sampling
The vector $\mathbf{z}\in {\mathbb{R}}^{N}$ is sparse if the number of its nonzero samples is restrained compared to its own dimension N; rigorously, z is said to be Ksparse if the number of nonzero components is K, either in the spatial or in a transformed domain (e.g., Fourier, wavelet, etc.). CS provides a framework for sensing and compression of a sparse signal.
Φ being a suitable measurement matrix of size M × N.
It is proven [11] that, for values of δ small enough, sparse signals can be perfectly recovered from compressive sensing measurements. In [12], the authors show that the RIP property is verified when the measurement energy Φ z^{2} is more and more concentrated, in probability, around the value $\mathbf{z}{}_{2}^{2}$ as far as the number of measurements increases.
or by a greedy iterative pursuit of the support of z; examples of this latter approach are provided by the orthogonal matching pursuit [13] and the compressive sampling matching (CoSaMP) algorithms [14].
In (2), we recognize that randomly sampling the components of z and collecting them in y is equivalent to realizing CS using a particular sensing matrix; therefore, many CS theory results apply to RS, too. Both RS and CS techniques have been considered for application in WSNs.
4 Related works
Efficient sensing and data gathering in WSNs by means of CS and RSbased techniques have aroused lively interest in recent literature. In [15], a CSbased distributed communication architecture is exploited to minimize the latency for information retrieval under a favorable powerdistortion tradeoff, whereas in [16], a CSbased sensing and data gathering procedure is analyzed for the case of network routing tree topologies. In [17], maximization of largescale WSN lifetime is pursued by means of a fully distributed algorithm according to which each sensor autonomously performs classical or compressive sampling in order to reduce the number of transmitted packets.
In [9], the authors analyze a RS and multihop data gathering scheme. In this scheme, only randomly selected nodes measure the field and transmit their readings to the FC through specific multihop paths. While a sensor reading is routed towards the FC, its value is combined with the ones sensed by the sensors in the path, so that each random projection provided to the FC is built by accumulating randomly weighted sensor readings along a network path. Energy efficiency is pursued if the number of nodes contributing to each projection is low.
In [18], a peculiar form of the CS sensing matrix is proven to exhibit good reconstruction properties while still being able to reduce the number of intersensor transmissions. The structure of the sensing matrix, originally designed for WSNs with chain topology, is viable of an extension to more complex scenarios, provided that suitably treestructured routing paths are designed from the exterior of the network towards the FC.
Recently, in [10] a RSbased sensor network framework for underwater systems has been introduced. Differently from the works in [9, 16, 17], a singlehop network is considered, where the sensors directly communicate with the FC. Every sampling interval Δt, each sensor senses the field and transmits it directly to the FC with probability p. The sensing probability p is suitably chosen in order to let the FC acquire sufficiently many data for field reconstruction. The approach in [10] favorably merges the RS procedure with a random access protocol, thus obtaining a significant reduction in both the consumed energy and the occupied bandwidth. The main reasons why the above discussed methods achieve significant performances in efficient use of network resources are either in the fact that, during a sampling interval, only a subset of the sensors measures the field by means of RS or in the fact that CS acquisition is actually realized jointly with the routing procedure.
Recent studies [16, 18] suggest that in the case of spatially sparse signals, the energy/bandwidth of RS and CS efficiency deteriorates since reconstruction accuracy is guaranteed only when a large number of sensors contribute to the measurements. In [16], the authors remark how difficult it is to design a RS matrix suited to sparse signals and still allowing an efficient network routing. In [18], it is pointed out that, on spatially sparse signals, CS techniques still guarantee reconstruction accuracy but at an increased number of measurements (e.g., M up to 50% of N), whereas for the same values of M and N, RS only opportunistically achieves reconstruction.
The problem of efficient CS data routing from spatially localized signals is addressed in [19]. Therein, the authors of [19] propose to leverage the socalled transport cost, that is, the energy wasted to disseminate CS measurement towards the FC via multihop paths, by clustering the network nodes in nonoverlapping sets, each one responsible for one or more CS measurements. In order to assure perfect reconstruction, the sensors’ clusterization is selected depending on the sparsifying basis under which the field is sensed. The clusterization corresponds to a sparse structure in the sensing matrix, and it is the starting point to allow energy savings in the overall sensing procedure, realized by a centralized algorithm. The procedure is designed for spatially localized signals, which are sparse in a spatially localized basis (e.g., Daubechies, DCT), but it looses efficiency as the signals become more and more sparse in the spatial domain.
On the other hand, in several WSN applications, the sensed field indeed contains local fluctuations and abnormal readings, and it is well modeled as a spatially sparse signal. This motivated us to concern ourselves with the design of a sensing matrix suited to spatially sparse signals, as described in the following section.
5 CS using Radonlike random projections
In a nutshell, we aim at devising a sensing matrix that represents a spatially sparse field z in a domain such that dropping N − M components does not prevent signal reconstruction. Recalling that the Radon transform has the dual properties of (1) compressing spatial domain straight lines into transform domain pulses [20] and (2) expanding spatial discrete pulses into as many nonzero values as the number of considered Radon projections [21], we recognize that the Radon transform provides a mean for redundant representation of sparse signals built by spatially isolated pulses. Thereby, we resort to a spatially sparse signal CS scheme inspired by the Radon projection computation.
Expressions (4) to (6) represent randomly weighted accumulations of z[n _{1},n _{2}] over ridge paths. Let us now generalize the above expressions by regarding them as obtained by columnwise accumulation of a suitably rotated version of the sequence z[n _{1},n _{2}].
for m = 0,…K(p) − 1, p = 0,…P − 1. Since the accumulation in (7) recalls the columnwise accumulations employed in the computation of the discrete Radon transform, we refer to the projections in (7) as Radonlike random projections.
using the ${\sum}_{p}K(p)\times {N}_{1}{N}_{2}$ random sampling matrix Φ _{ R } defined as
Let us remark that, even though the samples contributing to each y component are the same as those that would have contributed to a specific Radon projection of z, due to the random weighting, the measurement vector y is not  and it is not even easily related to  the Radon transform of z.
In the following, we demonstrate that the conditions given by the CS theory for reconstructing z from y stand. Before turning to mathematics, let us observe that if the image z[n _{1},n _{2}] is built by sparse isolated pulses, each pattern contributes, apart from a suitable random weighting, to each one of the P Radonlike random projections ${y}^{({\vartheta}_{p})}[m],\phantom{\rule{2.77626pt}{0ex}}m=0,\dots K(p)1,\phantom{\rule{2.77626pt}{0ex}}p=0,\dots P1$. Thereby, the set of P Radonlike random projections is a Predundant representation of the pulse. This motivated us to formally demonstrate that the Radonlike random projections ${y}^{({\vartheta}_{p})}[m],\phantom{\rule{2.77626pt}{0ex}}m=0,\dots K(p)1,\phantom{\rule{2.77626pt}{0ex}}p=0,\dots P1$ satisfy the conditions of a CS measurement set.
5.1 Restricted isometry property of the Radonlike sampling matrix
To formally state that the above introduced simplified sampling structure is feasible for accurate field reconstruction, we shall demonstrate that the random measurements y evaluated as in (8) are consistent CS measurements, i.e., they substantially preserve the information of the sampled sequence z[n _{1},n _{2}].
with high probability, then any sparse sequence z can be perfectly recovered from CS measurements y = Φ _{ R } z[11].
The RIP in (11) asserts that the measurement energy ${\mathcal{E}}_{y}\stackrel{\text{def}}{=}{\mathbf{\Phi}}_{R}\mathbf{z}{}^{2}$ is strongly concentrated around the value ${\mathcal{E}}_{z}$. Preliminary results on the RIP property of a Radonlike CS matrix appear in [22]. In Appendix 1, we extend these results and, following the approach in [12], we show that the following property stands.
provided that $P\ge 2{K}^{2}{C}_{2}^{2}log(2/\epsilon )/{\delta}^{2}$, C _{2} being a suitable constant. From Property 1, the RIP property in (11) immediately follows.
5.2 Further remarks
The sampling matrix Φ _{ R } differs from the full sampling matrices usually adopted in CS since it is sparse. In the following, we show how the sparsity of the Radonlike sensing matrix Φ _{ R } can be leveraged on to significantly simplify the CS measurement computation in a WSN so as to reduce the consumed energy and employed bandwidth.
The definition of ${y}^{({\vartheta}_{p})}[m]$ in (7) given above is consistent and useful from an analytical point of view. When turning to the evaluation of ${y}^{({\vartheta}_{p})}[m]$ in a WSN, the evaluation of ${z}^{({\vartheta}_{p})}\left[{n}_{1},{n}_{2}\right]$ is not accomplished, and the measurement computation is realized throughout the data gathering stage.
In [23], the authors demonstrate the RIP for a different kind of sensing matrix, that is, block diagonal matrices. With respect to the approach in [23], the proof in Appendix 1 is carried out asymptotically, that is, for M large enough to approximate ${\mathcal{E}}_{z}$ as the outcome of a Gaussian random variables, and it leverages the hypothesis of a spatially sparse signal, i.e., a signal that is sparse in the canonical basis.
Finally, the concentration inequality (12) guarantees that the sequence z can be recovered from the measurements y with high probability, as far as the number P of considered projections increases. Since CS convergence is assured only in probability, the CS measurement experiment could be repeated. In a WSN, data are periodically sensed and routed to the FC, and a small probability of misreconstruction can be tolerated since it can be recovered in the subsequent sampling interval. Furthermore, integration of independently drawn measurements acquired in a WSN during different temporal intervals can be performed at the FC. This interesting research issue is deferred to further studies.
6 Radonlike CS in a WSN
In a WSN application scenario, the P Radonlike projections correspond to randomly weighted sums of the values sensed by different subsets of WSN sensors. The sums can be evaluated using different techniques.
Following the approach in [24], the sensors within a subset can synchronously transmit their weighted sensed values, and the sum can be realized at the FC by onair analogical superimposition of received signals. This protocol requires strict control of the power received by the FC from each sensor. Precisely, each sensor node needs to estimate the channel seen towards the FC in order to precompensate the transmitted value according to the channel attenuation. Thereby, although feasible in principle, this approach requires a sophisticated processing and tight power control by the sensor nodes.
According to a data gathering paradigm, the projections are computed within the network by a subset of sensors while they are forwarding their sensed values to the FC. The sums in (7) can then be realized by routing and accumulating values of z[n _{1},n _{2}] over suitably tilted paths in the network grid discrete support.
Here we refer to such a data gathering approach, and we infer some consequences from the peculiar sparse structure of the matrix Φ _{ R } on the computation procedure. Firstly, we observe that in every row, the nonzero coefficients of the matrix Φ _{ R } are arranged so as to obtain ${y}^{({\vartheta}_{p})}[m]$ as the sum of the values of a column of the rotated image ${\mathbf{z}}^{({\vartheta}_{p})}$. When collecting the measurement in a WSN, each projection ${y}^{({\vartheta}_{p})}[m]$ can then be computed by accumulating measurements throughout a specific, suitably tilted, grid path. Secondly, we observe that in every column of the matrix Φ _{ R }, there are only P nonzero values. Hence, each value z[i,j] shall contribute only to P out of M projections ${y}^{({\vartheta}_{p})}[m]$. When realizing the Radonlike CS in the sensor network grid, each sensor shall transmit its value P times.

The computation of each projection ${y}^{({\vartheta}_{p})}[m]$ is performed in a distributed way within the WSN, and it requires signaling among grid sensors which are adjacent along a WSN path.

The accumulation along different paths can then be realized in parallel, provided that the distance between contemporaneously signaling nodes is kept large enough.
We now turn to quantifying the energy consumption and bandwidth occupancy required for realizing the Radonlike CS by means of a data gathering procedure in a WSN. In Section 6.1, we evaluate the energy consumption and bandwidth occupancy of the Radonlike CS scheme in a WSN. Next, we compare these results with selected stateoftheart schemes, namely those of the random sensing approaches described in Section 1, detailed in Section 6.2.
6.1 Radonlike CS efficiency
We now evaluate the allocated bandwidth and consumed energy for entirely collecting the measurements in a time T _{ c } in the WSN scenario in Section 2. The actual bandwidth occupation and energy consumption depend not only on the WSN structure but also on the adopted data gathering procedure. Without loss of generality, we refer to the suboptimal data gathering algorithm sketched out in Appendix 2, here briefly summarized for the reader’s convenience.
A deterministic (collisionfree) time division multiple access (TDMA) is adopted. Signaling takes place between adjacent nodes only. Parallel transmission of nodes sufficiently apart is considered. In Appendix 2, we evaluate two parameters that directly affect the energy and bandwidth consumption of the data gathering algorithm, namely the total number of singlehop transmissions (N _{TX}) and the total number of time slots (N _{TS}) needed to collect all the sensors’ readings to the FC.
γ _{ P } being a scalar factor depending on the adopted P projections. The guidelines for calculating γ _{ P } are given in Appendix 2 where we also evaluate the value of γ _{ P } for different sets of directions ϑ _{ p }.
δ _{ P } being a factor depending on the considered projection directions ϑ _{ p }. Appendix 2 reports the guidelines for the evaluation of the parameter δ _{ P } for different sets of directions ϑ _{ p }.
We observe that, as a consequence of the sparsity of the Radonlike sensing matrix, (1) the number of transmission varies only linearly with the network size N, and (2) the algorithm being parallelized, the number of time slots varies linearly with the square root of the network size N. With these results, we are able to evaluate the allocated bandwidth and consumed energy for entirely collecting the measurements in a time T _{ c } in the WSN scenario described in Section 2.
Projection evaluation according to the data gathering scheme detailed in Appendix 2 accounts for a series of transmissions among neighboring nodes. The energy spent for a singlehop transmission is given by ${E}_{\text{SH}}=G{d}_{\text{SH}}^{2}{T}_{p}^{(\text{RL})}$, with d _{SH} = d or $\sqrt{2}d$ being the distance for horizontally, vertically, and diagonally adjacent nodes (a scale factor depending on the actual transmission parameters, namely the sensitivity at the FC receiver and the transmitter and receiver antenna gains) and ${T}_{p}^{(\mathit{\text{RL}})}$ the time needed for packet transmission.
The packet duration ${T}_{p}^{(\text{RL})}$ depends on the design of the selected sensing system. If the overall sensing framework is designed under the system constraint of having a fixed occupied bandwidth B, the packet duration time will be evaluated as ${T}_{p}^{(\text{RL})}=L/{B}_{\text{RL}}$ with B _{RL} = B.
Such system design choices should be carefully taken into consideration when comparing energy consumption of different schemes possibly comprising different numbers of singlehop transmissions N _{TX}.
6.2 RS efficiency
We now present a few results on the energy and bandwidth consumption of the approaches proposed in [10]. Therein, a RS procedure, allowing only a randomly chosen subset of sensors to acquire the measurement, is coupled with both a TDMA scheme and a random access scheme. Herein we elaborate on these results and add a few details. With respect to the computation in [10], where the energy consumption for each sensor to transmit to the network sink is approximated by a constant, here we explicitly take into account the dependence of the energy with respect to (w.r.t.) the spatial sensor location. Secondly, therein an approximate relation is established between two key system parameters, namely (1) the minimal fraction of sensing data that must be correctly received at the sink to allow CS reconstruction and (2) the minimal bandwidth. Herein we extend the relation to different ranges of sensing probability, better suited to RS of a spatially sparse field.
In the RS/deterministic access (RD) scheme, the FC randomly chooses a set of M sensors, M being a sufficient number of measurements for satisfactory field reconstructions and broadcasting the addresses of eliged nodes through the network. The selected nodes acquire the measurements and transmit their readings to the FC via a TDMA deterministic access scheme. As in this scheme only M nodes need to share the TDMA frame, the packet transmission time is ${T}_{p}^{(\text{RD})}={T}_{c}/M$. Consequently, the occupied bandwidth for the RD scheme is ${B}_{\text{RD}}=M\frac{L}{{T}_{c}}$.
The energy consumption and occupied bandwidth performance of the scheme in [10] need to be addressed in a slightly different way w.r.t. the previous cases. CS theoretic results determine the number M of measurements needed at the FC to correctly restore the sensed field; within an observation time, this constraint corresponds to a required percentage q _{ s } of correctly received samples at the FC. Because of possible collisions, the required percentage q _{ s } needed at the FC does not translate straightforwardly into a sensing probability p _{ s }. In [10], the authors establish a relationship among the sensing probability p _{ s } and the probability q _{ s } of correct packet reception and demonstrate that, given q _{ s }, a minimum bandwidth B is required in order to assure that a feasible value of p _{ s } exists. Thereby, if the available bandwidth is not accurately dimensioned, small values of p _{ s } do not provide enough measurements at the FC, whereas large values of p _{ s } cause too many collisions.
6.3 Further remarks
Before turning to the numerical performance evaluation, a few remarks are in order. The above analysis has pointed out that the consumed energy and allocated bandwidth adopting the Radonlike CS scheme grow only with the square root $\sqrt{N}$ of the network size, whereas those of selected stateoftheart approaches vary with the power N. The impact of these trends on energy consumption depends on all system parameters and mostly on p _{ s }. For a spatially sparse field, where p _{ s } and consequently q _{ s } tend to be high, since a large fraction of sensors shall transmit their values using RS with random access to allow proper reconstruction, a random sensing scheme is prone to exhibit a large energy consumption and bandwidth occupancy. The Radonlike CS scheme then yields a reduced energy consumption for each node, as well as a parsimonious bandwidth use for collecting data over the entire grid. The gain is more and more evident as the network size (i.e., the covered area) increases.
Let us point out that, on nonspatially sparse fields, the conditions for accurate reconstruction, e.g., the values of p _{ s } and P, may differ, leading to different relative performances. The investigation of this issue is left for further studies.
The actual gain in terms of energy and bandwidth depends on the constants γ _{ P },δ _{ P } which grow with the number of considered projections. The advantages of the Radonlike CS scheme are expected to be evident on spatially sparse signals, where low values of P (e.g., P = 3) enable reconstruction, whereas the RS data gathering algorithm requires a high percentage of samples to reach the FC in order to achieve satisfying reconstruction results [18].
As far as the medium access scheme is concerned, the hereindevised Radonlike CS scheme is realized via a TDMA technique, just as the RD scheme. Therefore, it implies an effort of synchronization and scheduling. Nonetheless, different data gathering procedures can be envisaged realizing the Radonlike CS using a random access criterion. This issue is left for further studies. Finally, these results depend on the peculiar structure of the Radonlike sensing matrix Φ _{ R } and, although derived for a particular data gathering algorithm, can be generalized to different Radonlike CS measurement computation schemes.
7 Numerical simulations
In this section, we analyze the performance of our Radonlike CS scheme both in terms of reconstruction accuracy and of employed network resources. Firstly, in Section 7.1 we present a few results showing that an accurate reconstruction of a spatially sparse signal can be achieved by the Radonlike CS using a feasible number of Radonlike projections. Secondly, in Section 7.2 we demonstrate the energy and bandwidth gain achievable when adopting the Radonlike CS scheme in a WSN. For fair comparison of the different sensing techniques, we consider their performances under different system parameter settings, respectively corresponding to the case when each of the sensing system is operating at its minimal bandwidth and to the case of packet duration T _{ p } fixed for all the schemes. A comprehensive representation of the bandwidthenergy pairs of the different sensing systems is then shown versus the network dimensionality. Finally, we present a few results assessing the performance of Radonlike CS sampling on realworld data.
7.1 Radonlike CS reconstruction accuracy
We have first evaluated the reconstruction accuracy of the Radonlike CS scheme, using different number P of projections, under the assumption of noisefree observations. Specifically, we have tested the reconstruction accuracy when only projections along rows and columns of the network grid are considered (P = 2,M = 128), when projections along the rows, columns, and the π/4oriented diagonal of the grid are considered (P = 3, M = 255), and finally, also when projections along the 3π/4oriented diagonal are considered (P = 4, M = 382).
Reconstruction accuracy (MSE) obtained by Radonlike CS and RS schemes ( N = 64 × 64 = 4,096) for different numbers of measurements
Parameter  

M  128  255  382 
P  2  3  4 
ϑ _{ p }  0,π/2  ϑ _{ p } = 0,π/2,π/4  ϑ _{ p } = 0,π/2,±π/4 
Radonlike CS – MSE  0.0056  0.0019  0.0011 
RS – MSE  13.3  7.604  4.721 
For the sake of comparison, we have also evaluated the reconstruction accuracy obtained by the RS [10] scheme under the same experimental settings. In Table 1 we recognize that, for the selected range of measurements (M ≤ 382), the RS does not allow capturing the sparse nature of the sensed field. To obtain the same reconstruction accuracy of the Radonlike CS scheme, namely a MSE equal to 0.0036, the RS requires to be run with a number of measurements M ≃ 2,500 ≈ 50% N.
Reconstruction accuracy (MSE) obtained by Radonlike CS and RS schemes ( N = 80 × 80 = 6,400) for different numbers of measurements
Parameter  

M  160  319  478 
P  2  3  4 
ϑ _{ p }  0,π/2  ϑ _{ p } = 0,π/2,π/4  ϑ _{ p } = 0,π/2,±π/4 
Radonlike CS – MSE  0.0045  0.00152  0.000901 
RS – MSE  8.602  6.472  4.506 
Reconstruction accuracy (MSE) obtained by the Radonlike CS, noisy measurements ( N = 80 × 80 = 6,400)
Parameter  

M  128  255  382 
P  2  3  4 
ϑ _{ p }  0,π/2  ϑ _{ p } = 0,π/2,π/4  ϑ _{ p } = 0,π/2,±π/4 
Radonlike CS – MSE for${\sigma}_{n}^{2}=0.5$  0.0065  0.0034  0.0033 
Radonlike CS – MSE for${\sigma}_{n}^{2}=0.7$  0.007  0.0039  0.0036 
To recap, the above results show that, as a rule of thumb, Radonlike CS requires$M\approx P\sqrt{N}$ measurements for representing a spatially sparse field, whereas the RS requires a large percentage of the measurements M _{RS} ≈ α N to be correctly received (e.g., P = 3 and α = 50% in the above experiments). Overall, the Radonlike CS scheme allows sensing and reconstructing of a spatially sparse field with far less measurement w.r.t. stateoftheart techniques such as the RS presented in [10].
7.2 Radonlike CS efficiency
 (a1)
The number of measurements chosen is large enough to yield a satisfactory reconstruction accuracy, quantified by a MSE ≤ 10^{ −3 }.
 (a2)
The coherence time of the sensed field is fixed to T _{ c } = 2,500s.
 (a3)
The dimension of the transmitted packet is set to L = 1 Kb.
With reference to the experimental setting described in Section 7.1, condition (a1) implies P = 3 projections. We start by computing the energy consumption under the assumption that the occupied bandwidth and, consequently, the packet transmission time T _{ p } = L/B are the same for the different schemes.
Let us remark that, under this setting corresponding to a system design choice of having a fixed occupied bandwidth, each scheme requires a different number of transmissions in order to let the FC acquire the needed measurements. Thereby, the overall process of sensing is accomplished in different time intervals by the different data gathering techniques. In these experiments, we have set${T}_{p}^{(\mathit{\text{RL}})}={T}_{p}^{(\text{RD})}={T}_{p}^{(\text{RR})}={T}_{p}=0.61$. Figure 6 reports the energy consumed for different numbers of network sensors N. We recognize that employing the RL scheme drastically reduces the energy consumed by the data gathering algorithm.
For the sake of comparison, in the same figure, we also report the performance of RS, implemented using both a deterministic access scheme (RD in the legend) and the random access scheme (RR in the legend) described in [10]. The occupied bandwidth is computed according to the analysis in Section 6 for the RL, RD, and RR scheme, respectively, under the same assumptions (a1) to (a3). These settings imply p _{ s } = 0.5 for the RD scheme and q _{ s } = 0.5 for the RR one.
The bandwidth employed for the Radonlike data gathering scheme is significantly reduced w.r.t. the RS, both using deterministic and random access. The above results, obtained by considering different numbers of measurements and equal reconstruction accuracy for the three algorithms, are explained by the efficiency of the Radonlike data collection algorithm, exploiting only singlehop, parallel data transmission.
Finally, we are interested in comparing the resource employed by the different schemes to accomplish the sensing process exactly at the same time. To reach this goal, as the number of singlehop transmissions varies from one scheme to another, the different schemes will have a different packet transmission time and hence will occupy a different bandwidth. In Figure 7, we illustrate the bandwidthenergy scatterplot of the RL, RR, and RD schemes for different network sizes. For RD and RR, we have considered two cases, that is, when 50% and 30% of the sensor readings are required at the FC for satisfactory field reconstruction.
The energy/bandwidth pairs draw different trajectories while the number of nodes N increases. We clearly recognize a systematic energy and bandwidth saving of the RL scheme w.r.t. the competitors. Moreover, both the consumed energy and the occupied bandwidth exhibit far smaller variations with the number of network nodes than what happens with the RD and RR schemes, making the RL approach fully scalable in terms of network nodes.
7.3 Radonlike CS performances on real data sets
Reconstruction performance in a realdata scenario (Zonal Current at Monterey Bay[[26]]) for different thresholding values
t  S  MSE against original field  MSE against thresholded field 

0.1  826  0.003  0.0015 
0.125  485  0.0031  8.20 × 10^{−4} 
0.15  386  0.0033  6.67 × 10^{−4} 
0.175  319  0.0035  5.89 × 10^{−4} 
0.2  285  0.0036  5.59 × 10^{−4} 
The results in Table 4 confirm the effectiveness of the Radonlike scheme in enabling reconstruction of the spatially sparse nature of the sensed thresholded field, achieving MSE as low as 0.0036 for a high threshold value such as t = 0.2. As the thresholding factor, the number of nonzero coefficients in the thresholded image increases, making the Radonlike approach less effective. We would like to emphasize that application of Radonlike sensing matrices to nonsparse data could still be possible by taking into account suitable sparsifying basis, which is left for further studies.
In Figure 11 (right), we report the reconstructed thresholded field after 15 iterations of the CoSaMP algorithm for t = 0.2; the corresponding original thresholded image is reported in Figure 11 (center). Visual inspection of Figure 11 (right) shows how, in spite of the reduced number of measurements and of the restrained energy consumption, the Radonlike scheme is capable of capturing the spatially sparse nature of the reconstructed field. Finally, the approach outlined herein could be enforced by taking into account suitable padding of the data samples that are under the threshold, so as to substitute the zero entries obtained by the reconstruction algorithm with a specific nonzero value, e.g., their spatial mean, thereby reducing the observed MSE.
7.4 Final remarks

In accounting an irregular sampling grid

In exploiting nonstraight sampling path.
These conditions may be encountered, for instance, in vehicular networks or citizen sensing networks [27], w1ere the disposition of the nodes are far from being regular, and the sampling path should adapt to the routing paths, which in turn basically depend on the street and building disposition. To sum up, we consider this contribution as an intermediate step towards finding a general relation between the compressive sensing of a finite innovation rate signal and its realization by efficient routing algorithms in a realistic WSN scenario.
8 Conclusions
In this paper, we have addressed the efficient compressive sampling of spatially sparse signals in sensor networks. Specifically, we have introduced a peculiar CS sampling scheme for spatially sparse bidimensional signals. We have analytically demonstrated that our scheme satisfies the theoretical conditions required for CS signal reconstruction. Then after devising a distributed data gathering scheme for collecting of the CS measurements in a WSN, we have characterized the scheme both in terms of consumed transmission energy and occupied bandwidth. The scheme outperforms stateoftheart schemes for spatially sparse fields, and it represents an intermediate step towards the definition of routing procedures well suited to the characteristics of the signal a realistic sensor network is faced with.
Endnotes
^{ a } The coherence time T _{ c } is defined as the time interval over which the process almost decorrelates in time.
^{ c } We also approximate herein the intersensor distance in the diagonal direction to d.
Appendix 1 :RIP property of the Radonlike measurements matrix
provided that$P\ge 2{K}^{2}{C}_{2}^{2}log(2/\epsilon )/{\delta}^{2}$, C _{ 2 } being a suitable constant.
Demonstration The condition in (20) can be demonstrated as follows. Let us consider the sample energy${\mathcal{E}}_{y}$ of the measurements.${\mathcal{E}}_{y}$ being a sample moment, we invoke here its asymptotical normal distributions [28]. Although this hypothesis is not necessary for the RIP to stand, it allows us to straightforwardly evaluate the minimal number of projections P required for Ksparse field reconstruction, and therefore we retain it in the following.
Thereby, in order to demonstrate (12), it suffices to show that$\mathrm{E}\left\{{\mathcal{E}}_{y}\right\}={\mathcal{E}}_{z}$ and Var$\left\{{\mathcal{E}}_{y}\right\}=o(P)$ for the case under concern.
Hence, by setting${\sigma}_{\phi}^{2}=1/P$, we get$\mathrm{E}\left\{{\mathcal{E}}_{y}\right\}={\mathcal{E}}_{z}$.
with${C}_{2}=\underset{({n}_{1},{n}_{2})}{max}z{\left[{n}_{1},{n}_{2}\right]}^{2}$.
The demonstration presented herein proves that the Radonlike CS matrix satisfies the RIP property in the spatial domain, i.e., under the assumption that the sparsifying basis is the canonical basis. The interested reader can find a proof of the RIP property for the Radonlike matrix in any orthonormal noncanonical basis in [30].
Appendix 2 :Within WSN Radonlike projections’ computation
Let us consider a regular network composed by N = N _{ 1 } N _{ 2 } sensors as in Figure 1 where, without loss of generality, we assume that N _{ 1 } and N _{ 2 } are odd valued, i.e.,${N}_{1}=2{\stackrel{~}{N}}_{1}+1$,${N}_{2}=2{\stackrel{~}{N}}_{2}+1$, so as to identify a central column where the FC is located.
We discuss a simple suboptimal procedure to collect all the projections to the FC using a TDMA access scheme. Let us subdivide the network into four quadrants, and let us consider first the horizontal projections p _{ H }[m], obtained by accumulating randomly weighted values along the network rows. In each quadrant, the data gathering process starts at the outer nodes. The external node in each row measures the field, computes the product of the reading with a randomly selected coefficient, encodes this value in a packet of L bits, and transmits it to the neighboring node in the horizontal direction. The neighboring node, once the packet from the outer node has been received, measures the field, multiplies the reading by the random coefficient, and sums it to the value received by the outer node. The overall process continues until the nodes in the central column are reached by the data flow and are then ready to propagate the projection values to the FC. Once the FC has received the horizontal projection values from the first quadrant, the same operations are serially performed in the three remaining quadrants. The projection values of each quadrant are therefore computed by evaluating partial sums and propagating them towards the nodes in the central column; then the projection values are transmitted to the FC via a multihop route along the central column.

${\stackrel{~}{N}}_{1}$ transmission to reach the central column for each of the${\stackrel{~}{N}}_{2}+1$ rows

$\sum _{l=0}^{{\stackrel{~}{N}}_{1}}l$ transmissions to propagate the projection value towards the FC along the central column
Let us now evaluate the number of time slots in which the${N}_{\text{TX}}^{(\pi /2)}$ transmissions can be performed. Since signaling occurs between adjacent nodes, the propagation of information on the different rows can be scheduled in parallel flows, provided that a suitable interrow delay of ν _{ 0 } time slots is introduced to prevent interference among neighboring nodes.

The data gathering starts at t _{ 0 } = 0, on the first row of the quadrant, i.e., the one comprising the FC. The outermost node transmits its randomly weighted sensed value in the first time slot. In the second time slot, the second node forwards the sum of the received data and its own randomly weighted sensed value. Similarly, each node updates and sends the received partial sum. Thereby, the FC retrieves the accumulation after${t}_{f}^{1}={\stackrel{~}{N}}_{1}{T}_{p}$, with T _{ p } being the duration of a time slot.

On the second row, the transmission begins after ν _{ 0 }firstrow transmission. Then${\stackrel{~}{N}}_{1}$ time slots are needed for the partial sum to reach the central column, and one additional time slot is needed to reach the FC. The propagation ends at${t}_{f}^{2}=({\nu}_{0}+{\stackrel{~}{N}}_{1}+1){T}_{p}$.

On the i th row, the transmission begins after (i − 1) · ν _{ 0 } time slots, and the propagation ends at${t}_{f}^{i}=(i\xb7{\nu}_{0}+{\stackrel{~}{N}}_{2}+i){T}_{p}$.

On the (${\stackrel{~}{N}}_{2}+1$)th row, transmission to the FC is accomplished at${t}_{f}^{{\stackrel{~}{N}}_{2}+1}=({\stackrel{~}{N}}_{2}{\nu}_{0}+{\stackrel{~}{N}}_{1}+{\stackrel{~}{N}}_{2}){T}_{p}$.
The overall protocol for evaluating p _{ H }[m] is illustrated in Figure 4.
An important remark is in order. Despite its simplicity, this basic result highlights one of the major advantages of the Radonlike CS scheme. Since the Radonlike projections can be evaluated by means of information propagation on linear paths in the network, the number of singlehop transmissions vary with the product depth and width of the network grid, that is, with the network size N. On the other hand, since only singlehop transmissions are employed, the transmission can be parallelized, and the number of time slots required for computation of an assigned projection set${y}^{({\vartheta}_{p})}[m]$ varies with the sum of depth and width of the network grid, that is, with the square root of the network size N. This intrinsic behavior, which holds for different projections’ directions, is the reason why the Radonlike CS scheme will be proven to be both energy and bandwidthefficient.
With slight modifications, the above described procedure can be extended to the case of differently tilted paths. For the sake of concreteness, we develop in the following the calculations for ϑ _{ p } = 0 (vertical projections), ϑ _{ p } = ±π/4 (diagonal projections), which have been considered in the simulations described in this paper.
 (p1)
All the p/4oriented paths that originate from the nodes lying along the outer row of the quadrant and that reach the FC through either the central row or the central column (solid arrows in Figure 5)
 (p2)
All the p/4oriented paths that originate from the nodes lying along the outer column of the quadrant and that reach the FC through either the central row or the central column (dashed arrows in Figure 5).
If the quadrant is processed so that we firstly perform the accumulations along the paths in (p1) starting at t _{0} = 0 and secondly perform the accumulations along the paths in (p2), then

The first projection value along the paths in (p1) reaches the FC at${t}_{f}^{1}={\xd1}_{2}{T}_{p}$.

The last projection value along the paths in (p1) reaches the FC at most at${t}_{f}^{({\stackrel{~}{N}}_{1}+1)}=({\stackrel{~}{N}}_{1}{\nu}_{0}+max\{{\stackrel{~}{N}}_{1},{\stackrel{~}{N}}_{2}\}){T}_{p}$.

The first projection value along the paths in (p2) reaches the FC at most at ${t}_{f}^{{\stackrel{~}{N}}_{1}+2}=\left[\left({\stackrel{~}{N}}_{1}+1\right){\nu}_{0}+max\{{\stackrel{~}{N}}_{1},{\stackrel{~}{N}}_{2}\}\right]{T}_{p}$.

The last projection value along the paths in (p2) reaches the FC at most at ${t}_{f}^{{\stackrel{~}{N}}_{1}+{\stackrel{~}{N}}_{2}+1}=\left[\left({\stackrel{~}{N}}_{1}+{\stackrel{~}{N}}_{2}+1\right){\nu}_{0}+{\stackrel{~}{N}}_{1}\right]{T}_{p}$.
To recap, the Radonlike CS data gathering procedure lets the fusion center collect all the needed measurements in a highly parallelized fashion. Far from being optimal, the data gathering scheme introduced herein allows a significant reduction in both the occupied bandwidth and the consumed energy w.r.t. stateoftheart data gathering scheme such as the RS introduced in [10]. Further developments of globally optimized Radonlike CS data gathering algorithms are still under investigation.
Declarations
Authors’ Affiliations
References
 Colonnese S, Melodia T, Cuomo F: Leveraging multiview video coding in clustered multimedia sensor networks. In Proceedings of Global Communications Conference (GLOBECOM) 2012. Anaheim; 3–7 December 2012.Google Scholar
 Ghataoura DS, Mitchell JE, Matich GE: Networking and application interface technology for wireless sensor network surveillance and monitoring. IEEE Commun. Mag 2011, 49(10):9097.View ArticleGoogle Scholar
 Sheu JP, Hu WK, Lin JC: Distributed localization scheme for mobile sensor networks. IEEE Trans. Mobile Comput 2010, 9(4):516526.View ArticleGoogle Scholar
 Aziz NAA, Aziz KA: Managing disaster with wireless sensor networks. In Proceedings of the International Conference on Advanced Communication Technology (ICACT) 2011. Seoul; 13–16 February 2011.Google Scholar
 Carli M, Panzieri S, Pascucci F: A joint routing and localization algorithm for emergency scenario. Ad Hoc Networks 2012. 10.1016/j.adhoc.2012.09.001Google Scholar
 Ren F, Zhang J, He T, Lin C, Das SK: EBRP: energybalanced routing protocol for data gathering in wireless sensor networks. IEEE Trans. Parallel Distributed Syst 2011, 22(12):21082125.View ArticleGoogle Scholar
 Hamouda YEM, Phillips C: Adaptive sampling for energyefficient collaborative multitarget tracking in wireless sensor networks. IET Wireless Sensor Syst 2011, 1(1):1525. 10.1049/ietwss.2010.0059View ArticleGoogle Scholar
 Baraniuk RG, Candés E, Elad M, Ma Yi: Applications of sparse representation and compressive sensing. Proc. IEEE 2010, 98(6):906909.View ArticleGoogle Scholar
 Quer G, Masiero R, Munaretto D, Rossi M, Wider J, Zorzi M: On the interplay between routing and signal representation for compressive sensing in wireless sensor networks. In Proceedings of the Information Theory and Applications Workshop 2009. San Diego; 8–13 February 2009.Google Scholar
 Fazel F, Fazel M, Stojanovic M: Random access compressed sensing for energyefficient underwater sensor networks. IEEE J. Select. Areas Commun 2011, 29(8):16601670.View ArticleGoogle Scholar
 Candés EJ, Wakin MB: An introduction to compressive sampling. IEEE Signal Proc. Mag 2008, 25(2):2130.View ArticleGoogle Scholar
 Baraniuk RG, Davenport M, DeVore R, Wakin M: A simple proof of the restricted isometry property for random matrices. Constr. Approximation 2008, 28(3):253263. 10.1007/s003650079003xMathSciNetView ArticleGoogle Scholar
 Tropp J, Gilbert AC: Signal recovery form partial information via orthogonal matching pursuit. IEEE Trans. Inf. Theory 2007, 53: 46554666.MathSciNetView ArticleGoogle Scholar
 Needell D, Tropp J: CoSaMP: Iterative signal recovery form incomplete and inaccurate samples. Appl. Comput. Harmonic Anal 2008, 26: 301321.MathSciNetView ArticleGoogle Scholar
 Bajwa W, Haput J, Sayeed A, Nowak R: Compressive wireless sensing. In Proceedings of the 5th International Conference on Information Processing Sensor Networks (ISPN06). New York: ACM; 2006:134142.Google Scholar
 Shen G, Lee SY, Lee S, Pattem S, Tu A, Krishnamachari B, Ortega A, Cheng M, Dolinar S, Kiely A, Klimesh M, Xie H: Novel distributed wavelet transforms and routing algorithms for efficient data gathering in sensor webs. In Proceedings Electronics SystemIntegration Technology Conference (ESTC2008). London; 1–4 September 2008.Google Scholar
 Caione C, Brunelli D, Benini L: Distributed compressive sampling for lifetime optimization in dense wireless sensor networks. IEEE Trans. Industrial Informatics 2012, 8(1):3040.View ArticleGoogle Scholar
 Luo C, Wu F, Sun J, Chen CW: Efficient measurement generation and pervasive sparsity for compressive data gathering. IEEE Trans. Wireless Commun 2010, 9(12):37283738.View ArticleGoogle Scholar
 Lee S, Ortega A: Joint optimization of transport cost and reconstruction for spatiallylocalized compressed sensing in multihop sensor networks. In APSIPA Annual Summit and Conference (APSIPA ASC 2010). Singapore; 14–17 December 2010.Google Scholar
 Colonnese S, Campisi P, Panci G, Scarano G: Blind image deblurring driven by nonlinear processing in the edge domain. EURASIP J. Appl. Signal Process 2004, 16: 24622475.View ArticleGoogle Scholar
 Matus F, Flusser J: Image representation via a finite Radon transform. IEEE Trans. on Pattern Anal. Mach. Intell 1993, 15(10):9961006. 10.1109/34.254058View ArticleGoogle Scholar
 Colonnese S, Cusani R, Rinauro S, Scarano G: Computationallyefficient compressive sampling of pulse stream images using Radonlike measurements. In 5th International Symposium on Communications Control and Signal Processing. Rome; 2–4 May 2012.Google Scholar
 Yap HL, Eftekhari A, Wakin MB, Rozell CJ: The restricted isometry property for block diagonal matrices. In Proceedings of the Conference on Information Sciences and Systems (CISS). Baltimore; 23–25 March 2011.Google Scholar
 Haupt J, Bajwa WU, Rabbat M, Nowak R: Compressed sensing of networked data. IEEE Signal Proc. Mag 2008, 25(2):92101.View ArticleGoogle Scholar
 Hegde C, Baraniuk RG: Sampling and recovery of pulse streams. IEEE Trans. Sig. Proc 2011, 59(4):15051517.MathSciNetView ArticleGoogle Scholar
 NASA Accessed March 2013 http://ourocean.jpl.nasa.gov./.
 Kanhere SS: Participatory sensing: crowdsourcing data from mobile smartphones in urban spaces. In 12th IEEE International Conference on Mobile Data Management (MDM 2011). Lulea; 6–9 June 2011.Google Scholar
 Kendall M, Stuart A, Ord JK: Kendall’s Advanced Theory of Statistics, Volume 1: Distribution Theory. Oxford: Oxford University Press; 1994.Google Scholar
 Proakis JB: Digital Communications. New York: McGrawHill; 2007.Google Scholar
 Colonnese S, Rinauro S, Cusani R, Scarano G: The restricted isometry property of the Radonlike CS matrix. Proc. of IEEE Int. Work on Multimedia Signal Processing, 2013 in pressGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.