By Topic

Efficient Localized Localization Algorithm for 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
$33 $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

5 Author(s)
Kezhong Liu ; Wuhan University of Technology ; Shu Wang ; Fan Zhang ; Fuping Hu
more authors

The location of sensor nodes in wireless sensor networks plays an important role in most applications. In this paper, we address the localization problem by characterizing some sufficient conditions such that technical convenience for the collection of local information used for network localization can be enabled. The main contribution of this paper is as follows. Some latest research results on the graph rigidity theory are introduced and incorporated, and a feasible node localization scheme is presented. More specifically, a tree structure termed BN-tree is introduced to construct a localizable collaborative body. Especially, the localizable collaborative body can be constructed dynamically with the variety of the network topology. Simulation results, which show that the quality of localization is well bounded by the range of communication, are also provided to validate the proposed algorithm

Published in:

The Fifth International Conference on Computer and Information Technology (CIT'05)

Date of Conference:

21-23 Sept. 2005