The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Trickle Algorithm
Abstract
The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression mechanism and transmission point selection allow Trickle’s communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use. Status of This Memo This is an Internet Standards Track document. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the
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
IP is dead, long live IP for wireless sensor networks
Hui, J. W., & Culler, D. E. (2008) · Proceedings of the 6th ACM conference on Embedded network sensor systems · doi:10.1145/1460412.1460415 · Cited by 312
Self-citation
Cited by
Standardized Protocol Stack for the Internet of (Important) Things
Palattella, M. R., Accettura, N., Vilajosana, X., Watteyne, T., Grieco, L. A., Boggia, G., & Dohler, M. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.111412.00158 · Cited by 767
Performance analysis of the RPL Routing Protocol
Accettura, N., Grieco, L. A., Boggia, G., & Camarda, P. (2011) · 2011 IEEE International Conference on Mechatronics · doi:10.1109/icmech.2011.5971218 · Cited by 346
Ghaleb, B., Al-Dubai, A. Y., Ekonomou, E., Alsarhan, A., Nasser, Y., Mackenzie, L. M., & Boukerche, A. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2874356 · Cited by 333
Challenging the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL): A Survey
Kim, H.-S., Ko, J., Culler, D. E., & Paek, J. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2751617 · Cited by 278
Self-citationIETF Standardization in the Field of the Internet of Things (IoT): A Survey
Ishaq, I., Carels, D., Teklemariam, G., Hoebeke, J., Abeele, F., Poorter, E., Moerman, I., & Demeester, P. (2013) · Journal of Sensor and Actuator Networks · doi:10.3390/jsan2020235 · Cited by 226
Metadata
- Authors
- Levis, P., Clausen, T., Hui, J., Gnawali, O., & Ko, J.
- Publisher
- RFC Editor
- Published
- 2011-03
- OpenAlex
- W2298500030
- Cited by
- 457
- References
- 1
- Type
- report
- 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.