Localization algorithm for mobile sensor networks under the random walk model

Guey Yun Chang, Dar Wei Chiou

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

1 Scopus citations

Abstract

In wireless sensor network (WSN), location information is required to achieve the goal in many applications. Most of existing localization algorithms for mobile sensor networks are based on the Sequential Monte Carlo (SMC) method. SMC-based methods has either high localization error in low-anchor density environments or high communication cost. In this paper, we propose a non-SMC-based distributed localization scheme. Our main idea comes from the observation that a sensor node which hears another node for a sufficiently long time has trajectory similar to the heard node's trajectory. Simulation shows that our scheme has low localization error, low communication cost, and low computation cost.

Original languageEnglish
Title of host publication2012 12th International Conference on ITS Telecommunications, ITST 2012
Pages758-763
Number of pages6
DOIs
StatePublished - 2012
Event2012 12th International Conference on ITS Telecommunications, ITST 2012 - Taipei, Taiwan
Duration: 5 Nov 20128 Nov 2012

Publication series

Name2012 12th International Conference on ITS Telecommunications, ITST 2012

Conference

Conference2012 12th International Conference on ITS Telecommunications, ITST 2012
Country/TerritoryTaiwan
CityTaipei
Period5/11/128/11/12

Fingerprint

Dive into the research topics of 'Localization algorithm for mobile sensor networks under the random walk model'. Together they form a unique fingerprint.

Cite this