The DOI matches its Crossref record.
Adaptive protocols for information dissemination in wireless sensor networks
Open accessAbstract
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network.Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data.They use meta-data negotiations to eliminate the transmission of redundant data throughout the network.In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them.This allows the sensors to efficiently distribute data given a limited energy supply.We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol.We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches.We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
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
Directed diffusion for wireless sensor networking
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808417 · Cited by 2,359
Metadata
- Authors
- Heinzelman, W. R., Kulik, J., & Balakrishnan, H.
- Venue
- Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 174-185
- OpenAlex
- W2091936226
- Cited by
- 2,308
- References
- 0
- FWCI
- 26.77
- Type
- conference paper
- Language
- en
- Open access
- gold
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.
