Based On Landweber Wireless Sensor Network Node Localization Algorithm Research

Wireless Sensor Networks, a novel technology about acquiring and processing information, have been proposed for a multitude of diverse applications. Node localization plays a key role in the validity of WSN applications. Range-based localization must measure distances between neighboring nodes. Received signal strength indication (RSSI), featuring low communication overhead and low complexity, is our basis of localization on the energy constrained sensor nodes. We analyze the theory of distance measurement based on RSSIThe ill-posed problem caused by measurement error in the localization is a bottleneck to increase the localization precision. Based on the Landweber iteration principle, a new multilateral localization algorithm is proposed, which includes the optimal reference node number, the iteration index selecting, the stopping rule and the accelerated Landweber iteration algorithm. Test results show that Landweber Iteration Algorithm works better than the well-known Maximum Likelihood Estimation. The localization error is less than 1m when the iteration indexωis 3.3x10-6 and the optimal localization can be achieved in ten times interation when the stopping rule of the Accelerated Landweber Iteration Algorithm isσκ≤1.