The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Convex position estimation in wireless sensor networks
Abstract
A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem for these constraints yields estimates for the unknown positions of the nodes in the network. Providing that the constraints are tight enough, simulation illustrates that this estimate becomes close to the actual node positions. Additionally, a method for placing rectangular bounds around the possible positions for all unknown nodes in the network is given. The area of the bounding rectangles decreases as additional or tighter constraints are included in the problem. Specific models are suggested and simulated for isotropic and directional communication, representative of broadcast-based and optical transmission respectively, though the methods presented are not limited to these simple cases.
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citationThe capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
The Cricket location-support system
Priyantha, N. B., Chakraborty, A., & Balakrishnan, H. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345917 · Cited by 3,716
GPS-less low-cost outdoor localization for very small devices
Bulusu, N., Heidemann, J., & Estrin, D. (2000) · IEEE Personal Communications · doi:10.1109/98.878533 · Cited by 3,592
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
Self-citationNegotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks
Kulik, J., Heinzelman, W., & Balakrishnan, H. (2002) · Wireless Networks · doi:10.1023/a:1013715909417 · Cited by 1,086
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGOPS Operating Systems Review · doi:10.1145/384264.379006 · Cited by 234
Self-citation2-DOF Actuated Micromirror Designed for Large DC Deflection
Pister, K. S. J., & Sensor, B. (1999) · Cited by 15
Self-citation
Cited by
Locating the nodes: cooperative localization in wireless sensor networks
Patwari, N., Ash, J. N., Kyperountas, S., Hero, A. O., Moses, R. L., & Correal, N. S. (2005) · IEEE Signal Processing Magazine · doi:10.1109/msp.2005.1458287 · Cited by 3,031
Location systems for ubiquitous computing
Hightower, J., & Borriello, G. (2001) · Computer · doi:10.1109/2.940014 · Cited by 2,987
Geography-informed energy conservation for Ad Hoc routing
Xu, Y., Heidemann, J., & Estrin, D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381685 · Cited by 2,833
Range-free localization schemes for large scale sensor networks
He, T., Huang, C., Blum, B. M., Stankovic, J. A., & Abdelzaher, T. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.938995 · Cited by 2,643
Relative location estimation in wireless sensor networks
Patwari, N., Hero, A. O., Perkins, M., Correal, N. S., & O'Dea, R. J. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814469 · Cited by 1,879
Metadata
- Authors
- Doherty, L., pister, K. S. J., & El Ghaoui, L.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 3
- Pages
- 1655-1663
- OpenAlex
- W2165295831
- Cited by
- 1,632
- References
- 11
- FWCI
- 82.97
- Type
- conference paper
- 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.