JOURNAL ARTICLE

Localization Algorithm for Wireless Sensor Network Based on Genetic Simulated Annealing Algorithm

Abstract

In most sensor network applications, the information gathered by sensors will be meaningless without the location of the sensor nodes. Node localization has been a topic of active research in recent years. Accurate self-localization capability is highly desirable in wireless sensor network (WSN). This paper proposes a genetic simulated annealing algorithm based localization (GSAAL) algorithm for WSN. The proposed algorithm adopts two new genetic operators: single-vertex- neighborhood mutation and the descend-based arithmetic crossover. Four example problems are used to evaluate the performance of the proposed algorithm. Simulation results show that our algorithm can achieve higher accurate position estimation than semi-definite programming with gradient search localization (SDPL).

Keywords:
Wireless sensor network Simulated annealing Algorithm Crossover Computer science Genetic algorithm Brooks–Iyengar algorithm Node (physics) Vertex (graph theory) Key distribution in wireless sensor networks Wireless Wireless network Artificial intelligence Computer network Theoretical computer science Engineering Graph Machine learning

Metrics

34
Cited By
1.14
FWCI (Field Weighted Citation Impact)
19
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Indoor and Outdoor Localization Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Underwater Vehicles and Communication Systems
Physical Sciences →  Engineering →  Ocean Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.