Distributed data acquisition optimization algorithm for wireless sensor networks

With the rapid development of applications such as the Internet of Things and intelligent transportation, wireless sensor networks play an important role in data collection and environmental monitoring. However, wireless sensor networks face low efficiency and high energy consumption in distributed data collection and node configuration. In this context, a sensor node configuration optimization algorithm based on an improved sparrow search algorithm by introducing reverse elite selection, dynamic perturbation, and dynamic warning update strategies is proposed. Secondly, a virtual grid partitioning strategy is designed, and a distributed data collection and transmission optimization algorithm is proposed. The node configuration algorithm achieved the most uniform distribution of nodes in simulation testing and almost achieved complete region coverage. Under 30% node failure, its network coverage rate was 83.5%. When the packet size was 1000kb, the data transmission rate and average communication delay of the data collection algorithm were 4.2Mbps and 42ms, respectively. Compared with existing algorithms, the proposed scheme performs well in coverage retention, energy consumption reduction, and fault recovery capability, and can meet the efficient and reliable distributed data collection needs of wireless sensor networks in complex environments.

Authors

Institutions

Publication Details

Journal
Measurement Sensors
Published
2025-05-14
DOI
https://doi.org/10.1016/j.measen.2025.101883
Citations
2
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed data acquisition optimization algorithm for wireless sensor networks

Hongxu Zhang, Youxian Zhang, Zhen Nie
2 citations
Measurement Sensors
Energy Efficient Wireless Sensor Networks
2.97
article

Distributed data acquisition optimization algorithm for wireless sensor networks

Hongxu Zhang, Youxian Zhang, Zhen Nie
article en
2 citations

Abstract

With the rapid development of applications such as the Internet of Things and intelligent transportation, wireless sensor networks play an important role in data collection and environmental monitoring. However, wireless sensor networks face low efficiency and high energy consumption in distributed data collection and node configuration. In this context, a sensor node configuration optimization algorithm based on an improved sparrow search algorithm by introducing reverse elite selection, dynamic perturbation, and dynamic warning update strategies is proposed. Secondly, a virtual grid partitioning strategy is designed, and a distributed data collection and transmission optimization algorithm is proposed. The node configuration algorithm achieved the most uniform distribution of nodes in simulation testing and almost achieved complete region coverage. Under 30% node failure, its network coverage rate was 83.5%. When the packet size was 1000kb, the data transmission rate and average communication delay of the data collection algorithm were 4.2Mbps and 42ms, respectively. Compared with existing algorithms, the proposed scheme performs well in coverage retention, energy consumption reduction, and fault recovery capability, and can meet the efficient and reliable distributed data collection needs of wireless sensor networks in complex environments.

Measurement SensorsVol. 39
Henan Institute of Technology (CN), Henan Institute of Science and Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 9%
Energy Efficient Wireless Sensor Networks
2.97
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.