Localization of networks with presence and distance constraints based on 1-hop and 2-hop mass–spring optimization

In this paper we consider the localization of a sensor network where the nodes are heterogeneous, in that some of them are able to measure the distance from their neighbors, while some others are just able to detect their presence, and we provide a post-processing algorithm that can be used to improve an initial estimate for the location of the nodes, based on a mass–spring optimization approach, taking into account presence and distance information, as well as one-hop and two-hop information.