Strategies for Distributed Sensor Selection Using Convex Optimization


Consider the estimation of an unknown parameter vector in a linear measurement model. Centralized sensor selection consists in selecting a set of ks sensor measurements, from a total number of m potential measurements. The performance of the corresponding selection is measured by the volume of an estimation error covariance matrix. In this work, we consider the problem of selecting these sensors in a distributed or decentralized fashion. In particular, we study the case of two leader nodes that perform naive decentralized selections. We demonstrate that this can degrade the performance severely. Therefore, two heuristics based on convex optimization methods are introduced, where we first allow one leader to make a selection, and then to share a modest amount of information about his selection with the remaining node. We will show that both heuristics clearly outperform the naive decentralized selection, and achieve a performance close to the centralized selection.

DOI: 10.1109/GLOCOM.2012.6503470

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Altenbach2012StrategiesFD, title={Strategies for Distributed Sensor Selection Using Convex Optimization}, author={Fabian Altenbach and Steven Corroy and Georg B{\"{o}cherer and Rudolf Mathar}, booktitle={GLOBECOM}, year={2012} }