Barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement

Xiaowen Gong, Junshan Zhang, Douglas Cochran, Kai Xing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much recent attention has been given to multistatic and MIMO radar concepts, little has been paid to understanding the performance of radar networks (i.e., multiple individual radars working in concert). In this context, we study the optimal placement of a bistatic radar (BR) sensor network for barrier coverage. The coverage problem in a bistatic radar network (BRN) is challenging because: 1) in contrast to the disk sensing model of a traditional passive sensor, the sensing region of a BR depends on the locations of both the BR transmitter and receiver, and is characterized by a Cassini oval ; 2) since a BR transmitter (or receiver) can potentially form multiple BRs with different BR transmitters (or receivers, respectively), the sensing regions of different BRs are coupled, making the coverage of a BRN highly non-trivial. This paper considers the problem of deploying a network of BRs in a region for maximizing the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that the shortest barrier-based placement is optimal if the shortest barrier is also the shortest line segment connecting the region's two boundaries. Based on this observation, we study the optimal placement of the BRs on a line segment for minimizing its vulnerability, which is a non-convex optimization problem. By exploiting some specific structural properties pertaining to the problem (particularly an important structure of detectability), we find the optimal placement order and the optimal placement spacing of the BR nodes, both of which exhibit elegant balanced structures. Our findings give valuable insight for the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the coverage of a network of BRs.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Pages49-58
Number of pages10
DOIs
StatePublished - 2013
Event14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013 - Bangalore, India
Duration: Jul 29 2013Aug 1 2013

Other

Other14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013
CountryIndia
CityBangalore
Period7/29/138/1/13

Fingerprint

Sensor networks
Radar
Radar transmitters
Radar receivers
Sensors
MIMO radar
Radio waves
Structural properties

Keywords

  • Barrier Coverage
  • Bistatic Radar Sensor Network
  • Optimal Placement
  • Worst-case Intrusion

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Gong, X., Zhang, J., Cochran, D., & Xing, K. (2013). Barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 49-58) https://doi.org/10.1145/2491288.2491305

Barrier coverage in bistatic radar sensor networks : Cassini oval sensing and optimal placement. / Gong, Xiaowen; Zhang, Junshan; Cochran, Douglas; Xing, Kai.

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. p. 49-58.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gong, X, Zhang, J, Cochran, D & Xing, K 2013, Barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement. in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). pp. 49-58, 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013, Bangalore, India, 7/29/13. https://doi.org/10.1145/2491288.2491305
Gong X, Zhang J, Cochran D, Xing K. Barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. p. 49-58 https://doi.org/10.1145/2491288.2491305
Gong, Xiaowen ; Zhang, Junshan ; Cochran, Douglas ; Xing, Kai. / Barrier coverage in bistatic radar sensor networks : Cassini oval sensing and optimal placement. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. pp. 49-58
@inproceedings{3adee1c5e3ff4cd199b39bc115714929,
title = "Barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement",
abstract = "By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much recent attention has been given to multistatic and MIMO radar concepts, little has been paid to understanding the performance of radar networks (i.e., multiple individual radars working in concert). In this context, we study the optimal placement of a bistatic radar (BR) sensor network for barrier coverage. The coverage problem in a bistatic radar network (BRN) is challenging because: 1) in contrast to the disk sensing model of a traditional passive sensor, the sensing region of a BR depends on the locations of both the BR transmitter and receiver, and is characterized by a Cassini oval ; 2) since a BR transmitter (or receiver) can potentially form multiple BRs with different BR transmitters (or receivers, respectively), the sensing regions of different BRs are coupled, making the coverage of a BRN highly non-trivial. This paper considers the problem of deploying a network of BRs in a region for maximizing the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that the shortest barrier-based placement is optimal if the shortest barrier is also the shortest line segment connecting the region's two boundaries. Based on this observation, we study the optimal placement of the BRs on a line segment for minimizing its vulnerability, which is a non-convex optimization problem. By exploiting some specific structural properties pertaining to the problem (particularly an important structure of detectability), we find the optimal placement order and the optimal placement spacing of the BR nodes, both of which exhibit elegant balanced structures. Our findings give valuable insight for the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the coverage of a network of BRs.",
keywords = "Barrier Coverage, Bistatic Radar Sensor Network, Optimal Placement, Worst-case Intrusion",
author = "Xiaowen Gong and Junshan Zhang and Douglas Cochran and Kai Xing",
year = "2013",
doi = "10.1145/2491288.2491305",
language = "English (US)",
isbn = "9781450321938",
pages = "49--58",
booktitle = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",

}

