Search algorithms for path planning problems in harsh wireless sensor network environment

This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. The three addressed problems are 1) long initial computation delay in dynamic environment,...

Full description

Saved in:

Bibliographic Details
Main Author:	Hong, Siaw Swin
Format:	Thesis
Language:	English
Published:	2017
Subjects:	Wireless LANs Wireless sensor networks
Online Access:	http://psasir.upm.edu.my/id/eprint/76952/1/FSKTM%202017%2067%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.76952
record_format	uketd_dc
spelling	my-upm-ir.769522020-02-11T01:38:27Z Search algorithms for path planning problems in harsh wireless sensor network environment 2017-07 Hong, Siaw Swin This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. The three addressed problems are 1) long initial computation delay in dynamic environment, 2) slow reaction towards rapid change of goal points and massive number of node depending on single source of computational power, and 3) tradeoffs between optimality and computational effort to achieve optimality in TSP path planning problem. Literatures are reviewed, restructured in chronological form, and discussed. Open issues of reviewed algorithms had been briefed in this dissertation. In order to solve the addressed problem, this dissertation proposed three algorithms which are Enhanced D, Natural Behaviour Navigation (NBN), and Frothing Waypoint Navigation (FWN). Each algorithm solves its respective problem with Enhanced D solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. Experiments have been done for each algorithm by comparing with other suitable algorithms. Multiple performance metrics have been defined and discussed for all experiments. The metrics included but not limited to the few following: Average Path Length, Initial Delay, Computational Time, Cell Visit, and so on. Finally, conclusion is drawn from the results of all experiments at the end of the dissertation and future works are proposed along. Wireless LANs Wireless sensor networks 2017-07 Thesis http://psasir.upm.edu.my/id/eprint/76952/ http://psasir.upm.edu.my/id/eprint/76952/1/FSKTM%202017%2067%20IR.pdf text en public doctoral Universiti Putra Malaysia Wireless LANs Wireless sensor networks
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
topic	Wireless LANs Wireless sensor networks
spellingShingle	Wireless LANs Wireless sensor networks Hong, Siaw Swin Search algorithms for path planning problems in harsh wireless sensor network environment
description	This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. The three addressed problems are 1) long initial computation delay in dynamic environment, 2) slow reaction towards rapid change of goal points and massive number of node depending on single source of computational power, and 3) tradeoffs between optimality and computational effort to achieve optimality in TSP path planning problem. Literatures are reviewed, restructured in chronological form, and discussed. Open issues of reviewed algorithms had been briefed in this dissertation. In order to solve the addressed problem, this dissertation proposed three algorithms which are Enhanced D, Natural Behaviour Navigation (NBN), and Frothing Waypoint Navigation (FWN). Each algorithm solves its respective problem with Enhanced D solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. Experiments have been done for each algorithm by comparing with other suitable algorithms. Multiple performance metrics have been defined and discussed for all experiments. The metrics included but not limited to the few following: Average Path Length, Initial Delay, Computational Time, Cell Visit, and so on. Finally, conclusion is drawn from the results of all experiments at the end of the dissertation and future works are proposed along.
format	Thesis
qualification_level	Doctorate
author	Hong, Siaw Swin
author_facet	Hong, Siaw Swin
author_sort	Hong, Siaw Swin
title	Search algorithms for path planning problems in harsh wireless sensor network environment
title_short	Search algorithms for path planning problems in harsh wireless sensor network environment
title_full	Search algorithms for path planning problems in harsh wireless sensor network environment
title_fullStr	Search algorithms for path planning problems in harsh wireless sensor network environment
title_full_unstemmed	Search algorithms for path planning problems in harsh wireless sensor network environment
title_sort	search algorithms for path planning problems in harsh wireless sensor network environment
granting_institution	Universiti Putra Malaysia
publishDate	2017
url	http://psasir.upm.edu.my/id/eprint/76952/1/FSKTM%202017%2067%20IR.pdf
_version_	1747813194156474368

Search algorithms for path planning problems in harsh wireless sensor network environment

Similar Items