Barrier Coverage Algorithm Research Articles

On synchronization and orientation in distributed barrier coverage with relocatable sensors

Consider n identical relocatable sensors, with sensing range r and visibility range 2r, initially placed at arbitrary positions on a line segment barrier; each sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of the barrier that intersects with its sensing range. Sensors operate in Look-Compute-Move cycles: in a cycle a sensor determines the positions of sensors in its visibility range, it computes its next position (within its visibility range), and then moves to the calculated position. The barrier coverage problem we consider is for the sensors to independently make decisions and movements so to reach final positions whereby they collectively cover the barrier; in particular we are interested in oblivious (or memoryless) sensors, and focus on the impact that the level of synchrony and the presence/absence of orientation (i.e., global notion of “left-right”) have on the solvability of the problem.

MCDP: Maximizing Cooperative Detection Probability for Barrier Coverage in Rechargeable Wireless Sensor Networks

Barrier coverage problem is an important issue in wireless sensor networks (WSNs). Many solutions have been proposed for constructing a defense barrier aiming to maximize the surveillance quality while prolonging the network lifetime. However, most of them assumed that the sensor nodes are battery powered without considering the rechargeable sensors. Though the energy conservation issue has been taken into account in most studies, the perpetual network lifetime is still impossible. In addition, most of existing works considered Boolean Sensing Model (BSM) which cannot reflect the physical features of sensing. This paper proposes a barrier coverage algorithm, called MCDP, which considers the rechargeable solar-powered sensors and applies the Probability Sensing Model (PSM) aiming to maximize the surveillance quality while the perpetual network lifetime of WSNs can be achieved. The MCDP algorithm first partitions the time line and monitoring region into several space time points and calculates the detection probability of each sensor to each space time point. Then the proposed MCDP algorithm schedules sensors staying in sensing state and recharging state in each time slot such that the weakest cooperative surveillance quality of the time-space point can be maximized. Experimental study shows that the proposed MCDP algorithm achieves better performance than existing work in terms of surveillance quality, stability of cooperative detection probability as well as fault tolerance.

GSMS: A Barrier Coverage Algorithm for Joint Surveillance Quality and Network Lifetime in WSNs

Barrier coverage problem is one of the most crucial issues in wireless sensor networks (WSNs) which have been applied to a wild range of applications. A lot of algorithms have been proposed to cope with this problem. However, the majority researches apply the Boolean Sensing Model (BSM) and the sensing frequency of the sensor is not considered, which are difficult to reflect the physical features of the sensing component. This paper proposed a barrier coverage algorithm, called Guaranteeing Surveillance Quality with Minimal Number of Active Sensors, or GSMS in short, aiming to guarantee the surveillance quality for a given monitoring region while activating the minimal number of active sensors. By applying the Probability Sensing Model (PSM) and considering sensing frequency, the proposed GSMS algorithm calculates the sensing probability of every location in the monitoring region and identifies the bottleneck location of surveillance quality. Then the GSMS algorithm prior schedules the sensor with the maximal contribution to the bottleneck location in terms of surveillance quality. The experimental study reveals that the proposed GSMS algorithm outperforms the existing algorithm in terms of the number of active sensors, lifetime of the WSNs, efficiency as well as the cooperative sensing probability.

A Novel Algorithm for Barrier Coverage Based on Hybrid Wireless Sensor Nodes

Barrier coverage is one of the research hot spots of wireless sensor network coverage control. In order to fix the defects and deficiencies of the network, which is composed of all isomorphic nodes in the barrier coverage, Voronoi diagram is introduced to divide the entire deployment area. According to the principle of the least square method, a mixed network deployment mechanism consisting of static nodes and dynamic nodes is established with static nodes working as the reference barrier line. By monitoring whether there is a barrier covering the blind spot in the deployed area, the monitoring area can be effectively covered by determining whether dynamic nodes need limited movement to redeploy the monitored area. And puts forward mixed node barrier covered in this algorithm, algorithm Voronoi diagram was used for continuous path problem domain discretization, and from different dimensions to compare coverage performance of each algorithm, the simulation experiments show that the algorithm improves the quality of monitoring area coverage, under the same conditions as other algorithms, a mobile node distance and low energy consumption, less expected to cover requirements and goals are met.

Strong barrier coverage of directional sensor networks with mobile sensors

