# Sparsity-Based Optimization of the Sensors Positions in Radar Networks with Separated Transmit and Receive Nodes

Authors: I. M. Ivashko; O. A. Krasnov; A. G.  Yarovoy
Journal: International Journal of Distributed Sensor Networks
 (2016)

---

## Abstract

A sparsity-based approach for the joint optimization of the transmit and the receive nodes positions in the radar network with widely distributed antennas is proposed in this paper. The optimization problem is formulated as minimization of the number of radars that meet fixed target localization requirements over the surveillance area. We demonstrated that this type of the problem is different from the problem of the monostatic radar network topology optimization and implies the bilinear matrix inequality (BMI) problem. To tackle it, we propose to use the relaxation technique, which allows for joint selection of the positions for transmit and receive radar nodes. Provided numerical analysis shows that, in order to satisfy the same requirements to the target localization accuracy, the radar network with bistatic radars requires less number of the nodes than the one with monostatic radars.


---

## Body

## 1. Introduction

The variety of applications of the radar (sensor) networks is constantly increasing in both civil and military domains. Such applications include homeland security and border control, environmental monitoring, and patient monitoring to list a few [1–3]. Availability of low-cost radars with wide-beam/omnidirectional antennas provides opportunity to estimate the target state vector over wide surveillance area using joint processing of data from widely distributed radar nodes. The spatial diversity of the radars allows for better resolution, higher detectability, and fault tolerance compared to a single conventional monostatic radar [4]. The costs of the system design, delivery, maintenance, and operation are lower for the radar networks as well.Within a wide spectrum of the radar networks, particular systems differ from each other by (i) the way of radar interaction with the target of interest (active way, passive way, or combination of both), (ii) the level of the spatial coherency (nodes can be mutually coherent, with short time coherency, and noncoherent), (iii) the method of the information fusion from individual radar nodes (fusion of radio frequency signals, video signals, individual targets’ detections and parameters measurements, and tracks), (iv) the level of autonomy in the signal reception and processing (autonomous level, cooperative level, or combination of both), and (v) the radar nodes architecture (monostatic radars, bistatic radars, or combination of both). These features and the parameters of the single radar define overall system performance [5]. For example, the network of multistatic radars with cooperative mode provides comparable estimation accuracy to the network of monostatic radars with autonomous reception mode, using two times less transmit/receive channels.The topology of the radar nodes affects the system performance as well. For example, the target localization accuracy of the radar network is affected by the ranging errors of each radar [6]. In Global Positioning Systems, where the ranging errors of the different satellites are the same, this effect can be described with the Geometric Dilution of Precision (GDOP) factor. The GDOP is defined as a ratio of the localization error to the ranging error, which is the same for all satellites. In the network of radars, where the ranging accuracy will be different for each radar node, this effect is described with the Cramér-Rao Lower Bound (CRLB). In both systems, the best estimation can be achieved with symmetrical and balanced topology of the sensing nodes [7, 8].However, in most of the applications, the available locations for the radar nodes are limited due to several reasons, such as the system cost, the availability of communication links and their data rates, and the existing infrastructure. Therefore, one of the key issues of the effective exploitation of radar networks is providing optimal topology of the radar nodes in terms of (minimum) estimation error. In general, this problem can be formulated in two ways: (i) to find the minimum number of the radar nodes positions that guarantee predefined target localization accuracy and (ii) to find optimal positions for a fixed number of the radar nodes such that the target localization error is minimal.The problem of the optimization of nodes positions of the sensor networks has been studied in the recent decades in both radar and communication fields [9–11]. In particular, the developed state-of-the-art techniques that are based on convex, greedy, and heuristic optimization can be exploited for different types of monostatic sensors [10–12]. Some of these techniques can be modified for the radar networks that use signals from transmitters of opportunity (passive bistatic radars (PBR)) [12, 13]. To the authors’ knowledge, there is no work dedicated to the joint position optimization of the transmit and receive radar nodes in the radar networks that use dedicated transmitters. This type of the radar network is also known asstatistical multiple-input multiple-output (MIMO) radar [4]. On the designing stage of the statistical MIMO radar the question of how to make the trade-off on devoting the available location either to transmit or receive nodes arises.In this paper, we address the problem of joint optimization of the transmit (Tx) and receive (Rx) radar nodes positions in the radar networks with widely separated antennas. We formulate the generic optimization problem of the first type, where the optimal positions of Tx and Rx radar nodes have to be selected in order to meet fixed accuracy requirements to target localization. This optimization problem implies the bilinear matrix inequality (BMI). We relax it to the linear matrix inequality (LMI) by introducing new variables that describe each of the Tx-Rx channels of the radar network. We explore the sparsity-based algorithm introduced in [11] to solve this problem. The algorithm can be applied for the selection of the favorable radar nodes’ positions in scenarios, where the conditions of network regularity and symmetry cannot be satisfied. Another advantage of this algorithm is its ability to find global minimum of the objective function in contrast to the heuristic optimization algorithms. We developed technique, based on the convex optimization, for the selection of the positions for transmitting and receiving radar nodes that satisfy given requirements to the estimation accuracy of the radar network. We applied the developed framework to the topology optimization of the Frequency-Modulated Continuous-Wave (FMCW) radar network with widely separated transmit and receive radar nodes. The corresponding theory on the evaluation of the target localization accuracy using the Fisher information matrix (FIM) has been developed.The paper is organized as follows. The system model is introduced in Section2. Section 3 provides the developed framework to the radar network topology optimization problem. The comparative numerical analysis of the radar network performance and topology optimization for different types of the systems is given in Section 4. In Appendix, the theoretical bounds on the target localization accuracy (Cramér-Rao Lower Bound) in Frequency-Modulated Continuous-Wave radar network are presented.


