The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cooperative Received Signal Strength-Based Sensor Localization With Unknown Transmit Powers
Abstract
Cooperative localization (also known as sensor network localization) using received signal strength (RSS) measurements when the source transmit powers are different and unknown is investigated. Previous studies were based on the assumption that the transmit powers of source nodes are the same and perfectly known which is not practical. In this paper, the source transmit powers are considered as nuisance parameters and estimated along with the source locations. The corresponding Cramér-Rao lower bound (CRLB) of the problem is derived. To find the maximum likelihood (ML) estimator, it is necessary to solve a nonlinear and nonconvex optimization problem, which is computationally complex. To avoid the difficulty in solving the ML estimator, we derive a novel semidefinite programming (SDP) relaxation technique by converting the ML minimization problem into a convex problem which can be solved efficiently. The algorithm requires only an estimate of the path loss exponent (PLE). We initially assume that perfect knowledge of the PLE is available, but we then examine the effect of imperfect knowledge of the PLE on the proposed SDP algorithm. The complexity analyses of the proposed algorithms are also studied in detail. Computer simulations showing the remarkable performance of the proposed SDP algorithm are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Cited by
Tomic, S., Beko, M., & Dinis, R. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2014.2334397 · Cited by 353
A Theoretical Foundation of Network Localization and Navigation
Win, M. Z., Shen, Y., & Dai, W. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2844553 · Cited by 353
Metadata
- Authors
- Vaghefi, R. M., Gholami, M. R., Buehrer, R. M., & Strom, E. G.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-03
- Volume
- 61
- Issue
- 6
- Pages
- 1389-1403
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2114351513
- Cited by
- 245
- References
- 1
- FWCI
- 13.02
- 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
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.