Time-bounded essential localization forwireless sensor networks

Wei Cheng*, Nan Zhang, Min Song, Dechang Chen, Xicheng Lu, Zexin Lu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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. To address this problem, 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. We propose an efficient distributed algorithm for timebounded essential localization over a sensor network, and evaluate the performance of our algorithm with extensive simulations.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010
Pages3-12
Number of pages10
DOIs
StatePublished - 2010
Externally publishedYes
Event5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010 - Macau, China
Duration: 15 Jul 201017 Jul 2010

Publication series

NameProceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010

Conference

Conference5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010
Country/TerritoryChina
CityMacau
Period15/07/1017/07/10

Keywords

  • Essential localization
  • Relative localization
  • Time bound
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'Time-bounded essential localization forwireless sensor networks'. Together they form a unique fingerprint.

Cite this