The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Entropy-based sensor selection heuristic for target localization
Open accessAbstract
We propose an entropy-based sensor selection heuristic for localization. Given 1) a prior probability distribution of the target location, and 2) the locations and the sensing models of a set of candidate sensors for selection, the heuristic selects an informative sensor such that the fusion of the selected sensor observation with the prior target location distribution would yield on average the greatest or nearly the greatest reduction in the entropy of the target location distribution. The heuristic greedily selects one sensor in each step without retrieving any actual sensor observations. The heuristic is also computationally much simpler than the mutual-information-based approaches. The effectiveness of the heuristic is evaluated using localization simulations in which Gaussian sensing models are assumed for simplicity. The heuristic is more effective when the optimal candidate sensor is more informative.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Wireless sensor networks: a survey
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00302-4 · Cited by 17,418
Chen, J. C., Hudson, R. E., & Yao, K. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.800420 · Cited by 509
Self-citationData Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Manyika, J., & Durrant-Whyte, H. F. (1995) · Cited by 333
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
Ertin, E., Fisher, J. W., III, & Potter, L. (2003) · International Symposium on Information Processing in Sensor Networks · doi:10.1007/3-540-36978-3_27 · Cited by 177
Coherent acoustic array processing and localization on wireless sensor networks
Chen, J. C., Yip, L., Elson, J., Wang, H., Maniezzo, D., Hudson, R. E., Yao, K., & Estrin, D. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814924 · Cited by 176
Self-citationLiu, J., Liu, J., Reich, J., Cheung, P., & Zhao, F. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36978-3_8 · Cited by 152
Cited by
Sensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
Approaches to Multisensor Data Fusion in Target Tracking: A Survey
Smith, D., & Singh, S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.183 · Cited by 379
Metadata
- Authors
- Wang, H., Yao, K., Pottie, G., & Estrin, D.
- Venue
- Proceedings of the 3rd international symposium on Information processing in sensor networks
- Publisher
- ACM
- Published
- 2004-04-26
- Pages
- 36-45
- OpenAlex
- W2140529724
- Cited by
- 310
- References
- 8
- FWCI
- 12.79
- Type
- conference paper
- Language
- en
- Open access
- green
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: Entropy-based sensor selection heuristic for target localization. https://app.cochat.ai/papers/10.1145/984622.984628
- The paper
- Wang, H., Yao, K., Pottie, G., & Estrin, D. (2004). Entropy-based sensor selection heuristic for target localization. Proceedings of the 3rd international symposium on Information processing in sensor networks. https://doi.org/10.1145/984622.984628
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.
