A Novel Protocol For Barrier K-Coverage In Wireless Sensor Networks

One of major problems in the wireless sensor networks is the barrier coverage problem. This problem deals with the ability to minimizing the probability of undetected penetration through the barrier (sensor network). The reliability and fault tolerance problems are very important for long strip barrier coverage sensor networks. Also, another design challenge in sensor networks is to save limited energy resources to prolong the lifetime of wireless sensor network. In this paper we propose the fault tolerant k-barrier coverage protocol, called APBC. The proposed protocol maintains a good balance in using nodes energy, in order to prolong the network lifetime. The proposed protocol presents a proper way to provide the k-barrier coverage at nodes fails without reexecuting the algorithm. The simulation results show that this method prolongs the lifetime of the network in comparison with RIS method

Barrier Coverage in Wireless Sensor Networks

Barrier coverage is a critical issue in wireless sensor networks (WSNs) for security applications, which aims to detect intruders attempting to penetrate protected areas. However, it is difficult to achieve desired barrier coverage after initial random deployment of sensors because their locations cannot be controlled or predicted. In this dissertation, we explore how to leverage the mobility capacity of mobile sensors to improve the quality of barrier coverage. We first study the 1-barrier coverage formation problem in heterogeneous sensor networks and explore how to efficiently use different types of mobile sensors to form a barrier with pre-deployed different types of stationary sensors. We introduce a novel directional barrier graph model and prove that the minimum cost of mobile sensors required to form a barrier with stationary sensors is the length of the shortest path from the source node to the destination node on the graph. In addition, we formulate the problem of minimizing the cost of moving mobile sensors to fill in the gaps on the shortest path as a minimum cost bipartite assignment problem and solve it in polynomial time using the Hungarian algorithm. We further study the k-barrier coverage formation problem in sensor networks. We introduce a novel weighted barrier graph model and prove that determining the minimum number of mobile sensors required to form k-barrier coverage is related with but not equal to finding k vertex-disjoint paths with the minimum total length on the WBG. With this observation, we propose an optimal algorithm and a faster greedy algorithm to find the minimum number of mobile sensors required to form k-barrier coverage. Finally, we study the barrier coverage formation problem when sensors have location errors. We derive the minimum number of mobile sensors needed to fill in a gap with a guarantee when location errors exist and propose a progressive method for mobile sensor deployment. Furthermore, we propose a fault tolerant weighted barrier graph to find the minimum number of mobile sensors needed to form barrier coverage with a guarantee. Both analytical and experimental studies demonstrated the effectiveness of our proposed algorithms

Adaptive Energy Efficient Scheduling (AEES) for Fault Tolerant Coverage in Sensor Networks

For many sensor network applications it is necessary to provide full sensing coverage to a security-sensitive area. To actively monitor the set of target the subset of sensors are redundantly deployed. One of the major challenges in devising such network lies in the constrained energy and to tolerate unexpected failure to prolong the life span of the network. In this we rapidly restore the field monitoring, by periodically refreshing and switching the cover to tackle unanticipated failure in an energy efficient manner, because energy is the most critical resource considering the irreplaceable of batteries of the sensor nodes. In the same time it should amenably support more than one sensor at a time with different degree in distributed approach that periodically selects the covers and switch between them to extend coverage time and tolerate unexpected failures at runtime. In this scheme the sensor is an autonomous system that has the authority to decide how to cover its sensing range. It also incorporates a novel technique for offline cover update (OCU) to facilitate asynchronous transition between covers. This approach is robust to failure pattern is no uniform. DOI: 10.17762/ijritcc2321-8169.15013

The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications

International audienceThe wireless sensor networks (WSN) is a research area in continuous evolution with a variety of application contexts. Wireless sensor networks pose many optimization problems, particularly because sensors have limited capacity in terms of energy, processing and memory. The deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the network. Often, the sensors constituting the network cannot be accurately positioned, and are scattered erratically. To compensate the randomness character of their placement, a large number of sensors is typically deployed, which also helps to increase the fault tolerance of the network. In this paper, we are interested in studying the positioning and placement of sensor nodes in a WSN. First, we introduce the problem of deployment and then we present the latest research works about the different proposed methods to solve this problem. Finally, we mention some similar issues related to the deployment and some of its interesting applications

Movement-efficient Sensor Deployment in Wireless Sensor Networks

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Two key issues in MWSNs - energy consumption, which is dominated by sensor movement, and sensing coverage - have attracted plenty of attention, but the interaction of these issues is not well studied. To take both sensing coverage and movement energy consumption into consideration, we model the sensor deployment problem as a constrained source coding problem. %, which can be applied to different coverage tasks, such as area coverage, target coverage, and barrier coverage. Our goal is to find an optimal sensor deployment to maximize the sensing coverage with specific energy constraints. We derive necessary conditions to the optimal sensor deployment with (i) total energy constraint and (ii) network lifetime constraint. Using these necessary conditions, we design Lloyd-like algorithms to provide a trade-off between sensing coverage and energy consumption. Simulation results show that our algorithms outperform the existing relocation algorithms.Comment: 18 pages, 10 figure

The Robotarium: A remotely accessible swarm robotics research testbed

This paper describes the Robotarium - a remotely accessible, multi-robot research facility. The impetus behind the Robotarium is that multi-robot testbeds constitute an integral and essential part of the multi-robot research cycle, yet they are expensive, complex, and time-consuming to develop, operate, and maintain. These resource constraints, in turn, limit access for large groups of researchers and students, which is what the Robotarium is remedying by providing users with remote access to a state-of-the-art multi-robot test facility. This paper details the design and operation of the Robotarium and discusses the considerations one must take when making complex hardware remotely accessible. In particular, safety must be built into the system already at the design phase without overly constraining what coordinated control programs users can upload and execute, which calls for minimally invasive safety routines with provable performance guarantees