Research, Self-organizing Network Of Wireless Location Algorithm

The wireless sensor networking (WSN) is a brand-new embedded wireless technology, and the technolog has the considerably prospect for civil and military use. With the development of the correlation techniques and the extensive use of WSN products, WSN become second-largest network in the 21st century besides the first is the Internet. And routing scheme, information of network coverage, load balance, topology control also depended on the location information of the nodes in networks. Through the deployment of a large number of sensor nodes to the target area, the WSN technology will change the method of interaction which between people and the objective world.In this paper, we describe the structure characteristics of the wireless sensor network and make classification in according with the different characteristics, and analysis of the common basic principles of positioning technology. We selecte some basic RSSI distributed relative positioning algorithms for forestry environment to discuss the theory and its process of the positioning algorithms, including equilateral triangle positioning algorithm, RCM algorithm, clustering SPA relative positioning algorithm and Kalman filter algorithm. And we select the most appropriate method of positioning to improve and discuss.The relative localization algorithm--clustering-based SPA algorithm was theimportant content in this article. But regarding the open country environment, this method increased the system cost. And beacon node, because excessively times of the communication, the power loss is oversized, leading to a shorter life-span nodes, which is a fatal weakness in wireless sensor network application. In addition, the limited beacon node has also limited the wireless sensor network expansion. Under this research background, we use the relative localization and the graduation combination way, proposed that one kind may use in the wide range of the single beacon node localization algorithm. This algorithm does not use the manual deployment beacon nodes, and it depends upon the relative position of nodes, which takes the reference point by network in certain nodes to form the partial coordinate system. The neighboring partial coordinate system transforms the merge in turn again, and it produces the relative coordinates system as a whole. The method effectively resolves the questions addressing cluster SPA algorithm.Finally, the simulation experiment showed that the modified algorithm was better than the original algorithm in communication costs and it was more suitable for the application of few move sensor nodes.