Method and apparatus for TDOA wireless positioning using destructive interference of multiple anchor nodes

Abstract

The present invention relates to a method and apparatus for TDOA wireless positioning, has an effect of reducing positioning errors by reducing TDOA errors using destructive interference of multiple anchor nodes by dividing four or more anchor nodes into sets of three or more anchor nodes and by estimating a position of a tag node using TDOA of each set, and has an advantage of reducing the size and weight of the tag node since separate hardware is not required.

Claims

1. A server for TDOA wireless positioning using destructive interference, comprising: a transceiver to receive each reception time of a signal transmitted by a tag node from four or more anchor nodes; and a controller to calculate a position of the tag node using the signal and configured to: calculate TDOA (Time Difference of Arrival) between the anchor nodes using the received times, compose a set including three or more anchor nodes among the anchor nodes, estimate each distance between the tag node and the anchor nodes included in the set, calculate each distance between the tag node and the anchor nodes included in the set using TDOA calculated in the set, calculate a likelihood between the estimated distance and the calculated distance for the each set and calculate a position of the tag node using a set with the highest likelihood.

2. The server of claim 1, wherein the estimating each distance between the tag node and the anchor nodes included in the set uses the Chan algorithm.

3. The server of claim 1, wherein the estimating each distance between the tag node and the anchor nodes included in the set uses the Gauss-Newton method (iterative substitution method).

4. The server of claim 1, wherein the calculating the likelihood uses the Maximum Likelihood Estimation method.

5. A method for TDOA wireless positioning using destructive interference performed by a controller including one or more processors and memories, comprising: calculating TDOA between anchor nodes using respective time when four or more anchor nodes receives a signal transmitted by a tag node; composing a set including three or more anchor nodes among the anchor nodes; estimating each distance between the tag node and the anchor nodes included in the set; calculating each distance between the tag node and the anchor nodes included in the set using TDOA calculated in the set; calculating a likelihood between the estimated distance and the calculated distance for the each set; and calculating a position of the tag node using a set with the highest likelihood calculated.

6. The method of claim 5, wherein the estimating each distance between the tag node and the anchor nodes included in the set uses the Chan algorithm.

7. The method of claim 5, wherein the estimating each distance between the tag node and the anchor nodes included in the set uses the Gauss-Newton method (iterative substitution method).

8. The method of claim 5, wherein the calculating the likelihood uses the Maximum Likelihood Estimation method.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The above and other aspects, features, and advantages of the present disclosure will become more apparent to those of ordinary skill in the art by describing embodiments thereof in detail with reference to the accompanying drawings, in which:

(2) FIG. 1 shows a positioning method using TDOA of prior art;

(3) FIG. 2 shows a problem of a positioning method using TDOA of prior art;

(4) FIG. 3 is a block diagram of an entire system in which a wireless positioning method according to an exemplary embodiment of the present invention is performed;

(5) FIG. 4 is a structural diagram of a server in which a wireless positioning method according to an exemplary embodiment of the present invention is performed;

(6) FIG. 5 shows an example of a situation in which a TDOA error occurs due to a same factor;

(7) FIG. 6 shows a situation in which an error in signal arrival time occurs in each anchor node due to a same factor;

(8) FIG. 7 shows an example of selecting anchor node pairs according to an exemplary embodiment of the present invention; and

(9) FIG. 8 is a flowchart of a TDOA wireless positioning method according to another exemplary embodiment of the present invention.

(10) The accompanying drawings are exemplified by reference for understanding the technical idea of the present invention, and the scope of the present invention is not limited thereto.

DETAILED DESCRIPTION OF THE EMBODIMENTS

(11) Hereinafter, a configuration of the present invention guided by various embodiments of the present invention and effects resulting from the configuration will be described with reference to the drawings. In describing the present invention when it is determined that a detailed description of a related known function obvious to those skilled in the art may unnecessarily obscure the subject matter of the present invention, the detailed description thereof will be omitted.

