ArticleSensors (Basel, Switzerland)2024
K-Means Based Bee Colony Optimization for Clustering in Heterogeneous Sensor Network.
Article in Sensors (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Binary Secretary Bird Optimization Clustering by Novel Fitness Function Based on Voronoi Diagram in Wireless Sensor Networks.Sensors (Basel, Switzerland) · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
Abstract
In Wireless Sensor Networks (WSNs), an efficient clustering technique is critical in optimizing the energy level of networked sensors and prolonging the network lifetime. While the traditional bee colony optimization technique has been widely used as a clustering technique in WSN, it mostly suffers from energy efficiency and network performance. This study proposes a Bee Colony Optimization that synergistically combines K-mean algorithms (referred to as K-BCO) for efficient clustering in heterogeneous sensor networks. This is to develop a robust and efficient clustering algorithm that addresses the challenges of energy consumption and network performance in WSNs. The K-BCO algorithm outperformed comparative clustering algorithms such as H-LEACH, DBCP, and ABC-ACO in average error rate (AER), average data delivery rate (ADDR), and average energy consumption (AEC) for transmitting data packets from sensors to cluster heads. The K-BCO outperformed other algorithms in terms of ADDR at 95.00% against H-LEACH (75.86%), DBCP (72.07%) and ABC-ACO (90.08%). The findings indicate that the K-BCO not only optimizes energy consumption but also guarantees more stable and robust solutions, thereby extending the network lifetime of WSNs. Thus, K-BCO is recommended to practitioners in wireless sensor networks as it paves the way for more efficient and sustainable wireless communication.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.