The Research Of Sensor Localization In Barrier Coverage

Recently wireless sensor networks (WSN) are becoming increasingly important in a large number of applications. The localization of the sensor nodes is considered to be a fundamental problem in wireless sensor network. The localization algorithms are classified into range-based and range-free. In the range-based approaches, the positions of nodes are determined based on the measured distances or angles. However, the range-free approaches use hops and evaluated distance to locate. We use range-free approaches to study barrier coverage. When intruders cross a border or as they penetrate a protected region, the intruders can be monitored by sensor network. This type of coverage is regarded as barrier coverage, where the sensors form a barrier for the intruders.In this paper, we research barrier coverage and sensor location, and achieve a localized algorithm about deploying sensors in a two-dimensional polygonally-bounded region. The nodes of the sensor network cooperate to find common neighbors by the transmit information of two-hop away nodes, with the help of common neighbors; the protected region can be completely covered. Meanwhile, in order to cover the surveillance region with the purpose of maximizing the network lifetime, we consider to active the necessary common nodes to put into working state and the other sensors go to sleep for energy conservation. Further, we want to meet the requirement of barrier coverage with fewest possible sensor nodes so that the network energy consumption can be reduced, and then the network lifetime is prolonged. From the simulation results, we check that the improved algorithm is feasible in respect of barrier coverage and extension network lifetime.