Sparse localization on the basis of Schmidt orthonormalization in wireless sensor networks

  • Chunhui Zhao*
  • , Yunlong Xu
  • , Hui Huang
  • , Bing Cui
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

To improve the localization accuracy of a node in the wireless sensor network with a mobile beacon node, a sparse localization algorithm using Schmidt orthonormalization (SLSO) was proposed. With the SLSO, the node localization problem was converted to a reconstruction problem of the sparse signal by gridding the sensing area, and a new observation matrix which is able to effectively satisfy the restricted isometry property (RIP) was obtained by Schmidt orthonormalization. To solve the problem of the sparse signal being approximately sparse in the model, a centroid algorithm was adopted to improve the localization accuracy. The experiment results show that, compared with MAP algorithms, SLSO has better localization accuracy, and requires less broadcasting times.

Original languageEnglish
Pages (from-to)747-752+759
JournalHarbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University
Volume35
Issue number6
DOIs
Publication statusPublished - Jun 2014
Externally publishedYes

Keywords

  • Compressed sensing
  • Mobile beaconing
  • Node localization
  • Schmidt orthonormalization
  • Sparse localization
  • Wireless sensor network

Fingerprint

Dive into the research topics of 'Sparse localization on the basis of Schmidt orthonormalization in wireless sensor networks'. Together they form a unique fingerprint.

Cite this