TY - GEN

T1 - Barrier coverage in bistatic radar sensor networks

T2 - Cassini oval sensing and optimal placement

AU - Gong, Xiaowen

AU - Zhang, Junshan

AU - Cochran, Douglas

AU - Xing, Kai

PY - 2013

Y1 - 2013

N2 - By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much recent attention has been given to multistatic and MIMO radar concepts, little has been paid to understanding the performance of radar networks (i.e., multiple individual radars working in concert). In this context, we study the optimal placement of a bistatic radar (BR) sensor network for barrier coverage. The coverage problem in a bistatic radar network (BRN) is challenging because: 1) in contrast to the disk sensing model of a traditional passive sensor, the sensing region of a BR depends on the locations of both the BR transmitter and receiver, and is characterized by a Cassini oval ; 2) since a BR transmitter (or receiver) can potentially form multiple BRs with different BR transmitters (or receivers, respectively), the sensing regions of different BRs are coupled, making the coverage of a BRN highly non-trivial. This paper considers the problem of deploying a network of BRs in a region for maximizing the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that the shortest barrier-based placement is optimal if the shortest barrier is also the shortest line segment connecting the region's two boundaries. Based on this observation, we study the optimal placement of the BRs on a line segment for minimizing its vulnerability, which is a non-convex optimization problem. By exploiting some specific structural properties pertaining to the problem (particularly an important structure of detectability), we find the optimal placement order and the optimal placement spacing of the BR nodes, both of which exhibit elegant balanced structures. Our findings give valuable insight for the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the coverage of a network of BRs.

AB - By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much recent attention has been given to multistatic and MIMO radar concepts, little has been paid to understanding the performance of radar networks (i.e., multiple individual radars working in concert). In this context, we study the optimal placement of a bistatic radar (BR) sensor network for barrier coverage. The coverage problem in a bistatic radar network (BRN) is challenging because: 1) in contrast to the disk sensing model of a traditional passive sensor, the sensing region of a BR depends on the locations of both the BR transmitter and receiver, and is characterized by a Cassini oval ; 2) since a BR transmitter (or receiver) can potentially form multiple BRs with different BR transmitters (or receivers, respectively), the sensing regions of different BRs are coupled, making the coverage of a BRN highly non-trivial. This paper considers the problem of deploying a network of BRs in a region for maximizing the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that the shortest barrier-based placement is optimal if the shortest barrier is also the shortest line segment connecting the region's two boundaries. Based on this observation, we study the optimal placement of the BRs on a line segment for minimizing its vulnerability, which is a non-convex optimization problem. By exploiting some specific structural properties pertaining to the problem (particularly an important structure of detectability), we find the optimal placement order and the optimal placement spacing of the BR nodes, both of which exhibit elegant balanced structures. Our findings give valuable insight for the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the coverage of a network of BRs.

KW - Barrier Coverage

KW - Bistatic Radar Sensor Network

KW - Optimal Placement

KW - Worst-case Intrusion

UR - http://www.scopus.com/inward/record.url?scp=84882962529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84882962529&partnerID=8YFLogxK

U2 - 10.1145/2491288.2491305

DO - 10.1145/2491288.2491305

M3 - Conference contribution

AN - SCOPUS:84882962529

SN - 9781450321938

SP - 49

EP - 58

BT - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

ER -