Abstract

This paper focuses on target localization problem in a multistation redundancy system which finds broad applications in sonar, radar, and location-based service. Previous solutions can only be applied to the minimum system, such as the TOA method with three sensors and the AOA method with two sensors or need matrix inversion. To solve this problem, we propose a simple closed-form solution for a multistation redundancy localization system by using the estimation variance as the weighting coefficient to compute an average of each group’s localization result. The proposed method, with simple algebraic solution, requires no matrix inversion and can be used for low-cost hardware devices. We derive the method in TOA solution and AOA solution, respectively. The proposed method can also be extended to other locating technologies. Numerical examples are provided to illustrate the performance of the proposed method in root-mean-square error. The positioning accuracy of the proposed method is close to Cramér-Rao low bound both in TOA solution and AOA solution.

1. Introduction

Target localization has a wide range of applications in sonar, radar, and location-based service [1]. It is often of concern for many scholars to enhance the localization accuracy and make the localization algorithm widely applicable to all kinds of situations [2]. A large variety of range-based localization methods have been proposed with respect to a set of sensors with known positions [3, 4]. Several range-based geolocation techniques have been used to estimate the target position including the time-of-arrival (TOA) [57], the time-difference-of-arrival (TDOA) [8, 9], the angle-of-arrival (AOA) [1012], the received signal strength (RSS) [1316] based techniques, or hybrid location techniques [17, 18]. Among these location techniques, TOA and AOA have attracted much attention because of their high positioning accuracy [16, 18]. This paper focuses on TOA and AOA location techniques.

There are algebraic method and matrix method for the multistation localization system [5]. Algebraic methods mainly include the TOA method [19] which uses the circles produced by range measurements at other sensors to find the position of the transmitter at the intersection of circles in two dimensions or spheres in three dimensions and the AOA method [10] which calculates the target position from the point of intersection of bearing lines. It should be noted that algebraic methods are designed for the minimum location system, such as the TOA method with three anchor sensors, and the AOA method with two anchor sensors. The main advantage of algebraic methods is that they can provide a simple algebraic solution without the computation of matrix inversion which makes those methods can be applied in a low-cost location system especially for wireless sensor networks (WSNs) [5, 20]. Since the algebraic methods are based on local information of a minimum system, the direct extension for those methods to a multistation redundancy system may not obtain optimal performance since those solutions cannot make use of extra measurements to improve position accuracy [8].

To improve the localization accuracy, matrix methods [5, 6, 8, 11, 2125] based on global information of measurements from all sensors were developed for a multistation redundancy system. The closed-form solution which requires solving a set of linear equations including all the measurements was given by Friedlander [21]. In order to obtain optimal estimation, Foy proposed an iterative localization method [26] based on Taylor series expansion. It starts with an initial guess and improves the estimate at each step by determining the local linear least-squares (LS) solution. Moreover, a proportion of solutions concentrates on transforming the localization problem into a manageable form. The LS method [6] based on TOA measurements is provided by Caffery. It uses the least square procedure to solve geometric equations which represent the lines of positions. Chan’s method [8], using a two-step weighted LS approach, provides higher accuracy which is close to CRLB when the number of sensors is greater than 3. Since the above matrix methods are based on global information and consider the relationships among all of measurements, they have better performance than the algebraic method and may achieve the CRLB. Unfortunately, the high computational burden caused by matrix inversion makes it hard for matrix methods to be applied for a low-cost location system such as WSNs with several Mhz oscillators [20, 27].

It is necessary to develop a location scheme with high positioning accuracy for a low-cost location system. In this paper, a novel and efficient estimator is designed for a low-cost location system. The proposed method first divides all of anchor sensors into several groups. Each group is a minimum location system and can provide a position estimate using an algebraic method. Subsequently, theoretical variances of position estimates for every group are derived and are used as weights to obtain the final solution. The proposed method utilizes groups to avoid matrix inversion and uses theoretical variances as weights to improve the system performance. In this paper, the proposed method is applied in TOA and AOA location techniques. Moreover, the theoretical variance of the proposed method is also derived for performance analysis. Simulation results verify the proposed method. Compared with current studies, the proposed method not only provides a simple algebraic solution without matrix inversion but also has the similar performance with the matrix method.

