Research On Guaranteeing And Repairing Barrier Coverage In Wireless Sensor Networks

Research on barrier coverage is one of the hottest topics in wireless sensor networks.Barrier coverage constructs a sensing barrier for detecting intruders crossing a region.Recent studies mostly treat single sensor as sensing and communication unit, and focus onefficient algorithms to guaranteeing barrier coverage, with little consideration on thecollaboration between individual nodes. Observing that in many situations, sensorsnaturally fall into several clusters (or blocks), for example when the sensors are deployeduniformly at random with a relatively low density, or when random sensors go down as aresult of energy exhaustion.Different from previous works, we propose to use chain as a basic scheduling unit forsensing and communication in this thesis. A chain is a set of sensors with the sensing areasof adjacent sensor overlapping with each other, and such units can be extracted from acluster under special condition. We present a distributed algorithm, named CHAIN,identify and repair all the weak zones in wireless sensor networks.Our contributions are as follows: First, we utilize chain as communication unit, whichreduces the message count between the sensors in a chain, thus reduces thecommunication overhead in wireless sensor networks. Second, we compare weak barriercoverage with strong barrier coverage, and then propose different strategies to identify andrepair the weak zones for them in wireless sensor networks.Theoretic analysis and simulations show that, compared with a representativeprevious algorithm, algorithm CHAIN significantly performs better.