Tree-based Routing Protocol in Wireless Sensor Networks using Optimization Algorithm Batch Particles with a Mobile Sink
Arian Yousefiankalareh, Ali Najari, Mehdi Hosseynzadeh · 2020
Wireless sensor networks include a large number of sensor nodes that are distributed over a given range. To improve energy efficiency and delay, which are two important criteria in wireless sensor networks, tree-based routing protocols are common. In this paper, we present a minimally invasive veneer tree using the particle optimization algorithm for routing wireless sensor networks with a moving sink. This algorithm is population-based, and population members try to find a tree that has less energy and latency by sharing routing information. The proposed algorithm was compared in terms of energy consumption, distance, and the number of steps with previous algorithms. The simulation results showed that the improvement of the proposed protocol compared to the MWST method is on average in energy, distance, and step 30, 40, and 36 percent, respectively.