To illustrate, the paper is organized as follows. Section 2 formulates the system model of the localization problem in a multistation redundancy system using TOA measurements and AOA measurements in a 2-D plane, respectively. The previous method is described and analyzed. Section 3 presents the proposed method in TOA solution and AOA solution, respectively. The performance of the proposed method is analyzed by deriving the theoretical estimate variance in Section 4. Simulation results are presented in Section 5 to illustrate the localization accuracy compared with CRLB and other methods. Section 6 concludes this paper.

2. Problem Formulation

The target localization problem in a multistation redundancy system which contains anchor sensors is depicted in Figure 1. For notational convenience and ease of illustration, we model the problem in a 2-D plane. Extension to three dimensions is straightforward. Assume that anchor sensors are located at known positions and the unknown target position is . The objective of the target localization is to identify the target location from the known observers’ positions and the measurements, such as TOAs and AOAs.

Assume that TOA and AOA measurements have already been measured as shown in Figure 1. The measured distance between the target and th sensor is and the estimation of azimuth for the target is . Then, we can use these measurements to establish TOA equations [28] and AOA equations [10]

Let , and . So that (1) can be written as which is a set of linear equations with unknowns , , and . From (2) we can obtain

Since TOA and AOA measurements have error, which consists of the true measurements corrupted by additive independent zero-mean Gaussian noise. So with TOA and AOA noise, the error vector [11, 28] derived from (3) and (4) is where in TOA case, in AOA case.

Most of the previous methods [5, 6, 8, 11, 23, 25] are based on the least square procedure. Thus, the source position is computed by or some improvements of it, such as the two-step weighted LS method (Chan’s method) [8]. These methods require matrix inversion that leads to a high requirement for hardware devices. However, low-cost hardware devices, such as some embedded systems, may not support matrix inversion. Hence, it is difficult for these methods to be applied to a low-cost location system. A more widely adapted method needs to be developed to address this situation.

3. The Proposed Method

In order to enable low-cost hardware devices to achieve high-precision positioning, we propose a simple closed-form solution for the multistation localization system. Without matrix inversion, the proposed method provides an algebraic solution which can be effectively applied to low-cost hardware devices.

We develop the approach by using theoretical variances as weighting coefficients to compute an average of each group’s localization result. As shown in Figure 2, first, the anchor sensors are divided into several groups and each group of sensors are used to estimate the target position, respectively. Then, theoretical variances of the position estimates in each group are calculated and regarded as weighted values. Finally, the weighted average of the estimates is obtained as final solution.

TOA and AOA measurements have already been measured, and the specific derivations are as follows.

3.1. TOA Solution

Assume that there are anchor sensors distributed arbitrarily in a 2-D plane. We divide these sensors into groups. Each group has 3 sensors, which are the minimum number of base stations required for the TOA location algorithm. Note that some sensors may be repeated in different groups. In the th group, the th observation station is at known position and the distance measured between the target and th sensor is , for .

In each group, the localization scenario consists of a source and three observation stations. Assume that the unknown source position is located at (, ). Then, the TOA measurement equations [19] in -th group are given by where is the true distance between the target and th sensor.

Transform (9) with respect to the first receiver, we obtain

Using (10) and (11), we obtain

Since TOA measurements have errors, which consist of the true TOAs corrupted by additive independent zero-mean Gaussian noise, we actually model distance estimates associated with receiver as where and .

Let and represent the position estimate coordinates in each group, where subscript denotes the th group. Then, the location estimate is where and .

