By Topic

Hop-count based localization using geometric constraints in 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

4 Author(s)
Sangho Lee ; Sch. of Inf. & Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju ; Eunchan Kim ; Chungsan Kim ; Kiseon Kim

Localization is an important issue in wireless sensor networks because many applications provide services with location information of the events in sensing areas. Among conventional localization schemes, hop-count based localization schemes are very promising with respect to the cost because the location estimate can be achieved using connectivity information without a special module for localization. However, hop-count based schemes have a weakness that the location estimate is coarser than localization schemes using measured distance or angle information. To improve the localization accuracy encountered in estimating the location from the coarse distance estimate, this paper proposes a localization scheme that utilizes geometric constraints to narrow down a potential area where a sensor node is supposed to be, and then estimates its location. Through simulation results, the proposed scheme is shown to provide higher localization accuracy and lower power consumption in comparison to the existing hop-count based schemes.

Published in:

Communications, 2008. APCC 2008. 14th Asia-Pacific Conference on

Date of Conference:

14-16 Oct. 2008