EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hybrid Reliable Clustering Algorithm with Heterogeneous Traffic Routing for Wireless Sensor Networks

Sreenu Naik Bhukya iD, Chandra Sekhara Rao Annavarapu

Sensors · 31.01.2025 · 25 (3) · 864

DOI: 10.3390/s25030864 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 31.01.2025. Verfasst von Sreenu Naik Bhukya und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engaging, National Institute of Technology Calicut, NIT Campus P.O., Kozhikode 673 601, Kerala, India. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Wireless sensor networks (WSNs) are vulnerable to several challenges. Congestion control, the utilization of trust to ensure security, and the incorporation of clustering schemes demand much attention. Algorithms designed to deal with congestion control fail to ensure security and address challenges faced due to congestion in the network. To resolve this issue, a Hybrid Trust-based Congestion-aware Cluster Routing (HTCCR) protocol is proposed to effectively detect attacker nodes and reduce congestion via optimal routing through clustering. In the proposed HTCCR protocol, node probability is determined based on the trust factor, queue congestion status, residual energy (RE), and distance from the mobile base station (BS) by using hybrid K-Harmonic Means (KHM) and the Enhanced Gravitational Search Algorithm (EGSA). Sensor nodes select cluster heads (CHs) with better fitness values and transmit data through them. The CH forwards data to a mobile sink once the sink comes into the range of CH. Priority-based data delivery is incorporated to effectively control packet forwarding based on priority level, thus decreasing congestion. It is evident that the propounded HTCCR protocol offers better performance in contrast to the benchmarked TBSEER, CTRF, and TAGA based on the average delay, packet delivery ratio (PDR), throughput, detection ratio, packet loss ratio (PLR), overheads, and energy through simulations. The proposed HTCCR protocol involves 2.5, 2.3, and 1.7 times less delay; an 18.1%, 12.5%, and 5.5% better detection ratio; 2.9, 2.6, and 1.8 times less energy; a 2.2, 1.9, and 1.5 times lower PLR; a 14.5%, 10.5%, and 5.2% better PDR; a 30.7%, 28.5%, and 18.4% better throughput; and 2.27, 1.91, and 1.66 times lower routing overheads in contrast to the TBSEER, CTRF, and TAGA protocols, respectively. The HTCCR protocol involves 4.1% less delay for the ‘C1’ and ‘C2’ RT packets, and the average throughput of RT is 10.4% better when compared with NRT.

Schlagwörter

Stichwörter der Autor:innen

Enhanced Gravitational Search Algorithm (EGSA)K-Harmonic Means (KHM)congestionpriority-based data deliverytrustwireless sensor networks (WSNs)

Autor:innen und Institutionen

  • Department of Computer Science and Engaging, National Institute of Technology Calicut, NIT Campus P.O., Kozhikode 673 601, Kerala, India.
  • Department of Computer Science and Engineering, Indian Institute of Technology (Indian School of Mines) Dhanbad, Dhanbad 826004, Jharkhand, India.

ORCID-Profile: Sreenu Naik Bhukya

Zitieren

APA

Bhukya, S. N., & Annavarapu, C. S. R. (2025). Hybrid Reliable Clustering Algorithm with Heterogeneous Traffic Routing for Wireless Sensor Networks. Sensors, 25(3), 864. https://doi.org/10.3390/s25030864

Vancouver

Bhukya SN, Annavarapu CSR. Hybrid Reliable Clustering Algorithm with Heterogeneous Traffic Routing for Wireless Sensor Networks. Sensors. 2025;25(3):864. doi:10.3390/s25030864

BibTeX
@article{Bhukya2025,
  author = {Bhukya, Sreenu Naik and Annavarapu, Chandra Sekhara Rao},
  title = {Hybrid Reliable Clustering Algorithm with Heterogeneous Traffic Routing for Wireless Sensor Networks},
  journal = {Sensors},
  year = {2025},
  volume = {25},
  number = {3},
  pages = {864},
  doi = {10.3390/s25030864}
}
Kostenlos starten →