2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2016
DOI: 10.1109/icassp.2016.7472381
|View full text |Cite
|
Sign up to set email alerts
|

Sparsity-promoting sensor selection with energy harvesting constraints

Abstract: In this paper, we propose a novel sensor selection scheme for networks equipped with energy harvesting sensing devices. Ultimately, the goal is to minimize the reconstruction distortion at the fusion center by selecting a reduced (i.e., sparse) yet informative enough subset of sensors. The solution must also fulfill the causality constraints associated to the energy harvesting process. For a classical formulation, the optimization problem turns out to be nonconvex. To circumvent that, we promote sparsity direc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(20 citation statements)
references
References 14 publications
0
20
0
Order By: Relevance
“…Actually, the same result is obtained if each component is known to be either non-positive or non-negative: nonnegativity is assumed for simplicity without loss of generality. However, we notice that the non-negative setting has itself a number of applications, that range from sparse localization problems, see [1], to sparse sensor selection, see [2]. In [4], Problem (1) is shown to provide encouraging results if compared to state-of-the-art algorithms for the recovery of sparse signals from compressed and low-precision data.…”
Section: Background and Motivating Examplementioning
confidence: 99%
“…Actually, the same result is obtained if each component is known to be either non-positive or non-negative: nonnegativity is assumed for simplicity without loss of generality. However, we notice that the non-negative setting has itself a number of applications, that range from sparse localization problems, see [1], to sparse sensor selection, see [2]. In [4], Problem (1) is shown to provide encouraging results if compared to state-of-the-art algorithms for the recovery of sparse signals from compressed and low-precision data.…”
Section: Background and Motivating Examplementioning
confidence: 99%
“…In [2]- [4], [7], [11], a static measurements model was considered such that the distributed parameter estimation is minimized based on the current measurement statistics. These works considered a source without temporal correlation.…”
Section: Introductionmentioning
confidence: 99%
“…In [2] the sensor placement via convex relaxation approach was introduced for static state estimation. In [4], [11], the same problem was solved taking into account the amount of EH This work is supported by the KAUST-MIT-TUD consortium under grant OSR-2015-Sensors-2700.…”
Section: Introductionmentioning
confidence: 99%
“…This design problem is solved for the parameter estimation task with estimation accuracy being the inference performance metric. A similar derivation for the error of the minimum mean squared error (MMSE) estimator is formulated in [7]. Nevertheless, only one type of sensor is considered in [7], which restricts the system flexibility.…”
Section: Introductionmentioning
confidence: 99%
“…A similar derivation for the error of the minimum mean squared error (MMSE) estimator is formulated in [7]. Nevertheless, only one type of sensor is considered in [7], which restricts the system flexibility. Moreover, the problem statement in this work is novel and accounts for a trade off between the system performance and the total budget.…”
Section: Introductionmentioning
confidence: 99%