Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions

The target localization algorithm is critical in the field of wireless sensor networks (WSNs) and is widely used in many applications. In the conventional localization method, the location distribution of the anchor nodes is fixed and cannot be adjusted dynamically according to the deployment enviro...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Chenguang Shao
Formato:	article
Lenguaje:	EN
Publicado:	Hindawi Limited 2021
Materias:	Technology (General) T1-995
Acceso en línea:	https://doaj.org/article/6821430253d94084b6d8cc0ae60b1912
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:6821430253d94084b6d8cc0ae60b1912
record_format	dspace
spelling	oai:doaj.org-article:6821430253d94084b6d8cc0ae60b19122021-11-29T00:56:33ZWireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions1687-726810.1155/2021/4047684https://doaj.org/article/6821430253d94084b6d8cc0ae60b19122021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/4047684https://doaj.org/toc/1687-7268The target localization algorithm is critical in the field of wireless sensor networks (WSNs) and is widely used in many applications. In the conventional localization method, the location distribution of the anchor nodes is fixed and cannot be adjusted dynamically according to the deployment environment. The resulting localization accuracy is not high, and the localization algorithm is not applicable to three-dimensional (3D) conditions. Therefore, a Delaunay-triangulation-based WSN localization method, which can be adapted to two-dimensional (2D) and 3D conditions, was proposed. Based on the location of the target node, we searched for the triangle or tetrahedron surrounding the target node and designed the localization algorithm in stages to accurately calculate the coordinate value of the target. The relationship between the number of target nodes and the number of generated graphs was analysed through numerous experiments, and the proposed 2D localization algorithm was verified by extending it the 3D coordinate system. Experimental results revealed that the proposed algorithm can effectively improve the flexibility of the anchor node layout and target localization accuracy.Chenguang ShaoHindawi LimitedarticleTechnology (General)T1-995ENJournal of Sensors, Vol 2021 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Technology (General) T1-995
spellingShingle	Technology (General) T1-995 Chenguang Shao Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
description	The target localization algorithm is critical in the field of wireless sensor networks (WSNs) and is widely used in many applications. In the conventional localization method, the location distribution of the anchor nodes is fixed and cannot be adjusted dynamically according to the deployment environment. The resulting localization accuracy is not high, and the localization algorithm is not applicable to three-dimensional (3D) conditions. Therefore, a Delaunay-triangulation-based WSN localization method, which can be adapted to two-dimensional (2D) and 3D conditions, was proposed. Based on the location of the target node, we searched for the triangle or tetrahedron surrounding the target node and designed the localization algorithm in stages to accurately calculate the coordinate value of the target. The relationship between the number of target nodes and the number of generated graphs was analysed through numerous experiments, and the proposed 2D localization algorithm was verified by extending it the 3D coordinate system. Experimental results revealed that the proposed algorithm can effectively improve the flexibility of the anchor node layout and target localization accuracy.
format	article
author	Chenguang Shao
author_facet	Chenguang Shao
author_sort	Chenguang Shao
title	Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
title_short	Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
title_full	Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
title_fullStr	Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
title_full_unstemmed	Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions
title_sort	wireless sensor network target localization algorithm based on two- and three-dimensional delaunay partitions
publisher	Hindawi Limited
publishDate	2021
url	https://doaj.org/article/6821430253d94084b6d8cc0ae60b1912
work_keys_str_mv	AT chenguangshao wirelesssensornetworktargetlocalizationalgorithmbasedontwoandthreedimensionaldelaunaypartitions
_version_	1718407711834505216

Wireless Sensor Network Target Localization Algorithm Based on Two- and Three-Dimensional Delaunay Partitions

Ejemplares similares