Node positioning in ad hoc wireless sensor networks

Kegen Yu*, Mark Hedley, Ian Sharp, Y. Jay Guo

*Corresponding author for this work

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

15 Citations (Scopus)

Abstract

Locating the sensor nodes in an ad hoc wireless sensor network (WSN) is a very challenging task. In general, the network nodes are not synchronised and the internal delays within the sensor nodes may be unknown. As a result, the positioning problem can not be solved by simply using the triangulation method and certain prior information must be provided. In this paper, we consider a scenario where there are a number of nodes whose positions are known, and it is required to locate the other mobile or static sensor nodes within the radio range of each other by measuring the time of arrival (TOA) in the whole system. Two algorithms are employed, the direct method and the linear least squares (LS) estimator. The performance of the two algorithms is investigated. In particular an analytical formula is derived to estimate the performance of the LS estimator. Simulation results agree well with theoretical predictions.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Industrial Informatics, INDIN'06
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages641-646
Number of pages6
ISBN (Print)0780397010, 9780780397019
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2006 IEEE International Conference on Industrial Informatics, INDIN'06 - Singapore, Singapore
Duration: 16 Aug 200618 Aug 2006

Other

Other2006 IEEE International Conference on Industrial Informatics, INDIN'06
CountrySingapore
CitySingapore
Period16/08/0618/08/06

Fingerprint Dive into the research topics of 'Node positioning in ad hoc wireless sensor networks'. Together they form a unique fingerprint.

Cite this