- Research
- Open Access
- Published:

# A new DOA-based factor graph geolocation technique for detection of unknown radio wave emitter position using the first-order Taylor series approximation

*EURASIP Journal on Wireless Communications and Networking*
**volume 2016**, Article number: 189 (2016)

## Abstract

This paper proposes a new geolocation technique to improve the accuracy of the position estimate of a single unknown (anonymous) radio wave emitter. We consider a factor graph (FG)-based geolocation technique, where the input are the samples of direction-of-arrival (DOA) measurement results sent from the sensors. It is shown that the accuracy of the DOA-based FG geolocation algorithm can be improved by introducing approximated expressions for the mean and variance of the tangent and cotangent functions based on the first-order Taylor series (TS) at the tangent factor nodes of the FG. This paper also derives a closed-form expression of the Cramer-Rao lower bound (CRLB) for DOA-based geolocation, where the number of samples is taken into account. The proposed technique does not require high computational complexity because only mean and variance are to be exchanged between the nodes in the FG. It is shown that the position estimation accuracy with the proposed technique outperforms the conventional DOA-based least square (LS) technique and that the achieved root mean square error (RMSE) is very close to the theoretical CRLB.

## Introduction

Accurate wireless geolocation has received considerable attention in the past two decades [1] and is expected to play important roles in current and future wireless communications systems. This technology is the key to supporting location-based service applications, e.g., Emergency-911 (E-911), location-sensitive billing, smart transportation systems, vehicle navigation, fraud detection, people tracking, and public safety systems [1–3]. This paper proposes a new direction-of-arrival (DOA)-based factor graph (FG) geolocation technique to detect the position of a single unknown anonymous radio wave emitter (the terminology “anonymous” is omitted in the rest of the paper for simplicity), where to convert the measured DOA samples to the mean and variance of the tangent and cotangent functions, we utilize the first-order Taylor series (TS) approximation. The proposed technique is not only applicable for an unknown radio wave emitter, e.g., illegal radio wave emitter, but it is also applicable for common radio wave emitter position detection. The basic setup is shown in Fig. 1, where the FG is performed at the fusion center.

The FG is first applied on a geolocation technique in [4]. In the FG, the complexity is reduced because the global function factors into the products of several simple local functions, and the messages passed through the nodes are in the form of mean and variance, because of the Gaussianity assumption of the measured sample distribution [5–8]. The FG technique has been extended to incorporate not only DOA [6, 7] but also other information sources such as time of arrival (TOA) [8, 9], time difference of arrival (TDOA) [10], and received signal strength (RSS) [11], since the location of the unknown radio wave emitter can be estimated from them. In this paper, we use the terminology DOA instead of angle of arrival (AOA) for better expression.

DOA is used in this paper because it is measured by using either antenna arrays or a directional antenna without requiring perfect synchronization, time stamp, or transmit power information of a single unknown radio wave emitter [12, 13]. The other FG-based techniques, in contrast to the DOA-based techniques, e.g., TOA-based techniques, should perform perfect time synchronization among the sensors as well as between the sensors and the unknown emitter. The TDOA-based techniques can eliminate the necessity of the synchronization between the sensors and the emitter, but still, the sensors have to be accurately synchronized. Perfect synchronization is needed both in TOA and TDOA because the high velocity of the light, e.g., error of 1 *μ*s, leads to error around 300 m [8]. Another difficulty arises in TOA-based geolocation techniques, where the TOA parameters cannot be measured from an unknown radio wave emitter because the time stamp information (time of departure (TOD) of the signal) of the transmitted signal from an unknown radio emitter is not available.

On the other hand, the major difficulty with the RSS-based technique is that it requires equal transmit power between the target and the test signal transmitted from the monitoring spots to gather the preliminary RSS map [11]. However, the transmit power of an unknown radio wave emitter is not available. The facts described above motivate us to use the DOA-based FG techniques to detect the position of the unknown radio emitter. The DOA-based FG techniques are also suitable in line-of-sight (LOS) and imperfect synchronization conditions.

### Related work

A lot of work in DOA-based geolocation techniques have been proposed even since 30 years ago [14, 15]. However, it is quite recently that the FG-based techniques using DOA, TOA, TDOA, and RSS information were proposed, where the measurement data related to those parameters are used as the input to the algorithms. A joint TOA-DOA-based FG geolocation algorithm was proposed in [6], where the measured samples are efficiently used in FG to estimate the position accurately. Nevertheless, the joint TOA-DOA-based FG geolocation algorithm shown in [6] is still not fully correct because the message to be exchanged, the information of measurement error derived from the measurement results, enters the FG at an improper node as identified by [8].

The FG geolocation technique derived in [6] is improved in [7] as suggested in [8]. It also removes the necessity of measuring the TOA data from the joint TOA-DOA-based FG geolocation algorithm shown in [6] to obtain a simple DOA-based FG technique. After the DOA-based FG technique reaches a convergence point, the position estimate results are used as the initial position for the Gauss-Newton (GN) algorithm as the second step of the algorithm, the so-called factor graph-Gauss-Newton (FG-GN) geolocation technique in [7], to attain even higher accuracy.

