Electronic Science and Technology ›› 2025, Vol. 38 ›› Issue (3): 60-67.doi: 10.16180/j.cnki.issn1007-7820.2025.03.008

Previous Articles     Next Articles

Optimization of 3D Coverage in Wireless Sensor Networks Based on Improved SO Algorithm

GAO Zhixiang, PANG Feifei(), SONG Peikun   

  1. School of Electronics Information,Xi'an Polytechnic University,Xi'an 710600,China
  • Received:2023-09-26 Revised:2023-10-09 Online:2025-03-15 Published:2025-03-11
  • Supported by:
    National Natural Science Foundation of China(62101419);Xi'an Beilin District Science and Technology Plan Project(GX2146);China Textile Industry Federation Science and Technology Guidance Program Projec(2020069)

Abstract:

In view of the problems such as slow convergence and incomplete coverage of the basic snake algorithm when applied to the coverage of 3D wireless sensor networks, an improved snake algorithm is proposed to optimize the coverage of spatial networks. Chebyshev polynomial is used to improve the initial population of the snake optimization algorithm, so that the population of the algorithm has a better initial position, which lays a foundation for the subsequent position update. In the exploration stage and the development stage of snake optimization algorithm, spiral sine strategy and piecewise chaotic mapping are introduced respectively to intervene in population position update, so that the population can keep a high search ability and search range. The improved snake optimization algorithm is applied to the coverage problem of wireless sensor three-dimensional space network. The simulation results show that compared with the basic snake optimization algorithm, the improved snake optimization algorithm can improve the coverage of space network by 20%, enhance the overall performance of the network, and has practicability and robustness.

Key words: wireless sensor network, SO algorithm, space coverage, Chebyshev polynomial, chaotic map, spiral sine strategy, node deployment, terative refinement

CLC Number: 

  • TP212.9