Font Size: a A A

Research On Performance Optimization Method Of Strong Barrier Coverage Based On Directed Sensor Network

Posted on:2014-04-20Degree:MasterType:Thesis
Country:ChinaCandidate:L WangFull Text:PDF
GTID:2268330392464454Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Barrier coverage based on the sensor network is of essential networking monitoring model, which widely used in intrusion detection, regional security, battlefield security and other fields, holding an important theoretical research value and practical application prospect. Due to the covering effectiveness and transmission effectiveness of the sensor network, combined with the node energy consumption inequality constraints, making the wireless sensor network service performance optimization becoming one of the current research focuses in this field. The directed sensors (camera, infrared sensor, sonar sensors) because of its flexibility and practicability has been widely used, at same time it also raise the new technical challenges. This paper start with time and space characteristics of the barrier coverage, making the in-depth research on redundancy of rebuilding the barrier and blind area verifying optimization problem in the directed sensor network.Firstly, making bottleneck of influencing the lifetime of barrier coverage the pointcut, based on the sensor4-tuple sensing model, we propose the effective approach to determine the overlapping area of the neighbors, then proving its correctness. Based on this, we propose the concept of the minimum rotation angle coverage barrier, and model the problem with a linear programming problem. Based on undirected weighted graph we propose a greedy area coverage algorithm and the using of asynchronous node waking model time interleaved execution algorithm. Achieving the purpose of saving energy and prolonging the lifetimeSecondly, we propose the self-adaption algorithm of repairing the blind area in the network, firstly we model the network as a strip. Making the definition of the factor of the network quality Q. We propose the method of calculating method and demonstrate the effectiveness of Q value criterion to decide the coverage of blind area in the network. We propose the effective methods looking for coverage hole, and we can quickly locate the position of the blind area. Then we propose a lightweight distributed barrier repairing algorithm, which can effectively repair the barrier.At last, we make the simulation experiment to verify the algorithm. Through the experimental validation and comparison of data can be concluded that the proposed algorithm can effectively improve the quality of barrier covered services.
Keywords/Search Tags:Directional sensor network, Strong barrier coverage, Lifetime, Linearprogramming problem, Greedy algorithm, Coverage of blind area
PDF Full Text Request
Related items