Research On Barrier Coverage Algorithm For Three-dimensional Directional Sensor Networks

As a higher form of wireless sensor networks, directional sensor networks equipped withsensing units such as camera, microphone which used to collect multimedia information, it can beused in sensing and acquainting scalar data in environment such as temperature, pressure and etc,and also has the capability of accessing to multimedia information such as video, audio, image andetc. As a basic quality service guarantee in the directional sensor networks, coverage controlmechanism can improve the efficiency in the use of networks resources, prolong the networksduration time. Barrier coverage is a coverage control method which focused on the probability ofbeing discovered when a moving target traverses through the monitoring region of sensor networks.Barrier coverage algorithm for directional perception model on two-dimensional plane was mainlystudied in the former works. But in reality, the monitoring sensor nodes are arranged in thethree-dimensional space, which is difficult for the traditional two-dimensional barrier coveragealgorithm apply to three-dimensional environment directly. Therefore, we need to design a newbarrier coverage algorithm which can be applied in the three-dimensional directional sensornetwork.In this thesis, the studies of barrier coverage are mainly divided into two points. First, aboundaries based traversal path algorithm (BTP) for target in three-dimensional directional sensornetworks is proposed when the moving target traversing through the monitoring region. Both thecoverage and the length of traversal path are taken into account in this algorithm, and a traversalpath with minimum exposure in the path set which has minimum coverage is chosen. Second, a gridbased barrier coverage enhance algorithm (GBCE) is proposed in the determination of the optimalway of deploying sensor nodes under three-dimensional environment. By putting monitoring regioninto grid, GBCE finds the minimal exposure path and the path segment with the minimal exposureon minimal exposure path. By putting more monitoring node behind it, we can make value of theminimum exposure path much bigger, then strengthening the monitoring ability of networks formoving target. Finally, simulation results demonstrate the correctness of algorithms in this thesis,and it provides a theoretical basis for further research.