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.