The Experts below are selected from a list of 42 Experts worldwide ranked by ideXlab platform
Bang Wang - One of the best experts on this subject based on the ideXlab platform.
-
constructing Perimeter Barrier coverage with bistatic radar sensors
Journal of Network and Computer Applications, 2015Co-Authors: Jiaoyan Chen, Bang WangAbstract:Perimeter Barrier coverage is widely used in many surveillance and intruder detection applications. In this paper, we study how to achieve Perimeter Barrier coverage with bistatic radar sensors. Much different from the binary disk and sector coverage, the coverage area of bistatic radar is dependent on the distance between a pair of radar transmitter and receiver. We first study the minimum cost bistatic transmitter-receiver placement problem. We prove the optimal placement pattern and the structure property of a minimum cost placement sequence. When manually placing radars is not applicable, we study the mobile radar movement problem for Perimeter Barrier coverage with the objective of minimizing the total moving distance or maximal moving distance. To solve the movement problems, we propose two algorithms to first determine the target locations and then use bipartite graph approach to find the best movement schemes. We also provide performance bounds of our movement solutions to the optimal solutions. Our solutions to the placement and movement problems are also validated via simulation results.
Tao Gu - One of the best experts on this subject based on the ideXlab platform.
-
minimum cost deployment of bistatic radar sensor for Perimeter Barrier coverage
Sensors, 2019Co-Authors: Xianghua Xu, Chengwei Zhao, Tingcong Ye, Tao GuAbstract: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.
Jiaoyan Chen - One of the best experts on this subject based on the ideXlab platform.
-
constructing Perimeter Barrier coverage with bistatic radar sensors
Journal of Network and Computer Applications, 2015Co-Authors: Jiaoyan Chen, Bang WangAbstract:Perimeter Barrier coverage is widely used in many surveillance and intruder detection applications. In this paper, we study how to achieve Perimeter Barrier coverage with bistatic radar sensors. Much different from the binary disk and sector coverage, the coverage area of bistatic radar is dependent on the distance between a pair of radar transmitter and receiver. We first study the minimum cost bistatic transmitter-receiver placement problem. We prove the optimal placement pattern and the structure property of a minimum cost placement sequence. When manually placing radars is not applicable, we study the mobile radar movement problem for Perimeter Barrier coverage with the objective of minimizing the total moving distance or maximal moving distance. To solve the movement problems, we propose two algorithms to first determine the target locations and then use bipartite graph approach to find the best movement schemes. We also provide performance bounds of our movement solutions to the optimal solutions. Our solutions to the placement and movement problems are also validated via simulation results.
Xianghua Xu - One of the best experts on this subject based on the ideXlab platform.
-
minimum cost deployment of bistatic radar sensor for Perimeter Barrier coverage
Sensors, 2019Co-Authors: Xianghua Xu, Chengwei Zhao, Tingcong Ye, Tao GuAbstract: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.
Tingcong Ye - One of the best experts on this subject based on the ideXlab platform.
-
minimum cost deployment of bistatic radar sensor for Perimeter Barrier coverage
Sensors, 2019Co-Authors: Xianghua Xu, Chengwei Zhao, Tingcong Ye, Tao GuAbstract: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.