We found that (1) The distance (*r*) is used in [7] as an argument of the tangent and cotangent functions, i.e., tan(*r*) and cot(*r*), which is obviously incorrect. Instead, the angle should be the argument of the tangent and cotangent functions, i.e., tan(*θ*) and cot(*θ*). (2) The factor node for collecting the samples is not available in the DOA-based FG geolocation techniques in [6, 7]. Moreover, the input parameter in [7] is *r* instead of *θ*. (3) The mean formula of tangent and cotangent function nodes [7] is not clearly described.

The Cramer-Rao lower bound (CRLB) is derived in [7], and the results of a series of simulations conducted to evaluate the accuracy of the DOA-based FG geolocation technique are shown also in [7] for the comparison purpose between CRLB and the root mean square error (RMSE) of DOA-based geolocation techniques, i.e., FG-GN, GN, and FG. However, the CRLB of the DOA-based technique shown in [7] does not take into account the influence of the sample number, and hence, the accuracy of the detection, when the number of the samples is large, is better than the CRLB, leading to the unusefulness of the comparison.

### Contributions

In the FG-based geolocation techniques described above, each sensor performs DOA measurement and transmits samples to the fusion center. Only the mean and variance of the DOA samples are used in the FG because of the Gaussianity assumption. The FG converts the angle information to the coordinate distance, referred to as relative distance, between the target and the sensor. The message passing takes place between the factor nodes and the variable nodes in the FG to obtain the target position estimate.

This paper provides clear understanding of the DOA-based geolocation techniques using FG, where the detail explanation of how the messages are updated at each node, and how the updated messages are exchanged between the nodes. The primary objectives of this paper are as follows: (A) We introduce a new set of formulas to be calculated at the tangent and cotangent factor nodes, to better approximate the mean and variance of the function values by utilizing the first-order TS expansion of the functions, so that the Gaussianity assumption still holds. (B) We derive the CRLB of the DOA-based geolocation technique taking into account the number of samples; hence, the accuracy of the new CRLB obtained by this paper is higher than that shown in [7]. (C) The results of a series of simulations are presented to evaluate the convergence property of the proposed technique, where the trajectory of the iterative estimation process is presented. Comparison between the RMSE of the proposed technique and the new CRLB is also provided. It is shown that the proposed algorithm can achieve close-CRLB accuracy, where the number of the samples, the number of the sensors, and the standard deviation of measurement error are used as a parameter.

The GN technique requires good initial position before it starts the iteration, while the proposed technique can start at any initial point. Therefore, it is not required to make a comparison between our proposed technique and the GN technique because we start the iteration from any arbitrary points. Also, since the detailed description of the algorithm for the DOA-based FG geolocation techniques presented in [6, 7] have improper expression as mentioned above in Section 1.1, this paper does not compare the accuracy of the proposed technique with that of [6] and [7]. Instead, the accuracy comparison is between the proposed technique and the DOA-based least square (LS) geolocation [16]. The FG we propose in this paper includes the DOA *measurement factor node*
*D*
_{
θ
} and *angle variable node*
*N*
_{
θ
}, as shown in Fig. 2, as in [8]. The two new nodes are proposed to emphasize that we need to calculate the mean and variance of DOA samples. It should be noted here that it is impossible to calculate variance with only one sample. It is also shown in this paper that with the proposed technique, the accuracy of the target position estimation outperforms the conventional DOA-based LS geolocation technique and the results are also very close to theoretical CRLB for the DOA-based geolocation.

## System model

In general, the FG consists of the factor and variable nodes. In Fig. 2, the factor node is shown by a square, while the variable node by a circle. The factor node updates the messages forwarded from the connected variable nodes by using the specific simple local function, and the result is passed to the destination variable node. During the iteration, the messages sent from the source factor nodes are further combined in the variable node and passed back to the destination factor node for the next round of iteration. At the final iteration, the variable node combines the messages from all the connected factor nodes by using the sum-product algorithm.

Assume that the unknown radio wave emitter is located at coordinate position **x**= [ *x*
*y*]^{T}, where *T* is the transpose function. Sensors are located at position **X**
_{
i
}= [ *X*
_{
i
}
*Y*
_{
i
}]^{T}, where *i*, *i*={1,2,…,*N*}, is the sensor index. The orientation of the sensors is known to ensure that the sensors measure the angle with respect to the global coordinate system. The sensor to fusion center transmission is perfect via wired or wireless connections. \(\mathbf {\Delta x}_{\theta _{i}}=\ [\!\Delta y_{\theta _{i}} \,\,\Delta x_{\theta _{i}}]^{T}\) is the relative distance between the position (*X*
_{
i
},*Y*
_{
i
}) and target position (*x*,*y*), given by

with the *θ*
_{
i
} being the true DOA; however, the measured samples are corrupted by error due to the spatial spread of the multipath component and impairments in measurement. The DOA measurement equation is then given by

