Customized Chimp With Blue Monkey Optimization (CCBMO)‐Based Secure‐Aware Cluster‐Based Routing in Wireless Sensor Network

ABSTRACT One of the most well‐known routing systems is cluster‐based routing, where the head node collects information from every other cluster node, performs specific aggregation functions, and afterwards delivers the aggregated information towards the base station. Motivated by that, we have developed a novel cluster‐based routing approach that is comprised of two working phases which are optimal cluster head selection as well as routing. Cluster‐based routing reduces the energy consumption of sensor nodes by organizing them into clusters, allowing data to be aggregated before transmission, which minimizes redundant data communication. The suggested approach allows the network to dynamically react to shifting conditions, such as node failures, mobility, and changes in ambient parameters. In this first phase, the suitable cluster head is selected using the hybridized optimization named customized chimp with blue monkey optimization (CCBMO), by considering the parameters like energy, distance as well as delay. After the selection of the optimal cluster head, routing is done which uses factors such as packet delivery ratio (PDR) and security for the optimal routing process.

Authors

Institutions

Publication Details

Journal
International Journal of Communication Systems
Published
2026-06-17
DOI
https://doi.org/10.1002/dac.70531
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Customized Chimp With Blue Monkey Optimization (CCBMO)‐Based Secure‐Aware Cluster‐Based Routing in Wireless Sensor Network

Senthil Murugan, K. Kalaiselvi, Y. Basanthi
International Journal of Communication Systems
Energy Efficient Wireless Sensor Networks
article

Customized Chimp With Blue Monkey Optimization (CCBMO)‐Based Secure‐Aware Cluster‐Based Routing in Wireless Sensor Network

Senthil Murugan, K. Kalaiselvi, Y. Basanthi
article en

Abstract

ABSTRACT One of the most well‐known routing systems is cluster‐based routing, where the head node collects information from every other cluster node, performs specific aggregation functions, and afterwards delivers the aggregated information towards the base station. Motivated by that, we have developed a novel cluster‐based routing approach that is comprised of two working phases which are optimal cluster head selection as well as routing. Cluster‐based routing reduces the energy consumption of sensor nodes by organizing them into clusters, allowing data to be aggregated before transmission, which minimizes redundant data communication. The suggested approach allows the network to dynamically react to shifting conditions, such as node failures, mobility, and changes in ambient parameters. In this first phase, the suitable cluster head is selected using the hybridized optimization named customized chimp with blue monkey optimization (CCBMO), by considering the parameters like energy, distance as well as delay. After the selection of the optimal cluster head, routing is done which uses factors such as packet delivery ratio (PDR) and security for the optimal routing process.

International Journal of Communication SystemsVol. 39(11)
SRM Institute of Science and Technology (IN), Saint Joseph's College (US), Chettinad Academy of Research and Education (IN), St. Joseph's Institute of Technology (IN)
Affordable and clean energy
Openalex Percentile: Top 4%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.