The DOI matches its OpenAlex record.
Taming the underlying challenges of reliable multihop routing in sensor networks
Abstract
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table with constant space regardless of cell density. We study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques. We focus on a many-to-one, periodic data collection workload. We narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments. The most effective solution uses a simple time averaged EWMA estimator, frequency based table management, and cost-based routing.
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
Cited by
Joint mobility and routing for lifetime elongation in wireless sensor networks
Luo, J., & Hubaux, J.-P. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498454 · Cited by 880
Machine learning in wireless sensor networks: Algorithms, strategies, and applications
Alsheikh, M. A., Lin, S., Niyato, D., & Tan, H.-P. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320099 · Cited by 965
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
Localization With Mobile Anchor Points in Wireless Sensor Networks
Ssu, K.-F., Ou, C.-H., & Jiau, H. C. (2005) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2005.844642 · Cited by 461
Denial-of-Service in Wireless Sensor Networks: Attacks and Defenses
Raymond, D. R., & Midkiff, S. F. (2008) · IEEE Pervasive Computing · doi:10.1109/mprv.2008.6 · Cited by 461
Metadata
- Authors
- Woo, A., Tong, T., & Culler, D.
- Published
- 2003-01-01
- OpenAlex
- W4235904988
- Cited by
- 636
- References
- 0
- FWCI
- 21.57
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Taming the underlying challenges of reliable multihop routing in sensor networks. https://app.cochat.ai/papers/10.1145/958492.958494
- The paper
- Woo, A., Tong, T., & Culler, D. (2003). Taming the underlying challenges of reliable multihop routing in sensor networks. https://doi.org/10.1145/958492.958494
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.