Journal
PEER-TO-PEER NETWORKING AND APPLICATIONS
Volume 15, Issue 3, Pages 1473-1485Publisher
SPRINGER
DOI: 10.1007/s12083-022-01302-x
Keywords
Arithmetic optimization algorithm; Deployment; Heterogeneous; Range free localization; Wireless sensor networks
Funding
- Manipal Academy of Higher Education, Manipal
Ask authors/readers for more resources
With the advancement of sensor technologies, Wireless Sensor Networks (WSN) are envisioning a rich variety of promising services in many fields. However, coverage holes and disconnected networks can exist in randomly deployed networks.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available