A localization and deployment model for wireless sensor networks using arithmetic optimization algorithm

58Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the advancement of sensor technologies, Wireless Sensor Networks (WSN) are envisioning a rich variety of promising services in many fields. WSN is formed by the deployment of sensor nodes in the regions of interest using a deterministic or random deployment strategy. The random deployment strategy is more suitable in large monitoring areas and harsh environments. But, in this type of deployment, coverage holes and disconnected networks can exist. Important events may get unnoticed reducing the reliability of the networks. Since the locations of nodes are unknown in a randomly deployed WSN, it is difficult to locate the holes. For this, we are proposing a localization and deployment model. The localization algorithm uses Arithmetic Optimization Algorithm (AOA) and the results of this algorithm are further used to develop a deployment model to achieve a completely connected network. This algorithm is tested in various fields. The algorithm is able to localize nodes accurately and identify the coverage holes with an error rate of less than 0.27% when the Average Localization Error (ALE) is within 5m.

Cite

CITATION STYLE

APA

Bhat, S. J., & Santhosh, K. V. (2022). A localization and deployment model for wireless sensor networks using arithmetic optimization algorithm. Peer-to-Peer Networking and Applications, 15(3), 1473–1485. https://doi.org/10.1007/s12083-022-01302-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free