Fault-Tolerance and Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage

2016 ◽  
Author(s):  
Hsin-Yun Chang ◽  
Louis Kao ◽  
Kai-Po Chang ◽  
Chiuyuan Chen
Keyword(s):  
Fault Tolerance ◽  
Minimum Cost ◽  
Barrier Coverage ◽  
Bistatic Radar ◽  
Radar Sensors

Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage

2016 ◽  
Vol 65 (2) ◽  
pp. 577-588 ◽  
Author(s):  
Bang Wang ◽  
Jiaoyan Chen ◽  
Wenyu Liu ◽  
Laurence T. Yang
Keyword(s):  
Minimum Cost ◽  
Barrier Coverage ◽  
Bistatic Radar ◽  
Radar Sensors

scholarly journals Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 225 ◽  
Author(s):  
Xianghua Xu ◽  
Chengwei Zhao ◽  
Tingcong Ye ◽  
Tao Gu
Keyword(s):  
Detection Threshold ◽  
Region Of Interest ◽  
Minimum Cost ◽  
Circular Ring ◽  
Barrier Coverage ◽  
Bistatic Radar ◽  
Radar Sensor ◽  
Minimum Threshold ◽  
Practical Applications ◽  
Closed Area

Perimeter barriers can provide intrusion detection for a closed area. It is efficient for practical applications, such as coastal shoreline monitoring and international boundary surveillance. Perimeter barrier coverage construction in some regions of interest with irregular boundaries can be represented by its minimum circumcircle and every point on the perimeter can be covered. This paper studies circle barrier coverage in Bistatic Radar Sensor Network (BRSN) which encircles a region of interest. To improve the coverage quality, it is required to construct a circle barrier with a predefined width. Firstly, we consider a BR deployment problem to constructing a single BR circular barrier with minimum threshold of detectability. We study the optimized BR placement patterns on the single circular ring. Then the unit costs of the BR sensor are taken into account to derive the minimum cost placement sequence. Secondly, we further consider a circular BR barrier with a predefined width, which is wider than the breadth of Cassini oval sensing area with minimum threshold of detectability. We propose two segment strategies to efficiently divide a circular barrier to several adjacent sub-ring with some appropriate width: Circular equipartition strategy and an adaptive segmentation strategy. Finally, we propose approximate optimization placement algorithms for minimum cost placement of BR sensor for circular barrier coverage with required width and detection threshold. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.

scholarly journals Approximate Optimal Deployment of Barrier Coverage on Heterogeneous Bistatic Radar Sensors

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2403
Author(s):  
Xianghua Xu ◽  
Chengwei Zhao ◽  
Zongmao Cheng ◽  
Tao Gu
Keyword(s):  
Sensor Networks ◽  
Coupling Effect ◽  
Minimum Cost ◽  
Approximate Algorithm ◽  
Barrier Coverage ◽  
Optimal Placement ◽  
Coverage Problem ◽  
Placement Problem ◽  
Simulation Experiments ◽  
Radar Sensors

Heterogeneous Bistatic Radars (BR) have different sensing ranges and couplings of sensing regions, which provide more flexible coverage for the boundary at complex terrain such as across rivers and valleys. Due to the Cassini oval sensing region of a BR and the coupling of sensing regions among different BRs, the coverage problem of BR sensor networks is very challenging. Existing works in BR barrier coverage focus mainly on homogeneous BR sensor networks. This paper studies the heterogeneous BR placement problem on a line barrier to achieve optimal coverage. 1) We investigate coverage differences of the basic placement sequences of heterogeneous BRs on the line barrier, and prove the optimal basic placement spacing patterns of heterogeneous BRs. 2) We study the coverage coupling effect among adjacent BRs on the line barrier, and determine that different placement sequences of heterogeneous BR transmitters will affect the barrier’s coverage performance and length. The optimal placement sequence of heterogeneous BR barrier cannot be solved through the greedy algorithm. 3) We propose an optimal BRs placement algorithm on a line barrier when the heterogeneous BR transmitters’ placement sequence is predetermined on the barrier, and prove it to be optimal. Through simulation experiments, we determine that the different placement sequences of heterogeneous BR transmitters have little influence on the barrier’s maximum length. Then, we propose an approximate algorithm to optimize the BR placement spacing sequence on the heterogeneous line barrier. 4) As a heterogeneous barrier case study, a minimum cost coverage algorithm of heterogeneous BR barrier is presented. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.

A Cross-Layer Fault Tolerant Protocol with Recovery Mechanism for Clustered Sensor Networks

2020 ◽  
pp. 197-220 ◽  
Author(s):  
Yasmine Djebaili ◽  
Azeddine Bilami
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Minimum Cost ◽  
Estimation Algorithm ◽  
Link Quality ◽  
Sensor Nodes ◽  
Detection Mechanism ◽  
Network Applications ◽  
Congestion Detection ◽  
Congested Area

This article describes how fault tolerance is an essential issue for many WSN (Wireless Sensor Network) applications such as wildlife monitoring, battlefield surveillance and health monitoring. It represents a great challenge for researchers regarding to the characteristics of sensor nodes which are prone to failures due essentially to their limited resources. Faults may occur, not only when sensor nodes exhaust their energy, but also when the congestion phenomenon emerges, because of a high traffic in the network and limited storage capacity of the sensor nodes. In order to support fault tolerance in WSNs, the authors propose a new scheme which incorporates a link quality estimation algorithm and a congestion detection mechanism to enable nodes that present high quality links to be chosen for routing in a non-congested area in case of faults. Evaluations through simulations under NS2 show that our proposed protocol tolerates faults with a minimum cost relatively to HEEP protocol and improves network's performances comparatively to other fault tolerant protocols such as EF-LEACH.

Sign in / Sign up

Export Citation Format

Share Document