Barrier coverage is attractive for many practical applications of directional sensor networks. Power conservation is one of the important issues in directional sensor networks. In this article, we address energy-efficient barrier coverage for directional sensor networks with mobile sensors. First, we derive the critical condition for mobile deployment. We assume that a number of stationary directional sensors are placed independently and randomly following a Poisson point process in a two-dimensional rectangular area. Our analysis shows that the critical condition only depends on the deployment density ([Formula: see text]) and the sensing radius ( r). When the initial deployment satisfies [Formula: see text], barrier gaps may exist, so we need to redeploy mobile sensors to improve the barrier coverage. Then, we propose an energy-efficient barrier repair algorithm to construct an energy-efficient barrier to detect intruders moving along restricted crossing paths in the target area. Through extensive simulations, the results show that the energy-efficient barrier repair algorithm improves the barrier coverage and prolongs the network lifetime by minimizing the maximum sensor moving distance. And in comparison with the energy-efficient barrier coverage algorithm (previous works), the energy-efficient barrier repair algorithm increases by 18% of network lifetime on average.

Distributed Deployment Algorithm for Barrier Coverage in Mobile Sensor Networks

The deployment of sensor nodes (SNs) to form a network with coverage ability is one of the most important challenges of wireless sensor networks. In this paper, we study an efficient distributed deployment algorithm for barrier coverage improvement with mobile sensors, in which the SNs can be relocated after the initial deployment. To achieve the maximum number of barriers, we propose a distributed algorithm to construct $k$ -barrier coverage by relocation of the SNs. Different from existing approaches, we propose a novel clustering technique based on the network area to reduce the information exchange messages. Then, based on the SNs clusters, we propose a heuristic method to assign the SNs evenly into each cluster with regard to the required number of SNs of each cluster and decide the moving SNs by computing the optimal relocation, considering moving distance minimization. The main goal of this approach is to relocate the SNs to form the maximum number of barriers with a minimum relocation cost, in terms of sensor energy consumption of communication and movement. The simulation results demonstrate the effectiveness of our algorithm when compared with other competing approaches.

Non-Preference Bi-Objective Compound Event Barrier Coverage Algorithm in 3-D Sensor Networks

With the increase of complexity of monitoring tasks in wireless sensor networks, using a single kind of sensor can no longer fit the strict monitoring requirements. Nowadays, event coverage is widely applied to detect events accurately by utilizing diverse kinds of sensors. The traditional 2-D event model cannot meet the actual monitoring requirements, and there will be many kinds of complicated constraints in the environment. Therefore, a compound event model with multiple constraints is put forward to 3-D sensor networks. Simultaneously, a compound event barrier coverage algorithm on the basis of non-preference bi-objective evolution (NPBO) strategy is presented in multiple constraints sensor networks. The proposed algorithm introduces a non-preference $\alpha $ -dominance mechanism to solve the low efficiency problem of multi-objective evolutionary under multiple constraints. A large number of experimental results indicate that the NPBO mechanism is more high-efficient than the latest algorithm in allocating sensor resources.

Distributed restoring of barrier coverage in wireless sensor networks using limited mobility sensors

In Wireless Sensor Networks, sensors are used for tracking objects, monitoring health and observing a region/territory for different environmental parameters. Coverage problem in sensor network ensures quality of monitoring a given region. Depending on applications different measures of coverage are there. Barrier coverage is a type of coverage, which ensures all paths that cross the boundary of a region intersect at least one sensor's sensing region. The goal of the sensors is to detect intruders as they cross the boundary or as they penetrate a protected area. The sensors are dependent on their battery life. Restoring barrier coverage on sensor failure using mobile sensors with minimum total displacement is the primary objective of this paper. A centralized barrier coverage restoring scheme is proposed to increase the robustness of the network. We formulate restoring barrier coverage as bipartite matching problem. A distributed restoring of barrier coverage algorithm is also proposed, which restores it by first finding existing alternate barrier. If alternate barrier is not found, an alternate barrier is reconstructed by shifting existing sensors in a cascaded manner. Detailed simulation results are shown to evaluate the performance of our algorithms.

Optimizing Detection Quality and Transmission Quality of Barrier Coverage in Heterogeneous Wireless Sensor Networks

This paper proposes an algorithm, called the Optimized Barrier Coverage Algorithm (OBCA), to optimize the quality of the barrier coverage formed by a wireless sensor network (WSN). OBCA aims at optimizing the barrier coverage quality in terms of the detection degree, the detection quality, and the transmission quality (i.e., the expected transmission time). This paper also proposes a model to formulate the minimum detection probability between two WSN sensors with different sensing ranges. With the model, OBCA can be applied to heterogeneous WSNs whose sensors have various sensing ranges. OBCA’s optimization is proved, and its time complexity is analyzed. The performance of OBCA is simulated and compared with those of two related algorithms.

