事件发生位置的确定和节点自身位置的获取对于整个无线传感器网络的实际应用来说起着关键性的作用。目前,虽然研究人员已经提出了许多定位算法,但是这些算法带有局限性,总是不能满足实际定位需求。为了提高定位效率,本文将循环迭代思想融入已有的自组织定位算法体系,来实现对经典自组定位算法Euclidean拓展和优化的目标。改进后的算法在确保能耗可以接受的前提下,实现了网络节点定位误差的显著降低、定位覆盖程度明显提高等目标。另外,仿真结果也检验了改进算法的可行性和优越性,证实了理论的合理性。
It is very vital to locate where event happens and to gain the position of node itself for practical application in whole Wireless Sensor Network (WSN). At present, researchers have raised many localization algorithms, but these algorithms with restriction always can' t meet practical requirement. To improve the positioning efficiency, this paper penetrates the circular and iterative thought into ad-hoc positioning system to extend and optimize the classical positioning algorithm of Euclidean. At last, within the acceptable energy consumption, improved algorithm reduces the localization error and extends localization coverage efficiently. At the same time, the simulation result checks and tests its feasibility and suoeriority to orove the reasonable theory.