关键词: 无线传感网络, AOA算法, 分簇算法, 定位算法

Abstract: Nowadays, network security mostly connects to wireless sensor network (WSN), the ability of WSN rests with the quality of the localization algorithm. Clustering localization algorithm is efficient, highly scalable, simple and practical algorithm, but it is also a fuzzy match algorithm which does not have high accuracy. If cluster-head switch of clustering algorithm is done within the global nodes, it will cause large amount of energy waste. The AOA algorithm has good localization ability under complex environment. In this paper, by using the AOA algorithm, every node has the ability of self-detection and can calculate the coordinates relative to cluster-head with coordinate algorithm by using node relative-angle. In order to reduce energy waste, this paper designs a algorithm base upon energy-efficient principle of the complete graph. Separating clusters only runs once in the beginning. A new cluster-head will be elected when there is no cluster-head in a cluster or it is in the situation of low power, and then the information is send to the latest cluster-head. Simulating experiment with Matlab shows that this paper achieves a range-based clustering localization algorithm. The algorithm maintains the advantages of high-speed deploying, high energy-efficient and high accuracy. In addition, the algorithm is adequate to non-loosen wireless sensor network.

Key words: wireless sensor network, AOA(angle of arrival) algorithm, clustering algorithm, localization algorithm