## 2. System Model

We consider an active radar network withN transmitting and M receiving nodes in 3D space. The Tx and Rx nodes can be either colocated or separated corresponding to the monostatic and bistatic radar architectures, respectively. In the model of bistatic radar network, it is assumed that each of N totally available transmitters forms a bistatic sensing pair with each of M available receivers that correspond to the cooperative mode of the signal reception and result in J
=
N
M bistatic radars, if not specified otherwise. In case of monostatic radar network, the number of Tx channels N is equal to the number of Rx channels M, which forms J
=
N
=
M monostatic radars. Monostatic radars are assumed to use autonomous mode of the signal reception; that is, each of the receivers receives signal from the dedicated (colocated) transmitter.Antenna patterns of the Tx and Rx antennas are assumed to be omnidirectional. The target detection is based on the reflected signal. The data fusion is made on the level of single measurements of the estimated signal parameters at each of the receiving radar nodes. This implies two-step algorithm of the target localization. The fist step includes target detection and estimation of the signal parameters. In the second step, the target position vector is evaluated by applying appropriate positioning algorithm. For example, for target localization using the set of the measured signal time delays, the multilateration algorithm, based on the direct calculation, can be applied [14]. The target localization in 2D plane with multilateration algorithm that uses two measured bistatic distances is shown in Figure 1. In 3D space, the coordinate surfaces correspond to the ellipsoids of revolution in the points of transmitting and receiving positions of bistatic radar.Figure 1
Target localization in multistatic radar network with cooperative mode of signal reception.We consider the following measurement model:(1)
r
=
f
ψ
+
ξ
,where r
∈
R
J is the vector that represents accumulated measurements, namely, signal time delays, in J bistatic pairs; ψ
=
[
x
,
y
,
z
] is the parameter vector that represents the true target coordinates; f
(
·
) is the nonlinear function; ξ is the measurement noise. The nonlinear function f
(
·
) from (1) is the signal time delay measured in the jth bistatic radar and is related to the target and radar nodes’ positions as follows:(2)
τ
j
=
R
n
t
+
R
m
r
c
,where c is the speed of light, and (3)
R
n
t
=
x
-
x
n
t
2
+
y
-
y
n
t
2
+
z
-
z
n
t
2
,
R
m
r
=
x
-
x
m
r
2
+
y
-
y
m
r
2
+
z
-
z
m
r
2are distances from the nth transmitter and mth receiver to the target; n
=
1
,
…
,
N; m
=
1
,
…
,
M; p
=
x
y
z is the coordinate vector of the target, p
n
(
t
)
=
[
x
n
(
t
)
,
y
n
(
t
)
,
z
n
(
t
)
], and p
m
(
r
)
=
[
x
m
(
r
)
,
y
m
(
r
)
,
z
m
(
r
)
] are coordinate vectors of the nth transmitter and the mth receiver, respectively.A single target case is considered throughout the paper. It is assumed that the measurements from the multiple targets in the scene are associated using appropriate data association algorithm, like the one presented in [15]. Effects of the signal multipath are neglected, assuming that multipath is suppressed during the detection and the estimation in a single radar. The signal attenuation that occurs due to the finite target-radar distance is taken into account, following the classic radar equation:(4)
P
r
=
P
t
G
t
G
r
R
C
S
λ
2
4
π
3
R
n
2
R
m
2
L
s
y
s
t
G
p
,where P
r is the received signal power, P
t is the transmitted power, G
t is the Tx antenna gain, G
r is the Rx antenna gain, R
C
S is the radar cross section, λ is the signal wavelength, L
s
y
s
t is the system loss, and G
p is the processing gain.


## 3. Radar Network Geometry Optimization

We use the Cramér-Rao Lower Bound (the inverse of the Fisher information matrix) as the performance metric of the system to evaluate the target localization accuracy. Although the CRLB approaches the maximum likelihood estimatior (MLE) at high signal-to-noise ratios (SNR), it remains an effective metric of the radar network performance [16]. It incorporates the operational parameters of the single radar node as well as the system features (such as topology of the nodes, their architecture, and cooperation mode). Hence, the effect of these factors upon the system performance can be analyzed with the CRLB. Moreover, with increasing the number of the radar nodes, the threshold point (the point up to which the CRLB approaches the MLE asymptotically) moves to the lower SNR regions [17].For unbiased estimatorθ
^ of the parameter vector θ, the CRLB allows one to place a bound on the variance of each element from the parameter vector θ
=
[
θ
1
,
…
,
θ
K
] [18]:(5)
Var
⁡
θ
^
i
≥
I
-
1
θ
i
i
,where I is the K
×
K Fisher information matrix (FIM) with elements (6)
I
θ
i
j
=
-
∂
2
ln
⁡
g
r
;
θ
∂
θ
i
∂
θ
j
,where g
(
r
;
θ
) is the probability density function of the parameter vector θ; 〈
⋯
〉 means statistical average of the quantity in the brackets; i
=
1
,
…
K; j
=
1
,
…
K.One of the functions of the FIM can be used as metrics of the system estimation accuracy: the minimum eigenvalue (λ
m
i
n), which indicates the length of the major axis of the error ellipsoid that corresponds to the maximum estimation error, the sum of the eigenvalues that corresponds to the sum of the errors, and the (log) determinant, which is the (log) volume of the confidence ellipsoid [11, 19, 20].In the optimization algorithm, we constraint the minimum eigenvalue of the FIMλ
m
i
n with the threshold λ
g. This corresponds to the constraint on the localization error σ
p
o
s
=
p
~
-
p, which has to be within an origin-centered ellipsoid (in 3D space) with the longest axis R
e and probability higher than P
e: P
r
(
σ
p
o
s
2
≤
R
e
)
≥
P
e [21]. For the parameter vector θ with three components K
=
3, the probability P
e is given by [6](7)
P
e
q
=
erf
⁡
q
2
-
2
q
π
exp
⁡
-
q
2
,where(8)
e
r
f
=
2
π
∫
0
x
exp
⁡
-
t
2
d
tis the error function and q is the constant that determines the size of the confidence ellipsoid and relates to its semimajor axis as R
e
2
=
q
λ
m
i
n.


