Greedy Sensor Selection: Leveraging Submodularity Based on Volume Ratio of Information Ellipsoid

This article focuses on greedy approaches to select the most informative k sensors from N candidates to maximize the Fisher information, i.e., the determinant of the Fisher information matrix (FIM), which indicates the volume of the information ellipsoid (VIE) constructed by the FIM. However, it is a critical issue for conventional greedy...

Sensor Selection for Angle of Arrival Estimation Based on the Two-Target Cramér-Rao Bound

Sensor selection is a useful method to help reduce data throughput, as well as computational, power, and hardware requirements, while still maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown source models. In this work, we...

Array Design Based on the Worst-Case Cramér-Rao Bound to Account for Multiple Targets

Sensor selection is a useful method to help reduce computational, hardware, and power requirements while maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown target directions. We propose to tackle the sensor selection problem...

Sensor placement and resource allocation for energy harvesting IoT networks

Optimal sensor selection for source parameter estimation in energy harvesting Internet of Things (IoT) networks is studied in this paper. Specifically, the focus is on the selection of the sensor locations which minimizes the estimation error at a fusion center, and to optimally allocate power and bandwidth for each selected sensor subject to...

Sparse sensing for composite matched subspace detection

In this paper, we propose sensor selection strategies, based on convex and greedy approaches, for designing sparse samplers for composite detection. Particularly, we focus our attention on sparse samplers for matched subspace detectors. Differently from previous works, that mostly rely on random matrices to perform compression of the sub...

Submodular Sparse Sensing for Gaussian Detection with Correlated Observations

Detection of a signal under noise is a classical signal processing problem. When monitoring spatial phenomena under a fixed budget, i.e., either physical, economical or computational constraints, the selection of a subset of available sensors, referred to as sparse sensing, that meets both the budget and performance requirements is highly...

Subset Selection for Kernel-Based Signal Reconstruction

In this work, we introduce subset selection strategies for signal reconstruction based on kernel methods, particularly for the case of kernel-ridge regression. Typically, these methods are employed for exploiting known prior information about the structure of the signal of interest. We use the mean squared error and a scalar function of the...

Consistent sensor, relay, and link selection in wireless sensor networks

In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in a wireless sensor network where the active sensors need to communicate their measurements to one or...