An Improved Node Localization Algorithm for Wireless Sensor

Abstract

This paper introduces an improved localization algorithm that bases on distance and local coordinate system which is built up by beacon nodes. This algorithm evaluates the differences of several independent localization information to determine whether upgrade this node as beacon nodes according to the size of the difference whether beyond the prescribed or not. It can effectively prevent and reduce the accumulated and spread error in localization process by the audit of beacon nodes, and improve the positioning accuracy of nodes in the network. The location technology of wireless sensor network (WSN) is utilized in solving the localization of events and nodes in WSN, so as to offer effective location information for applications .The data collected by sensors would be significant only if it contained coordinate information in WSN. Since the significance of location information, we must ascertain the geographic location of sensor node for most, then deepen event detection, and adopt measures, and make the decision in the end. The relative localization of node can be dented as followed: locating one node as datum, and establishing one coordinate system on the basis of one criterion, ascertaining relative distance and direction between other nodes and this one, so as to count coordinates of other nodes in the same coordinate system. In the mobile net, however, node cannot acquire localization neighbor nodes directly, but measure the distance between each modes and itself. In this instance, each node could ascertain its relative distance between others by interchange distance information of their adjacent nodes. At present, there are a large number of systems and algorithms that could work out localization of WSN node itself. However, different localization systems and algorithms are utilized to solve certain issues. The functions are different in network compose, energy demand infrastructures and spatio-temporal complexity .