An Improved Amorphous Localization Algorithm for Wireless Sensor Networks
Shikai Shen, Bin Yang, Kaiguo Qian, Wu Wang, Xiaohong Jiang, Yumei She, Yujian Wang
Abstract
Shikai Shen, Bin Yang, Kaiguo Qian, Wu Wang, Xiaohong Jiang, Yumei She, Yujian Wang
Abstract
Node localization is of significant importance for supporting many critical applications in wireless sensor networks. However, traditional Amorphous localization algorithm and its variants still cannot provide sufficient localization accuracy. To address this issue, this paper proposes an improved Amorphous localization algorithm to determine the locations of unknown nodes. To determine the locations of unknown nodes under this algorithm, we need to select these beacon nodes, which are less than a presetting hop count threshold away from unknown nodes. We then adopt two-dimensional hyperbolic function instead of the classic least square method to determine the locations of unknown nodes, which are very close to their actual locations. Simulations are conducted to validate the accuracy of our proposed localization algorithm in wireless sensor networks. Remarkably, the average localization error of our proposed localization algorithm is lower than those of Amorphous algorithm and its improved algorithm, under both the uniform and non-uniform node distributions.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Node localization is of significant importance for supporting many critical applications in wireless sensor networks. However, traditional Amorphous localization algorithm and its variants still cannot provide sufficient localization accuracy. To address this issue, this paper proposes an improved Amorphous localization algorithm to determine the locations of unknown nodes. To determine the locations of unknown nodes under this algorithm, we need to select these beacon nodes, which are less than a presetting hop count threshold away from unknown nodes. We then adopt two-dimensional hyperbolic function instead of the classic least square method to determine the locations of unknown nodes, which are very close to their actual locations. Simulations are conducted to validate the accuracy of our proposed localization algorithm in wireless sensor networks. Remarkably, the average localization error of our proposed localization algorithm is lower than those of Amorphous algorithm and its improved algorithm, under both the uniform and non-uniform node distributions.
Key concepts: Wireless sensor network, Algorithm, Computer science, Node (physics), Wireless, Key distribution in wireless sensor networks, Wireless network, Computer network