The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Impact of network density on data aggregation in wireless sensor networks
Abstract
In-network data aggregation is essential for wireless sensor networks where energy resources are limited. In a previously proposed data dissemination scheme (directed diffusion with opportunistic aggregation), data is opportunistically aggregated at intermediate nodes on a low-latency tree. In this paper, we explore and evaluate greedy aggregation, a novel approach that adjusts aggregation points to increase the amount of path sharing, reducing energy consumption. Our preliminary results suggest that, under investigated scenarios, greedy aggregation can achieve up to 45% energy savings over opportunistic aggregation in high-density networks without adversely impacting latency or robustness.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Energy-efficient communication protocol for wireless microsensor networks
Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2005) · Proceedings of the 33rd Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2000.926982 · Cited by 14,140
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
Self-citationWireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
Next century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
Self-citationThe impact of data aggregation in wireless sensor networks
Krishnamachari, L., Estrin, D., & Wicker, S. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems Workshops · doi:10.1109/icdcsw.2002.1030829 · Cited by 1,448
Self-citationA survey of active network research
Tennenhouse, D. L., Smith, J. M., Sincoskie, W. D., Wetherall, D. J., & Minden, G. J. (1997) · IEEE Communications Magazine · doi:10.1109/35.568214 · Cited by 1,358
An approximate solution for the Steiner problem in graphs
Takahashi, H., & Matsuyama, A. (1980) · Mathematica japonica · Cited by 878
Building efficient wireless sensor networks with low-level naming
Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., & Ganesan, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502049 · Cited by 598
Self-citationSteiner problem in networks: a survey
WinterP. (1987) · Networks · doi:10.5555/34233.34235 · Cited by 563
Computational experience with approximation algorithms for the set covering problem
Grossman, T., & Wool, A. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00161-0 · Cited by 201
Wetherall, D. J., & Tennenhouse, D. L. (1996) · ACM SIGOPS European Workshop · doi:10.1145/504450.504457 · Cited by 119
Cited by
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844142 · Cited by 2,719
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
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
Self-citationThe nesC language: a holistic approach to networked embedded systems
Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., & Culler, D. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641652 · Cited by 1,631
TinyOS: An Operating System for Sensor Networks
Levis, P., Madden, S., Polastre, J., Szewczyk, R., Whitehouse, K., Woo, A., Gay, D., Hill, J., Welsh, M., Brewer, E., et al. (2005) · Ambient Intelligence · doi:10.1007/3-540-27139-2_7 · Cited by 1,324
Metadata
- Authors
- Intanagonwiwat, C., Estrin, D., Govindan, R., & Heidemann, J.
- Venue
- Proceedings 22nd International Conference on Distributed Computing Systems
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Pages
- 457-458
- OpenAlex
- W2151157922
- Cited by
- 696
- References
- 13
- FWCI
- 33.39
- 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.