A Connectivity Based Localization Algorithm for Sensor Network

It is often useful to know the geographic positions of nodes in a wireless sensor network. LCO (Localization with Convex Optimization technique) is a recent localization method which uses connectivity-induced constraints-who is within communications range of whom-to derive the locations of the nodes in the network. However, LCO is an inherently centralized algorithm restricted in many applications. In this paper, we propose a new variant of the LCO method, LN3I (Localization with all Neighbor and Non-Neighbor relationships and Iteration). The location estimates rely on these relationships gathered by each node through message exchanges over a wireless sensor network. Using extensive simulations providing that the constraints are tight enough, we show that the new algorithm that incorporating non-neighbor constraints performs much better than the LCO method that only utilizing neighbor relationships.