(12) Terms such as ‘the first’ and ‘the second’ may be used to describe various elements, but, the above elements should not be limited by the terms above. The terms may only be used to differentiate one element from another. For example, without departing from the scope of the present invention, ‘the first element’ may be named ‘the second element’ and similarly, ‘the second element’ may also be named ‘the first element.’ In addition, expressions in the singular include plural expressions unless explicitly expressed differently in context. Unless otherwise defined, the terminology used in the embodiments of the present invention may be interpreted as meanings commonly known to those of ordinary skill in the art.

(13) Hereinafter, a configuration of the present invention guided by various embodiments of the present invention and effects resulting from the configuration will be described with reference to the drawings.

(14) FIG. 3 is a block diagram of an entire system in which a wireless positioning method according to an embodiment of the present invention is carried out.

(15) Four or more anchor nodes 120, 130, 140, and 150, a tag node 110, and a server 100 are required to carry out the wireless positioning according to an embodiment of the present invention.

(16) When a signal transmitted from the tag node 110 is received by each anchor node 120, 130, 140, and 150, and the received time is transmitted to the server 100, the server uses TDOA to calculate a position of the tag node 110.

(17) FIG. 4 is a structural diagram of a server for measuring a position of a tag node using TDOA.

(18) The server 100 includes a transceiver 102 and a controller 104.

(19) The transceiver 102 receives time information from each of the anchor nodes 120, 130, 140, and 150 that they received the signal transmitted by the tag node 110.

(20) The controller 104 includes one or more processors and memories, and calculates the position of the tag node 110 using TDOA, which is a difference between signal reception times received from the transceiver 102.

(21) FIG. 5 shows an example of a situation in which an error may occur in TDOA.

(22) The tag node 110 transmits a signal, and a first anchor node 120, a second anchor node 130, and a third anchor node 140 respectively receive the signal transmitted by the tag node 110. In this case, the first anchor node 120 and the second anchor node 130 are placed on NLOS with the tag node 110 due to an obstacle 190. Therefore, an error occurs in an arrival time when the signal transmitted by the tag node 110 arrives, and when a distance is calculated using this, an error is bound to occur.

(23) FIG. 6 shows a situation in which an arrival time of a signal changes due to an obstacle.

(24) It can be seen that T1 122, which is a time supposed to arrive at the first anchor node 120 if there is no obstacle 190, is slowed down to T1′ 124 due to the obstacle 190, and T2 132, which is a time supposed to arrive at the second anchor node 130 if there is no obstacle 190, is also slowed down to T2′ 134. It can be seen that only T3 142, which is a time of the signal arriving at the third anchor node 140 without the obstacle between the tag node 110 and the third anchor node 140, has normally arrived.

(25) It can be seen the signal arrived at the first anchor node 120 and the signal arrived at the second anchor node 130 are delayed due to the same obstacle over the original time to supposed to arrive, but there is no difference between a time difference TDOA12 (the time difference between the time the signal arrived at the first anchor node 120 and the time the signal arrived at the second anchor node 130) and a time difference TDOA′12. That is, the error generated in the first anchor node 120 and the second anchor node 130 is canceled out by the same factor.

(26) Accordingly, the server 100 may obtain the position of the tag node 110 with a less error due to such a destructive interference phenomenon.

(27) T1′ is a time when the signal arrived at the first anchor node 120, and T2′ is a time when the signal arrived at the second anchor node 130. Assuming that the arrival times are T1 and T2, respectively if there is no NLOS error, it may be expressed as T1′=T1+E1 and T2′=T2+E2 (E1 and E2 are errors caused by NLOS). It can be seen that since the error is caused by the same obstacle, E1 and E2 can be regarded as the same, therefore, TDOA′12 with error is almost the same as TDOA12 without error like TDOA′12=T2′−T1′ T2−T1=TDOA12.

(28) However, TDOA13 and TDOA′13 will be measured differently because the third anchor node (140) does not contain NLOS error.

(29) The prior art estimates the position of the tag node 110 except for the measured values of the first anchor node 120 and the second anchor node 130, where an error occurs due to NLOS, but there is a problem that the accuracy decreases as data that can be used for positioning decreases.