### 3.1. The Radar Network with Colocated Transmit and Receive Antennas

We formulate the following optimization problem to select the minimum numberJ
~ of sensing locations from the J available ones (J
~
≪
J) that allow for the target localization with predefined accuracy requirements from the target area S:(9)
min
⁡
1
J
T
w
s.t.
λ
m
i
n
I
w
≥
λ
g
,
∀
p
∈
S
w
j
∈
0,1
,
j
=
1
,
…
,
J
,where the minimization of the cost function corresponds to the minimization of l
1-norm of the selection vector w
∈
R
J with w
j
=
1
(
0
) which indicates whether the jth candidate position is selected or not; I is the Fisher information matrix on the target localization in the radar network:(10)
I
p
=
∑
j
=
1
J
I
p
jwith I
(
j
) being the FIM constructed, based on measurements from jth radar (example on construction of the FIM on target localization in FMCW radar network can be found in Appendix A).The dependence of the target localization accuracy upon the selected radars is introduced using the multiplication of each of the FIMsI
(
j
) by corresponding value from the selection vector w
j:(11)
I
w
,
p
=
∑
j
=
1
J
w
j
I
p
j
.Problem (9) is a convex optimization problem that can be solved with the algorithm presented in [11] by minimizing the reweighted l
1-norm of the selection vector w:(12)
m
i
n
w
∈
R
J
u
T
w
,where u is a weight vector with components u
j
(
k
)
=
1
/
(
ϵ
+
w
j
k
) updated in each of kth iterations; ϵ is a small number that prevents division by zero. The use of the weight vector u in the cost function allows for the smaller number of the radar positions to be selected, compared to l
1-norm minimization [22].Since the number of the selected positionsJ
~ is much less than the number of alternative ones J
~
≪
J, the selection vector w contains small number of the nonzero entries. These nonzero entries represent the number of radars required to reconstruct the target position vector with predefined estimation accuracy. In this manner, the optimization problem is sparse.


### 3.2. The Radar Network with Widely Separated Transmit and Receive Antennas

#### 3.2.1. Problem Formulation

In this section we consider bistatic radar network with cooperative mode of the signal transmission reception; that is, signals scattered from the target due to illumination by all of the transmit radar nodes are received by all of the receiving radar nodes. Then the Fisher information matrix that characterizes the system performance can be represented as(13)
I
w
t
,
w
r
,
p
=
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
,where w
(
t
) and w
(
r
) are the selection vectors of Tx and Rx radar nodes’ positions.In order to choose the favorable geometry of bistatic radars, the positions of transmittingN and receiving antennas M have to be optimized simultaneously. The minimization function is then a sum of two (reweighted) l
1-norms and the problem of the multistatic radar network geometry optimization is formulated as(14)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
w
n
t
∈
0,1
,
n
=
1
,
…
,
N
w
m
r
∈
0,1
,
m
=
1
,
…
,
M
,where u
(
t
) and u
(
r
) are weight vectors for the number of Tx and Rx radar units with the elements [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
), respectively. The notation I
⪰
1 means that matrix (
I
-
1
) is positive semidefinite (I and 1 are symmetrical matrices).Constraint in (14) implies thebilinear matrix inequality (BMI) problem. BMI problems are NP-hard and include all quadratic problems. There are local and global methods for the solution of BMI optimization problems. Local method implies an alternate optimization over the parameters w
(
t
) and w
(
r
). In the global method (branch-and-bound type) the solution can be found by relaxing BMI problem to the linear matrix inequality (LMI) problem. We apply semidefinite relaxation to solve the problem of the geometry optimization of multistatic radar networks.


#### 3.2.2. Semidefinite Relaxation in BMI Problem of Multistatic Radar Network Geometry Optimization

First, we substitute the bilinear termsw
n
(
t
) and w
m
(
r
) in (14) with new variable γ
=
[
w
1
(
t
)
,
…
,
w
N
(
t
)
,
w
1
(
r
)
,
…
,
w
M
(
r
)
]
T and introduce the bound on γ
j [23]. Consequently, the optimization problem (14) will be(15)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
1
3
⪰
0
,
∀
p
∈
S
g
n
m
=
w
n
t
w
m
r
,
n
=
1
,
…
,
N
;
m
=
1
,
…
,
M
.Then we relax the constraint ong
n
m as LMI:(16)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
G
γ
γ
T
1
⪰
0
,
diag
⁡
G
=
γwhere G
=
γ
γ
T.Problem (16) is a semidefinite programming (SDP) problem in the variables G and γ. Similar to the monostatic radar network optimization [11], the optimization algorithm for the selection of the multistatic radar network topology is as follows:(1)
Initialize the iteration counter k
=
0 and the weight vectors u
(
t
)
=
1
N, u
(
r
)
=
1
M.
(2)
Solve the weighted l
1-norm minimization problem (16) for the optimum γ
(
k
) in the kth iteration.
(3)
Update the weight vectors: [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
) for each n
=
1
,
…
,
N and m
=
1
,
…
,
M.
(4)
Stop on convergence or when k attains a specified maximum number of iterations k
m
a
x, otherwise, increment k and go to step (2).The application of the relaxation technique leads to non-Boolean solution of the optimization problem. An approximate Boolean solution can be found by thresholding nonzero entries of the vectorγ or by applying the randomization technique [24].As one can see, the structure of the FIM that describes the target localization performance of the radar network is defined as one that incorporates the estimation performance of each radar (Tx-Rx channel)I
(
j
). The cooperation mode of the signal reception will result in higher number of Tx-Rx channels, compared to the autonomous mode of the signal reception. Therefore, as soon as the FIM of each Tx-Tx channel I
(
j
) in the radar network is defined, the target localization accuracy of the system can be easily evaluated. To summarize, the developed generic framework can be applied for the optimization of the radar nodes positions in the radar networks that consist of different types of the radar sensors, which can be both homogeneous and heterogeneous. In the next section, we present the application of the developed theory to the optimization of the radar nodes positions of the FMCW radar network.