With 3 sensors, the target position can be solved using (15) in each group. We compute theoretical variance by using the differential method [8]. From (12), the differential of is where , and . The differential of is where

For simplicity, we assume that the signal and noises are mutually independent, zero-mean stationary Gaussian random processes. If the distance estimation variance is , then the theoretical variance of is

The theoretical variance of is

The variance weighted average TOA solution is given by

From (20) and (21), it is clear that the variance is related to the measurement error, the distance between the sensor and target and the baseline. When measurement error or the distance between the sensor and target increases, the variance increases. While when the baseline becomes longer, the variance decreases. Hence, for the proposed method, it is better to let the target be in the central range of the array and divide sensors with uniform extraction.

3.2. AOA Solution

Assume that there are anchor sensors distributed arbitrarily in a 2-D plane. We divide these sensors into groups. Each group has 2 sensors, which is the minimum number of sensors required for the AOA location algorithm. Note that some sensors may be repeated in different groups. In the th group, the th sensor is located at known position and the measured angles are , , for . The unknown source position is located at (, ).

In th group, the true AOAs are given by [10]

Using (24), we obtain

The AOA measurements are subject to independent zero-mean Gaussian noise where and . Let and represent the position estimate coordinates in each group, where subscript denotes the th group, then the position estimate is

With 2 sensors, the target position can be solved using (27) in each group. We compute theoretical variance by using the differential method [8]. The differential of is where , and . The differential of is where , , and . If the angle estimation variance is , then the theoretical variance of is where The theoretical variance of is

The variance weighted average AOA solution is given by

Through the analysis of (31) and (33), we can obtain that when measurement error or the distance between the sensor and target increases, the variance increases. These conclusions are similar to those in TOA solution. Yet the variance increases if the baseline gets longer. Therefore, we would better group sensors with sequential extraction to get a smaller baseline in AOA solution.

4. Performance Analysis

In location estimation, there are two main different values that we can use to evaluate the performance of localization algorithms. One is theoretical variance, and the other one is CRLB [29, 30]. Theoretical variance is used to evaluate the practical performance of localization methods, while CRLB establishes a lower bound for any unbiased estimator. Since CRLB has already been derived in [29, 30], here, we derive the theoretical estimate variance of the proposed method in this section to illustrate its performance.

4.1. Theoretical Variance of TOA Solution

Assume that the variance of range measurements is . From (22), we can obtain the differential of : where . Using (16) and (20), and can be written as where , , and . Then, we have where , , and .

Substituting (37), (38), and (39) into (36), the theoretical estimate variance of is

With the similar derivation, the theoretical estimate variance of is where , , , , , , and .

The theoretical estimate variance of the proposed method is then obtained from (40) and (41) as

Figure 3 depicts the theoretical variance of the proposed method in the TOA case as the target position varies, where the sensor positions are , , , , , , , , and and is fixed at 50. It shows that the estimation is more accurate when the target gets closer to the central of the array range.

4.2. Theoretical Variance of AOA Solution

Assume that the variance of angle measurements is . From (28), can be written as where

From (34), we can obtain the differential of where . Using (31), can be written as where Then, we have where and .

Substituting (43), (46), and (48) into (45), the theoretical estimate variance of is

With the similar derivation, the theoretical estimate variance of is where

The theoretical estimate variance of the proposed method is then obtained from (49) and (50) as

The theoretical variance of AOA solution is illustrated in Figure 4 as the target position varies, where the sensor positions are , , , and and is fixed at 3°. The result is similar to TOA solution that the proposed method can give a more accurate estimation if the target gets closer to the central of the array range.

5. Simulation Results

Simulations are performed to validate the performance of the proposed method and to compare the relative localization accuracy for different methods.

Without loss of generality, we assume that the signal and noises are mutually independent, zero-mean stationary Gaussian random processes. Suppose that and denote TOA standard deviations and AOA standard deviations, respectively. Simulation results are displayed in terms of the root-mean-square error (RMSE) given by [15] which are obtained from the average of 3000 independent runs.