(30) Accordingly, the present invention proposes a method for reducing positioning errors by using destructive interference without excluding anchor nodes that generate such errors.

(31) The server 100 receives time information transmitted from the anchor nodes 120, 130, 140, and 150 through the transceiver 102. For positioning according to the present invention, at least four or more anchor nodes are required unlike the prior art.

(32) The controller 104 of the server 100 calculates TDOAs in all cases by using the received arrival time information. TDOA between anchor node i and anchor node j is calculated as follows: TDOA.sub.ij=|T.sub.i−T.sub.j|.

(33) Next, in all cases of TDOAs, a set of TDOAs including three or more nodes is composed. If there are four anchor nodes, a set is composed as follows:
S.sub.1={TDOA.sub.12,TDOA.sub.13}
S.sub.2={TDOA.sub.12,TDOA.sub.14}
S.sub.3={TDOA.sub.23,TDOA.sub.24}
S.sub.4={TDOA.sub.12,TDOA.sub.13,TDOA.sub.24}

(34) FIG. 7 shows an example of selecting anchor node pairs.

(35) In general, an anchor node pair is selected based on one anchor node as shown in (a) of FIG. 7. (a) of FIG. 7 shows an example of selecting anchor node pairs in order to calculate TDOA between another anchor node based on a fifth anchor node 250.

(36) However, according to an embodiment of the present invention, after calculating TDOA by selecting various anchor node pairs, the position of the tag node may be calculated using the TDOA. (b) of FIG. 7 shows an example of selecting a pair between the fifth anchor node 250 and other anchor nodes or between a sixth anchor node 260 and other anchor nodes according to the present invention.

(37) Now, for every set, a distance R.sub.i between the anchor node and the tag node, respectively is estimated. As for R.sub.i, when the distance between the nearest anchor node and the tag node is referred to R.sub.1, R.sub.i is estimated by first estimating R.sub.1, and then using TDOA between anchor nodes. R.sub.1 uses the Chan algorithm, which is a closed form of quadratic equation, so if there is no error in the measured TDOA, it would match the actual distance R.sub.1, but there is a difference from the actual R.sub.1 since TDOA contains an error.

(38) The Gauss-Newton method (iterative substitution method) may be used to obtain R.sub.1.

(39) R.sub.i is estimated by the expansion of the following mathematical equations:

(40) $P = [\begin{matrix} x_{i} - x_{1} & y_{i} - y_{1} \\ x_{j} - x_{1} & y_{j} - y_{1} \end{matrix}]$

(41) Each of 1, i, and j denotes an anchor node number, and 1 denotes the nearest anchor node that is the basis of TDOA calculation. [x.sub.n, y.sub.n] denotes the position of an n-th anchor node.
R=[r.sub.ir.sub.j].sup.T

(42) r.sub.i denotes a TDOA value measured at the i-th anchor node.

(43) $k_{n} = x_{n}^{2} + y_{n}^{2}$ $A = - P^{- 1}$ $B = \frac{1}{2} [\begin{matrix} {(r_{i} - r_{1})}^{2} - k_{i} + k_{1} \\ {(r_{j} - r_{1})}^{2} - k_{j} + k_{1} \end{matrix}]$ $E = A \times R = [\begin{matrix} E_{a} \\ E_{b} \end{matrix}]$ $F = A \times B = [\begin{matrix} F_{a} \\ F_{b} \end{matrix}]$

(44) By calculating R.sub.1, a distance between the nearest anchor node and the tag node using the above equations, the following equation is obtained:
R.sub.1.sup.2=(x.sub.1−E.sub.aR.sub.1+F.sub.a)).sup.2+(y.sub.1−(E.sub.bR.sub.1+F.sub.b)).sup.2