## 3.1. The Radar Network with Colocated Transmit and Receive Antennas

We formulate the following optimization problem to select the minimum numberJ
~ of sensing locations from the J available ones (J
~
≪
J) that allow for the target localization with predefined accuracy requirements from the target area S:(9)
min
⁡
1
J
T
w
s.t.
λ
m
i
n
I
w
≥
λ
g
,
∀
p
∈
S
w
j
∈
0,1
,
j
=
1
,
…
,
J
,where the minimization of the cost function corresponds to the minimization of l
1-norm of the selection vector w
∈
R
J with w
j
=
1
(
0
) which indicates whether the jth candidate position is selected or not; I is the Fisher information matrix on the target localization in the radar network:(10)
I
p
=
∑
j
=
1
J
I
p
jwith I
(
j
) being the FIM constructed, based on measurements from jth radar (example on construction of the FIM on target localization in FMCW radar network can be found in Appendix A).The dependence of the target localization accuracy upon the selected radars is introduced using the multiplication of each of the FIMsI
(
j
) by corresponding value from the selection vector w
j:(11)
I
w
,
p
=
∑
j
=
1
J
w
j
I
p
j
.Problem (9) is a convex optimization problem that can be solved with the algorithm presented in [11] by minimizing the reweighted l
1-norm of the selection vector w:(12)
m
i
n
w
∈
R
J
u
T
w
,where u is a weight vector with components u
j
(
k
)
=
1
/
(
ϵ
+
w
j
k
) updated in each of kth iterations; ϵ is a small number that prevents division by zero. The use of the weight vector u in the cost function allows for the smaller number of the radar positions to be selected, compared to l
1-norm minimization [22].Since the number of the selected positionsJ
~ is much less than the number of alternative ones J
~
≪
J, the selection vector w contains small number of the nonzero entries. These nonzero entries represent the number of radars required to reconstruct the target position vector with predefined estimation accuracy. In this manner, the optimization problem is sparse.


## 3.2. The Radar Network with Widely Separated Transmit and Receive Antennas

### 3.2.1. Problem Formulation

In this section we consider bistatic radar network with cooperative mode of the signal transmission reception; that is, signals scattered from the target due to illumination by all of the transmit radar nodes are received by all of the receiving radar nodes. Then the Fisher information matrix that characterizes the system performance can be represented as(13)
I
w
t
,
w
r
,
p
=
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
,where w
(
t
) and w
(
r
) are the selection vectors of Tx and Rx radar nodes’ positions.In order to choose the favorable geometry of bistatic radars, the positions of transmittingN and receiving antennas M have to be optimized simultaneously. The minimization function is then a sum of two (reweighted) l
1-norms and the problem of the multistatic radar network geometry optimization is formulated as(14)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
w
n
t
∈
0,1
,
n
=
1
,
…
,
N
w
m
r
∈
0,1
,
m
=
1
,
…
,
M
,where u
(
t
) and u
(
r
) are weight vectors for the number of Tx and Rx radar units with the elements [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
), respectively. The notation I
⪰
1 means that matrix (
I
-
1
) is positive semidefinite (I and 1 are symmetrical matrices).Constraint in (14) implies thebilinear matrix inequality (BMI) problem. BMI problems are NP-hard and include all quadratic problems. There are local and global methods for the solution of BMI optimization problems. Local method implies an alternate optimization over the parameters w
(
t
) and w
(
r
). In the global method (branch-and-bound type) the solution can be found by relaxing BMI problem to the linear matrix inequality (LMI) problem. We apply semidefinite relaxation to solve the problem of the geometry optimization of multistatic radar networks.


### 3.2.2. Semidefinite Relaxation in BMI Problem of Multistatic Radar Network Geometry Optimization

