Node Localization Algorithm Based on Improved DV-Hop Wireless Sensor Network

Node location plays a key role in wireless sensor networks(WSNs). DV-Hop based on distance vector hop is a non-ranging algorithm, which has low cost and oversimplified complexity. Sensor nodes are uneven distributed in wireless sensor networks and irregular network topology result in low positioning accuracy. In order to improve the accuracy, the RSSI technology is proposed to measure the average signal strength between nodes, and the average RSSI value between neighboring nodes is compared with the RSSI value at the communication radius to define node hops; then on basis of the first step, re-determine the average hop distance of the beacon node, finally, the bat individual in the bat algorithm is utilized to determine the location of the unknown node, the Levy flight strategy optimizes the bat’s speed and location in the iterative process. From the analysis of the node communication radius and the ratio of beacon nodes, compared with the traditional DV-Hop and related algorithms, the proposed method shows a better positioning effect.