The Algorithms Of Wireless Sensor Network Node Localization

Wireless Sensor Network (WSN), which is made by the convergence of sensor, embedded computation, networks and wireless communication technologies, is a novel technology about acquiring and processing information. Many application of wireless sensor networks are based on sensor self-positioning, such as battlefield surveillance, environment monitoring, object tracking and other, which depend on first knowing the location of sensor nodes. Thus, the problem of node localization is the precondition of many applications of sensor networks, and is also one of the foundation technologies of wireless networks.In this dissertation, we discuss the distributed localization scheme suitable to wireless sensor networks. The main contributions of this dissertation are: this dissertation addresses the background of localization and the challenges involved in localization for very large, ad hoc deployed wireless sensor networks, summarizes the proposed localization algorithms. As well as, it briefly introduces other open research issues in wireless sensor networks. In this dissertation, we address the challenges involved in localization for very large, ad hoc deployed wireless sensor networks. Although several localization technologies have been proposed in the past few years, none currently satisfies all our requirements because no single localization system is simultaneously scalable, ad hoc deployable and accommodating of the hardware constraints of very small devices. Our thesis is that all these issues can be solved simultaneously by a self-configuring localization system that autonomously adapts to its environmental dynamics and differentiated service quality. Our approach is based on localized adaptive algorithms that self-configure to exploit both the local processing on each sensor node, as well as the redundancy across densely-deployed sensor nodes. This thesis finally summarizes the research work, and discusses those potential research topics in future.