Research On Node Self-Localization Algorithm Of Wireless Sensor Network

As an brand-new technology of acquiring and processing information, Wireless Sensor Networks(WSNS), which integrates the sensor, micro-electro-mechanical system and network technologies, can concurrently test, sense, collect, process and transfer in information of monitored objects to the terminal users in real time. It demonstrates comprehensive application prospect in many fields, such as military, medicine, space exploration, industry, civilian and home networks. It is necessary for us to do research on self-location technology of sensor nodes over WSNS because most of applications base on the location information of sensor nodes. There is no sense in monitoring without location information.In this paper, the main job is to improve and realize the node self-localization algorithms of WSNS. At first, we analyze the network structure of WSNS and its features, then we find that most of localization algorithms have the common shortage by analyzing and making research on typical localization algorithms, such as many anchor with GPS, high cost, unknown nodes lying on anchors, so we present a synthesized localization algorithm based on low cost, which unknown nodes get location information from a few beacon nodes based on range-based and range-free. In the range-based part, we solve the localization problem based-on trilateration by utilizing the angle weight that gets from redundant beacon nodes. As for the unknown nodes that can't receive the signal from the beacon nodes, we make the improved algorithm based on DV-HOP which belongs to based-free algorithms, more and more unknown nodes are localized. The simulation results verify their effectiveness. At last, we design and make the hardware and software of sensor nodes and sink nodes for validating the availability of the algorithm later.