where *k* is the sample index. For notation simplicity, the sensor index *i* is omitted from the equations common to all the sensors, while it is included when needed, in the rest of the paper. It is reasonable to assume that *n*
_{
k
} is independent identically distributed (i.i.d.) zero-mean Gaussian random variable. The Gaussianity assumption is used in this paper because of the accumulative effects of many independent factors, as in [6–8, 10, 11]; hence, the assumption is reasonable for many of the wireless parameter measurement-based techniques such as DOA, TOA [8], TDOA [10], and RSS-based FG technique [11]. Furthermore, it can simplify the total computational complexity. This Gaussianity assumption is also used for the TOA/DOA-based FG technique in [6] and the DOA-based FG technique in [7]. This paper also uses the same assumption. Then, \(\hat {\theta }\) follows a normal distribution \(\mathcal {N}(\theta,\sigma ^{2})\) having a probability density function \(p(\hat {\theta)}\) as

where the sample index is also omitted from the expression. However, each sensor does not know the needed values of *θ* and *σ*
_{
θ
}. Hence, each sensor in the proposed DOA-based TS FG geolocation technique first calculates the mean \(m_{D_{\theta } \rightarrow N_{\theta }}\) and the variance \(\sigma ^{2}_{D_{\theta } \rightarrow N_{\theta }}\) from the *K*-measured samples. The mark “ →” in the suffix indicates the message flow directions in the FG.

The node *D*
_{
θ
} forwards the messages \((m_{D_{\theta } \rightarrow N_{\theta }}, \sigma _{D_{\theta } \rightarrow N_{\theta }}^{2})\) to the *N*
_{
θ
}, and then, the messages \((m_{N_{\theta }\rightarrow C_{\theta }}, \sigma _{N_{\theta }\rightarrow C_{\theta }}^{2})\) are directly forwarded to the *tangent factor node*
*C*
_{
θ
}, where \(m_{N_{\theta }\rightarrow C_{\theta }}=m_{D_{\theta }\rightarrow N_{\theta }}\) and \(\sigma _{N_{\theta }\rightarrow C_{\theta }}^{2}=\sigma _{D_{\theta } \rightarrow N_{\theta }}^{2}\). The angle messages \((m_{N_{\theta } \rightarrow C_{\theta }}, \sigma _{N_{\theta } \rightarrow C_{\theta }}^{2})\) are converted to the relative distance messages \((m_{C_{\theta } \rightarrow \Delta x_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta x_{\theta }}^{2})\) and \((m_{C_{\theta } \rightarrow \Delta y_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta y_{\theta }}^{2})\) in the node *C*
_{
θ
}. The relative distance in (1) in the (*X*,*Y*) coordinate and the true DOA *θ* are connected by the tangent and cotangent functions, as [6, 7]

Even though (3) and (4) are self-referenced point equations, which can be solved by iterative techniques, the iteration needs proper initialization of the mean and variance of the argument variables \(\Delta \hat {x}_{\theta }\) and \(\Delta \hat {y}_{\theta }\) which are corresponding to \(\hat {x}\) and \(\hat {y}\) by (1) and (2), where the detail of initializations are described in Section 5. We do not know the true values of *θ*, *Δ*
*x*
_{
θ
}, *Δ*
*y*
_{
θ
}, *x*, and *y*; however, the message needed in the FG is the mean and variance of samples \(\hat {\theta }\), \(\Delta x_{\hat {\theta }}\), \(\Delta y_{\hat {\theta }}\), \(\hat {x}\), and \(\hat {y}\), which can be produced from the angle messages in the form of the mean and variance of samples \(\hat {\theta }\), \((m_{D_{\theta } \rightarrow N_{\theta }}, \sigma ^{2}_{D_{\theta } \rightarrow N_{\theta }})\). The details of the entire process are described in next section.

## The proposed technique

The messages corresponding to *Δ*
*y*
_{
θ
} and *Δ*
*x*
_{
θ
} of (3) and (4), respectively, are the mean and variance, i.e., \((m_{C_{\theta } \rightarrow \Delta x_{\theta }},\sigma _{C_{\theta }\rightarrow \Delta x_{\theta }}^{2})\) and \((m_{C_{\theta } \rightarrow \Delta y_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta y_{\theta }}^{2})\), where \(m_{C_{\theta } \rightarrow \Delta x_{\theta }}\) and \(m_{C_{\theta } \rightarrow \Delta y_{\theta }}\) are the means of \(\Delta x_{\hat {\theta }}\) and \(\Delta y_{\hat {\theta }}\), respectively; \(\sigma _{C_{\theta } \rightarrow \Delta x_{\theta }}^{2}\) and \(\sigma _{C_{\theta } \rightarrow \Delta y_{\theta }}^{2}\) are the variances of \(\Delta x_{\hat {\theta }}\) and \(\Delta y_{\hat {\theta }}\), respectively. We derive the messages for (3) and (4), based on the formula for the product of two independent random variables (*a*·*b*) as [17]

