NEECH: New Energy-Efficient Algorithm Based on the Best Cluster Head in Wireless Sensor Networks

One of the main issues in wireless sensor networks is the network lifetime. Sending data collected through nodes in the WSN results in more energy drain. Repeating this procedure drains the primary energy of nodes. So, the network lifetime is expired. This research proposes an algorithm called NEECH based on three dimensions of energy, distance, and density of nodes. The NEECH algorithm improves the network lifetime. Our algorithm is based on the gravity center and the mass center to select the probable cluster head and is selected the best cluster head by genetic algorithm. Simulation results show that the proposed method can improve the network lifetime compared to previous methods. We also demonstrate that the proposed method can select a better cluster head in high-density areas. In addition, the proposed fitness function reduces the number of generations. Our analyses show that the NEECH protocol, in addition to increasing network lifetime and first node die and last node die factors, also reduces the number of executable generations by 22.22%. In addition, unlike early algorithms such as LEACH, which use a random approach to cluster head selection, the NEECH protocol reduces the energy consumption of each node by selecting the appropriate cluster head in each round by the genetic algorithm. The simulation results illustrate that the NEECH algorithm improves the last node die (LND) parameter by more than 67% compared to the LEACH and algorithms based on the LEACH. Moreover, the NEECH protocol also improves the first node die parameter by more than 50% over the LEACH and similar methods to LEACH.