By Topic

An efficient algorithm for localization in wireless sensor networks based on internal array of nodes within cells

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)
Mendoza, M.L. ; Dept. of Electron., ITESM, Cuernavaca, Mexico ; Silva, V.H.Z. ; Diaz, A.P.

In this work it is presented an efficient algorithm for localization based on an internal array of nodes within cells. The main hypothesis of this work is the following: if the application can be planned, then the density of cells is defined as the main parameter. It is shown that the magnitude of localization error during a random positioning of the grouped cells may be determined if the strength in RF signal is varied. The localization algorithm can be applied either using range-based or range-free methods. The efficiency of this algorithm is based on the following relevant results: the complexity decreases; the operational problems, such as collinear nodes, reflexions and signal interferences, are reduced; and finally it avoids the overlapping problem.

Published in:

Parallel Processing, 2005. ICPP 2005 Workshops. International Conference Workshops on

Date of Conference:

14-17 June 2005