A hierarchical and partial-distributed localization scheme for ad-hoc wireless sensor networks

L. L. Zou, Z. W. Zhao, Yuanqing Zheng

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Current localization algorithms for Ad-hoc wireless sensor networks are categorized either as distributed or centralized ones. Typical distributed algorithms include DV-hop, DV-distance [1], etc., which need the deployment of certain amount of anchor nodes; on the contrary, the centralized algorithms, such as MDS-MAP [3], need less anchor nodes, while the computation complexity is higher as a result of centralized computing. In this paper, a hierarchical and partial-distributed scheme for Ad-hoc wireless sensor networks is proposed. The scheme can be implemented with lower computation complexity and less anchor nodes; moreover, the transmission of localization information among different nodes is easier than that in the scheme utilizing completely distributed algorithms. In addition, the implementation approach of the scheme in NS-2 is given in the simulation section.
Original languageEnglish
Title of host publicationProceedings - IEEE INDIN 2008
Subtitle of host publication6th IEEE International Conference on Industrial Informatics
Pages25-29
Number of pages5
DOIs
Publication statusPublished - 31 Oct 2008
Externally publishedYes
EventIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics - Daejeon, Korea, Republic of
Duration: 13 Jul 200816 Jul 2008

Conference

ConferenceIEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics
CountryKorea, Republic of
CityDaejeon
Period13/07/0816/07/08

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this