Mobile Anchor Nodes Aided DV-hop (M-A-DV-hop) Algorithm

摘要

Evolving networks of ad-hoc, wireless sensing nodes rely heavily on the ability to obtain position information. In this paper we first briefly analyze the theory of DV-hop algorithm. And with simulation results, we realize that the high anchor node ratio and node deployment density can improve the localization precision in random wireless sensor networks. However, this will increase the hardware cost and in static networks the anchor nodes will not be needed after all unknown nodes have their location information. So we introduce mobile anchor nodes when the network only has sparse nodes. We advise a novel method to add new nodes in the research area. The mobile anchor nodes use the random way point (RWP) model, which is widely used in the ad-hoc networks. The simulation results demonstrate that the mobile anchor nodes can greatly reduce the hardware cost and distinctly improve the localization precision.