The localization of nodes in a wireless sensor network is milestone to the correct functioning of the network. This paper aims to evaluate by means of simulations the Malguki spring localization algorithm. The algorithm is simulated for three different anchor deployment scenarios: the classical scenarios of random and uniform anchors and a novel scenario called hybrid. This paper analyzes the algorithm from the point of view of the obtained average errors, as well as from the point of view of the parameters that influence its results.
Performance analysis of wireless sensor network node localization algorithm
2011-11-01
261648 byte
Conference paper
Electronic Resource
English
Node Localization in Wireless Sensor Network by Ant Lion Optimization
Springer Verlag | 2021
|British Library Online Contents | 2011
|Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks
British Library Online Contents | 2011
|Node Selection Strategy for Target Localization in Wireless Sensor Networks
British Library Online Contents | 2009
|