Research on DV-Hop improved algorithm based on dual communication radius

摘要: In order to solve the problem that traditional DV-Hop location algorithm has a large error in locating unknown nodes, this paper proposes an improved based on dual communication radius. By adding radius, updates minimum hop number obtained by node closer beacon smaller value and keeps information of nodes farther away. This method reflects gap between actual distances terms number, which solves difference same hops certain extent. Therefore, it is more advantageous estimate accurate average jump distance can calculate precise them obtain coordinates nodes. MATLAB simulation results show radius effectively reduce improve accuracy stability compared with algorithm.