.png){kind=icon}
.png){kind=icon}
Return
PSO based Amorphous algorithm to reduce localization error in Wireless Sensor Network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2024.101890.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, localizing or identifying the position of unknown sensor nodes has become an essential problem in Wireless Sensor Networks (WSN). The improvement in localization accuracy leads to obtaining the exact location of the dumb node. Among all localization algorithms, Amorphous localization is highly suggested for usage in many application domains due to its simplicity, viability, low cost, and zero additional hardware requirements. Position estimation of the dumb node in the Amorphous algorithm considers three different practical scenarios, such as the position of dumb nodes falling within the range of anchor nodes, the position of the dumb node being in the opposite direction of the anchor node, and the position of the dumb node not within the range of anchor node. However, the localization error generated by the Amorphous algorithm is high. To address the limitations of Amorphous algorithm we have proposed a PSO based Amorphous algorithm. The proposed work reduces the average hop size of anchor nodes and reduces the localization error. The simulation results demonstrate that, in comparison to other existing Amorphous algorithms, the proposed PSO based Amorphous localization algorithm produced a superior performance in terms of MAE, MSE and RMSE.
Keywords:
Wireless Sensor Network (WSN)
Localization
Range-based localization
Range-free localization
Amorphous algorithm
Particle Swarm Optimization (PSO)
Journal
IF:
3.5
Papers:
1.5K
Citations:
2.2K