Abstract

Many applications in wireless sensor networks require sensor nodes to obtain their absolute or relative geographic positions, but adding GPS receivers or other sophisticated sensors to every node can be expensive. CPE (Convex Position Estimate) is a recent localization method which uses connectivity-induced constraints to derive the locations of the nodes in the network. However, CPE is an inherently centralized algorithm of which the localization accuracy should be improved. In this paper, we propose LNNC (Localization with Neighbor and Non-neighbor Constraints), a new variant of CPE that can be executed in a distributed fashion, and the location estimates rely on the constraints gathered by every node across the network through message exchanges. Providing these constraints are tight enough, we make extensive simulations to illustrate that the new algorithm incorporating non-neighbor constraints performs much better than CPE that only utilizing neighbor constraints.

Paper Details