Energy-Aware Sensor Selection in Field Reconstruction
- 29 July 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 21 (12) , 1476-1480
Abstract
In this letter, a new sparsity-promoting penalty function is introduced for sensor selection problems in field reconstruction, which has the property of avoiding scenarios where the same sensors are successively selected. Using a reweighted ℓ 1 relaxation of the ℓ 0 norm, the sensor selection problem is reformulated as a convex quadratic program. In order to handle large-scale problems, we also present two fast algorithms: accelerated proximal gradient method and alternating direction method of multipliers. Numerical results are provided to demonstrate the effectiveness of our approaches.Keywords
Funding Information
- Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (113E220)
This publication has 10 references indexed in Scilit:
- Sparsity-aware field estimation via ordinary Kriging2014
- Optimal Periodic Sensor Scheduling in Networks of Dynamical SystemsIEEE Transactions on Signal Processing, 2014
- Sparsity-Promoting Extended Kalman Filtering for Target Tracking in Wireless Sensor NetworksIEEE Signal Processing Letters, 2012
- Temporally staggered sensing for field estimation with quantized data in wireless sensor networks2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Sensor Selection via Convex OptimizationIEEE Transactions on Signal Processing, 2008
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- On the lifetime of wireless sensor networksIEEE Communications Letters, 2005
- Convex Optimization2004
- Maximum Mutual Information Principle for Dynamic Sensor Query Problems2003