Node Coverage and Connectivity Optimization in Heterogeneous Wireless Sensor Networks Using Improved Flower Pollination Algorithm

Wireless sensor networks (WSNs) rely on energy-conserving routing protocols due to the limited power and communication capabilities. The LEACH protocol has seen extensive usage despite its homogeneous network foundation, leads inadequate signal coverage. To solve the issue, this research proposes an improved flower pollination algorithm (IFPA) improves flower pollination algorithm (FPA) addresses issues with slow convergence and local optima. This research presents an enhanced clustering technique that may be utilized in heterogeneous sensor networks. Its main feature is the ability to adjust the status of data transmission. Once the observed information intensity above the predefined threshold, the data transmission connection is initiated and data is sent to the sink by the cluster heads, which filter the perceived information. Otherwise, cluster nodes keep track of the data and wait for the next batch of nodes to provide data. The good news is that the simulation results show a network lifespan that is several times longer than the LEACH protocol. The IFPA method stands out because it increases coverage rates while drastically decreasing the cost of deploying networks. As a result, the suggested method might find many uses, helping to lower costs and improve the performance of wireless sensor networks.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icuis64676.2024.10866393
Citations
1
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Node Coverage and Connectivity Optimization in Heterogeneous Wireless Sensor Networks Using Improved Flower Pollination Algorithm

S. A. Kalaiselvan, R. Kesavan, Saritha Mahankali
1 citations
Energy Efficient Wireless Sensor Networks
0.35
article

Node Coverage and Connectivity Optimization in Heterogeneous Wireless Sensor Networks Using Improved Flower Pollination Algorithm

S. A. Kalaiselvan, R. Kesavan, Saritha Mahankali
article en
1 citations

Abstract

Wireless sensor networks (WSNs) rely on energy-conserving routing protocols due to the limited power and communication capabilities. The LEACH protocol has seen extensive usage despite its homogeneous network foundation, leads inadequate signal coverage. To solve the issue, this research proposes an improved flower pollination algorithm (IFPA) improves flower pollination algorithm (FPA) addresses issues with slow convergence and local optima. This research presents an enhanced clustering technique that may be utilized in heterogeneous sensor networks. Its main feature is the ability to adjust the status of data transmission. Once the observed information intensity above the predefined threshold, the data transmission connection is initiated and data is sent to the sink by the cluster heads, which filter the perceived information. Otherwise, cluster nodes keep track of the data and wait for the next batch of nodes to provide data. The good news is that the simulation results show a network lifespan that is several times longer than the LEACH protocol. The IFPA method stands out because it increases coverage rates while drastically decreasing the cost of deploying networks. As a result, the suggested method might find many uses, helping to lower costs and improve the performance of wireless sensor networks.

Saveetha University (IN)
Openalex Percentile: Top 34%
Energy Efficient Wireless Sensor Networks
0.35
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.