By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zou, L.L. ; Sch. of Inf. Sci. & Technol., Beijing Normal Univ., Beijing ; Zhao, Z.W. ; Zheng, Y.Q.

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.

Published in:

Industrial Informatics, 2008. INDIN 2008. 6th IEEE International Conference on

Date of Conference:

13-16 July 2008