A new approach towards solving the location discovery problem in wireless sensor networks

  • Authors:

  • Guang Han;Gang Qu;Shaoxiong Hua

  • Affiliations:

  • Dept. of Electrical and Computer Engineering and Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Dept. of Electrical and Computer Engineering and Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Synopsys Inc., Mountain View, CA

  • Venue:
  • MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Location discovery problem in wireless sensor networks (WSN) is the process that sensor nodes collaborate to determine their positions. To solve this problem, high-cost sensor nodes with known locations, called anchors, are required. We propose a novel bilateration locationing algorithm and an associated anchor deployment scheme that can reduce the number of required anchors and location errors. The novelty in the bilateration algorithm is that it generally requires only two neighbor sensors with known locations to determine a node's location. To make this algorithm effective in practice, we propose to deploy three anchors as a group. Therefore, sensors around the anchors can first locate themselves and then sensors that are far away can gradually determine their locations. We conduct theoretical analysis and extensive simulations. Comparing with the state-of-the-art location discovery approaches, our algorithm provides higher accurate location estimations with fewer anchor's and lower communication cost.