Mobile element assisted cooperative localization for wireless sensor networks with obstacles

Hongyang Chen, Qingjiang Shi, Rui Tan, H. Vincent Poor, Kaoru Sezaki

Research output: Contribution to journalArticle

113 Scopus citations

Abstract

In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted wireless sensor networks (WSNs). An optimal movement scheduling method with mobile elements (MEs) is proposed to address limitations of static WSNs in node localization. In this scheme, a mobile anchor node cooperates with static sensor nodes and moves actively to refine location performance. It takes advantage of cooperation between MEs and static sensors while, at the same time, taking into account the relay node availability to make the best use of beacon signals. For achieving high localization accuracy and coverage, a novel convex position estimation algorithm is proposed, which can effectively solve the problem when infeasible points occur because of the effects of radio irregularity and obstacles. This method is the only rangefree based convex method to solve the localization problem when the feasible set of localization inequalities is empty. Simulation results demonstrate the effectiveness of this algorithm.

Original languageEnglish (US)
Article number5427426
Pages (from-to)956-963
Number of pages8
JournalIEEE Transactions on Wireless Communications
Volume9
Issue number3
DOIs
StatePublished - Mar 2010

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Keywords

  • Convex localization algorithm
  • Mobile elements
  • Mobility-assisted wireless sensor networks
  • Optimal movement scheduling

Fingerprint Dive into the research topics of 'Mobile element assisted cooperative localization for wireless sensor networks with obstacles'. Together they form a unique fingerprint.

  • Cite this