A multi-objective metaheuristic method for node placement in dynamic IoT environments

This study introduces an optimal Node Placement based on Enhanced Sand Cat Swarm Optimization (NP-ESCSO) algorithm, a novel metaheuristic approach for solving the node placement problem in dynamic IoT environments. By integrating a Tent chaotic map and a hybrid motion strategy, the algorithm achieves a robust balance between exploration and exploitation, ensuring superior performance in obstacle-rich environments. A newly developed multi-objective fitness function optimizes critical metrics such as coverage, energy efficiency, connectivity, and redundancy. The proposed method highlights its potential for scalable and cost-effective IoT network deployment, particularly in environments with complex obstacles. Furthermore, the algorithm exhibits faster convergence and superior adaptability, making it suitable for real-world applications. NP-ESCSO not only optimizes IoT systems efficiently but also offers significant advancements in reducing computational overhead, improving scalability, and ensuring dynamic adaptability. Simulations conducted on real-world maps demonstrate that NP-ESCSO achieves a coverage rate of 92.44%, an energy efficiency of 48.69%, and a redundancy value of 2.096, significantly outperforming baseline methods. Compared to existing algorithms, NP-ESCSO improves fitness values by up to 14% and other key performance indicators by 45%.

Authors

Institutions

Publication Details

Journal
Discover Internet of Things
Published
2025-05-22
DOI
https://doi.org/10.1007/s43926-025-00153-1
Citations
3
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
4.46
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A multi-objective metaheuristic method for node placement in dynamic IoT environments

Farzad Kiani
3 citations
Discover Internet of Things
Energy Efficient Wireless Sensor Networks
4.46
article

A multi-objective metaheuristic method for node placement in dynamic IoT environments

Farzad Kiani
article en
3 citations

Abstract

This study introduces an optimal Node Placement based on Enhanced Sand Cat Swarm Optimization (NP-ESCSO) algorithm, a novel metaheuristic approach for solving the node placement problem in dynamic IoT environments. By integrating a Tent chaotic map and a hybrid motion strategy, the algorithm achieves a robust balance between exploration and exploitation, ensuring superior performance in obstacle-rich environments. A newly developed multi-objective fitness function optimizes critical metrics such as coverage, energy efficiency, connectivity, and redundancy. The proposed method highlights its potential for scalable and cost-effective IoT network deployment, particularly in environments with complex obstacles. Furthermore, the algorithm exhibits faster convergence and superior adaptability, making it suitable for real-world applications. NP-ESCSO not only optimizes IoT systems efficiently but also offers significant advancements in reducing computational overhead, improving scalability, and ensuring dynamic adaptability. Simulations conducted on real-world maps demonstrate that NP-ESCSO achieves a coverage rate of 92.44%, an energy efficiency of 48.69%, and a redundancy value of 2.096, significantly outperforming baseline methods. Compared to existing algorithms, NP-ESCSO improves fitness values by up to 14% and other key performance indicators by 45%.

Discover Internet of ThingsVol. 5(1)
Fatih Sultan Mehmet Waqf University (TR)
Openalex Percentile: Top 6%
Energy Efficient Wireless Sensor Networks
4.46
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.