First, we substitute the bilinear termsw
n
(
t
) and w
m
(
r
) in (14) with new variable γ
=
[
w
1
(
t
)
,
…
,
w
N
(
t
)
,
w
1
(
r
)
,
…
,
w
M
(
r
)
]
T and introduce the bound on γ
j [23]. Consequently, the optimization problem (14) will be(15)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
1
3
⪰
0
,
∀
p
∈
S
g
n
m
=
w
n
t
w
m
r
,
n
=
1
,
…
,
N
;
m
=
1
,
…
,
M
.Then we relax the constraint ong
n
m as LMI:(16)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
G
γ
γ
T
1
⪰
0
,
diag
⁡
G
=
γwhere G
=
γ
γ
T.Problem (16) is a semidefinite programming (SDP) problem in the variables G and γ. Similar to the monostatic radar network optimization [11], the optimization algorithm for the selection of the multistatic radar network topology is as follows:(1)
Initialize the iteration counter k
=
0 and the weight vectors u
(
t
)
=
1
N, u
(
r
)
=
1
M.
(2)
Solve the weighted l
1-norm minimization problem (16) for the optimum γ
(
k
) in the kth iteration.
(3)
Update the weight vectors: [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
) for each n
=
1
,
…
,
N and m
=
1
,
…
,
M.
(4)
Stop on convergence or when k attains a specified maximum number of iterations k
m
a
x, otherwise, increment k and go to step (2).The application of the relaxation technique leads to non-Boolean solution of the optimization problem. An approximate Boolean solution can be found by thresholding nonzero entries of the vectorγ or by applying the randomization technique [24].As one can see, the structure of the FIM that describes the target localization performance of the radar network is defined as one that incorporates the estimation performance of each radar (Tx-Rx channel)I
(
j
). The cooperation mode of the signal reception will result in higher number of Tx-Rx channels, compared to the autonomous mode of the signal reception. Therefore, as soon as the FIM of each Tx-Tx channel I
(
j
) in the radar network is defined, the target localization accuracy of the system can be easily evaluated. To summarize, the developed generic framework can be applied for the optimization of the radar nodes positions in the radar networks that consist of different types of the radar sensors, which can be both homogeneous and heterogeneous. In the next section, we present the application of the developed theory to the optimization of the radar nodes positions of the FMCW radar network.


## 3.2.1. Problem Formulation

In this section we consider bistatic radar network with cooperative mode of the signal transmission reception; that is, signals scattered from the target due to illumination by all of the transmit radar nodes are received by all of the receiving radar nodes. Then the Fisher information matrix that characterizes the system performance can be represented as(13)
I
w
t
,
w
r
,
p
=
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
,where w
(
t
) and w
(
r
) are the selection vectors of Tx and Rx radar nodes’ positions.In order to choose the favorable geometry of bistatic radars, the positions of transmittingN and receiving antennas M have to be optimized simultaneously. The minimization function is then a sum of two (reweighted) l
1-norms and the problem of the multistatic radar network geometry optimization is formulated as(14)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
w
n
t
w
m
r
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
w
n
t
∈
0,1
,
n
=
1
,
…
,
N
w
m
r
∈
0,1
,
m
=
1
,
…
,
M
,where u
(
t
) and u
(
r
) are weight vectors for the number of Tx and Rx radar units with the elements [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
), respectively. The notation I
⪰
1 means that matrix (
I
-
1
) is positive semidefinite (I and 1 are symmetrical matrices).Constraint in (14) implies thebilinear matrix inequality (BMI) problem. BMI problems are NP-hard and include all quadratic problems. There are local and global methods for the solution of BMI optimization problems. Local method implies an alternate optimization over the parameters w
(
t
) and w
(
r
). In the global method (branch-and-bound type) the solution can be found by relaxing BMI problem to the linear matrix inequality (LMI) problem. We apply semidefinite relaxation to solve the problem of the geometry optimization of multistatic radar networks.


## 3.2.2. Semidefinite Relaxation in BMI Problem of Multistatic Radar Network Geometry Optimization

First, we substitute the bilinear termsw
n
(
t
) and w
m
(
r
) in (14) with new variable γ
=
[
w
1
(
t
)
,
…
,
w
N
(
t
)
,
w
1
(
r
)
,
…
,
w
M
(
r
)
]
T and introduce the bound on γ
j [23]. Consequently, the optimization problem (14) will be(15)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
1
3
⪰
0
,
∀
p
∈
S
g
n
m
=
w
n
t
w
m
r
,
n
=
1
,
…
,
N
;
m
=
1
,
…
,
M
.Then we relax the constraint ong
n
m as LMI:(16)
m
i
n
w
t
∈
R
N
,
w
r
∈
R
M
u
t
T
w
t
+
u
r
T
w
r
s.t.
∑
n
=
1
N
∑
m
=
1
M
g
n
m
I
p
n
m
-
λ
g
1
3
⪰
0
,
∀
p
∈
S
G
γ
γ
T
1
⪰
0
,
diag
⁡
G
=
γwhere G
=
γ
γ
T.Problem (16) is a semidefinite programming (SDP) problem in the variables G and γ. Similar to the monostatic radar network optimization [11], the optimization algorithm for the selection of the multistatic radar network topology is as follows:(1)
Initialize the iteration counter k
=
0 and the weight vectors u
(
t
)
=
1
N, u
(
r
)
=
1
M.
(2)
Solve the weighted l
1-norm minimization problem (16) for the optimum γ
(
k
) in the kth iteration.
(3)
Update the weight vectors: [
u
n
(
t
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
n
t
]
k
) and [
u
m
(
r
)
]
(
k
)
=
1
/
(
ϵ
+
[
w
m
r
]
k
) for each n
=
1
,
…
,
N and m
=
1
,
…
,
M.
(4)
Stop on convergence or when k attains a specified maximum number of iterations k
m
a
x, otherwise, increment k and go to step (2).The application of the relaxation technique leads to non-Boolean solution of the optimization problem. An approximate Boolean solution can be found by thresholding nonzero entries of the vectorγ or by applying the randomization technique [24].As one can see, the structure of the FIM that describes the target localization performance of the radar network is defined as one that incorporates the estimation performance of each radar (Tx-Rx channel)I
(
j
). The cooperation mode of the signal reception will result in higher number of Tx-Rx channels, compared to the autonomous mode of the signal reception. Therefore, as soon as the FIM of each Tx-Tx channel I
(
j
) in the radar network is defined, the target localization accuracy of the system can be easily evaluated. To summarize, the developed generic framework can be applied for the optimization of the radar nodes positions in the radar networks that consist of different types of the radar sensors, which can be both homogeneous and heterogeneous. In the next section, we present the application of the developed theory to the optimization of the radar nodes positions of the FMCW radar network.


