Joint Node Selection and Power Allocation Strategy for Multitarget Tracking in Decentralized Radar Networks
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Networked radar systems have been demonstrated to offer enhanced target tracking capabilities. An effective radar resource allocation strategy can efficiently optimize system parameters, leading to performance enhancements. In this paper, two critical but limited system resources are considered for optimization: the number of radar nodes and the transmitted power. In this scenario, a joint node selection and power allocation (JSPA) strategy is developed with the objective of tracking multiple targets. The proposed mechanism implements the optimal resource allocation based on the feedback information in the tracking recursion cycle in order to improve the worst-case tracking accuracy with multiple targets. The network architecture considered in this paper is decentralized so that communication requirements may be reduced while maintaining system robustness. Since the predicted conditional Cramér-Rao lower bound (PC-CRLB) provides a lower bound on the accuracy of the target state estimates conditional on the actual measurement realizations, it is more accurate than the standard posterior CRLB and is thus derived and used as an optimization criterion for the JSPA strategy. It is shown that the optimal JSPA is a two-variable nonconvex optimization problem. We propose an efficient two-step semidefinite programming based solution to solve this problem. Numerical results demonstrate the superior performance of the proposed strategy and the effectiveness of the proposed solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“For practical large networked systems, they can be provided by using average consensus algorithms [47].”
MethodEstimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
Self-citationAnalytic Implementations of the Cardinalized Probability Hypothesis Density Filter
Vo, B.-T., Vo, B.-N., & Cantoni, A. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894241 · Cited by 824 · cited 1×
“, CPHD filtering [56], [57], and multisensor fusion [58], [59], the concept of resource-aware design can also be applied to the RFS-based tracking problems.”
Method
Metadata
- Authors
- Xie, M., Yi, W., Kirubarajan, T., & Kong, L.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-02-01
- Volume
- 66
- Issue
- 3
- Pages
- 729-743
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2769907991
- Cited by
- 192
- References
- 3
- FWCI
- 8.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Joint Node Selection and Power Allocation Strategy for Multitarget Tracking in Decentralized Radar Networks. https://app.cochat.ai/papers/10.1109/tsp.2017.2777394
- The paper
- Xie, M., Yi, W., Kirubarajan, T., & Kong, L. (2018). Joint Node Selection and Power Allocation Strategy for Multitarget Tracking in Decentralized Radar Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2017.2777394
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.