On precise path planning algorithm in wireless sensor network

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 d...

Full description

Saved in:
Bibliographic Details
Main Authors: Farhanda Javed, Samiullah Khan, Asfandyar Khan, Alweena Javed, Rohi Tariq, Matiullah, Faheem Khan
Format: Article
Language:English
Published: Wiley 2018-07-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147718783385
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850160226958835712
author Farhanda Javed
Samiullah Khan
Asfandyar Khan
Alweena Javed
Rohi Tariq
Matiullah
Faheem Khan
author_facet Farhanda Javed
Samiullah Khan
Asfandyar Khan
Alweena Javed
Rohi Tariq
Matiullah
Faheem Khan
author_sort Farhanda Javed
collection DOAJ
description 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.
format Article
id doaj-art-b42affe4262643b594ee55d8817fa91f
institution OA Journals
issn 1550-1477
language English
publishDate 2018-07-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-b42affe4262643b594ee55d8817fa91f2025-08-20T02:23:12ZengWileyInternational Journal of Distributed Sensor Networks1550-14772018-07-011410.1177/1550147718783385On precise path planning algorithm in wireless sensor networkFarhanda Javed0Samiullah Khan1Asfandyar Khan2Alweena Javed3Rohi Tariq4 Matiullah5Faheem Khan6Institute of Social Policy & Research (ISPaR)–Peshawar, Bacha Khan University CharsaddaDepartment of Maths, Stats and Computer Science, The University of Agriculture PeshawarInstitute of Business Management Sciences, The University of Agriculture PeshawarDepartment of Computer Science, Virtual University of PakistanDepartment of Maths, Stats and Computer Science, The University of Agriculture PeshawarInstitute of Social Policy & Research (ISPaR)–Peshawar, Bacha Khan University CharsaddaDepartment of Computer Science, Bacha Khan University, CharsaddaWireless 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.https://doi.org/10.1177/1550147718783385
spellingShingle Farhanda Javed
Samiullah Khan
Asfandyar Khan
Alweena Javed
Rohi Tariq
Matiullah
Faheem Khan
On precise path planning algorithm in wireless sensor network
International Journal of Distributed Sensor Networks
title On precise path planning algorithm in wireless sensor network
title_full On precise path planning algorithm in wireless sensor network
title_fullStr On precise path planning algorithm in wireless sensor network
title_full_unstemmed On precise path planning algorithm in wireless sensor network
title_short On precise path planning algorithm in wireless sensor network
title_sort on precise path planning algorithm in wireless sensor network
url https://doi.org/10.1177/1550147718783385
work_keys_str_mv AT farhandajaved onprecisepathplanningalgorithminwirelesssensornetwork
AT samiullahkhan onprecisepathplanningalgorithminwirelesssensornetwork
AT asfandyarkhan onprecisepathplanningalgorithminwirelesssensornetwork
AT alweenajaved onprecisepathplanningalgorithminwirelesssensornetwork
AT rohitariq onprecisepathplanningalgorithminwirelesssensornetwork
AT matiullah onprecisepathplanningalgorithminwirelesssensornetwork
AT faheemkhan onprecisepathplanningalgorithminwirelesssensornetwork