An enhanced evolutionary algorithm for requested coverage in wireless sensor networks

Wireless sensor nodes with specific and new sensing capabilities and application requirements have affected the behaviour of wireless sensor networks and created problems. Placement of the nodes in an application area is a wellknown problem in the field. In addition, high per-node cost as well as ne...

Full description

Saved in:

Bibliographic Details
Main Author:	Aval, Kamal Jadidy
Format:	Thesis
Language:	English
Published:	2016
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/84068/1/KamalJadidyAvalPFC2016.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.84068
record_format	uketd_dc
spelling	my-utm-ep.840682019-11-05T04:36:25Z An enhanced evolutionary algorithm for requested coverage in wireless sensor networks 2016 Aval, Kamal Jadidy QA75 Electronic computers. Computer science Wireless sensor nodes with specific and new sensing capabilities and application requirements have affected the behaviour of wireless sensor networks and created problems. Placement of the nodes in an application area is a wellknown problem in the field. In addition, high per-node cost as well as need to produce a requested coverage and guaranteed connectivity features is a must in some applications. Conventional deployments and methods of modelling the behaviour of coverage and connectivity cannot satisfy the application needs and increase the network lifetime. Thus, the research designed and developed an effective node deployment evaluation parameter, produced a more efficient node deployment algorithm to reduce cost, and proposed an evolutionary algorithm to increase network lifetime while optimising deployment cost in relation to the requested coverage scheme. This research presents Accumulative Path Reception Rate (APRR) as a new method to evaluate node connectivity in a network. APRR, a node deployment evaluation parameter was used as the quality of routing path from a sensing node to sink node to evaluate the quality of a network deployment strategy. Simulation results showed that the behaviour of the network is close to the prediction of the APRR. Besides that, a discrete imperialist competitive algorithm, an extension of the Imperialist Competitive Algorithm (ICA) evolutionary algorithm was used to produce a network deployment plan according to the requested event detection probability with a more efficient APRR. It was used to reduce deployment cost in comparison to the use of Multi-Objective Evolutionary Algorithm (MOEA) and Multi-Objective Deployment Algorithm (MODA) algorithms. Finally, a Repulsion Force and Bottleneck Handling (RFBH) evolutionary-based algorithm was proposed to prepare a higher APRR and increase network lifetime as well as reduce deployment cost. Experimental results from simulations showed that the lifetime and communication quality of the output network strategies have proven the accuracy of the RFBH algorithm performance. 2016 Thesis http://eprints.utm.my/id/eprint/84068/ http://eprints.utm.my/id/eprint/84068/1/KamalJadidyAvalPFC2016.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:125961 phd doctoral Universiti Teknologi Malaysia, Faculty of Computing Faculty of Computing
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Aval, Kamal Jadidy An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
description	Wireless sensor nodes with specific and new sensing capabilities and application requirements have affected the behaviour of wireless sensor networks and created problems. Placement of the nodes in an application area is a wellknown problem in the field. In addition, high per-node cost as well as need to produce a requested coverage and guaranteed connectivity features is a must in some applications. Conventional deployments and methods of modelling the behaviour of coverage and connectivity cannot satisfy the application needs and increase the network lifetime. Thus, the research designed and developed an effective node deployment evaluation parameter, produced a more efficient node deployment algorithm to reduce cost, and proposed an evolutionary algorithm to increase network lifetime while optimising deployment cost in relation to the requested coverage scheme. This research presents Accumulative Path Reception Rate (APRR) as a new method to evaluate node connectivity in a network. APRR, a node deployment evaluation parameter was used as the quality of routing path from a sensing node to sink node to evaluate the quality of a network deployment strategy. Simulation results showed that the behaviour of the network is close to the prediction of the APRR. Besides that, a discrete imperialist competitive algorithm, an extension of the Imperialist Competitive Algorithm (ICA) evolutionary algorithm was used to produce a network deployment plan according to the requested event detection probability with a more efficient APRR. It was used to reduce deployment cost in comparison to the use of Multi-Objective Evolutionary Algorithm (MOEA) and Multi-Objective Deployment Algorithm (MODA) algorithms. Finally, a Repulsion Force and Bottleneck Handling (RFBH) evolutionary-based algorithm was proposed to prepare a higher APRR and increase network lifetime as well as reduce deployment cost. Experimental results from simulations showed that the lifetime and communication quality of the output network strategies have proven the accuracy of the RFBH algorithm performance.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Aval, Kamal Jadidy
author_facet	Aval, Kamal Jadidy
author_sort	Aval, Kamal Jadidy
title	An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
title_short	An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
title_full	An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
title_fullStr	An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
title_full_unstemmed	An enhanced evolutionary algorithm for requested coverage in wireless sensor networks
title_sort	enhanced evolutionary algorithm for requested coverage in wireless sensor networks
granting_institution	Universiti Teknologi Malaysia, Faculty of Computing
granting_department	Faculty of Computing
publishDate	2016
url	http://eprints.utm.my/id/eprint/84068/1/KamalJadidyAvalPFC2016.pdf
_version_	1747818437611094016

An enhanced evolutionary algorithm for requested coverage in wireless sensor networks

Similar Items