Solving the Sensor Placement Problem Using Evolutionary Algorithms in Wireless Sensor Networks

Sensor placement is one of the most fundamental issues in the design of wireless sensor networks. One of the main challenges in sensor deployment is finding an optimal balance between conflicting network goals such as coverage and reducing the number of sensors in order to optimize. On the other hand, decomposition is a basic method in multi-objective optimization, and in recent years, the idea of using it in multi-objective evolutionary optimization has been proposed. In this research, the sensor placement problem is solved using evolutionary algorithms in wireless sensor networks. The goal of this research is to completely cover the sensors with the least number of sensors. The steps of the work are as follows: first, an NP problem is examined and then the GLA method is defined to solve it. The results show that GLA is more efficient than other methods such as SA and LAEDA in solving the optimization problem in large sensor fields. The proposed algorithm can achieve complete coverage with very low sensor density.

کلیدواژه ها:

Wireless sensor network ، wireless sensor placement ، optimization ، GLA method