关键词: 无线传感器网络, 传感器节点定位, 动态信标节点, 路径规划, 节点密度, 生成信标树算法

Abstract: Node localization in wireless sensor networks is a basic but very important research field. In practical application, sensor nodes are distributed randomly resulting in node density disproportion in the region. The existing localization algorithms of node are not sensitive to distribution density. Hence, if the algorithm applies the same strategy to locate nodes in regions with different node density, it will cause position accuracy low in dense area and location rate decreasing in sparse regions and the beacon node energy is not to maximize utilization. This paper puts forward a spanning tree algorithm of beacon based on node distribution density called GBT. Nodes in beacon group are traversed by planned path to complete node location. The simulation results show that the improved algorithm has better performance on decreasing time expend for locating node, enhancing accuracy of node location by taking advantage of beacon efficiently compared with previous algorithms.

Key words: wireless sensor networks, sensor localization, dynamic beacon node, route planning, node density, Generate Beacon-based Tree（GBT） algorithm