Sensor selection is an important design problem in large-scale sensor networks. Sensor selection can be interpreted as the problem of selecting the best subset of sensors that guarantees a certain estimation performance. We focus on observations that are related to a general non-linear model. The proposed framework is valid as long as the observations are independent, and its likelihood satisfies the regularity conditions. We use several functions of the Cramér-Rao bound (CRB) as a performance measure. We formulate the sensor selection problem as the design of a selection vector, which in its original form is a nonconvex l0-(quasi) norm optimization problem. We present relaxed sensor selection solvers that can be efficiently solved in polynomial time. We also propose a projected subgradient algorithm that is attractive for large-scale problems and also show how the algorithm can be easily distributed. The proposed framework is illustrated with a number of examples related to sensor placement design for localization.
Study of Sparsity-Aware Distributed Conjugate Gradient Algorithms for Sensor Networks
提出了一种基于共轭梯度法和扩散策略的传感器网络参数估计分布式自适应算法。我们提出了稀疏意识的传统和修改分布式CG算法使用$l_{1}$和对数和惩罚函数。与一致最小均方(Diffusion-LMS)算法和扩散CG算法相比,所提出的稀疏感知扩散分布式CG算法在均方偏差(MSD)和收敛性能方面都有提高,而与扩散分布式递归最小二乘(Recursive Least Squares,RLS)算法性能接近。数值结果表明,所提出的算法是可靠的,可以应用于多种场景。
Jointly Sparse Blind Deconvolution via Riemannian Optimization
School of Mathematics and Statistics, Xi’an Jiaotong University(西安交通大学数学与统计学院);College of Electronic Engineering, National University of Defense Technology(国防科技大学电子工程学院);School of Mathematical Sciences,University of Science and Technology of China(中国科学技术大学数学科学学院)