## 4. Numerical Results

In this section, we present the comparative analysis of the potential localization accuracy of multistatic and monostatic FMCW radar networks with application of the topology optimization algorithm. It is assumed that transmitted signals are orthogonal and do not interfere with each other [25]. Free-space model of signal propagation is used, assuming that the line-of-sight signal corresponds to the first and the strongest signal component in time.


### 4.1. Signal Model

The reference linear frequency modulated (LFM) up-chirp signal is(17)
s
t
=
exp
⁡
i
t
ω
0
+
Δ
ω
T
s
t
-
q
-
1
T
s
,where ω
0 is an angular frequency, related to the carrier frequency of the transmitted signal f
c as ω
0
=
2
π
f
c; Δ
ω is an angular frequency bandwidth, related to the signal bandwidth Δ
f as Δ
ω
=
2
π
Δ
f; T
s is the duration of the single sawtooth pulse (sweep time); q
=
1
,
…
,
Q denotes the pulse number with Q being the number of integrated train pulses used in signal processing for signal parameters estimation, 0
<
t
<
Q
T
s.The signal, reflected from the point moving target, is(18)
r
t
=
A
exp
⁡
i
φ
s
t
-
τ
,
ω
0
-
ω
d
+
ξ
t
,where A
exp
⁡
(
i
φ
) is the nonfluctuating complex signal amplitude; ω
d
=
2
π
f
d is an angular Doppler frequency shift with f
d being the Doppler frequency; ξ is zero-mean Gaussian noise with variance σ
2
:
ξ
~
N
(
0,2
σ
2
).In addition to the time delay and Doppler frequency, the complex amplitudeA
exp
⁡
(
i
φ
) of the received signal is measured as well. Consequently, the parameter vector contains four components K
=
4: θ
=
[
τ
,
ω
d
,
A
,
φ
]. We assume that the target localization is performed using the multilateration technique that requires only the time delay measurements for target position estimation. Therefore, the complex signal amplitude and the Doppler frequency are nuisance parameters in the model considered. The parameter vector ψ for target localization in the radar network corresponds to the true target position ψ
=
p
=
x
,
y
,
z. Then the Fisher information matrix on the target position can be evaluated by applying chain rule [18](19)
I
ψ
=
H
T
I
θ
Hwith(20)
H
=
∂
θ
ψ
∂
ψ
=
∂
τ
1
∂
x
∂
τ
1
∂
y
∂
τ
1
∂
z
∂
τ
2
∂
x
∂
τ
2
∂
y
∂
τ
2
∂
z
⋮
⋮
⋮
∂
τ
J
∂
x
∂
τ
J
∂
y
∂
τ
J
∂
zbeing J
×
3 Jacobian matrix. The detailed derivations of the Fisher information matrix for the target localization in FMCW radar network are given in Appendix A.


### 4.2. The Analysis of the Potential Localization Accuracy of the Multistatic and Monostatic Radar Networks

Figure2 shows contour plots of the target localization accuracy for three types of the FMCW radar networks with four Tx-Rx channels each, (i) monostatic radar network with autonomous mode of the signal reception (Figure 2(a)), (ii) multistatic radar network with cooperative mode of the signal reception (Figure 2(b)), and (iii) multistatic radar network with autonomous mode of the signal reception, where autonomous Tx-Rx pairs are depicted with dashed ellipses (Figure 2(c)). We define the localization accuracy as σ
p
o
s
=
σ
x
2
+
σ
y
2, where σ
x
2 and σ
y
2 are variances of the estimation x and y target coordinates, respectively. The operational characteristics of single FMCW radar are given in Table 1.Table 1
Simulation parameters of a single radar node.
Parameter
Value
Transmitter power
P
t
=
25 W
Transmit gain
G
(
t
)
=
3.8 dBi
Receive gain
G
(
r
)
=
3.8 dBi
Processing gain
G
p
=
512
=
27.1 dB
Carrier frequency
f
c
=
2 GHz
Sweep time
T
s
=
5
⋅
1
0
-
3 s
Number of bursts
N
B
=
512
Bandwidth
Δ
f
=
20 MHz
Receiver bandwidth
B
=
10 kHz
Noise figure
F
n
=
10 dB
Atmospheric losses
L
amt
=
0 dB
Processing losses
L
proc
=
0 dB
RF losses
L
RF
=
6 dBFigure 2
Contours of the position estimation accuracyσ
p
o
s, [
m
]. Red x-marks indicate positions of the transmit nodes; red squares indicate positions of the receive nodes.
(a)
Monostatic network with autonomous signal reception
(b)
Multistatic network with cooperative signal reception
(c)
Multistatic network with autonomous signal receptionThe presented plots show that the multistatic network with the cooperative mode of the signal reception (Figure2(b)) provides the equivalent localization accuracy to the monostatic radar network with autonomous mode of the signal reception (Figure 2(a)) but with two times less number of Tx-Rx channels. By introducing additional four radar nodes that form four autonomous Tx-Rx pairs of the multistatic radar network (Figure 2(c)), the localization accuracy increases, compared to the monostatic radar network (Figure 2(a)), because of the higher spatial diversity gain.To summarize, the multisatic radar network possesses significant advantage over the monostatic radar network in terms of the localization accuracy and the number of Tx-Rx channels. This advantage can be interpreted in two ways: either as an ability to provide higher localization accuracy with the same number of Tx and Rx channels or an ability to provide the same accuracy with less number of Tx-Rx channels. Subsequently, this allows for substantial advantages in the system cost (less number of transmitting and receiving channels) compared to the monostatic radar network.


### 4.3. Optimization of the Multistatic Radar Network Geometry

