A New Distributed Localization Method for Sensor Networks

Abstract

This paper studies the problem of determining the sensor locations in a large sensor network using relative distance (range) measurements only. Our work follows from a seminal paper by Khan et al. [1] where a distributed algorithm, known as DILOC, for sensor localization is given using the barycentric coordinate. A main limitation of the DILOC algorithm is that all sensor nodes must be inside the convex hull of the anchor nodes. In this paper, we consider a general sensor network without the convex hull assumption, which incurs challenges in determining the sign pattern of the barycentric coordinate. A criterion is developed to address this issue based on available distance measurements. Also, a new distributed algorithm is proposed to guarantee the asymptotic localization of all localizable sensor nodes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…