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

Abstract

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.