International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 0

Research Paper | Computer Engineering | Volume 15 Issue 9, September 2026 | Pages: 769 - 775 | India


A K-Means Clustering and Artificial Bee Colony Algorithm-based Routing Framework for Dynamic Communication Networks

I. Infant Jansi, Dr. G. Jagatheeshkumar

Abstract: To guarantee dependable and timely data transfer, dynamic communication networks including Mobile Ad Hoc Networks (MANETs), Wireless Sensor Networks (WSNs), Internet of Things (IoT) system, and Vehicular Ad Hoc Networks (VANETs) need effective routing techniques. Because of node mobility, network congestion, energy limitations, and frequent topology changes, conventional routing protocols frequently suffer from performance degradation. This study suggests and optimized routing architecture for dynamic communication networks that combines the Artificial Bee Colony (ABC) optimization method with K-Means clustering in order to overcome these difficulties. Network nodes are arranged into effective clusters using the K-Means clustering technique. Which lowers routing overhead and increases network scalability. The Artificial Bee Colony method takes into account factors including residual energy, communication distance, link quality, and network congestion to determine the best cluster heads and find effective routing patterns. Enhancing route stability, minimizing packet loss, lowering end-to-end latency, and improving network performance are the goals of the hybrid framework. The suggested method enables effective resource use and allows adaptive decision-making in the face of shifting network conditions. Performance measures such Packet Delivery Ratio, throughput, Energy Consumption, Routing Overhead, and Network Lifetime will be used in simulation tests to assess the framework efficacy. The anticipated outcomes show that in dynamic communication contexts, the suggested hybrid routing model can greatly outperform optimization-based routing techniques and conventional routing protocols.

Keywords: Dynamic communication networks, Artificial Bee Colony, Optimization Algorithm, Simulation experiments, Routing protocols

How to Cite?: I. Infant Jansi, Dr. G. Jagatheeshkumar, "A K-Means Clustering and Artificial Bee Colony Algorithm-based Routing Framework for Dynamic Communication Networks", Volume 15 Issue 9, September 2026, International Journal of Science and Research (IJSR), Pages: 769-775, https://www.ijsr.net/getabstract.php?paperid=SR26910192704, DOI: https://dx.doi.org/10.21275/SR26910192704

Download Citation: APA | MLA | BibTeX | EndNote | RefMan

Share This Research

Help this article reach readers, researchers and professionals.

Share activity is measured for research-engagement analytics. Only verified, unique public shares can support award tie-breaking.

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.

Download Article PDF


Rate This Article!

Top

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.