高精度AOA分簇定位算法

A Novel AOA Clustering-based Localization Algorithm with High Accuracy

如今的网络安全主要联系于无线传感网络,定位算法的优劣决定了无线传感网络的能力,也就决定了网络安全的能力。分簇定位算法具有能量效率高、可扩展性好、简单可行的优点,但是分簇算法属于一种模糊定位算法,不具有较高的精度。此外,分簇算法的簇首替换如果在全局范围内进行选择,很容易造成高消耗。AOA(angle of arrival)算法在复杂环境中具有精确的定位能力。文章通过运用AOA测距算法,使分簇算法的每个节点具有自探测能力,通过节点相对夹角,用坐标算法算出相应于簇首的坐标。为了让能量消耗低于普通分簇算法,文章根据完全图中能量有效原理,让分簇只在初始时进行一次,在每个簇内无簇首或能量低时,对簇首进行重选举,再将信息发送给总簇。Matlab仿真实验表明,文章算法实现了range-based的分簇定位算法,且保留了快速部署、能量效率高、高精度的优点。根据实验,文章算法适用于不松散部署的无线传感网络。

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 efifcient, 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-efifcient 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.