As shown in Figures 5(a) and 5(b), the correctness of the theoretical variance we derive is verified in TOA solution and AOA solution, respectively. The source is at an arbitrary position within the range of the array. The Monte Carlo experiment generates a source position randomly in each run. Simulations demonstrated that the theoretical variance fits well with RMSE in both TOA solution and AOA solution.

Figure 6(a) illustrates the performance of the proposed method as the number of the sensor varies, where the area size is 1000, is fixed at 30, and the source is at . The proposed method with the simplified formulae instead of matrix inversion still performs well, and its localization accuracy is close to CRLB. In case of AOA solution, the results are given in Figure 6(b), where the area size is 1000, is fixed at 2°, and the source is at . The performance of the proposed method also performs well in AOA solution.

In order to verify dynamic localization performance of the proposed method, simulations of dynamic positioning were carried out. Figures 7(a) and 7(b) compare the real target trace and estimated target trace in TOA solution. Two different motion trajectories of and are simulated in Figures 7(a) and 7(b), respectively. is fixed at 40. Both Figures 7(a) and 7(b) show that the proposed method performs well in dynamic localization. The real target trace and the estimated target trace are almost coincident. Similar simulation was conducted in AOA solution as shown in Figures 8(a) and 8(b), where is fixed at 2°.

Figures 8(a) and 8(b) show that the AOA solution of the proposed method achieves high accuracy in dynamic localization.

To give a comparison of the localization accuracy between the proposed method and other methods, Figure 9(a) compares the performance of the proposed method, Chan’s method [8], and direct average method in TOA solution with 4 sensors. The sensor positions are , , , and . The source is at an arbitrary position within the range of the array. The Monte Carlo experiment generates a source position randomly in each run. Simulations show the estimation performance of the proposed method as varies from 10 to 50. Among the three methods, the direct average method performs worst and the proposed method gives a smaller RMSE using variance weighting. The positioning accuracy of the proposed method is close to the Chan’s method and CRLB [29]. Note that no matrix reverse is required for the proposed method; the computation complexity is largely simplified, and the method can be used in low-cost hardware devices.

Similar experiment was conducted in AOA solution as shown in Figure 9(b). The sensor positions are , , , and . Simulations show the localization accuracy of the proposed method compared with the WLS method [11] and direct average method as varies from 1° to 3°. The performance of the proposed method remains promising in AOA solution.

As seen in all the figures, the proposed method using theoretical variances as weights to improve the system performance provides higher accuracy than the method that uses the direct average of each group’s estimate result. Previous closed-form solutions cannot be used for low-cost hardware devices due to matrix inversion. This method, on the other hand, provides an effective solution which has the similar performance with the matrix method for target localization with low-cost hardware devices.

6. Conclusions

We have developed a simple method for target localization in a multistation redundancy system. The proposed method, which utilizes groups to avoid matrix inversion and uses theoretical variances as weights to improve the system performance, gives an algebraic solution which can be applied to low-cost hardware devices. It requires less computation and does not reply on matrix inversion. The performance of the proposed method is verified by the simulation results. A comparison with other localization methods and CRLB was conducted. With theoretical variances used as the weighting coefficients, the proposed method has a significantly reduced RMSE compared with the method that directly averages each group’s localization result. The positioning accuracy of the proposed method is close to CRLB both in TOA solution and AOA solution.

This paper introduces the variance weighted average method for target localization in a multistation redundancy system. The proposed method, without matrix inversion, has the similar performance with the matrix method. For many low-cost hardware devices applications, this closed-form solution may itself be sufficiently accurate.

Data Availability

All data generated or analysed during this study are included in this paper. No additional data are available.

Conflicts of Interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Acknowledgments

The work undertaken in this paper was supported by the Fundamental Research Funds for the Central Universities of China (ZYGX2016J030).