Time-bounded essential localization for wireless sensor networks

  • Authors:

  • Wei Cheng;Nan Zhang;Xiuzhen Cheng;Min Song;Dechang Chen

  • Affiliations:

  • Department of Computer Science, University of Massachusetts Lowell, Lowell, MA;Department of Computer Science, The George Washington University, Washington, DC;Department of Computer Science, The George Washington University, Washington, DC;Electrical Engineering and Computer Science Department, University of Toledo, Toledo, OH;Department of Preventive Medicine and Biometrics, Uniformed Services University of the Health Sciences, Bethesda, MD

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional definition of relative localization is inappropriate for evaluating its actual overhead in localization time. To address this issue, we define a novel problem called essential localization and present the first rigorous study on the essential localizability of a wireless sensor network within a given time bound. Additionally, we propose an efficient distributed algorithm for time-bounded essential localization over a sensor network and evaluate the performance of the algorithm with analysis and extensive simulation studies.