Discussion of the work, which proposed the idea of virtual anchor nodes for the localization of the sensor nodes, with having the movement of single sensor node in the circular movement with being optimized by the HPSO. For the ranging the RSSI model has been proposed in the algorithm. As a reference node, single anchor node has been used for the localization of whole network. As of the random deployment of the sensor nodes (target nodes), when the target nodes fall under the range of the mobile anchor node, the Euclidean distance between the target node and mobile anchor node is being calculated. After the calculation of the Euclidean distance the two anchor nodes are being deployed with a difference of 600angle. Using the directional information the projecting of virtual anchor nodes is done, to which the virtual anchor nodes helps in the calculation of the 2D coordinates. While the calculation the mobile sensor node follow ups the circular path. The mobile sensor node considering at a center of the area marks up distance of its maximum range, and with that distance as a radius its goes for other circular path movement if all sensor nodes don’t fell to its range. With its movement at constant velocity the algorithm runs again and again. The performance of the algorithm are done on the factors of the average localization error and convergence time. The problem as of the LoS, with the virtual anchor nodes have been minimized.
Kamal, Y., Sharma, K., & Vandana. (2019). H-best particle swarm optimization based localization algorithm for wireless sensor network. International Journal of Engineering and Advanced Technology, 9(1), 2769–2778. https://doi.org/10.35940/ijeat.A9776.109119