E-SeRLoc: An enhanced serloc localization algorithm with reduced computational complexity

The localization problem in wireless sensor networks often raises the crucial question that to what extent higher location estimation accuracy can be achieved at the cost of additional energy consumption. To obtain a trade off between location accuracy and energy consumption in wireless sensor networks, it is necessary to have a global vision where both the localization scheme and its induced computational complexity are jointly addressed. However, throughout the variety of research works in this topic, much emphasis has been primarily placed on the localization scheme itself and even when the energy consumption issue is addressed, little insight is often provided to the computational complexity issue. Instead, our take in this work is to revisit SeRLoc, a well-known localization algorithm, by analyzing its algorithmic complexity and then proposing a novel method that reduces its computational complexity while preserving its location accuracy. Analytical results and extensive simulations show that the enhanced version of SeRLoc, called E-SeRLoc, achieves the same degree of location accuracy as the original version while paying less complexity cost, thereby reducing the energy consumption.