International Advanced Research Journal in             Science, Engineering and Technology

A monthly peer-reviewed / Refereed journal

ISSN Online 2393-8021
ISSN Print 2394-1588

Since  2014

Abstract: Wireless Sensor Networks (WSN) are commonly composed of a great number of randomly deployed nodes that communicate among themselves and gather information about the environment. Localization has been a major challenge in such networks because without discovering the location of the sensor that is informing sensed data, the informed data will not be useful. Localization algorithm is a vital and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. Many localization algorithms have been suggested and can be categorized into two families: range-based and range-free algorithms. Many applications require the sensor nodes to know their locations with a high degree of precision. Several localization methods based on mobile anchor nodes have been proposed for assisting the sensor nodes to determine their locations. However, none of these methods attempt to optimize the trajectory of the mobile anchor node. Accordingly, this work presents a path planning scheme, which optimizes the trajectory of the mobile anchor node minimizes the localization error and guarantees that all of the sensor nodes can determine their locations. To overcome the problem of node failure and link breakage, we will use redeployment of sensor nodes and used the mobile anchors to localize the nodes. The movement of mobile anchor nodes is like that it moves in the grids in a zigzag pattern such that it can efficiently cover the entire sensor field. Wireless Sensor Network (WSN) is a set of sensor nodes connected to each other via wireless links, some node are anchor node and some are unknown which are simulated on the MATLAB. In order to verify performance of our proposed algorithm against other algorithms viz. DV-Hop, simulations are conducted on MATLAB. DV-Hop is one of the range-free localization algorithms utilizing hop-distance estimation. The simulations of algorithms are randomly run many times for each result and the average values were used as final results. Simulation results show the performance of the proposed algorithm is superior to that of the DV-Hop algorithm.

Keywords: Anchor node, Improved DV-HOP algorithm, Localization, MATLAB, Wireless sensor networks

PDF | DOI: 10.17148/IARJSET.2020.7613

Open chat