Localizing Mobile Nodes in WSNs using Dragonfly Algorithm

Abstract

The most fundamental and important parameter in Wireless Sensor Networks (WSNs) is to locate the actual location of the node which is supposed to be the target. To locate the node, the utmost parameter is to determine the coordinates of the nodes otherwise all the information which is accumulated using the other sensor nodes will be of no use and hence the communication will be erroneous and may become as a source of interference for all the nodes. Thus for majority of the application under WSNs, necessity is to find the exact geographical location of the target nodes. In this paper, to compute the location of randomly moving target nodes an algorithm known as Dragon Fly Metaheuristic algorithm is used. A node whose position is known is normally deployed in the middle of the region which is to be sensed. The effectiveness of the DA method may be determined by getting results and comparing performance metrics such as the number of localised nodes, location, and scalability.