where *m*
_{
x
} and \({\sigma ^{2}_{x}}\), *x*∈{*a*,*b*,*a*·*b*} are the mean and variance of *x*, respectively. It should be noticed from (3)–(6) that the means and variances of \(\tan (\hat {\theta })\) and \(\cot (\hat {\theta })\), \(m_{\tan (\hat {\theta })}\) and \(\sigma ^{2}_{\tan (\hat {\theta })}\), \(m_{\cot (\hat {\theta })}\) and \(\sigma ^{2}_{\cot (\hat {\theta })}\), respectively, are required. However, there arises a problem because \(\tan (\hat {\theta })\) and \(\cot (\hat {\theta })\) in (4) and (3) are both nonlinear functions that violates the Gaussianity assumption to express the messages only by the mean and variance in the FG. This motivates us to use the first-order TS to derive linear approximation of the tangent and cotangent functions to obtain the messages corresponding to the relative distance, as \((m_{C_{\theta } \rightarrow \Delta x_{\theta }},\sigma _{C_{\theta }\rightarrow \Delta x_{\theta }}^{2})\) and \((m_{C_{\theta } \rightarrow \Delta y_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta y_{\theta }}^{2})\). The detailed derivation is described below.

The first-order TS is expressed as [18]

where \(f(\hat {\theta })\) is either \(\tan (\hat {\theta })\) or \(\cot (\hat {\theta })\), \(\hat {\theta }\) is the DOA sample, \(m_{\hat {\theta }}\) is the mean of \(\hat {\theta }\), \(f(m_{\hat {\theta }})\) is either the \(\tan (m_{\hat {\theta }})\) or \(\cot (m_{\hat {\theta }})\), and \(f'(m_{\hat {\theta }})\) is the first derivative of \(f(m_{\hat {\theta }})\). It should be noticed that (7) is a linear approximation for function of \(\hat {\theta }\), and hence, it is found that \(f(\hat {\theta })\) can be approximated by a Gaussian variable. The mean \(m_{f(\hat {\theta })}\) and variance \(\sigma ^{2}_{f(\hat {\theta })}\) can then be approximated using (7) as [18]

where \(\sigma ^{2}_{\hat {\theta }}\) is the variance of \(\hat {\theta }\). The mean and variance of \(\tan (\hat {\theta })\) and \(\cot (\hat {\theta })\) are obtained from (8) and (9), respectively, as

Equations (11) and (13) provide our proposed algorithm with accurate enough approximation over a relatively large value range of the angles except for the mean of the angles around 0 radiant. This exception is because cot(0) and csc(0) are infinity. Hence, we can solve the infinity problem by empirically setting a limit value of *m*
_{
θ
}. We found that \(m_{\hat {\theta }}\geq |0.1|\) in units of radiant is reasonable. By setting the limit value properly, unstable behavior of the algorithm can be avoided. Theoretically, we also require to set a limit value of \(m_{\hat {\theta }}\) for (10) and (12), (11) and (13) to avoid the infinity values for the angles around {*π*/2,3*π*/2}, {2*π*} radiants, respectively.

The node *C*
_{
θ
} calculates relative distance messages, \((m_{C_{\theta } \rightarrow \Delta x_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta x_{\theta }}^{2})\) and \((m_{C_{\theta } \rightarrow \Delta y_{\theta }},\sigma _{C_{\theta } \rightarrow \Delta x_{\theta }}^{2})\), according to (3)–(6) and (10)–(13), as

The node *C*
_{
θ
} forwards the messages \((m_{C_{\theta } \rightarrow \Delta x_{\theta }}, \sigma ^{2}_{C_{\theta } \rightarrow \Delta x_{\theta }})\) obtained from (15) and (17) to the *relative distance variable node*
*Δ*
*x*
_{
θ
} for the *X*-coordinate, while the messages \((m_{C_{\theta } \rightarrow \Delta y_{\theta }}, \sigma ^{2}_{C_{\theta } \rightarrow \Delta y_{\theta }})\) obtained from (14) and (16) are forwarded to the *relative distance variable node*
*Δ*
*y*
_{
θ
} for the *Y*-coordinate. The variable node *Δ*
*x*
_{
θ
} directly forwards the messages \((m_{\Delta x_{\theta } \rightarrow A_{\theta }}, \sigma ^{2}_{\Delta x_{\theta } \rightarrow A_{\theta }})\) to the *relative distance factor node*
*A*
_{
θ
}, where \((m_{\Delta x_{\theta } \rightarrow A_{\theta }}, \sigma ^{2}_{\Delta x_{\theta } \rightarrow A_{\theta }})=(m_{C_{\theta } \rightarrow \Delta x_{\theta }}, \sigma ^{2}_{C_{\theta } \rightarrow \Delta x_{\theta }})\). The node *Δ*
*y*
_{
θ
} forwards the messages \((m_{\Delta y_{\theta } \rightarrow B_{\theta }}, \sigma ^{2}_{\Delta y_{\theta } \rightarrow B_{\theta }})\) to the *relative distance factor node*
*B*
_{
θ
}, where \((m_{\Delta y_{\theta } \rightarrow B_{\theta }}, \sigma ^{2}_{\Delta y_{\theta } \rightarrow B_{\theta }})=(m_{C_{\theta } \rightarrow \Delta y_{\theta }}, \sigma ^{2}_{C_{\theta } \rightarrow \Delta y_{\theta }})\).

The messages in the nodes *A*
_{
θ
} and *B*
_{
θ
} are finally converted to the coordinate variable node, as[6–8]

As shown in Fig. 2, the messages of (20) and (21), \((m_{A_{\theta } \rightarrow x},\sigma ^{2}_{A_{\theta } \rightarrow x})\) and \((m_{B_{\theta } \rightarrow y},\sigma ^{2}_{B_{\theta } \rightarrow y})\), produced by the nodes *A*
_{
θ
} and *B*
_{
θ
}, respectively, are forwarded to the *estimated target position variable nodes*
*x* and *y*. According to the message-passing principle, now the reverse process is invoked. Recall that we omitted the sensor index in the equations; however, to derive the messages sent from the variable nodes *x* and *y*, the sensor index has to be introduced. All the messages coming from the nodes \(A_{\theta _{j}}, j=\{1,...,N\}\), except for the message sent back to the node \(A_{\theta _{i}}\), *i*≠*j*, are used in the node *x*. It can be easily found by invoking the fact that the products of multiple Gaussian pdfs having different means and variances are proportional to the Gaussian pdf; the messages sent back from the variable node *x* to the factor node \(A_{\theta _{i}}\) are given by \((m_{x \rightarrow A_{\theta _{i}}},\sigma ^{2}_{x \rightarrow A_{\theta _{i}}})\) as [5–8]

where *i* and *j* are the sensor indexes. The messages \((m_{y \rightarrow B_{\theta _{i}}},\sigma ^{2}_{y \rightarrow B_{\theta _{i}}})\) can be obtained in the same way as \((m_{x \rightarrow A_{\theta _{i}} }, \sigma ^{2}_{x \rightarrow A_{\theta _{i}}})\) calculated by (22) and (23).

The messages \((m_{x \rightarrow A_{\theta _{i}}},\sigma ^{2}_{x \rightarrow A_{\theta _{i}}})\) of (22) and (23) sent to the node \(A_{\theta _{i}}\) are used by (18) to calculate the messages \((m_{A_{\theta _{i}} \rightarrow \Delta x_{\theta _{i}}},\sigma ^{2}_{A_{\theta _{i}} \rightarrow \Delta x_{\theta _{i}}})\), and in the same way, the messages \((m_{B_{\theta _{i}} \rightarrow \Delta y_{\theta _{i}}},\sigma ^{2}_{B_{\theta _{i}} \rightarrow \Delta y_{\theta _{i}}})\) are calculated by (19) using \((m_{y \rightarrow B_{\theta _{i}}}\), \(\sigma ^{2}_{y \rightarrow B_{\theta _{i}}})\). The messages \((m_{A_{\theta _{i}}\rightarrow \Delta x_{\theta _{i}}},\sigma ^{2}_{A_{\theta _{i}}\rightarrow \Delta x_{\theta _{i}}})\) of (18) are forwarded from the node \(A_{\theta _{i}}\) to the node \(\Delta x_{\theta _{i}}\), and then, the messages \((m_{\Delta x_{\theta _{i}} \rightarrow C_{\theta _{i}}},\sigma ^{2}_{\Delta x_{\theta _{i}} \rightarrow C_{\theta _{i}}})\) are directly forwarded to the node \(C_{\theta _{i}}\), where \((m_{\Delta x_{\theta _{i}} \rightarrow C_{\theta _{i}}},\sigma ^{2}_{\Delta x_{\theta _{i}} \rightarrow C_{\theta _{i}}})=(m_{A_{\theta _{i}}\rightarrow \Delta x_{\theta _{i}}},\sigma ^{2}_{A_{\theta _{i}}\rightarrow \Delta x_{\theta _{i}}})\). The messages \((m_{B_{\theta _{i}}\rightarrow \Delta y_{\theta _{i}}},\sigma ^{2}_{B_{\theta _{i}}\rightarrow \Delta y_{\theta _{i}}})\) of (19) are forwarded from the node \(B_{\theta _{i}}\) to the node \(\Delta y_{\theta _{i}}\), and then, the messages \((m_{\Delta y_{\theta _{i}} \rightarrow C_{\theta _{i}}},\sigma ^{2}_{\Delta y_{\theta _{i}} \rightarrow C_{\theta _{i}}}) \) are forwarded to the node \(C_{\theta _{i}}\), where \((m_{\Delta y_{\theta _{i}} \rightarrow C_{\theta _{i}}},\sigma ^{2}_{\Delta y_{\theta _{i}} \rightarrow C_{\theta _{i}}}) =(m_{B_{\theta _{i}}\rightarrow \Delta y_{\theta _{i}}},\sigma ^{2}_{B_{\theta _{i}}\rightarrow \Delta y_{\theta _{i}}})\). The entire process is repeated iteratively. When the iteration converges or maximum iteration is reached, all messages from the nodes \(A_{\theta _{i}}\) and \(B_{\theta _{i}}\) are combined in the nodes *x* and *y* as [5–8]

Finally, the estimated coordinate position (*x*,*y*) of the unknown radio wave emitter is determined by (*m*
_{
x
},*m*
_{
y
}). To provide more comprehensive understanding, we summarize all equations operating at each node of the FG in Table 1, where the directions of the message flow is shown in the left column.

## CRLB derivation for DOA-based geolocation

This section derives the CRLB for DOA-based geolocation, taking into account the number of samples. The CRLB for DOA-based geolocation is presented in [7]; however, it does not take into account the effect of number of samples. The likelihood for *K* i.i.d. samples \(\hat {\theta }_{k},\;k=\{1,2,\ldots,K\},\) following the Gaussian distribution, is presented in [19], as

where \({\theta }=\arctan \left (\frac {Y_{i}-y}{X_{i}-x}\right)\). Here, the sensor index *i* is omitted again for simplicity. After several mathematical manipulations, as described in the Appendix, the closed form of the second-order derivative of log-likelihood function (LLF) is expressed as [19]

The closed-form CRLB for DOA-based geolocation technique which takes into account the number of samples is found to be

where \(\Sigma _{\theta }=\sigma ^{2}_{\theta } \mathbf {I}_{N}\) denotes Gaussian covariance, **I**
_{
N
} denotes an *N*×*N* identity matrix, and \(\mathbf {J}=\frac {\partial \mathbf {\theta }}{\partial \mathbf {x}}\) denotes Jacobian matrix given by

with the *r*
_{
i
} denotes the Euclidean distance between the target and sensors.

## Simulation results

The performance of the proposed technique was verified via computer simulations, where the simulation round consists of 1000 single-target locations randomly chosen from the area of 1000×1000 m^{2}, where each target location is tested in 100 trials. It should be noted here that the scope in this paper is to estimate only one target position. The case of unknown multiple-target detection is left for future work. It is assumed that the illegal radio, as an example of unknown radio emitter, emits the radio wave with strong enough transmit power covering the area of 1000×1000 m^{2}. The values of the measurement error were *σ*
_{
θ
}={1°,5°,10°,15°,⋯,45°}. It was assumed that the simulation does not contain outliers in angular measurement.

It may be difficult to *achieve* the LOS condition in areas with a size of 1000 × 1000 m^{2} especially in (sub)urban environments. However, instead, we can include the error due to the non-LOS components to the variance of the measurement error as shown in [20, 21], where the variances are different between the sensors. For simplicity, we assume that the variance \(\sigma _{\theta }^{2}\) of the measurement error is common to all sensors as in [6–8, 10, 11]. It is rather straightforward to derive the algorithm where each sensor has different values of variances. In fact, in our simulation setup, the area size is much smaller than that used in other references, for example, the TOA-based FG in [[8], TOA/DOA-based FG in [6], DOA-based FG in [7], and TDOA-based FG in [10], where they consider a hexagonal area with a radius of 5 km. Furthermore, as found in the simulation results, the estimation accuracy is quite high even with relatively large variance, e.g., with standard deviation *σ*
_{
θ
}=45°. This indicates that the assumption for the impact of the non-LOS components being represented by the measurement error variance is reasonable.

As shown in Fig. 3, six sensors were assumed in total, indicated by the *Δ* mark. The positions of the sensors in the simulation were limited to certain positions making a *sensing area* with three and five sensors at {(100,0),(1100,0), (600,−1000)} m and {(100,0), (1100,0), (600,−500), (100,−1000), (1100,−1100)} m, respectively. As described above, the target positions are randomly chosen inside the sensing 1000×1000 m^{2} area to evaluate the effectiveness of the proposed technique.

The accuracy of the proposed technique was evaluated by using the following parameters: (a) three to five sensors taken from the total of six sensors, (b) 25 to 1000 samples, and (c) 10 times of iterations for each trial. The initialization point is set at (0,0) for \(m_{x \rightarrow A_{\theta }}\) and \(m_{y \rightarrow B_{\theta }}\) and at (1,1) for \(\sigma ^{2}_{x \rightarrow A_{\theta }}\) and \(\sigma ^{2}_{y \rightarrow B_{\theta }}\). It should be noted that the initialization point can be set arbitrarily inside the area of the expected target detection. Regardless of the target positions (1000 points tested), with the initialization of mean and variance being set at (0,0) and (1,1), respectively, the final estimate of the target position is quite accurate. Conversely, this observation should be understood in a way that the estimation result is less sensitive to the initial values.

To demonstrate the convergence property of the proposed technique, the trajectory of a detection trail is shown in Fig. 4. It shows clearly that the target position estimate successfully reaches the true target position at (*x*,*y*)=(444,−746) m in 10 iterations, where the iteration process is started from the initial point (0,0) m. The estimate target position is calculated in each iteration by using (26) and (27). It should be noticed that only with seven iterations, the position estimate of the proposed technique reaches a point close to the true target position by using three sensors.

Figure 5 shows the RMSE versus the iteration times with the standard deviation *σ*
_{
θ
} of the measurement error as a parameter. The RMSE of the proposed technique converges after nine iterations for *σ*
_{
θ
}=1°, while it converges after five iterations for *σ*
_{
θ
}=20° and *σ*
_{
θ
}=45° as shown in Fig. 5. Hence, the iteration converges faster with a higher standard deviation of the measurement error because lower *σ*
_{
θ
} needs more times to achieve better accuracy. Although the RMSE with *σ*
_{
θ
}=1° is worse with less than five iterations, the RMSE with smaller *σ*
_{
θ
} is lower when the iterations converges.

To make a comparison of the accuracy of the proposed technique to the conventional DOA-based LS technique in [16], we conducted another series of the conventional DOA-based LS algorithm [16] in summarized below

where

with \((m_{x_{\text{{LS}}}}, m_{y_{\text{{LS}}}})\) being the target position estimate. The RMSEs achieved by the proposed and the conventional DOA-based LS techniques are then compared with the CRLB. In each round of simulations, both techniques used the same parameter values as described before.

Figure 6 shows that the RMSE versus the standard deviation *σ*
_{
θ
} of the measurement error with the number of sensors as a parameter. It is found that the more sensors, the smaller the RMSE. Figure 7 shows the number of the sensors versus the RMSE with the standard deviation *σ*
_{
θ
} of the measurement error as a parameter. It is found from the figure that there is a clear difference in the tendency of the RMSE between the proposed technique and the conventional DOA-based LS technique. With the conventional DOA-based LS technique, the RMSE with three sensors yields better performance than that of with four sensors for *σ*
_{
θ
}=1°, and the RMSE with five sensors is almost the same as that with four sensors. This indicates that since the LS equation is overdetermined with more than three sensors, the LS error is the dominant factor with *σ*
_{
θ
}=1°. When *σ*
_{
θ
}={20°, 45°}, on the other hand, the measurement error is the dominating factor, and hence, the achieved RMSEs with three, four, and five sensors are almost the same. This may be because the measurement error dominates the accuracy over the error due to the overdetermination.

In contrast to this observation, the RMSE decreases by increasing the sensor number for *σ*
_{
θ
}={1°, 20°, and 45°} with the proposed technique, and such tendency is consistent to the CRLB. It can be concluded that the geolocation accuracy in terms of RMSE with the proposed technique outperforms the reference conventional DOA-based LS technique.

Figure 8 shows the effect of the number of samples to the accuracy of DOA-based geolocation techniques with *σ*
_{
θ
} as a parameter. The RMSE of both the proposed and reference techniques[16] as well as the CRLB for the DOA-based geolocation decreases when more samples are used. It is shown in Fig. 8 that with RMSE 24 m, the proposed technique requires around 525 samples, while the conventional technique requires around 630 samples. The accuracy of the proposed technique always outperforms the reference technique with the same number of samples used. Obviously, by increasing the number of samples, the gap to the CRLB decreases with both the proposed and reference techniques. It is also found from the figure that the smaller the measurement error, the smaller the gap to the CRLB. The gap with different *σ*
_{
θ
} values decreases when the number of samples increases.

## Conclusions

We have proposed a new FG-based geolocation technique using DOA information for a single unknown (anonymous) radio emitter with accuracy improvement of the position estimate. We have derived a set of new approximated expression for the mean and variance of the tangent and cotangent functions based on the first-order TS to hold the Gaussianity assumption. We have also derived a closed-form expression of the CRLB for DOA-based techniques taking into account the influence of the number of samples. The simulation results confirmed that our proposed technique provides (a) better accurate position estimate with the number of samples, number of sensors, and standard deviation of measurement error as parameters, (b) fast convergence, and (c) keep low computational complexity, which are suitable for the future geolocation techniques requiring high accuracy and low complexity in an imperfect synchronization condition. The development of DOA-based TS FG technique for multiple-target detection is left as future work.

## Appendix: CRLB derivations for DOA-based geolocation

The sensor index *i* is omitted in this derivation for simplicity. By taking the expectation of (28), we have

Since

as shown in [19]

The Fisher information matrix (FIM) [19, 22, 23]

is found to

Substituting (35) into (37) yields

Now, we replace *θ* by a vector *θ*=(*θ*
_{1},…,*θ*
_{
N
}). Then, the variance \((\sigma _{\theta }^{2})\) is replaced by the Gaussian covariance matrix *Σ*
_{
θ
}, as

Finally, by substituting (39) into the CRLB expression (29), as in [7, 10, 19], we obtain the CRLB for a DOA-based geolocation technique that takes into account the measured number of samples *K*, as

## References

- 1
J James, J Caffery, GL Stuber, Overview of radiolocation in CDMA cellular systems. IEEE Commun. Mag.

**36**(4), 38–45 (1998). - 2
K Pahlavan, X Li, J-P Makela, Indoor geolocation science and technology. IEEE Commun. Mag.

**40:**, 112–118 (2002). - 3
Y Zhao, Standardization of mobile phone positioning for 3G systems. IEEE Commun. Mag.

**40:**, 108–116 (2002). - 4
J-C Chen, C-S Maa, J-T Chen, in

*Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) 2003*, 2. Factor graphs for mobile position location, (2003), pp. 393–396. - 5
FR Kschischang, BJ Frey, H-A Loeliger, Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory.

**47**(2), 498–519 (2001). - 6
J-C Chen, P Ting, C-S Maa, J-T Chen, in

*IEEE VTC 2004*, 5. Wireless geolocation with TOA/AOA measurements using factor graph and sum-product algorithm, (2004), pp. 3526–3529. - 7
B Omidali, SA-AB Shirazi, in

*14th International CSI Computer Conference (CSICC 2009)*. Performance improvement of AOA positioning using a two-step plan based on factor graphs and the Gauss-Newton method, (2009), pp. 305–309. - 8
J-C Chen, Y-C Wang, C-S Maa, J-T Chen, Network side mobile position location using factor graphs. IEEE Trans. Wireless Comm.

**5**(10), 2696–2704 (2006). - 9
J-C Chen, C-S Maa, J-T Chen, Mobile position location using factor graphs. IEEE Commun. Lett.

**7:**, 431–433 (2003). - 10
C Mensing, S Plass, Positioning based on factor graphs. EURASIP J. Adv. Signal Process.

**2007**(ID 41348), 1–11 (2007). - 11
C-T Huang, C-H Wu, Y-N Lee, J-T Chen, A novel indoor RSS-based position location algorithm using factor graphs. IEEE Trans. on Wireless Comm.

**8**(6), 3050–3058 (2009). - 12
G Giorgetti, A Cidronali, SKS Gupta, G Manes, Single-anchor indoor localization using a switched-beam antenna. Commun. Letters, IEEE.

**13**(1), 58–60 (2009). - 13
J Wang, J Chen, D Cabric, Cramer-Rao bounds for joint RSS/DOA-based primary-user localization in cognitive radio networks. IEEE Trans. Wireless Commun.

**12**(3), 1363–1375 (2013). - 14
DG Gregoire, GB Singletary, in

*Aerospace and Electronics Conference, 1989. NAECON 1989., Proceedings of the IEEE 1989 National*. Advanced ESM AOA and location techniques, (1989), pp. 917–9242. - 15
SZ Kang, Z Ming, in

*Aerospace and Electronics Conference, 1988. NAECON 1988., Proceedings of the IEEE 1988 National*. Passive location and tracking using DOA and TOA measurements of single nonmaneuvering observer, (1988), pp. 340–3441. - 16
P Kulakowski, J Vales-Alonsob, E Egea-Lopez, W Ludwin, J Garcá-Haro, Angle-of-arrival localization based on antenna arrays for wireless sensor networks. Comput. Electr. Eng.

**36:**, 1181–1186 (2010). - 17
N O’Donoughue, JMF Moura, On the product of independent complex Gaussians. IEEE Trans. Signal Process.

**60**(3), 1050–1063 (2012). - 18
G Casella, RL Berger,

*Statistical inference*, 2nd edn., (Duxbury, 2002). - 19
SM Kay,

*Fundamentals of statistical signal processing: estimation theory*(Prentice Hall, 1993). - 20
H-L Jhi, J-C Chen, C-H Lin, A factor-graph-based TOA location estimator. IEEE Commun. Mag.

**11**(5), 1764–1773 (2012). - 21
MP Wylie, J Holtzman, The non-line of sight problem in mobile location estimation. IEEE Trans. Signal Process, 827–831 (1996).

- 22
C Gentile, N Alsindi, R Raulefs, C Teolis,

*Geolocation techniques, principles and applications*(Springer, New York, 2013). - 23
G Mao, B Fidan,

*Localization algorithms and strategies for wireless sensor networks: monitoring and surveillance techniques for target tracking*(IGI Global, New York, 2009).

## Acknowledgements

This research is supported, in part, by Koden Electronics Co., Ltd., and in part by the Doctor Research Fellow (DRF) Program of Japan Advanced Institute of Science and Technology (JAIST).

### Authors’ contributions

MRKA conceived and designed the research work, expanded and improved the algorithms for more potential applications, conducted computer simulations, acquired and analyzed data, and critically revised the manuscript. KA conceived and designed the research work, developed the base of algorithm for geolocation, analyzed data, and critically revised the manuscript. TM conceived and designed the research work, performed verification of the algorithm, analyzed data, and critically revised the manuscript. All authors read and approved the final manuscript.

### Competing interests

The authors declare that they have no competing interests.

## Author information

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## About this article

### Cite this article

Kahar Aziz, M.R., Anwar, K. & Matsumoto, T. A new DOA-based factor graph geolocation technique for detection of unknown radio wave emitter position using the first-order Taylor series approximation.
*J Wireless Com Network* **2016, **189 (2016). https://doi.org/10.1186/s13638-016-0683-4

Received:

Accepted:

Published:

### Keywords

- CRLB
- DOA
- Factor graphs
- Geolocation
- Taylor series