On precise path planning algorithm in wireless sensor network. (July 2018)

• Record Type: Journal Article
• Authors: Javed, Farhanda; Khan, Samiullah; Khan, Asfandyar; Javed, Alweena; Tariq, Rohi; Matiullah, ; Khan, Faheem
• Is Part Of: International journal of distributed sensor networks. Volume 14:Number 7(2018)
• Publication Date: 2018-07
• Subjects: Wireless sensor networks -- localization -- mobile beacon trajectory -- reference nodes -- collinearity; Sensor networks -- Periodicals; Intelligent agents (Computer software) -- Periodicals; Multisensor data fusion -- Periodicals; 681.2
• DOI: 10.1177/1550147718783385
• Languages: English
• ISSNs: 1550-1329

Abstract

Wireless sensor network is a collection of small devices called sensors nodes, which are deployed in the sensing field to monitor physical and environmental information. Location information of sensor node is a critical issue for many applications in wireless sensor network. The main problem is to design a path for a mobile landmark to maximize the location accuracy as well as to reduce energy consumption. Different path planning schemes have been proposed for localization. Here, this study focused only on static path planning scheme. In this article, the performance of five static path planning schemes is evaluated, namely, random way point, Scan, D-Scan, Hilbert, and Circles based on three parameters such as location error ratio, energy consumption, and number of references. Network simulator-2 is used as a simulation tool. Simulation scenarios with three node densities are used in this research study such as sparse node density, medium node density, and dense node density. The analysis of simulation results concludes that random way point has higher performance efficiency compared to rest of the static path planning algorithms concerning location error ratio (accuracy), energy consumption, and number of references in medium and dense node density scenarios. Hilbert performance was found good only in sparse node density scenario.