By Topic

The Four Corners DV-Hop Localization Algorithm for Wireless Sensor Network

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)
Yinhui Meng ; Sch. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China ; Jian Chen ; Yingyou Wen ; Hong Zhao

Localization is crucial for wireless sensor networks. In the original DV-Hop algorithm, beacon nodes need to broadcast messages to compute minimum hop-count between each node pair, and beacon nodes also need to broadcast messages to make each unknown node get the average one-hop distance. Twice broadcasts cause a lot of communication. The communication causes a lot of energy consumption. In order to address this problem, an improved algorithm, named Four Corners DV-Hop algorithm, is proposed. The Four Corners DV-Hop algorithm utilizes the beacon placement to divide the whole area into some small regions. We analyze the communication model and set a threshold to make a message just broadcasted in a small region instead of in the whole area to reduce communication. Compared to the original DV-Hop algorithm, the Four Corners DV-Hop localization algorithm reduces a lot of communication and is more accurate through the simulation results.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011