Title
Greedy Sensor Selection under Channel Uncertainty
Abstract
Estimation in resource constrained sensor networks where the fusion center selects a fixed-size subset from a pool of available sensors observing the states of a linear dynamical system is considered. With some probability, the communication between a selected sensor and the fusion center may fail. It is shown that when the fusion center employs a Kalman filter and desires to minimize a function of the error covariance matrix, sensor selection under communication uncertainty can be cast as the maximization of a submodular function over uniform matroids. We propose a computationally efficient greedy sensor selection scheme achieving performance within (1 -1/ e ) of the optimal non-adaptive policy. Additionally, we propose an efficient adaptive greedy algorithm which achieves (1-1/e) of the optimal adaptive policy. Structural features of the problem are exploited to reduce the complexity of the greedy selection algorithms. We analyze the complexity and present simulation studies which demonstrate efficacy of the proposed techniques.
Year
DOI
Venue
2012
10.1109/WCL.2012.053112.120229
Wireless Communications Letters, IEEE
Keywords
Field
DocType
Kalman filters,channel estimation,covariance matrices,distributed sensors,optimisation,radio networks,Kalman filter,channel uncertainty,error covariance matrix,fixed-size subset,fusion center,greedy sensor selection,linear dynamical system,maximization,resource constrained sensor networks,submodular function,Kalman filter,Submodular functions,link failures,sensor selection
Linear dynamical system,Mathematical optimization,Submodular set function,Kalman filter,Greedy algorithm,Fusion center,Covariance matrix,Greedy randomized adaptive search procedure,Wireless sensor network,Mathematics
Journal
Volume
Issue
ISSN
1
4
2162-2337
Citations 
PageRank 
References 
5
0.50
7
Authors
3
Name
Order
Citations
PageRank
Shamaiah, M.1567.29
Siddhartha Banerjee218522.85
Haris Vikalo31279113.16