IEL: A New Localization Algorithm for Wireless Sensor Network


In order to improve the estimation accuracy, coverage and stability of Bounding Box localization method, we proposed a new method based on discrete communication model, IEL (Intersection and Exclusion Localization). In our discrete network model, the network was subdivided into many congruent square cells, and all the positions and distances were expressed as the number of cells, the communication range of each node was defined as a rectangle centered at the node. Sensor nodes use geometric constraints induced by both neighboring and non-neighboring anchors to decrease the uncertainty of their position estimate. A sensor node can position itself anywhere within the intersection of the communication ranges of its neighboring anchors, also within the exclusion of those other anchors outside of its range. Simulation results in more realistic scenarios show preliminarily that IEL can significantly achieve higher accuracy with less anchor nodes than Bounding Box method.

  • Abstract
  • Keywords:
  • Introduction
  • Bounding Box Localization
  • IEL Algorithm
  • Algorithm Performance Analysis
  • Simulation Results
  • Conclusion
  • Acknowledgments
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In