Mobile anchor-free localization for wireless sensor networks

  • Authors:
  • Yurong Xu;Yi Ouyang;Zhengyi Le;James Ford;Fillia Makedon

  • Affiliations:
  • DevLab, Computer Science Department, Dartmouth College and Heracleia Lab, Univ. of Texas at Arlington;DevLab, Computer Science Department, Dartmouth College and Heracleia Lab, Univ. of Texas at Arlington;DevLab, Computer Science Department, Dartmouth College and Heracleia Lab, Univ. of Texas at Arlington;DevLab, Computer Science Department, Dartmouth College and Heracleia Lab, Univ. of Texas at Arlington;DevLab, Computer Science Department, Dartmouth College and Heracleia Lab, Univ. of Texas at Arlington

  • Venue:
  • DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the network nodes can be in motion at any given time. For situations in which it is not practical or cost-efficient to use GPS or anchor nodes, this paper proposes an Anchor-Free Mobile Geographic Distributed Localization (MGDL) algorithm for wireless sensor networks. Taking advantage of the accelerometers that are present in standard motes, MGDL estimates the distance moved by each node. If this distance is beyond a threshold, then this node will trigger a series of mobile localization procedures to recalculate and update its location in the node itself. Such procedures will be stopped when the node stops moving. Data collected using Tmote Invent nodes (Moteiv Inc.) and simulations show that the proposed detection method can efficiently detect the movement, and that the localization is accurate and the communication is efficient in different static and mobile contexts.