The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach
Abstract
Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in ad-hoc sensor networks. Based on this approach, we present a protocol, HEED (hybrid energy-efficient distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does not make any assumptions about the distribution or density of nodes, or about node capabilities, e.g., location-awareness. The clustering process terminates in O(1) iterations, and does not depend on the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. It also achieves fairly uniform cluster head distribution across the network. A careful selection of the secondary clustering parameter can balance load among cluster heads. Our simulation results demonstrate that HEED outperforms weight-based clustering protocols in terms of several cluster characteristics. We also apply our approach to a simple application to demonstrate its effectiveness in prolonging the network lifetime and supporting data aggregation.
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
An application-specific protocol architecture for wireless microsensor networks
Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2002.804190 · Cited by 10,565
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
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
Data Mining - Concepts and Techniques.
Perner, P. (2002) · Künstliche Intell. · Cited by 4,886
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
Geography-informed energy conservation for Ad Hoc routing
Xu, Y., Heidemann, J., & Estrin, D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381685 · Cited by 2,833
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
Protocols for self-organization of a wireless sensor network
Sohrabi, K., Gao, J., Ailawadhi, V., & Pottie, G. J. (2000) · IEEE Personal Communications · doi:10.1109/98.878532 · Cited by 2,060
An energy efficient hierarchical clustering algorithm for wireless sensor networks
Bandyopadhyay, S., & Coyle, E. J. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209194 · Cited by 1,774
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
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
Rumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Instrumenting the world with wireless sensor networks
Estrin, D., Girod, L., Pottie, G., & Srivastava, M. (2002) · 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221) · doi:10.1109/icassp.2001.940390 · Cited by 1,164
Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks
Kulik, J., Heinzelman, W., & Balakrishnan, H. (2002) · Wireless Networks · doi:10.1023/a:1013715909417 · Cited by 1,086
Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2002) · Wireless Networks · doi:10.1023/a:1016542229220 · Cited by 1,071
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
A transmission control scheme for media access in sensor networks
Woo, A., & Culler, D. (2001) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/381677.381699 · Cited by 962
PEAS: a robust energy conserving protocol for long-lived sensor networks
Ye, F., Zhong, G., Cheng, J., Lu, S., & Zhang, L. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2003.1203449 · Cited by 922
Rumor Routing Algorithm For Sensor Networks
Braginsky, D., & Estrin, D. L. (2002) · Cited by 905
Power control and clustering in ad hoc networks
Kawadia, V., & Kumar, P. R. (2004) · doi:10.1109/infcom.2003.1208697 · Cited by 587
A clustering scheme for hierarchical control in multi-hop wireless networks
Banerjee, S., & Khuller, S. (2002) · doi:10.1109/infcom.2001.916296 · Cited by 551
PEAS: a robust energy conserving protocol for long-lived sensor networks
Ye, F., Zhong, G., Lu, S., & Zhang, L. (2003) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2002.1181406 · Cited by 515
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
Cerpa, A., & Estrin, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019378 · Cited by 487
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
Chan, H., & Perrig, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24606-0_11 · Cited by 376
ASCENT: Adaptive Self-Configuring sEnsor Network Topologies
Cerpa, A., & Estrin, D. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510736 · Cited by 319
On-demand routing in large ad hoc wireless networks with passive clustering
Gerla, M., Kwon, T. J., & Pei, G. (2002) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2000.904608 · Cited by 190
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
Self-citationJoint 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
In-network aggregation techniques for wireless sensor networks: a survey
Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007) · IEEE Wireless Communications · doi:10.1109/mwc.2007.358967 · Cited by 734
Node clustering in wireless sensor networks: recent developments and deployment challenges
Younis, O., Krunz, M., & Ramasubramanian, S. (2006) · IEEE Network · doi:10.1109/mnet.2006.1637928 · Cited by 721
Self-citationData Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620
Metadata
- Authors
- Younis, O., & Fahmy, S.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2004-12-23
- Volume
- 1
- Pages
- 629-640
- OpenAlex
- W2126379392
- Cited by
- 1,093
- References
- 31
- FWCI
- 36.96
- 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.