(45) Since this equation is a theoretically schematized equation of R.sub.1, it is necessary to convert it to a quadratic equation for R.sub.1 as follows in order to find actual solution of R.sub.1:
(1−Ea.sup.2−Eb.sup.2)R.sub.1.sup.2+2(x.sub.1E.sub.a+y.sub.1E.sub.b−EaFa−EbFb)R.sub.1+2(x.sub.1F.sub.a+y.sub.1F.sub.b)−(F.sub.a.sup.2+Fb.sup.2)−(x.sub.1.sup.2+y.sub.1.sup.2)=0

(46) R.sub.i can be calculated by using R.sub.1 and TDOA obtained in this way.

(47) Since R.sub.1 and R.sub.i are estimated values calculated by the equations, and R′.sub.i calculated based on the position of the tag node calculated through the positioning algorithm includes a TDOA measurement error, between the two is an error proportional to the square of the TDOA measurement error.

(48) An equation for obtaining R′.sub.i is as follows:
R′i=(x.sub.i−x).sup.2+(y.sub.i−y).sup.2

(49) x.sub.i and y.sub.i denote the position of the i-th anchor node, and x and y denote the position of the tag node.

(50) Finally, the likelihood between R.sub.i estimated by the equation and R′.sub.i obtained using the measured TDOA is obtained by using the Maximum Likelihood Estimation (MLE) method.

(51) $likelihood = \frac{1}{\exp (\frac{.Math. .Math. R_{i}^{2} - {R_{i}^{'}}^{2} .Math.}{n})}$

(52) n is a total number of anchor nodes in the set.

(53) A TDOA set with the highest likelihood value calculated will be a pair of anchor nodes with the least error or canceled error, and thus the position of the tag node may be calculated as follows:

(54) $[\begin{matrix} T_{x} \\ T_{y} \end{matrix}] = - {[\begin{matrix} x_{j} - x_{i} & y_{j} - y_{i} \\ x_{k} - x_{i} & y_{k} - y_{i} \end{matrix}]}^{- 1} \times ([\begin{matrix} R_{i} \\ R_{j} \end{matrix}] R_{i} + \frac{1}{2} [\begin{matrix} R_{j} - K_{j} + K_{i} \\ R_{k} - K_{k} + K_{i} \end{matrix}])$

(55) [T.sub.x, T.sub.y] denotes a position of the tag node, and i, j, and k denote the numbers of the i-th, j-th, and k-th anchor nodes.

(56) FIG. 8 is a flowchart of a TDOA method using destructive interference according to an embodiment of the present invention.

(57) First, each arrival time of a signal transmitted by the tag node is received from four or more anchor nodes at step S10, and TDOA between each anchor node is calculated at step S20.

(58) Since at least four anchor nodes are included, sets including three or more anchor nodes are composed at step S30.

(59) Next, a distance between the anchor node and the tag node is respectively estimated using the above equations in each set at step S40.

(60) A likelihood between the distance estimated in the above step and the distance obtained by positioning using TDOA is calculated at step S50, and estimating that a set with the highest likelihood is a set with the lowest error to the actual distance, a position of the tag node is calculated using anchor nodes of this set at step S60.

(61) As described above, according to the present invention, even if there is an error in the TDOA value due to NLOS, there is an advantage in that it is possible to position the tag node more accurately than the existing method. Since separate hardware is not required to perform such a method, it is possible to obtain an effect of reducing the cost by reducing the size or weight of the tag node.

(62) The scope of protection of the present invention is not limited to the description and expression of the embodiments explicitly described above. In addition, it is added once again that the scope of protection of the present invention may not be limited due to obvious changes or substitutions in the technical field of the present invention.

Method and apparatus for TDOA wireless positioning using destructive interference of multiple anchor nodes

Assignee

Inventors

Cpc classification

Classification Explorer

G01S5/06

PHYSICS

Classification Explorer

G01S5/0218

PHYSICS

Classification Explorer

G01S5/14

PHYSICS

Classification Explorer

G01S5/0278

PHYSICS

Classification Explorer

G01S11/02

PHYSICS

Classification Explorer

G01S5/02213

PHYSICS

International classification

Classification Explorer

G01S5/14

PHYSICS

Classification Explorer

G01S5/02

PHYSICS

Abstract

Claims

Description