Next, the topology optimization algorithm was applied to the scenario of the target localization in FMCW radar network along the specified areas in the city of Delft (Netherlands). These areas correspond to the canal and the highway in the city (Figure3). The target radar cross section is R
C
S
=
1 m2. Parameters of the single radar node are given in Table 1. The constraint on the maximum value of localization error has been set to R
e
=
5 m with probability P
e
=
95
%. The optimization algorithm has been applied for the selection of the optimal positions for transmitting and receiving radar nodes. Two scenarios of the modeling of the candidate locations for the radar nodes were considered. In the first scenario, Tx and Rx radar grids coincide and correspond to the existing locations of GSM masts (Figure 3), the coordinates of which can be found in [26], for example. In the second scenario, the nodes of the Tx radar grid correspond to the positions of the GSM masts and the nodes of the Rx radar grid are randomly generated points with mean values that correspond to the Tx grid and the standard deviation equal to 250 m. In both scenarios, the grid points of the Tx and Rx grids represent the candidate positions for the radar nodes. The reason why we consider these two scenarios is to study the effect of the spatial diversity of the Tx and Rx radar grids on the optimization result.Figure 3
Positions of the GSM masts in the Delft area (blue dashed line indicates the surveillance areas).Figure4 shows the distribution of the localization error around the target area of interest with optimized radar network geometry for two considered scenarios in 2D plane. For the first and the second scenarios, the maximum value of the localization error around the target area is equal to 1 m and 5 m, respectively. The number of the Tx and Rx channels is less in the second scenario due to the spatial diversity of the Tx and Rx radar units, which leads to higher signal-to-noise ratio without increasing the number of Tx-Rx channels. For the first scenario, the selected radar network includes both monostatic and bistatic radars. To summarize, the positions of the Tx and Rx grids relative to each other affect the optimization result significantly. The exploitation of the spatially separated Tx and Rx grids allows for the less number of the radar nodes required to satisfy the same accuracy constraint, compared to the scenario with fully overlapping Tx-Rx radar grids.Figure 4
Contours of the position estimation accuracyσ
p
o
s, [
m
], for optimal geometries of the radar network. Red x-marks indicate positions of the transmit nodes, red squares indicate positions of the receive nodes, and cyan diamonds correspond to target areas.
(a)
Tx and Rx grids fully overlap
(b)
Tx and Rx grids do not overlap


## 4.1. Signal Model

The reference linear frequency modulated (LFM) up-chirp signal is(17)
s
t
=
exp
⁡
i
t
ω
0
+
Δ
ω
T
s
t
-
q
-
1
T
s
,where ω
0 is an angular frequency, related to the carrier frequency of the transmitted signal f
c as ω
0
=
2
π
f
c; Δ
ω is an angular frequency bandwidth, related to the signal bandwidth Δ
f as Δ
ω
=
2
π
Δ
f; T
s is the duration of the single sawtooth pulse (sweep time); q
=
1
,
…
,
Q denotes the pulse number with Q being the number of integrated train pulses used in signal processing for signal parameters estimation, 0
<
t
<
Q
T
s.The signal, reflected from the point moving target, is(18)
r
t
=
A
exp
⁡
i
φ
s
t
-
τ
,
ω
0
-
ω
d
+
ξ
t
,where A
exp
⁡
(
i
φ
) is the nonfluctuating complex signal amplitude; ω
d
=
2
π
f
d is an angular Doppler frequency shift with f
d being the Doppler frequency; ξ is zero-mean Gaussian noise with variance σ
2
:
ξ
~
N
(
0,2
σ
2
).In addition to the time delay and Doppler frequency, the complex amplitudeA
exp
⁡
(
i
φ
) of the received signal is measured as well. Consequently, the parameter vector contains four components K
=
4: θ
=
[
τ
,
ω
d
,
A
,
φ
]. We assume that the target localization is performed using the multilateration technique that requires only the time delay measurements for target position estimation. Therefore, the complex signal amplitude and the Doppler frequency are nuisance parameters in the model considered. The parameter vector ψ for target localization in the radar network corresponds to the true target position ψ
=
p
=
x
,
y
,
z. Then the Fisher information matrix on the target position can be evaluated by applying chain rule [18](19)
I
ψ
=
H
T
I
θ
Hwith(20)
H
=
∂
θ
ψ
∂
ψ
=
∂
τ
1
∂
x
∂
τ
1
∂
y
∂
τ
1
∂
z
∂
τ
2
∂
x
∂
τ
2
∂
y
∂
τ
2
∂
z
⋮
⋮
⋮
∂
τ
J
∂
x
∂
τ
J
∂
y
∂
τ
J
∂
zbeing J
×
3 Jacobian matrix. The detailed derivations of the Fisher information matrix for the target localization in FMCW radar network are given in Appendix A.


## 4.2. The Analysis of the Potential Localization Accuracy of the Multistatic and Monostatic Radar Networks

