Cart (Loading....) | Create Account
Close category search window
 

Sensor Selection in Distributed Multiple-Radar Architectures for Localization: A Knapsack Problem Formulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Godrich, H. ; Princeton Univ., Princeton, NJ, USA ; Petropulu, A.P. ; Poor, H.V.

Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, with full resource allocation, the achievable localization minimum estimation mean-square error (MSE) may extend beyond the system predetermined performance goals. In this paper, performance driven resource allocation schemes for multiple radar systems are proposed. Two operational policies are considered. In the first, the number of transmit and receive antennas employed in the estimation process is minimized by effectively selecting a subset of active antennas such that the required MSE performance threshold is attained. In the second, an optimal subset of active antennas of predetermined size is selected such that the localization MSE is minimized. These problems are formulated in a combinatorial optimization framework as a knapsack problem (KP), where the goal is to obtain a performance level with the lowest cost, in terms of active system elements. The Cramer-Rao bound (CRB) is used as a performance metric. Cost parameters, representing operational cost or any other utilization constraints on the antennas, are associated with each of the radars. These are incorporated in the KP formulation, integrating decision making factors in the selection process. Antenna subset selection is implemented through a heuristic algorithm, by successively selecting antennas so as to minimize the performance gap between the temporal CRB and a given MSE goal or a given subset size. The proposed approximate algorithms offer considerable reduction in computational complexity when compared with an exhaustive search. By minimizing the number of operational antennas needed to complete the task, this concept introduces savings in both communication link needs and central processing load, in addition to the operational ones.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 1 )

Date of Publication:

Jan. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.