CAUCHY localization: A distributed computation of WSNs

Y. M. Baryshnikov, E. G. Coffman, K. J. Kwak

Research output: Contribution to journalConference articlepeer-review

Abstract

The localization problem of a wireless sensor network (WSN) is posed as a distributed computation performed by the sensors alone. A relatively small number of the nodes along the boundary of the WSN are initialized with their exact locations, which serve as reference coordinates that seed the computation. Our range-free, scalable localization protocol begins with a self-organizing, local-rule, distributed computation: In a converging sequence, each sensor periodically takes as its location estimate the average of its neighbors' estimates. These estimates are used to construct an instance of the Cauchy Integral Formula from which the final location estimates are produced. Our research is still in progress, but we are currently in position to argue the superiority over other range-free methods operating under similar minimalist constraints. Among the salient properties of our approach is a tolerance to variations in timing and sensor density, and to variations in the characteristics of individual sensors, such as computing speed and communication range.

Original languageEnglish (US)
Pages (from-to)59-61
Number of pages3
JournalPerformance Evaluation Review
Volume39
Issue number2
DOIs
StatePublished - Sep 2011
Event29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation, IFIP PERFORMANCE 2011 - Amsterdam, Netherlands
Duration: Oct 18 2011Oct 20 2011

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'CAUCHY localization: A distributed computation of WSNs'. Together they form a unique fingerprint.

Cite this