Figure2 shows contour plots of the target localization accuracy for three types of the FMCW radar networks with four Tx-Rx channels each, (i) monostatic radar network with autonomous mode of the signal reception (Figure 2(a)), (ii) multistatic radar network with cooperative mode of the signal reception (Figure 2(b)), and (iii) multistatic radar network with autonomous mode of the signal reception, where autonomous Tx-Rx pairs are depicted with dashed ellipses (Figure 2(c)). We define the localization accuracy as σ
p
o
s
=
σ
x
2
+
σ
y
2, where σ
x
2 and σ
y
2 are variances of the estimation x and y target coordinates, respectively. The operational characteristics of single FMCW radar are given in Table 1.Table 1
Simulation parameters of a single radar node.
Parameter
Value
Transmitter power
P
t
=
25 W
Transmit gain
G
(
t
)
=
3.8 dBi
Receive gain
G
(
r
)
=
3.8 dBi
Processing gain
G
p
=
512
=
27.1 dB
Carrier frequency
f
c
=
2 GHz
Sweep time
T
s
=
5
⋅
1
0
-
3 s
Number of bursts
N
B
=
512
Bandwidth
Δ
f
=
20 MHz
Receiver bandwidth
B
=
10 kHz
Noise figure
F
n
=
10 dB
Atmospheric losses
L
amt
=
0 dB
Processing losses
L
proc
=
0 dB
RF losses
L
RF
=
6 dBFigure 2
Contours of the position estimation accuracyσ
p
o
s, [
m
]. Red x-marks indicate positions of the transmit nodes; red squares indicate positions of the receive nodes.
(a)
Monostatic network with autonomous signal reception
(b)
Multistatic network with cooperative signal reception
(c)
Multistatic network with autonomous signal receptionThe presented plots show that the multistatic network with the cooperative mode of the signal reception (Figure2(b)) provides the equivalent localization accuracy to the monostatic radar network with autonomous mode of the signal reception (Figure 2(a)) but with two times less number of Tx-Rx channels. By introducing additional four radar nodes that form four autonomous Tx-Rx pairs of the multistatic radar network (Figure 2(c)), the localization accuracy increases, compared to the monostatic radar network (Figure 2(a)), because of the higher spatial diversity gain.To summarize, the multisatic radar network possesses significant advantage over the monostatic radar network in terms of the localization accuracy and the number of Tx-Rx channels. This advantage can be interpreted in two ways: either as an ability to provide higher localization accuracy with the same number of Tx and Rx channels or an ability to provide the same accuracy with less number of Tx-Rx channels. Subsequently, this allows for substantial advantages in the system cost (less number of transmitting and receiving channels) compared to the monostatic radar network.


## 4.3. Optimization of the Multistatic Radar Network Geometry

Next, the topology optimization algorithm was applied to the scenario of the target localization in FMCW radar network along the specified areas in the city of Delft (Netherlands). These areas correspond to the canal and the highway in the city (Figure3). The target radar cross section is R
C
S
=
1 m2. Parameters of the single radar node are given in Table 1. The constraint on the maximum value of localization error has been set to R
e
=
5 m with probability P
e
=
95
%. The optimization algorithm has been applied for the selection of the optimal positions for transmitting and receiving radar nodes. Two scenarios of the modeling of the candidate locations for the radar nodes were considered. In the first scenario, Tx and Rx radar grids coincide and correspond to the existing locations of GSM masts (Figure 3), the coordinates of which can be found in [26], for example. In the second scenario, the nodes of the Tx radar grid correspond to the positions of the GSM masts and the nodes of the Rx radar grid are randomly generated points with mean values that correspond to the Tx grid and the standard deviation equal to 250 m. In both scenarios, the grid points of the Tx and Rx grids represent the candidate positions for the radar nodes. The reason why we consider these two scenarios is to study the effect of the spatial diversity of the Tx and Rx radar grids on the optimization result.Figure 3
Positions of the GSM masts in the Delft area (blue dashed line indicates the surveillance areas).Figure4 shows the distribution of the localization error around the target area of interest with optimized radar network geometry for two considered scenarios in 2D plane. For the first and the second scenarios, the maximum value of the localization error around the target area is equal to 1 m and 5 m, respectively. The number of the Tx and Rx channels is less in the second scenario due to the spatial diversity of the Tx and Rx radar units, which leads to higher signal-to-noise ratio without increasing the number of Tx-Rx channels. For the first scenario, the selected radar network includes both monostatic and bistatic radars. To summarize, the positions of the Tx and Rx grids relative to each other affect the optimization result significantly. The exploitation of the spatially separated Tx and Rx grids allows for the less number of the radar nodes required to satisfy the same accuracy constraint, compared to the scenario with fully overlapping Tx-Rx radar grids.Figure 4
Contours of the position estimation accuracyσ
p
o
s, [
m
], for optimal geometries of the radar network. Red x-marks indicate positions of the transmit nodes, red squares indicate positions of the receive nodes, and cyan diamonds correspond to target areas.
(a)
Tx and Rx grids fully overlap
(b)
Tx and Rx grids do not overlap


## 5. Conclusion

In this paper, the optimization approach of the multistatic radar networks with widely separated transmit and receive antennas has been developed. We have tackled the problem of the selection of the minimum number of the radars, which provide given requirements to the target localization accuracy, in the radar networks with widely separated transmitting and receiving nodes. The sparsity-based optimization approach was adopted to solve this problem. It has been shown that the optimization of the multistatic radar network geometry implies the bilinear matrix inequality problem. We have reduced this problem into the linear matrix inequality by applying the semidefinite relaxation technique. The developed framework has been applied to the geometry optimization of the FMCW multistatic radar network for the target localization. With the numerical results, it has been shown that the optimization can be performed for fully overlapping transmitting and receiving radar grids. However, setting Tx and Rx radar grids to the nonoverlapping ones results in less number of required sites for the transmission and the reception. This is due to the fact that separated Tx and Rx radar grids allow exploring the spatial diversity gain in the process of the estimation target parameters.The proposed technique can be applied for the optimization of the radar networks that have different parameters and explore other modes of the signal reception (autonomous, cooperative, or combination of both). For example, it can be extended to the model, where the parameter vector contains other parameters, such as target velocity, or combination of different parameters, such as position and velocity vectors. Moreover, the developed framework is not limited to the estimation task; it can be applied to solve detection-driven optimization problems that arise in various types of sensors, which measure different environment parameters (temperature, pressure, humidity, etc.).



---

*Source: 9437602-2016-02-14.xml*