Low Cost Recursive Localization scheme for High Density Wireless Sensor Networks

Abstract

While existing localization approaches mainly focus on enhancing the accuracy, particular attention has recently been given to reducing the localization algorithm implementation costs. To obtain a tradeoff between location accuracy and implementation cost, recursive localization approaches are being pursued as a cost-effective alternative to the more expensive localization approaches. In the recursive approach, localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, the authors propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the localization accuracy through an adequate distribution of reference nodes within the network.

Comparative node selection‐based localization technique for wireless sensor networks: A bilateration approach

“…A variation of this is in the ERL strategy. 22 Instead of considering the energy of the nodes to compute the confidence value, it simply limits the reference nodes depending on the distance between them. The spacing between the reference nodes is maintained at r/2 and r/3, where r is the cell radius, so that at least one reference node is present per cell.…”