The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
An energy efficient hierarchical clustering algorithm for wireless sensor networks
Abstract
A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.
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
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
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
An energy-efficient MAC protocol for wireless sensor networks
Ye, W., Heidemann, J., & Estrin, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019408 · Cited by 5,361
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
Adaptive clustering for mobile wireless networks
Lin, C. R., & Gerla, M. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.622910 · Cited by 1,533
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
Composing domain-specific design environments
Ledeczi, A., Bakay, A., Maroti, M., Volgyesi, P., Nordstrom, G., Sprinkle, J., & Karsai, G. (2001) · Computer · doi:10.1109/2.963443 · Cited by 1,130
Distributed clustering for ad hoc networks
Basagni, S. (2003) · Proceedings of the ... International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN) · doi:10.1109/ispan.1999.778957 · Cited by 1,021
Max-min d-cluster formation in wireless ad hoc networks
Amis, A. D., Prakash, R., Vuong, T. H. P., & Huynh, D. T. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832171 · Cited by 985
Smart Dust: communicating with a cubic-millimeter computer
Warneke, B., Last, M., Liebowitz, B., & Pister, K. S. J. (2001) · Computer · doi:10.1109/2.895117 · Cited by 697
CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
Carman, D. W., Kruus, P. S., & Matt, B. J. (2000) · Cited by 620
Bulusu, N., Heidemann, J., & Estrin, D. (2002) · Proceedings 21st International Conference on Distributed Computing Systems · doi:10.1109/icdsc.2001.918979 · Cited by 289
Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
Baccelli, F., & Zuyev, S. (1999) · Operations Research · doi:10.1287/opre.47.4.619 · Cited by 86
Cited by
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
Younis, O., & Fahmy, S. (2004) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2004.41 · Cited by 5,025
Routing techniques in wireless sensor networks: a survey
Al-Karaki, J. N., & Kamal, A. E. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1368893 · Cited by 4,500
A survey on clustering algorithms for wireless sensor networks
Abbasi, A. A., & Younis, M. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.05.024 · Cited by 2,383
Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach
Younis, O., & Fahmy, S. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354534 · Cited by 1,093
Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes
Tutuncuoglu, K., & Yener, A. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.012412.110805 · Cited by 749
Metadata
- Authors
- Bandyopadhyay, S., & Coyle, E. J.
- Venue
- IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
- Publisher
- IEEE
- Published
- 2004-03-01
- Volume
- 3
- Pages
- 1713-1723
- OpenAlex
- W2167465093
- Cited by
- 1,774
- References
- 15
- FWCI
- 54.56
- 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.