Compound Event Barrier Coverage Algorithm Based on Environment Pareto Dominated Selection Strategy in Multi-Constraints Sensor Networks

There are a variety of complex constraints in the wide application of wireless sensor networks. Traditional coverage models and algorithms have been unable to meet the needs of multi-constrained sensor networks. At the same time, in a complex monitoring environment, a single type of sensor information cannot meet the requirements of reliable monitoring. Hence, in this paper, aiming at the multi-constraints in sensor networks, a compound event barrier coverage algorithm is proposed based on environment Pareto-dominated selection strategy, which can distribute the sensor resources reasonably and find out the coverage ratio efficiently in multi-constraints sensor networks. The proposed algorithm takes advantage of Pareto domination relationship, constraint violation degree, constraint boundary distance, and crowding degree to preserve the outstanding infeasible individuals in the evolutionary process and participate in the mutation operation; we also adopt the adaptive scaling factor and crossover probability strategy to avoid the algorithm into local optimal. The proposed algorithm is proved to be more highly efficient than the latest algorithm in the distribution of sensor resources by experimental results.

MobiBar: An autonomous deployment algorithm for barrier coverage with mobile sensors

Critical homeland security applications, such as international border surveillance and zone monitoring in case of biological attacks, require the timely creation of a barrier of sensors along the border to be monitored. Mobile Wireless Sensor Networks have the potential to meet the desired coverage requirements, by exploiting the device coordination and self-deployment capabilities. However the design of effective and efficient algorithms is challenging. In this paper we propose MobiBar, an autonomous deployment algorithm for k-barrier coverage with mobile sensors. MobiBar coordinates sensor movements in order to construct k distinct complete barriers and to ensure the desired level of redundancy. We formally prove that MobiBar terminates in a finite time and that the final deployment provides the maximum level of barrier coverage with the available sensors. Furthermore, we show that MobiBar is able to self-reconfigure and self-heal the network to deal with dynamic coverage requirements and sudden sensor failures. We study the performance of MobiBar by means of simulations. Results show that it achieves performance close to centralized solutions and it outperforms recent distributed approaches with respect to several performance metrics.

An Optimization Algorithm for Barrier Coverage in Mobile Sensor Networks

Barrier coverage of heterogeneous sensors with randomly deployed is a critical issue in military and homeland security applications. In this paper we study how to exploit sensor mobility to improve barrier coverage. We presented an efficient algorithm to relocate mobile sensors accord to line so as to improve barrier coverage. The algorithm firstly scans whole barrier and finds out barrier gaps. Then it relocates mobile sensor nodes to fill the gaps with energy consumption limited. Simulation results show that the algorithms can effectively improve the barrier coverage.

An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks

Intrusion detection is one of the most important applications of wireless sensor networks. When mobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the scattered sensor nodes before they pierce through the field of sensor (barrier coverage). In this paper, we propose an energy efficient scheduling method based on learning automata, in which each node is equipped with a learning automaton, which helps the node to select best node to guarantee barrier coverage, at any given time. To apply our method, we used coverage graph of deployed networks and learning automata of each node operates based on nodes that located in adjacency of current node. Our algorithm tries to select minimum number of required nodes to monitor barriers in deployed network. To investigate the efficiency of the proposed barrier coverage algorithm several computer simulation experiments are conducted. Numerical results show the superiority of the proposed method over the existing methods in term of the network lifetime and our proposed algorithm can operate very close to optimal method.

Sub-optimal decentralised control algorithms for blanket and k -barrier coverage in autonomous robotic wireless sensor networks

This research aims to propose a novel sub-optimal decentralised blanket coverage control algorithm, namely, ‘one-Barrier-to-Blanket Coverage Algorithm’ (BBCA) as well as a novel k-barrier coverage control algorithm, namely, ‘one-to-k Barrier Coverage Algorithm’ (1-kBCA) for self-deployed autonomous wireless sensor networks in the obstacle-free and convex deployment area. The motion coordination schemes developed in this research are based on the nearest neighbour techniques. Research indicates that simple motion coordination schemes have resulted in the powerful and intelligent control algorithms to achieve the desired coverage. Since the algorithms were developed based on simple local rules, they are indeed computationally efficient and ease the communication overheads. What is more, the superiorities of the proposed algorithms are nonetheless related to their uniformity, flexibility, simplicity, scalability as well as reliability. Instead of theoretical proofs as solid mathematical frameworks, computer simulations also have been presented to demonstrate the effectiveness of the proposed algorithms.