Target detection in bistatic radar networks

Node placement and repeated security game

Ling Tang, Xiaowen Gong, Jianhui Wu, Junshan Zhang

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

We consider a bistatic radar network that consists of multiple separated radar transmitters and receivers, which are deployed to detect potential attacks at some points of interest (PoIs). To better defend these PoIs, the design of the bistatic radar network is investigated in two stages. First, we study the problem of optimally placing a number of radar transmitters and receivers in the sense of minimizing the maximum distance product between a PoI and its closest transmitter-receiver pair. For this problem, we propose a randomized Voronoi algorithm. Next, given the radars' locations, assuming that the transmitters use fixed and orthogonal frequencies to illuminate signals for interference avoidance, we study the problem of frequency selection for the receivers. Since an intelligent attacker can adaptively change the PoI to attack, the receivers should dynamically adapt their frequencies to cover different subsets of the PoIs. Accordingly, we model the dynamic interactions between the bistatic radar network and the attacker as a repeated security game. Based on their respective information, we propose two learning algorithms for each of them, respectively. We show that if both players follow the modified-regret-matching procedures, the empirical distributions of their actions converge to the set of correlated equilibria.

Original languageEnglish (US)
Article number6416889
Pages (from-to)1279-1289
Number of pages11
JournalIEEE Transactions on Wireless Communications
Volume12
Issue number3
DOIs
StatePublished - 2013

Fingerprint

Target Detection
Radar transmitters
Target tracking
Radar receivers
Radar
Placement
Receiver
Transmitter
Game
Vertex of a graph
Transceivers
Learning algorithms
Attack
Transmitters
Regret
Empirical Distribution
Voronoi
Learning Algorithm
Interference
Cover

Keywords

  • Bistatic radar network
  • learning algorithm
  • node placement
  • repeated game
  • security game

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Target detection in bistatic radar networks : Node placement and repeated security game. / Tang, Ling; Gong, Xiaowen; Wu, Jianhui; Zhang, Junshan.

In: IEEE Transactions on Wireless Communications, Vol. 12, No. 3, 6416889, 2013, p. 1279-1289.

Research output: Contribution to journalArticle

@article{c29bdda3f5724da586ee01ed5cbd478c,
title = "Target detection in bistatic radar networks: Node placement and repeated security game",
abstract = "We consider a bistatic radar network that consists of multiple separated radar transmitters and receivers, which are deployed to detect potential attacks at some points of interest (PoIs). To better defend these PoIs, the design of the bistatic radar network is investigated in two stages. First, we study the problem of optimally placing a number of radar transmitters and receivers in the sense of minimizing the maximum distance product between a PoI and its closest transmitter-receiver pair. For this problem, we propose a randomized Voronoi algorithm. Next, given the radars' locations, assuming that the transmitters use fixed and orthogonal frequencies to illuminate signals for interference avoidance, we study the problem of frequency selection for the receivers. Since an intelligent attacker can adaptively change the PoI to attack, the receivers should dynamically adapt their frequencies to cover different subsets of the PoIs. Accordingly, we model the dynamic interactions between the bistatic radar network and the attacker as a repeated security game. Based on their respective information, we propose two learning algorithms for each of them, respectively. We show that if both players follow the modified-regret-matching procedures, the empirical distributions of their actions converge to the set of correlated equilibria.",
keywords = "Bistatic radar network, learning algorithm, node placement, repeated game, security game",
author = "Ling Tang and Xiaowen Gong and Jianhui Wu and Junshan Zhang",
year = "2013",
doi = "10.1109/TWC.2013.011713.120892",
language = "English (US)",
volume = "12",
pages = "1279--1289",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Target detection in bistatic radar networks

T2 - Node placement and repeated security game

AU - Tang, Ling

AU - Gong, Xiaowen

AU - Wu, Jianhui

AU - Zhang, Junshan

PY - 2013

Y1 - 2013

N2 - We consider a bistatic radar network that consists of multiple separated radar transmitters and receivers, which are deployed to detect potential attacks at some points of interest (PoIs). To better defend these PoIs, the design of the bistatic radar network is investigated in two stages. First, we study the problem of optimally placing a number of radar transmitters and receivers in the sense of minimizing the maximum distance product between a PoI and its closest transmitter-receiver pair. For this problem, we propose a randomized Voronoi algorithm. Next, given the radars' locations, assuming that the transmitters use fixed and orthogonal frequencies to illuminate signals for interference avoidance, we study the problem of frequency selection for the receivers. Since an intelligent attacker can adaptively change the PoI to attack, the receivers should dynamically adapt their frequencies to cover different subsets of the PoIs. Accordingly, we model the dynamic interactions between the bistatic radar network and the attacker as a repeated security game. Based on their respective information, we propose two learning algorithms for each of them, respectively. We show that if both players follow the modified-regret-matching procedures, the empirical distributions of their actions converge to the set of correlated equilibria.

AB - We consider a bistatic radar network that consists of multiple separated radar transmitters and receivers, which are deployed to detect potential attacks at some points of interest (PoIs). To better defend these PoIs, the design of the bistatic radar network is investigated in two stages. First, we study the problem of optimally placing a number of radar transmitters and receivers in the sense of minimizing the maximum distance product between a PoI and its closest transmitter-receiver pair. For this problem, we propose a randomized Voronoi algorithm. Next, given the radars' locations, assuming that the transmitters use fixed and orthogonal frequencies to illuminate signals for interference avoidance, we study the problem of frequency selection for the receivers. Since an intelligent attacker can adaptively change the PoI to attack, the receivers should dynamically adapt their frequencies to cover different subsets of the PoIs. Accordingly, we model the dynamic interactions between the bistatic radar network and the attacker as a repeated security game. Based on their respective information, we propose two learning algorithms for each of them, respectively. We show that if both players follow the modified-regret-matching procedures, the empirical distributions of their actions converge to the set of correlated equilibria.

KW - Bistatic radar network

KW - learning algorithm

KW - node placement

KW - repeated game

KW - security game

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

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

U2 - 10.1109/TWC.2013.011713.120892

DO - 10.1109/TWC.2013.011713.120892

M3 - Article

VL - 12

SP - 1279

EP - 1289

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 3

M1 - 6416889

ER -