CN105425206A - Steady least square positioning method in nonsynchronous wireless network - Google Patents

Steady least square positioning method in nonsynchronous wireless network Download PDF

Info

Publication number
CN105425206A
CN105425206A CN201510740797.3A CN201510740797A CN105425206A CN 105425206 A CN105425206 A CN 105425206A CN 201510740797 A CN201510740797 A CN 201510740797A CN 105425206 A CN105425206 A CN 105425206A
Authority
CN
China
Prior art keywords
sigma
rho
eta
sensor
delta
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510740797.3A
Other languages
Chinese (zh)
Other versions
CN105425206B (en
Inventor
王刚
高尚超
张圣金
李有明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ningbo University
Original Assignee
Ningbo University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ningbo University filed Critical Ningbo University
Priority to CN201510740797.3A priority Critical patent/CN105425206B/en
Publication of CN105425206A publication Critical patent/CN105425206A/en
Application granted granted Critical
Publication of CN105425206B publication Critical patent/CN105425206B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S5/00Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Position Fixing By Use Of Radio Waves (AREA)

Abstract

The invention discloses a steady least square positioning method in the nonsynchronous wireless network. When measurement signals emitted by an unknown target source are spread to different sensors in the sensor network and then forwarded and returned to the unknown target source, measurement signal equivalent transmission distance measuring values based on round arrival time; according to the measurement signal equivalent transmission distance measuring value corresponding to each sensor, an equivalent distance measuring model corresponding to each sensor is obtained; the steady least square problem is established according to the re-described distance measuring models; optimization variables are introduced, the second-order cone relaxation technology is utilized, and the steady least square problem is relaxed into a second-order cone programming problem; and the second-order cone programming problem is solved in the interior point method to obtain the coordinate estimation value of the unknown target source. The method has the advantages that influence of clock drift and transfer time on the positioning precision can be effectively inhibited, the positioning precision is high, and the positioning stability is high.

Description

Robust least squares localization method in a kind of unsynchronized wireless networks
Technical field
The present invention relates to a kind of object localization method, especially relate to the robust least squares localization method in a kind of unsynchronized wireless networks.
Background technology
Target localization has indispensable effect in military field such as accurate military attack, modern society's mobile interchange epoch, along with the great development of the commercialization market application such as location Based service, also make efficient accurate target localization research obtain increasing concern; Meanwhile, Technology for Target Location all has broad application prospects in fields such as military surveillance, traffic monitoring, home automation, industrial or agricultural control, biologic medical, rescue and relief works, and therefore, goal in research localization method tool is of great significance.And as the good complement of the positioning systems such as GPS, the target localization in wireless network is a classical research topic.
In target localization, localization method based on the measured value of time of arrival account for greatly, but the prerequisite of this localization method realize target location is the whole fixer network of supposition Complete Synchronization in time, does not consider the asynchronous impact on locating effect of fixer network, and in fact, due to various factors such as hardware conditions, real network is normally asynchronous, in other words, impossible Complete Synchronization, therefore this localization method is difficult to be applied to real network.Other conventional Initial Transmission Time also requiring accurate known network based on localization method time of arrival existing, but the more difficult realization of this requirement cost is larger in other words.
For solving the technical matters existed based on the localization method of the measured value of time of arrival, the localization method in unsynchronized wireless networks arises at the historic moment.In localization method in unsynchronized wireless networks, because sensor clock exists clock jitter and clock drift, therefore when complete unknown clock jitter and clock drift, the problem of they and target location Combined estimator is difficult to solve.In order to overcome this problem, there has been proposed some schemes, that compares main flow has: one is the location based on time of arrival poor (TDOA); Another kind is the location based on round time of arrival (TW-TOA), and Fig. 1 gives typically based on the schematic diagram of the localizing environment of round time of arrival (TW-TOA).In the localization method based on difference time of arrival, clock jitter is removed, and final need be carried out Combined estimator to clock drift and target location, but it should be noted that this method still needs the sensor in fixer network synchronous in time; In the localization method based on round time of arrival, it does not need any inter-node synchronous in fixer network, but it is envisaged that the connecting time in measuring is on the impact of positioning result, the total feasible zone method proposed if any scholar and least square method, all first these two kinds of methods are estimated the connecting time, try to achieve target location estimated value eventually through to the Combined estimator of clock drift and target source position, but wherein can produce larger impact to the performance of location to the error of transfer time Estimate.
Summary of the invention
Technical matters to be solved by this invention is to provide the robust least squares localization method in a kind of unsynchronized wireless networks, and its location is based on round time of arrival, and positioning precision is high.
The present invention solves the problems of the technologies described above adopted technical scheme: the robust least squares localization method in a kind of unsynchronized wireless networks, is characterized in that comprising the following steps:
1. in unsynchronized wireless networks environment, a two-dimensional coordinate system or three-dimensional system of coordinate is set up as with reference to coordinate system, and there is the known sensor in a unknown object source and N number of position in hypothesis in unsynchronized wireless networks environment, and the coordinate of unknown object source in reference frame is x, the coordinate of N number of sensor in reference frame corresponds to s 1, s 2..., s n, wherein, N>=n+1, n represent the dimension of reference frame, s 1represent the coordinate of the 1st sensor in reference frame, s 2represent the coordinate of the 2nd sensor in reference frame, s nrepresent the coordinate of N number of sensor in reference frame;
2. in unsynchronized wireless networks environment, by unknown object source emission measurement signal, measuring-signal forwards through each sensor of propagation arrival again and turns back to unknown object source after transfer process, first determine that the measuring-signal launched in unknown object source is through propagating the mistiming of the time point arrived when each sensor forwards time point when turning back to unknown object source and unknown object source emission measurement signal again after transfer process, the measuring-signal launched of unknown object source is 2t through propagating the mistiming of time point when arrival i-th sensor forwards time point when turning back to unknown object source and unknown object source emission measurement signal again after transfer process i, unit is second, then wherein, 1≤i≤N, w represents the clock drift in unknown object source, s irepresent the coordinate of i-th sensor in reference frame, c is the light velocity, T irepresent the connecting time needed for measuring-signal that i-th sensor transfer process unknown object source is launched, represent that the measuring-signal launched in unknown object source forwards through propagation arrival i-th sensor the variance turned back on the whole piece transmission path in unknown object source again and is after transfer process gaussian reflectivity mirrors, symbol " ‖ ‖ " is Euclid 2 norm, then calculate the measuring-signal launched in unknown object source to arrive each sensor after transfer process, forward the measuring-signal effective transmission distance measure based on round time of arrival when turning back to unknown object source again through propagating, the measuring-signal launched of unknown object source through propagate arrival i-th sensor again after transfer process the measuring-signal effective transmission distance measure based on round time of arrival forwarded when turning back to unknown object source be 2d i, unit is rice, then d i = c × t i = c × ( w × ( | | x - s i | | c + T i 2 ) + n ~ i 2 ) = w ( | | x - s i | | + d T i 2 ) + n i 2 , Wherein, d T i = c × T i , represent T ito d iimpact, n irepresent d iin noise, n igaussian distributed, and n ivariance be σ i 2 = c 2 × σ ~ i 2 .
3. obtain the range observation model that each sensor is corresponding, for i-th sensor, the acquisition process of its corresponding range observation model is: make w=1+ δ, and require that δ satisfies condition | δ | and≤δ max< < 1, and determine span be then combine with w=1+ δ, obtain d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 , Combine again d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With w=1+ δ, obtain then basis &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) With | δ |≤δ max< < 1, obtains &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) &ap; &delta; ( d i - n i 2 ) , Suppose again | n i 2 | < < d i , Then basis &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta; ( d i - n i 2 ) With , obtain &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i ; Combine afterwards d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i , Obtain d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 , Right again d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 About equal sign both sides deduct intermediate value obtain d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 ; Finally make d ^ i = d i - a i + b i 4 , And make e i = d T i 2 - a i + b i 4 + &delta;d i , Will d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 Be reduced to and will as the range observation model that i-th sensor is corresponding; Wherein, δ represents the clock drift amount of unknown object source relative standard's clock, and symbol " || " is the symbol that takes absolute value, and symbol " < < " is much smaller than symbol, δ maxrepresent the maximal value of the clock drift amount of unknown object source relative standard's clock, a iand b icorresponding expression the upper bound of value and lower bound, | e i | &le; &rho; i , &rho; i = b i - a i 4 + &delta; m a x &times; d i ;
4. corresponding to each sensor range observation model is redescribed, for the range observation model that i-th sensor is corresponding to its detailed process redescribed be: will d ^ i &ap; | | x - s i | | + e i + n i 2 Change into d ^ i - e i &ap; | | x - s i | | + n i 2 ; Then right d ^ i - e i &ap; | | x - s i | | + n i 2 About equal sign both sides to carry out square, and to suppose then omit n iquadratic component obtain ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i ; Again will ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i Change into: n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | , Namely d ^ i &ap; | | x - s i | | + e i + n i 2 Redescribe for n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | ;
5. according to the range observation model after redescribing, set up a robust least squares problem, be described as: min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 ; Then make f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , According to min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 With f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , Will min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Change into min x max { e i } &Sigma; i = 1 N ( f ( e i ) ) 2 &sigma; i 2 ; Basis again min x max { e i } &Sigma; i = 1 N ( f ( e i ) ) 2 &sigma; i 2 Robust least squares problem is described as: min x &Sigma; i = 1 N &lsqb; max e i f ( e i ) &rsqb; 2 &sigma; i 2 ; Wherein, min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 The minimum x of value, max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make maximum { the e of value i, { e irefer to by e 1, e 2..., e nthe set of composition, f (e i) represent and get and make f (e i) the maximum e of value i;
6. f (e is determined i) maximal value, if then f (e i) maximal value be max (f (-ρ i), f (ρ i)); If then f (e i) maximal value be then basis with f (e i) maximal value, obtain diagram form on show, describe
For: min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) ; Wherein, symbol " || " is the symbol that takes absolute value, max () for getting max function, wherein f ( - &rho; i ) = | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( d ^ i ) = ( d ^ i ) 2 - 2 d ^ i &times; d ^ i + ( d ^ i ) 2 - | | x - s i | | 2 | | x - s i | | = | | x - s i | | , min x , { &eta; i } &Sigma; i = 1 N &eta; i Represent to get and make the minimum x of value, { η i, η ifor min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) I-th optimized variable of middle introducing, { η ithe set of N number of optimized variable for introducing, " s.t. " expressions " condition that submits to is ";
7. combine min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) And f ( - &rho; i ) | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | With
f ( d ^ i ) = | | x - s i | | , Obtain min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . ;
8. exist min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . Middle introducing optimized variable y, y=||x|| 2, then utilize second order cone relaxing techniques by y=||x|| 2relax and be || x|| 2≤ y, obtains Second-order cone programming problem, is described as: min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | | 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , | | 2 x y - 1 | | &le; y + 1. , Wherein, represent to get and make the minimum x of value, y, { η i, symbol " [] " is vector representation symbol, for s itransposed vector;
9. interior point method technology pair is utilized min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | | 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , | | 2 x y - 1 | | &le; y + 1. Solve, obtain x, y, { η icorresponding estimated value, correspondence is designated as
Described step 3. in a ivalue and b ithe deterministic process of value be:
3. N number of sensor that in the unsynchronized wireless networks tested, location information is known-1, is supposed;
3.-2, by jth ' individual sensor to i-th ' individual sensor send measuring-signal, calculate jth ' the measuring-signal of individual sensor emission through propagating arrival i-th ' individual sensor forward after transfer process again turn back to jth ' individual sensor time time point and jth ' individual sensor initial transmissions measuring-signal time the mistiming 2t of time point j', i'product with light velocity c, is designated as wherein, 1≤i'≤N, 1≤j'≤N, i' ≠ j';
-3 3. the positional information, according to N number of sensor, calculates the actual distance between jth ' individual sensor and i-th ' individual sensor, is designated as d j', i'; Then calculate jth ' effective transmission distance in the measuring-signal of the individual sensor emission connecting time through propagating arrival i-th ' individual sensor after i-th ' individual sensor, be designated as d t, j', i',
-4 3., from N number of sensor a selected sensor arbitrarily, suppose the sensor selected be i-th ' individual sensor, then make a i=min (d t, j', i'| 1≤j'≤N, j' ≠ i'), and make b i=max (d t, j', i'| 1≤j'≤N, j' ≠ i'), wherein, min () is for getting minimum value function, and max () is for getting max function.
Compared with prior art, the invention has the advantages that: compare existing total feasible zone method and least square method, the present invention utilizes Robust Least Squares Method clock drift and connecting time steadily and surely to be processed as an irrelevant variable, only go to estimate the coordinate figure of unknown object source in reference frame, thus can effectively suppress clock drift and connecting time on the impact of positioning precision, positioning precision is high; Meanwhile, utilize second order cone relaxing techniques the description of robust least squares problem to be relaxed as Second-order cone programming problem, can guarantee to obtain globally optimal solution like this and not by the impact of local convergence, thus have higher hi-Fix stability.
Accompanying drawing explanation
Fig. 1 is typically based on the schematic diagram of the localizing environment of round time of arrival (TW-TOA);
Fig. 2 is the overall procedure block diagram of the inventive method;
Fig. 3 be the inventive method and existing total feasible zone method and least square method in the measurements root-mean-square error with the change schematic diagram of noise size;
Fig. 4 be the inventive method and existing total feasible zone method and least square method in the measurements root-mean-square error with the change schematic diagram of sensor (anchor node) number.
Embodiment
Below in conjunction with accompanying drawing embodiment, the present invention is described in further detail.
Robust least squares localization method in a kind of unsynchronized wireless networks that the present invention proposes, as shown in Figure 2, it comprises the following steps its overall procedure block diagram:
1. in unsynchronized wireless networks environment, a two-dimensional coordinate system or three-dimensional system of coordinate is set up as with reference to coordinate system, and there is the known sensor in a unknown object source and N number of position in hypothesis in unsynchronized wireless networks environment, and the coordinate of unknown object source in reference frame is x, the coordinate of N number of sensor in reference frame corresponds to s 1, s 2..., s n, wherein, N>=n+1, n represent the dimension of reference frame, n=2 or n=3, n=2 when namely reference coordinate is two-dimensional coordinate system, n=3, s when reference coordinate is three-dimensional system of coordinate 1represent the coordinate of the 1st sensor in reference frame, s 2represent the coordinate of the 2nd sensor in reference frame, s nrepresent the coordinate of N number of sensor in reference frame.
2. in unsynchronized wireless networks environment, as shown in Figure 1, by unknown object source emission measurement signal, measuring-signal forwards through each sensor of propagation arrival again and turns back to unknown object source after transfer process, first determine that the measuring-signal launched in unknown object source is through propagating the mistiming of the time point arrived when each sensor forwards time point when being back to unknown object source and unknown object source emission measurement signal again after transfer process, the measuring-signal launched of unknown object source is 2t through propagating the mistiming of time point when arrival i-th sensor forwards time point when being back to unknown object source and unknown object source initial transmissions measuring-signal again after transfer process i, unit is second, then wherein, 1≤i≤N, w represents the clock drift in unknown object source, unknown in the value of this w, s irepresent the coordinate of i-th sensor in reference frame, c is the light velocity, T irepresent the connecting time needed for measuring-signal that i-th sensor transfer process unknown object source is launched, at this T ivalue unknown, represent that the measuring-signal launched in unknown object source forwards through propagation arrival i-th sensor the variance turned back on the whole piece transmission path in unknown object source again and is after transfer process gaussian noise, symbol " ‖ ‖ " is Euclid 2 norm, then calculate the measuring-signal launched in unknown object source to arrive each sensor after transfer process, forward the measuring-signal effective transmission distance measure based on round time of arrival when turning back to unknown object source again through propagating, the measuring-signal launched of unknown object source through propagate arrival i-th sensor again after transfer process the measuring-signal effective transmission distance measure based on round time of arrival forwarded when turning back to unknown object source be 2d i, unit is rice, then d i = c &times; t i = c &times; ( w &times; ( | | x - s i | | c + T i 2 ) + n ~ i 2 ) = w ( | | x - s i | | + d T i 2 ) + n i 2 , Wherein, represent T ito d iimpact, n irepresent d iin noise, n igaussian distributed, and n ivariance be (i.e. 2d imiddle noise n ipower),
3. obtain the range observation model that each sensor is corresponding, for i-th sensor, the acquisition process of its corresponding range observation model is: make w=1+ δ, and require that δ satisfies condition | δ | and≤δ max< < 1, and determine span be then combine with w=1+ δ, obtain d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 , Combine again d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With w=1+ δ, obtain &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) ; Then basis &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) With | δ |≤δ max< < 1, obtains &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) &ap; &delta; ( d i - n i 2 ) , Suppose again then basis &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta; ( d i - n i 2 ) With obtain &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i ; Combine afterwards d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i , Obtain d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 , Right again d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 About equal sign both sides deduct intermediate value obtain d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 ; Finally make d ^ i = d i - a i + b i 4 , And make e i = d T i 2 - a i + b i 4 + &delta;d i , Will d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 Be reduced to and will as the range observation model that i-th sensor is corresponding; Wherein, δ represents the clock drift amount of unknown object source relative standard's clock, and symbol " || " is the symbol that takes absolute value, and symbol " " is much smaller than symbol, δ maxrepresent the maximal value of the clock drift amount of unknown object source relative standard's clock, at this δ maxvalue known, a and b correspondence represent the upper bound of value and lower bound, a ivalue and b ivalue known, | e i|≤ρ i, &rho; i = b i - a i 4 + &delta; m a x &times; d i .
In this particular embodiment, step 3. in a ivalue and b ithe deterministic process of value be:
-1 3., suppose N number of sensor that the unsynchronized wireless networks location information of testing is known, the positional information of sensor can be located by GPS and be obtained.
3.-2, by jth ' individual sensor to i-th ' individual sensor send measuring-signal, calculate jth ' the measuring-signal of individual sensor emission through propagating arrival i-th ' individual sensor forward after transfer process again turn back to jth ' individual sensor time time point and jth ' individual sensor initial transmissions measuring-signal time the mistiming 2t of time point j', i'product with light velocity c, is designated as wherein, 1≤i'≤N, 1≤j'≤N, i' ≠ j'.
-3 3. the positional information, according to N number of sensor, calculates the actual distance between jth ' individual sensor and i-th ' individual sensor, is designated as d j', i'; Then calculate jth ' effective transmission distance in the measuring-signal of the individual sensor emission connecting time through propagating arrival i-th ' individual sensor after i-th ' individual sensor, be designated as d t, j', i',
-4 3., from N number of sensor a selected sensor arbitrarily, suppose the sensor selected be i-th ' individual sensor, then make a i=min (d t, j', i'| 1≤j'≤N, j' ≠ i'), and make b i=max (d t, j', i'| 1≤j'≤N, j' ≠ i'), wherein, min () is for getting minimum value function, and max () is for getting max function.
4. corresponding to each sensor range observation model is redescribed, for the range observation model that i-th sensor is corresponding to its detailed process redescribed be: will d ^ i &ap; | | x - s i | | + e i + n i 2 Change into d ^ i - e i &ap; | | x - s i | | + n i 2 ; Then right d ^ i - e i &ap; | | x - s i | | + n i 2 About equal sign both sides to carry out square, and to suppose then n can be omitted iquadratic component obtain ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i ; Again will ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i Change into: n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | , Namely d ^ i &ap; | | x - s i | | + e i + n i 2 Redescribe for n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | .
5. according to the range observation model after redescribing, set up a robust least squares problem, be described as: min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 ; Then make f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , According to min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 With f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , Will min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Change into min x max { e i } &Sigma; i = 1 N ( f ( e i ) ) 2 &sigma; i 2 ; Basis again min x max { e i } &Sigma; i = 1 N ( f ( e i ) ) 2 &sigma; i 2 Robust least squares problem is described as: min x &Sigma; i = 1 N &lsqb; max e i f ( e i ) &rsqb; 2 &sigma; i 2 ; Wherein, min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 The minimum x of value, max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make maximum { the e of value i, { e irefer to by e 1, e 2..., e nthe set of composition, symbol " || " is the symbol that takes absolute value, f (e i) represent and get and make f (e i) the maximum e of value i.
6. f (e is determined i) maximal value, if then f (e i) maximal value be max (f (-ρ i), f (ρ i)); If then f (e i) maximal value be then basis with f (e i) maximal value, obtain diagram form on show, be described as: min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) ; Wherein, symbol " || " is the symbol that takes absolute value, max () for getting max function, f ( - &rho; i ) = | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( d ^ i ) = ( d ^ i ) 2 - 2 d ^ i &times; d ^ i + ( d ^ i ) 2 - | | x - s i | | 2 | | x - s i | | = | | x - s i | | , min x , { &eta; i } &Sigma; i = 1 N &eta; i Represent to get and make the minimum x of value, { η i, η ifor min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) I-th optimized variable of middle introducing, { η ithe set of N number of optimized variable for introducing, " s.t. " expressions " condition that submits to is ".
7. combine min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) And f ( - &rho; i ) = | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | With f ( d ^ i ) = | | x - s i | | , Obtain min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . .
8. exist min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 - 2 d ^ i &times; ( - &rho; i ) + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . Middle introducing optimized variable y, y=||x|| 2, then utilize second order cone relaxing techniques by y=||x|| 2relax and be || x|| 2≤ y, obtains Second-order cone programming problem, is described as: min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | | 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , | | 2 x y - 1 | | &le; y + 1. , Wherein, represent to get and make the minimum x of value, y, { η i, symbol " [] " is vector representation symbol, for s itransposed vector.
9. interior point method technology pair is utilized min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | | 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | | 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i | | &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , | | 2 x y - 1 | | &le; y + 1. Solve, obtain x, y, { η icorresponding estimated value, correspondence is designated as
For verifying feasibility and the validity of the inventive method, l-G simulation test is carried out to the inventive method.
1) situation of change of performance with measurement noises size of the inventive method is tested.Suppose that use 8 sensors are measured, the method for measurement is: first set up a plane right-angle coordinate, and 8 sensors are respectively (40,40), (40 ,-40), (-40,40), (-40 ,-40), (40,0), (0,40), (40,0), (0 ,-40) place (unit: m), unknown object source is then randomly dispersed in (-40,40) × (-40,40) m 2coordinates regional in.In simulations, the clock drift w in unknown object source is then randomly dispersed in the scope of [0.99,1.01], is also the maximal value δ of the clock drift amount of unknown object source relative standard's clock max=0.01, and then suppose that the scope of stochastic distribution is for [24,36] m, 1≤i≤8, in addition, suppose that the power of the noise in each self-corresponding measuring-signal effective transmission distance measure of all the sensors is identical, are wherein, σ refers to that the standard deviation of the noise of the horizontal ordinate representative in Fig. 3 is poor.
Fig. 3 give the inventive method and existing total feasible zone method and linear least square method in the measurements root-mean-square error with the change schematic diagram of noise size.As can be seen from Figure 3, in noise change procedure from small to large, the positioning performance of the inventive method is better than existing total feasible zone method (GTR) and linear least-squares (LLS) algorithm.Specifically, when the standard deviation of noise is 1m and 9m, root-mean-square error can reduce 0.5m and 2.1m.
2) situation of change that the positioning precision of testing the inventive method increases along with number of probes.Measure method be: in a plane right-angle coordinate hypothesis have 8 sensors and 8 sensors respectively in (40,40), (40 ,-40), (-40,40), (-40,-40), (40,0), (0,40), (40,0), (unit: m) of (0 ,-40) place, unknown object source is then randomly dispersed in (-40,40) × (-40,40) m 2coordinates regional in, get front 5 respectively and position test to front 8 sensors.In addition, suppose that the standard deviation of the noise in each self-corresponding measuring-signal effective transmission distance measure of all the sensors is identical, be σ 12=...=σ 8=4m.
Fig. 4 give the inventive method and existing total feasible zone method (GTR) and linear least square method (LLS) in the measurements root-mean-square error with the change schematic diagram of sensor (anchor node) number.In number of sensors by 5 to 8 change procedures increased gradually, the inventive method is better than existing total feasible zone method and linear least-squares algorithm in positioning precision.Specifically, when number of sensors is less than 8, the performance of total feasible zone method and linear least-squares is sharply deteriorated, so that cannot complete location, and the inventive method still can complete and locates more accurately.
As can be seen from upper simulation result, the inventive method has good performance.Compare with linear least square method with existing total feasible zone method, the inventive method effectively can reduce root-mean-square error, improve the precision of location, and the increase of noise power can't weaken the performance of location significantly, embodies the robustness of location; In addition, still relatively accurately can locate when sensor is fewer in a network, further illustrate feasibility and the validity of the inventive method.

Claims (2)

1. the robust least squares localization method in unsynchronized wireless networks, is characterized in that comprising the following steps:
1. in unsynchronized wireless networks environment, a two-dimensional coordinate system or three-dimensional system of coordinate is set up as with reference to coordinate system, and there is the known sensor in a unknown object source and N number of position in hypothesis in unsynchronized wireless networks environment, and the coordinate of unknown object source in reference frame is x, the coordinate of N number of sensor in reference frame corresponds to s 1, s 2..., s n, wherein, N>=n+1, n represent the dimension of reference frame, s 1represent the coordinate of the 1st sensor in reference frame, s 2represent the coordinate of the 2nd sensor in reference frame, s nrepresent the coordinate of N number of sensor in reference frame;
2. in unsynchronized wireless networks environment, by unknown object source emission measurement signal, measuring-signal forwards through each sensor of propagation arrival again and turns back to unknown object source after transfer process, first determine that the measuring-signal launched in unknown object source is through propagating the mistiming of the time point arrived when each sensor forwards time point when turning back to unknown object source and unknown object source emission measurement signal again after transfer process, the measuring-signal launched of unknown object source is 2t through propagating the mistiming of time point when arrival i-th sensor forwards time point when turning back to unknown object source and unknown object source emission measurement signal again after transfer process i, unit is second, then wherein, 1≤i≤N, w represents the clock drift in unknown object source, s irepresent the coordinate of i-th sensor in reference frame, c is the light velocity, T irepresent the connecting time needed for measuring-signal that i-th sensor transfer process unknown object source is launched, represent that the measuring-signal launched in unknown object source forwards through propagation arrival i-th sensor the variance turned back on the whole piece transmission path in unknown object source again and is after transfer process gaussian reflectivity mirrors, symbol " || || " is Euclid 2 norm, then calculate the measuring-signal launched in unknown object source to arrive each sensor after transfer process, forward the measuring-signal effective transmission distance measure based on round time of arrival when turning back to unknown object source again through propagating, the measuring-signal launched of unknown object source through propagate arrival i-th sensor again after transfer process the measuring-signal effective transmission distance measure based on round time of arrival forwarded when turning back to unknown object source be 2d i, unit is rice, then d i = c &times; t i = c &times; ( w &times; ( | | x - s i | | c + T i 2 ) + n ~ i 2 ) = w ( | | x - s i | | + d T i 2 ) + n i 2 , Wherein, d T i = c &times; T i , represent T ito d iimpact, n irepresent d iin noise, n igaussian distributed, and n ivariance be &sigma; i 2 = c 2 &times; &sigma; ~ i 2 .
3. obtain the range observation model that each sensor is corresponding, for i-th sensor, the acquisition process of its corresponding range observation model is: make w=1+ δ, and require that δ satisfies condition | δ | and≤δ max< < 1, and determine span be then combine d i = w ( | | x - s i | | + d T i 2 ) + n i 2 With w=1+ δ, obtain d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 , Combine again d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With w=1+ δ, obtain &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) ; Then basis &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) With | δ |≤δ max< < 1, obtains &delta; ( | | x - s i | | + d T i 2 ) = &delta; ( d i 1 + &delta; - n i 2 ( 1 + &delta; ) ) &ap; &delta; ( d i - n i 2 ) , Suppose again then basis &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta; ( d i - n i 2 ) With obtain &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i ; Combine afterwards d i = ( | | x - s i | | + d T i 2 ) + &delta; ( | | x - s i | | + d T i 2 ) + n i 2 With &delta; ( | | x - s i | | + d T i 2 ) &ap; &delta;d i , Obtain d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 , Right again d i &ap; ( | | x - s i | | + d T i 2 ) + &delta;d i + n i 2 About equal sign both sides deduct intermediate value obtain d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 ; Finally make d ^ i = d i - a i + b i 4 , And make e i = d T i 2 - a i + b i 4 + &delta;d i , Will d i - a i + b i 4 &ap; | | x - s i | | + d T i 2 - a i + b i 4 + &delta;d i + n i 2 Be reduced to and will as the range observation model that i-th sensor is corresponding; Wherein, δ represents the clock drift amount of unknown object source relative standard's clock, and symbol " || " is the symbol that takes absolute value, and symbol " < < " is much smaller than symbol, δ maxrepresent the maximal value of the clock drift amount of unknown object source relative standard's clock, a iand b icorresponding expression the upper bound of value and lower bound, | e i | &le; &rho; i , &rho; i = b i - a i 4 + &delta; m a x &times; d i ;
4. corresponding to each sensor range observation model is redescribed, for the range observation model that i-th sensor is corresponding to its detailed process redescribed be: will d ^ i &ap; | | x - s i | | + e i + n i 2 Change into d ^ i - e i &ap; | | x - s i | | + n i 2 ; Then right d ^ i - e i &ap; | | x - s i | | + n i 2 About equal sign both sides to carry out square, and to suppose then omit n iquadratic component obtain ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i ; Again will ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 &ap; | | x - s i | | 2 + | | x - s i | | &times; n i Change into: n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | , Namely d ^ i &ap; | | x - s i | | + e i + n i 2 Redescribe for n i &ap; ( d ^ i ) 2 - 2 d ^ i &times; e i + ( e i ) 2 - | | x - s i | | 2 | | x - s i | | ;
5. according to the range observation model after redescribing, set up a robust least squares problem, be described as: min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 ; Then make f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , According to min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | ) 2 &sigma; i 2 &times; | | x - s i | | 2 With f ( e i ) = | ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , Will min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Change into min x max { e i } &Sigma; i = 1 N ( f ( e i ) ) 2 &sigma; i 2 ; Basis again robust least squares problem is described as: wherein, min x max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make max { e i } &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 The minimum x of value, max { e i } &Sigma; i = 1 N &ap; ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) &sigma; i 2 &times; | | x - s i | | 2 Represent to get and make &Sigma; i = 1 N ( ( e i ) 2 - 2 d ^ i &times; e i + ( d ^ i ) 2 - | | x - s i | | 2 ) 2 &sigma; i 2 &times; | | x - s i | | 2 Maximum { the e of value i, { e irefer to by e 1, e 2..., e nthe set of composition, represent to get and make f (e i) the maximum e of value i;
6. f (e is determined i) maximal value, if then f (e i) maximal value be max (f (-ρ i), f (ρ i)); If then f (e i) maximal value be then basis with f (e i) maximal value, obtain diagram form on show, be described as: min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) ; Wherein, symbol " | " is the symbol that takes absolute value, max () for getting max function, wherein f ( - &rho; i ) = | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( d ^ i ) = | ( d ^ i ) 2 - 2 d ^ i &times; d ^ i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | = | | x - s i | | , represent to get and make the minimum x of value, { η i, η ifor min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) I-th optimized variable of middle introducing, { η ithe set of N number of optimized variable for introducing, " s.t. " expressions " condition that submits to is ";
7. combine min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . &lsqb; f ( - &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( &rho; i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N , &lsqb; f ( d ^ i ) &rsqb; 2 &sigma; i 2 &le; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) And f ( - &rho; i ) = | ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | , f ( &rho; i ) = | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | | | x - s i | | With f ( d ^ i ) = | | x - s i | | , Obtain min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &le; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . ;
8. exist min x , { &eta; i } &Sigma; i = 1 N &eta; i s . t . | ( - &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , | ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - | | x - s i | | 2 | 2 | | x - s i | | 2 &le; &sigma; i 2 &le; &eta; i , i = 1 , ... , N , | | x - s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N . ( i f | d ^ i | &le; &rho; i ) . ; Middle introducing optimized variable y, y=||x|| 2, then utilize second order cone relaxing techniques by y=||x|| 2relax and be || x|| 2≤ y, obtains Second-order cone programming problem, is described as: min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . || 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i || &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , || 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i || &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , || 2 x y - 1 || &le; y + 1. , Wherein, represent to get and make the minimum x of value, y, { η i, symbol " [] " is vector representation symbol, for s itransposed vector;
9. interior point method technology pair is utilized min x , y , { &eta; i } &Sigma; i = 1 N &eta; i s . t . || 2 ( ( - &rho; i ) 2 + 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i || &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , || 2 ( ( &rho; i ) 2 - 2 d ^ i &times; &rho; i + ( d ^ i ) 2 - y + 2 s i T x - | | s i | | 2 ) y - 2 s i T x + | | s i | | 2 - &sigma; i 2 &times; &eta; i || &le; y - 2 s i T x + | | s i | | 2 + &sigma; i 2 &times; &eta; i , i = 1 , ... , N , y - 2 s i T x + | | s i | | 2 &le; &sigma; i 2 &times; &eta; i , i = 1 , ... , N , ( i f | d ^ i | &le; &rho; i ) , || 2 x y - 1 || &le; y + 1. Solve, obtain x, y, { η icorresponding estimated value, correspondence is designated as
2. the robust least squares localization method in a kind of unsynchronized wireless networks according to claim 1, is characterized in that a during described step 3. ivalue and b ithe deterministic process of value be:
3. N number of sensor that in the unsynchronized wireless networks tested, location information is known-1, is supposed;
3.-2, by jth ' individual sensor to i-th ' individual sensor send measuring-signal, calculate jth ' the measuring-signal of individual sensor emission through propagating arrival i-th ' individual sensor forward after transfer process again turn back to jth ' individual sensor time time point and jth ' individual sensor initial transmissions measuring-signal time the mistiming 2t of time point j', i'product with light velocity c, is designated as wherein, 1≤i'≤N, 1≤j'≤N, i' ≠ j';
-3 3. the positional information, according to N number of sensor, calculates the actual distance between jth ' individual sensor and i-th ' individual sensor, is designated as d j', i'; Then calculate jth ' effective transmission distance in the measuring-signal of the individual sensor emission connecting time through propagating arrival i-th ' individual sensor after i-th ' individual sensor, be designated as d t, j', i',
-4 3., from N number of sensor a selected sensor arbitrarily, suppose the sensor selected be i-th ' individual sensor, then make a i=min (d t, j', i'| 1≤j'≤N, j' ≠ i'), and make b i=max (d t, j', i'| 1≤j'≤N, j' ≠ i'), wherein, min () is for getting minimum value function, and max () is for getting max function.
CN201510740797.3A 2015-11-04 2015-11-04 A kind of robust least squares localization method in unsynchronized wireless networks Active CN105425206B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510740797.3A CN105425206B (en) 2015-11-04 2015-11-04 A kind of robust least squares localization method in unsynchronized wireless networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510740797.3A CN105425206B (en) 2015-11-04 2015-11-04 A kind of robust least squares localization method in unsynchronized wireless networks

Publications (2)

Publication Number Publication Date
CN105425206A true CN105425206A (en) 2016-03-23
CN105425206B CN105425206B (en) 2017-09-05

Family

ID=55503534

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510740797.3A Active CN105425206B (en) 2015-11-04 2015-11-04 A kind of robust least squares localization method in unsynchronized wireless networks

Country Status (1)

Country Link
CN (1) CN105425206B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106842121A (en) * 2016-11-07 2017-06-13 宁波大学 Sighting distance and the robust position location method based on reaching time-difference in non line of sight hybird environment
CN106950534A (en) * 2017-02-27 2017-07-14 广东小天才科技有限公司 Spatial position detection method and system and VR (virtual reality) wearable equipment
CN107271956A (en) * 2017-04-24 2017-10-20 宁波大学 The localization method based on arrival time of unknown initial time in nlos environment
CN107367709A (en) * 2017-06-05 2017-11-21 宁波大学 Arrival time robust weighted least-squares localization method is based in hybird environment
CN107765216A (en) * 2017-08-29 2018-03-06 宁波大学 Target location and timing parameter combined estimation method in unsynchronized wireless networks
CN110850366A (en) * 2019-10-31 2020-02-28 宁波大学 Positioning method based on received signal strength under mixed line-of-sight and non-line-of-sight environment

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03122582A (en) * 1989-10-05 1991-05-24 Mitsubishi Electric Corp Tracking apparatus
CN1215474A (en) * 1997-01-31 1999-04-28 摩托罗拉公司 Method and apparatus for covariance matrix estimation in a weighted least-squares location solution
WO2000075681A1 (en) * 1999-06-09 2000-12-14 Honeywell Inc. Narrowband based navigation scheme
CN101680940A (en) * 2007-04-13 2010-03-24 长联通讯技术公司 Determine that based on weighted least-squares estimation the geographic position of tellurian transmitter separates
CN103245941A (en) * 2013-04-16 2013-08-14 哈尔滨工程大学 Robust beam forming method based on robust least-square
CN104820204A (en) * 2015-04-13 2015-08-05 宁波大学 Weighted least square positioning method with reduced deviation

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03122582A (en) * 1989-10-05 1991-05-24 Mitsubishi Electric Corp Tracking apparatus
CN1215474A (en) * 1997-01-31 1999-04-28 摩托罗拉公司 Method and apparatus for covariance matrix estimation in a weighted least-squares location solution
WO2000075681A1 (en) * 1999-06-09 2000-12-14 Honeywell Inc. Narrowband based navigation scheme
CN101680940A (en) * 2007-04-13 2010-03-24 长联通讯技术公司 Determine that based on weighted least-squares estimation the geographic position of tellurian transmitter separates
CN103245941A (en) * 2013-04-16 2013-08-14 哈尔滨工程大学 Robust beam forming method based on robust least-square
CN104820204A (en) * 2015-04-13 2015-08-05 宁波大学 Weighted least square positioning method with reduced deviation

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
G WANG等: ""Second-order cone relaxation for TOA-Based source localization with unknown start transmission time"", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 *
SHENGJIN ZHANG等: ""Robust NLOS error mitigation method for TOA-Based localization via second-order cone relaxation"", 《IEEE COMMUNICATIONS LETTERS》 *
王刚: ""无线传感器网络中定位与跟踪算法的研究"", 《中国博士学位论文全文数据库信息科技辑》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106842121A (en) * 2016-11-07 2017-06-13 宁波大学 Sighting distance and the robust position location method based on reaching time-difference in non line of sight hybird environment
CN106950534A (en) * 2017-02-27 2017-07-14 广东小天才科技有限公司 Spatial position detection method and system and VR (virtual reality) wearable equipment
CN106950534B (en) * 2017-02-27 2020-07-03 广东小天才科技有限公司 Spatial position detection method and system and VR (virtual reality) wearable equipment
CN107271956A (en) * 2017-04-24 2017-10-20 宁波大学 The localization method based on arrival time of unknown initial time in nlos environment
CN107367709A (en) * 2017-06-05 2017-11-21 宁波大学 Arrival time robust weighted least-squares localization method is based in hybird environment
CN107765216A (en) * 2017-08-29 2018-03-06 宁波大学 Target location and timing parameter combined estimation method in unsynchronized wireless networks
CN107765216B (en) * 2017-08-29 2019-10-25 宁波大学 Target position and timing parameter combined estimation method in unsynchronized wireless networks
CN110850366A (en) * 2019-10-31 2020-02-28 宁波大学 Positioning method based on received signal strength under mixed line-of-sight and non-line-of-sight environment
CN110850366B (en) * 2019-10-31 2021-07-16 宁波大学 Positioning method based on received signal strength under mixed line-of-sight and non-line-of-sight environment

Also Published As

Publication number Publication date
CN105425206B (en) 2017-09-05

Similar Documents

Publication Publication Date Title
CN105425206A (en) Steady least square positioning method in nonsynchronous wireless network
CN108668358B (en) Arrival time-based cooperative positioning method applied to wireless sensor network
CN105334495B (en) A kind of non line of sight robust position location method based on time of arrival (toa) in wireless network
CN107690184A (en) Joint TDOA AOA wireless sensor network Semidefinite Programming localization methods
EP2817652B1 (en) Method and system for simultaneous receiver calibration and object localisation for multilateration
CN110673089B (en) Positioning method based on arrival time under unknown line-of-sight and non-line-of-sight distribution condition
CN105607039A (en) Robust least square positioning method based on arrival time difference in non line of sight (NLOS) environment
CN106446422A (en) Log likelihood estimation based novel passive locating and tracking method
CN103376447A (en) Method for achieving three-dimension positioning of non-cooperative double multistatic radar target
CN105353351A (en) Improved positioning method based on multi-beacon arrival time differences
CN102196559A (en) Method for eliminating channel delay errors based on TDOA (time difference of arrival) positioning
CN107576936A (en) A kind of method for removing broadband noise interference signal cross bearing False Intersection Points
CN103152826A (en) Moving target tracking method based on NLOS (non line of sight) state inspection compensation
CN109581281A (en) Moving objects location method based on reaching time-difference and arrival rate difference
CN107367709A (en) Arrival time robust weighted least-squares localization method is based in hybird environment
CN104820204A (en) Weighted least square positioning method with reduced deviation
CN106851821A (en) A kind of indoor 3-D positioning method based on radio communication base station
CN103558602A (en) Simulated annealing locating method for multi-base sonar configuration mode
CN110662163A (en) RSS (really simple syndication) and AOA (automatic optical inspection) based three-dimensional wireless sensor network cooperative positioning method
CN107765216B (en) Target position and timing parameter combined estimation method in unsynchronized wireless networks
CN111157943A (en) TOA-based sensor position error suppression method in asynchronous network
Huang et al. Analysis of TOA localization with heteroscedastic noises
CN104363649A (en) UKF (unscented Kalman filter)-based WSN (wireless sensor network) node location method with constraint conditions
CN114585082B (en) Wireless positioning method, device and storage medium of electric power Internet of things equipment
CN105866811A (en) Double-star positioning method based on ground cooperation signal

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant