A heuristic for wireless sensor network localization

The wireless sensor network localization problem is a challenging optimization problem which has attracted much research during the last years. Solving a wireless sensor network localization problem is to best localize a set of points on the basis of a subset of all pair-wise distances (often affected by noise) and the actual position of some of them. Our approach proposed in this paper does not rely on angles between nodes to locate the unknown nodes, and assumes that the distances d and e between some pairs of nodes are given. Our novel approach makes use of successful elements of metaheuristics such as path relinking. Computational experiments on benchmark instances show the effectiveness of our algorithm when compared to the best state-of-the-art approaches