(en)A method for sensor operation includes deploying a network of sensors ( 22 ), which have respective clocks ( 36 ) that are not mutually synchronized. At least a group of the sensors receive respective signals emitted from each of a plurality of sources ( 24, 26 ), and record respective times of arrival of the signals at the sensors according to the respective clocks. Location information is provided, including respective sensor locations of the sensors. The respective clocks are synchronized based on the recorded times of arrival and on the location information. In the process the sources may be localized, or if the sources are far away, then their directions may be resolved. Sensor positions may also be resolved in the process.

1.ApplicationNumber: US-201314388808-A
1.PublishNumber: US-2015092766-A1
2.Date Publish: 20150402
3.Inventor: JEAN OREN
WEISS ANTHONY JOSEPH

4.Inventor Harmonized: JEAN OREN(IL)
WEISS ANTHONY JOSEPH(IL)

5.Country: US
6.Claims:
(en)A method for sensor operation includes deploying a network of sensors ( 22 ), which have respective clocks ( 36 ) that are not mutually synchronized. At least a group of the sensors receive respective signals emitted from each of a plurality of sources ( 24, 26 ), and record respective times of arrival of the signals at the sensors according to the respective clocks. Location information is provided, including respective sensor locations of the sensors. The respective clocks are synchronized based on the recorded times of arrival and on the location information. In the process the sources may be localized, or if the sources are far away, then their directions may be resolved. Sensor positions may also be resolved in the process.

7.Description:
(en)CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims the benefit of U.S. Provisional Patent Application 61/617,186, filed Mar. 29, 2012, and of U.S. Provisional Patent Application 61/755,485, filed Jan. 23, 2013, both of which are incorporated herein by reference.


FIELD OF THE INVENTION
The present invention relates generally to sensor networks, and particularly to methods and systems for synchronization, localization and navigation using sensor networks.
BACKGROUND
Source localization systems based on Time of Arrival (TOA) are used to locate emitters or reflectors using sensors distributed in an area of interest. The area can be as large as the earth (as in Global Satellite Navigation Systems, GNSS, including the well-known GPS) to very small, such as a room in an office building. Each sensor typically receives signals from emitters in its range, records the times of arrival of the signals, and then reports the results to a computer (at a single location or distributed), which constructs an estimation of the emitter locations. In many systems, the signals are processed to produce Differential Time of Arrival (DTOA) measurements, based on the differences between times of arrival of a signal at different locations. For convenience in the description that follows and in the claims, the term “TOA” is used generically to refer to all forms of measurement of signal times of arrival, including DTOA, unless specifically indicated otherwise. The term “emitter” is used generically to refer to all forms of point energy sources, including bodies that reflect energy.
Sensor synchronization is a key factor in the ability of the computer to find the emitter locations. Synchronization may be maintained by equipping each sensor with a very accurate clock (such as an atomic clock) or a GPS receiver, but these solutions are costly, pose hard constraints on system design, and require extra electrical power. In some systems, synchronization is maintained by two-way messaging or two-way TOA ranging between the sensors, but these approaches also increase the cost, complexity and power consumption of the sensors.
Critical infrastructures such as wireless communication networks, stock trading systems, smart power grids, airport landing guiding systems, and digital broadcast networks, are heavily dependent on GNSS signals for time and positioning. Since the GNSS signal is weak, however, even the smallest jammer can do significant damage to infrastructure, and many jamming events are detected daily around the world. Furthermore, if the operator of the GNSS constellation chooses to shut down its services (or perhaps limit them to certain authorized military users, for example), GNSS-dependent infrastructures will fail.
SUMMARY
Embodiments of the present invention that are described hereinbelow provide methods and systems that use measurements made by a network of unsynchronized sensors to perform accurate synchronization of the sensor clocks, as well as localization and navigation using this sort of synchronization.
There is therefore provided, in accordance with an embodiment of the present invention, a method for sensor operation, which includes deploying a network of sensors, the sensors having respective clocks that are not mutually synchronized. At least a group of the sensors receive respective signals emitted from each of a plurality of sources, and record respective times of arrival of the signals at the sensors according to the respective clocks. Location information is provided, including respective sensor locations of the sensors. The respective clocks are synchronized based on the recorded times of arrival and on the location information.
In a disclosed embodiment, synchronizing the respective clocks includes estimating offsets and skews between the respective clocks.
The method may also include computing the source locations based on the sensor locations and the recorded times of arrival. In a disclosed embodiment, computing the source locations includes applying an estimator to a set of equations relating the recorded times of arrival and the source and sensor locations. Applying the maximum likelihood estimator may include applying an iterative optimization process to the set of the equations, wherein the optimization process derives a set of linear constraints on offsets and skews of the respective clocks based on the received signals. Additionally or alternatively, applying the iterative optimization process includes performing a convex optimization using maximum volume inscribed ellipsoid centering.
In one embodiment, the method includes detecting a fault in the network of the sensors based on the location information and the recorded times of arrival.
Typically, receiving the respective signals includes receiving radio signals, wherein the sources may include at least one satellite source, or possibly three or more satellite sources. Alternatively, the plurality of the sources may include the at least one satellite source and at least one terrestrial source. Synchronizing the respective clocks may then include using the times of arrival of the respective signals emitted from only a single satellite source and a single terrestrial source in order to synchronize the respective clocks of the sensors.
In some embodiments, the method includes finding a location of the at least one terrestrial source based on the recorded times of arrival and/or finding a direction of the at least one satellite source based on the recorded times of arrival.
Typically, the at least one satellite source is not a Global Satellite Navigation Systems (GNSS) satellite. Synchronizing the respective clocks may include detecting an attempt to spoof a satellite source, and discarding the signals received from the spoofed satellite source.
In a disclosed embodiment, synchronizing the respective clocks includes applying an orthogonal decomposition to a measurement space of the satellites.
Additionally or alternatively, receiving the respective signals includes, upon detecting a loss of signal from one of the sources, selecting a new source, and recording the respective times of arrival of the signals from the new source.
In one embodiment, the method includes navigating based on the recorded times of arrival and the location information.
In another embodiment, the sensors are associated with respective computers, and the method includes synchronizing operation of the computers based on synchronization of the respective clocks.
In an alternative embodiment, receiving the respective signals includes receiving acoustic signals.
There is also provided, in accordance with an embodiment of the present invention, a method for transmitter operation, which includes deploying a network of sources, having respective clocks that are not mutually synchronized. At least a group of the sources transmit, at times determined according to the respective clocks, respective signals, which are received by a plurality of sensors, and record respective times of arrival of the signals at the sensors. Location information is provided, including respective source locations of the sources. The respective clocks are synchronized based on the recorded times of arrival and on the location information. The sensors may be located accordingly.
In one embodiment, the network of sources includes base stations in a cellular communications network, and the sensors include user equipment in the cellular communications network, and synchronizing the respective clocks includes synchronizing operation of the base stations based on the signals received by the user equipment.
There is additionally provided, in accordance with an embodiment of the present invention, a method for sensor operation, which includes deploying a network of sensors, the sensors having respective clocks that are not mutually synchronized. At least a group of the sensors receive respective signals emitted from each of a plurality of sources, and record respective times of arrival of the signals at the sensors according to the respective clocks. Location information is provided, including respective sensor locations of the sensors. The source locations are computed based on the recorded times of arrival and on the location information.
There is further provided, a network system, including a network of sensors, which include respective clocks that are not mutually synchronized, and which are configured to receive, in at least a group of the sensors, respective signals emitted from each of a plurality of sources, and to record respective times of arrival of the signals at the sensors according to the respective clocks. A processor is configured to process the recorded times of arrival, using location information including respective sensor locations of the sensors, so as to synchronize the respective clocks.
There is moreover provided, in accordance with an embodiment of the present invention, processing apparatus, including a communications interface, which is configured to receive, from at least a group of sensors in a network of the sensors, which have respective clocks that are not mutually synchronized, times of arrival recorded by the sensors according to the respective clocks of signals emitted respectively from each of a plurality of sources. A processor is configured to process the recorded times of arrival, using location information including respective sensor locations of the sensors, so as to synchronize the respective clocks.
There is furthermore provided, in accordance with an embodiment of the present invention, a computer software product, including a non-transient computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive, from at least a group of sensors in a network of the sensors, which have respective clocks that are not mutually synchronized, times of arrival recorded by the sensors according to the respective clocks of signals emitted respectively from each of a plurality of sources, and to process the recorded times of arrival, using location information including respective sensor locations of the sensors, so as to synchronize the respective clocks.
Other embodiments provide systems, apparatus and software products that operate in accordance with the other methods laid out above.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram that schematically illustrates a sensor network, in accordance with an embodiment of the present invention;
FIG. 2 is a block diagram that schematically illustrates components of a sensor in the network of FIG. 1 ;
FIG. 3 is a block diagram that schematically illustrates components of a synchronization controller in the network of FIG. 1 ;
FIG. 4 is a flow chart that schematically illustrates a method for clock synchronization and localization in a sensor network, in accordance with an embodiment of the present invention;
FIG. 5 is a schematic, pictorial illustration of a navigation system based on a sensor network, in accordance with an embodiment of the present invention;
FIG. 6 is a schematic, pictorial illustration of a computer system with sensor-based synchronization, in accordance with an embodiment of the present invention; and
FIG. 7 is a schematic, pictorial illustration of a communication system with sensor-based synchronization, in accordance with an embodiment of the present invention.



DETAILED DESCRIPTION OF EMBODIMENTS
Overview
Embodiments of the present invention that are described herein derive accurate synchronization from networks of sensors, without requiring that the respective clocks of the sensors themselves be mutually synchronized. In the disclosed embodiments, a group of sensors receives respective signals emitted from multiple sources, which may be terrestrial, space-based (i.e., satellites), or a combination of the two. The sensors record the times of arrival of the signals at the sensor locations according to their respective, unsynchronized clocks.
A processor (which may be centralized or associated with one or more of the sensors) receives and uses the recorded times of arrival, together with known location information, to synchronize the sensor clocks. Typically, this known location information comprises the sensor locations, while the source locations are not known a priori, although some of the source locations may be known. “Synchronizing the clocks,” in the context of the present description and in the claims, typically means calculating the offsets and skews between the various unsynchronized sensor clocks, whether or not this synchronization is actually applied by the sensors themselves or only as a part of the computations performed by the processor. In some cases, some of the sensor clocks may be synchronized in advance, while others are not; and the term “synchronizing the clocks,” as used in the present description and in the claims includes cases in which only some of the clocks need be synchronized. As a by-product of the synchronization computation, the processor may also compute the hitherto-unknown source or sensor locations.
In alternative embodiments, the same methods of synchronization and localization may be applied, mutatis mutandis, to a network of unsynchronized emitters. Such techniques may be applied, for example, in synchronizing a cellular communication network, as explained in detail hereinbelow. For simplicity and clarity, the methods described below will refer in detail to the case of sensor synchronization, but the modification of these methods for emitter synchronization will be straightforward for those skilled in the art and is considered to be within the scope of the present invention.
The processor thus synchronizes and calibrates the time offsets and skews of the sensors (or, in alternative embodiments, the emitters) in the system passively, based only on the information that the sensors receive by wireless reception from source transmissions. As a result, the sensors can use inaccurate internal clocks and need only to be capable of measuring the time of arrival of the emitter signals relative to their own clocks and to relay this information to the processor. The sensors can thus be made small and inexpensive, while enjoying very low power consumption. The sources are not generally required to cooperate with the system in any way, thus allowing the use of sources of convenience—such as existing satellite or terrestrial sources, or very simple dedicated signal emitters—which operate in parallel without any interconnection.
Only limited location information need be known in advance for operation of the synchronization methods that are described herein. For example, the known locations (of the sensors or the sources) may be given in absolute terms or only relative to one another. Furthermore, if the locations of a certain number of the sensors (typically at least three) are already known, the remaining sensors can be located if they are allowed to transmit until their locations are estimated to the required accuracy. Alternatively, the sensors of unknown position can be considered navigators, and their positions and clock offsets can be resolved without necessarily ranging transmission on their part.
In some of the embodiments that are described hereinbelow, the processor carries out a process of estimation and optimization, such as maximum likelihood estimation, in order to compute both the offsets (and the skews if any) between the respective clocks and the unknown sensor locations. The possible values of the clock offsets and skews can be linearly constrained by the time of arrival measurements of the source signals. The clock offsets and skews and the unknown locations are estimated by applying an iterative optimization process to a set of equations and constraints relating the recorded times of arrival and the source and sensor locations. For terrestrial sources in particular, convex optimization using maximum volume inscribed ellipsoid centering has been found to give a good starting point for this estimation process. When satellite sources are present, the convex optimization can be replaced by other means, as described in detail hereinbelow.
Embodiments of the present invention are capable of operating with different numbers and configurations of terrestrial and/or satellite signal sources. For example, synchronization is possible in all of the following combinations:
Satellite sources only (at least three sources); Terrestrial sources (at least two, depending on the number of sensors); Combination of satellite and terrestrial sources (at least one of each, and only one of each is needed if at least six or seven sensors are used).

Synchronization can be improved by adding sources, as well as sensors. The actual positions of the satellite sources in the sky have only a second-order effect on synchronization and localization accuracy. In every embodiment in which a sensor network is synchronized, this synchronization can be used to localize terrestrial sources, as well as to find the direction of a satellite or navigate a sensor.


Precision of synchronization in sensor networks according to embodiments of the present invention is limited only by the available processing capability and the sensor position accuracy. The precision can be enhanced by increasing the bandwidth, signal/noise ratio, observation time and number of sources processed. The sensor positions may be determined by any suitable means known in the art, such as surveying, localization (if the sensors also transmit signals), or navigation by the methods described herein, assuming that the positions of certain sensors are known and can be used as a reference.
Embodiments of the present invention that use satellite sources of signals provide notable benefits over existing GNSS systems, which are prone to jamming, spoofing and limitations on availability, particularly in crowded urban areas. (Spoofing is the act of a malicious transmitter that transmits a signal mimicking the GNSS signal, causing GNSS receivers to output a different location and/or time from the actual location and/or time.) By contrast with GNSS systems, embodiments of the present invention are capable of exploiting signals from substantially any of the thousands of satellites that roam the heavens, and permit satellite signals to be chosen for this purpose arbitrarily, on the basis of convenience at the time of use. The set of satellite signals that is used may also be changed at any time if and when required, for example if one or more of the signals are lost. The disclosed embodiments provide techniques for satellite-based timing synchronization, localization and navigation that are more robust and less prone to jamming and spoofing than GNSS signals.
Unlike GNSS satellites, whose locations are precisely known and whose signals are tightly controlled, the exact orbital parameters of most satellites in space are not known to great accuracy. The signals they emit have different spectral characteristics and are typically unsynchronized with one another, and their transmission times are not known in advance to the receivers. Embodiments of the present invention overcome these limitations, while taking advantage of the superior geometrical diversity and availability of arbitrary satellite constellations relative to the GNSS constellations. These embodiments provide methods that use the radio-frequency (RF) signals received from the satellites at a network of terrestrial sensors to provide timing synchronization and navigation for a sensor in the area of such a network and provide a superior alternative to GNSS for critical operations. Because the sensors can choose any desired group of satellites, the network is largely immune to jamming, and spoofing can be detected easily due to the deviation of the spoofed signal from the normal signal model. For sensor networks that also process terrestrial signal sources (of known or unknown positions), the synchronization accuracy can be further improved by incorporating measurements of signals from terrestrial sources, such as broadcast signals or wireless user equipment or emitters localized by the system, in the synchronization process.
In some embodiments, localization accuracy finer than the RF carrier wavelength can be achieved, and carrier phase measurements may then be used to refine the location and synchronization estimates still further. Furthermore, the large number of different satellite signals (as well as terrestrial sources) received by the network can be used to derive a stable clock frequency in all of the sensors, thus enabling the sensors to use longer coherent integration times. One of the benefits of extending the coherent integration time is the ability to detect weak signals in high-attenuation environments, such as indoors.
In another embodiment, the methods described in the present patent application are used to estimate the direction (azimuth and elevation) of received satellite signals or other distant sources. These estimates can be applied in satellite orbital tracking, as well as ranging to the satellite when Doppler measurements are also available.
System Description
FIG. 1 is a block diagram that schematically illustrates a sensor network 20 , in accordance with an embodiment of the present invention. Sensors 22 (labeled S1, S2, S3, . . . ) are deployed at different, respective locations on a terrestrial surface 21 . The sensors receive RF signals transmitted by either terrestrial sources 24 (labeled T1, T2) or satellite sources 26 , or both. In some applications of network 20 , the locations of sensors 22 , or at least of some of the sensors, are known in advance, while the locations of sources 24 and/or 26 are not known a priori. In the description that follows, it will be assumed, for the sake of clarity and convenience, that it is the locations of sensors 22 that are known and used in synchronization and source localization; but the methods described below may be modified in a straightforward manner to perform synchronization and localization based on known source positions.
Sensors 22 are connected by a communication network 30 to a synchronization controller 28 , which processes TOA data that is measured and conveyed by the sensors over network 30 in order to perform synchronization, localization, and other related functions that are described herein. Network 30 may comprise any suitable sort of communication network that is known in the art. For example, network 30 may comprise a dedicated, wireline or wireless network. Alternatively or additionally, network 30 may comprise a public network, such as the Internet or a cellular communication network. Although controller 28 is shown and described here as a centralized unit, the functions of the controller may, additionally or alternatively, be performed in a centralized or distributed fashion by processors at different locations on network 30 , including processors that are coupled to and associated with one or more of sensors 22 . For purposes of the basic methods described below, it is sufficient that sensors 22 transmit their respective TOA data over network 30 to controller 28 , without return transmissions of any sort. Return transmission may be useful in some applications, however, for conveying control, synchronization and/or navigation information, for example, from controller 28 to sensors 22 .
Although sensor network 20 and the embodiments described hereinbelow operate on the basis of RF signals transmitted by sources 24 and 26 , in alternative embodiments (not shown in the figures), sensors 22 may receive and measure times of arrival of signals of other types. For example, sources 24 may comprise acoustic emitters, and sensors 22 may comprise acoustic receivers, which are used in localizing the emitters using the methods described below.
FIG. 2 is a block diagram that schematically shows components of sensor 22 , in accordance with an embodiment of the present invention. A receiver 32 receives and amplifies RF signals via an antenna 31 from sources 24 and/or 26 . A local processor 34 identifies the incoming signals and measures their times of arrival, based on clock signals provided by a local clock 36 . As noted earlier, the TOA measurements may be simple local measurements or differential (DTOA) measurements. Processor 34 transmits the TOA measurement results for the received signals from each of the relevant sources to controller 28 over network 30 via a communications interface 38 . Any suitable communication protocol, either standard or proprietary, may be used for this purpose.
As noted earlier, local clock 36 need not be particularly accurate and is generally not synchronized with the local clocks of other sensors. Any suitable sort of oscillator, as is known in the art, may thus be used in generating the clock signal according to which processor 34 makes its TOA measurements. If one or more of sensors 22 has access to absolute-time clock, then this information can be used to propagate the absolute time among the sensors in sensor network 20 after synchronization is established.
FIG. 3 is a block diagram that schematically shows details of synchronization controller 28 , in accordance with an embodiment of the present invention. Controller 28 receives TOA data over network 30 via a communication interface 40 . A processor 42 stores relevant data in a memory 44 , and computes synchronization and localization results as described hereinbelow. These results may be output via a user interface (UI) 46 , for example, or transmitted to sensors 22 or to other items of equipment via interface 40 .
Processor 42 and the other components of controller 28 may be parts of a general-purpose computer, which is programmed in software to carry out the functions that are described herein. This software may be downloaded to controller 28 in electronic form, over a network, for example. Alternatively or additionally, the software may be stored in a tangible, non-transitory computer-readable medium, such as optical, magnetic, or electronic memory (which may be incorporated in memory 44 ). Further alternatively or additionally, at least some of the functions of processor 42 may be carried out by dedicated or programmable hardware logic.
Methods of Operation
FIG. 4 is a flow chart that schematically illustrates a method for clock synchronization and localization in sensor network 20 , in accordance with an embodiment of the present invention. This method synchronizes and localizes a system of M sensors 22 and N sources 24 , 26 . Certain aspects will be described below initially with reference only to terrestrial sources 24 , and will then be expanded to handle satellite sources 26 , as well.
To begin the procedure, the clock offset vector and cost function values are initialized, at an initialization step 50 . In each iteration n, controller 28 estimates the location of each source t=1, 2, . . . , N based on the estimated clock offsets and the current value of the cost function, at a position estimation step 52 . Then, given the estimated source locations, controller 28 updates the clock offset estimates, at a clock update step 54 .
To determine whether the estimates have converged sufficiently to terminate the computation, controller 28 compares the new cost value to the cost value from the previous iteration, at a cost evaluation step 56 . Specifically, the controller may evaluate whether the change in cost since the previous iteration is less than a certain threshold. If not, n is incremented, and control returns to step 52 for a further iteration.
If the computation is found to have converged at step 56 , controller 28 synchronizes the clocks of sensors 22 based on the current value of the estimated clock offsets, at a synchronization step 58 . Depending on application requirements, the controller may either send actual synchronization values to the sensors, or it may simply record and apply appropriate corrections to the clock readings received from the sensors. The controller may also output or otherwise apply the current estimate of the source location values, at a location output step 60 .
In dealing with satellite sources, it is assumed that sensors 22 are sufficiently close together (typically not more than a few tens of kilometers apart) so that ionospheric and tropospheric effects on the satellite signals can be considered to be uniform. Otherwise, measurements should be corrected by tropospheric and ionospheric correction models or measurements. If the satellite signals occupy a large bandwidth or are scattered over a wide frequency band, the ionospheric correction can be estimated accurately, as is known in the art. Alternatively or additionally, comparison of signals may be limited to measurements from sets of sensors that are close to one another, thus allowing the entire sensor set to be deployed on a wider area.
The subsections that follow will demonstrate a number of different implementations of the method of FIG. 4 to synchronize the sensors:
First, methods using terrestrial sources assuming no skew at the sensor clocks. Second, methods for handling clock skew in the sensors using terrestrial sources. (Estimating the skew using such methods is unnecessary if satellite sources are present, as correcting the skew using such sources is straightforward. Finally methods for synchronizing the sensors using both satellite and terrestrial sources.

Note that each subsection has its own notation.


Localization and Passive Sensor Network Synchronization Using Terrestrial Sources—No Clock Skew
Consider M sensors and N sources. The s-th sensor has an internal clock offset denoted by δ S . We use sensor number 1 as a reference sensor and therefore we set δ 1 =0. Let m t (s) be the TOA measurement performed by the s-th sensor for the t-th source. Denote by q s , p t the known coordinates vector of the sensor and the unknown coordinates vector of the source, respectively. Let τ t be the unknown transmit time. Then








m
t

(
s
)


=



1
c






q
s

-

p
t





+

τ
t

+

δ
s

+

e
t

(
s
)







(
1.1
)







where e t S is a random measurement error with zero mean and a standard deviation of σ t (S) . Here, for reasons of clarity, we assume σ t (s) =σ t , or more precisely, the noise is assumed to be independent and identically distributed (i.i.d). Under this model the problem of self-synchronized localization can be defined as follows: Using all measurements m t (s) made by the sensor network estimate δ S , p t ∀s,t where s=1, 2, . . . M; t=1, 2, . . . N.
The self-synchronized localization problem, in a planar geometry, has 3N+M−1 unknowns: 2N unknown source coordinates, N unknown transmit times and M−1 sensor time offsets w.r.t. the reference sensor. If all sensors receive the signals of all the sources, we have MN TOA measurements. Thus, the problem is well posed if MN≧3N+M−1. Define the vectors associated with source t
m t [m t (1) , m t (2) . . . m t (M) ] T
r t [r t (1) , r t (2) . . . r t (M) ] T
r t (s) 1/ c∥q S −p t ∥

1 M [1, 1, . . . 1] T
δ [δ 1 , δ 2 . . . δ M ] T

e t [e t (1) , e t (2) . . . e t (M) ] T .
Using the above definitions the measurements defined in (1.1) become,
m t =r t +1 M τ t +δ+e t . (1.2)

When the error vector is Gaussian i.i.d the Maximum Likelihood cost function is







Q




∑

t
=
1

N








m
t

-

r
t

-


1
M



τ
t


-
δ



2

.






(
1.3
)







The cost function is minimized w.r.t. the time offsets by









τ
^

t

=




(


1
M
T



1
M


)


-
1




1
M
T



(


m
t

-

r
t

-
δ

)


=


1
M



1
M
T




(


m
t

-

r
t

-
δ

)

.







(
1.4
)







Substituting this result back in (1.3) yields










Q
=




∑

t
=
1

N







(


I
M

-


1
M



1
M



1
M
T



)



(


m
t

-

r
t

-
δ

)




2








=




∑

t
=
1

N






B


(


m
t

-

r
t

-
δ

)




2









=




∑

t
=
1

N






(



m
~

t

-


r
~

t

-

δ
~


)



2



,







(
1.5
)





where












B



I
M


-


1
M



1
M



1
M
T












m
~

t




Bm
t











r
~

t




Br
t










δ
~



B






δ
.






(
1.6
)







Collecting all vectors for t=1, 2, . . . , N we get
m [{tilde over (m)} 1 T , m 2 T . . . m N T ] T
r [{tilde over (r)} 1 T , {tilde over (r)} 2 T . . . {tilde over (r)} N T ] T
e [{tilde over (e)} 1 T , {tilde over (e)} 2 T . . . {tilde over (e)} N T ] T
C [I M , I M . . . I M ] T . (1.7)

Thus, the cost function for minimization is now
Q=μm−r−C{tilde over (δ)}∥ 2 (1.8)

The minimum w.r.t. {tilde over (δ)} is obtained for








δ

~
^


=




(


C
T


C

)


-
1





C
T



(

m
-
r

)



=


1
N




C
T



(

m
-
r

)








(
1.9
)







Substituting back in (1.8) we get








Q
=





[

I
-


1
N



CC
T



]



(

m
-
r

)




2


,




(
1.10
)







Thus, the search is “only” over {P t } t=1 N (2N unknowns). To ensure that the number of equations is not smaller than the number of unknowns, at least two sources and five sensors are required. Thus, solving the above equation for two sources requires a search within a four-dimensional space.
Iterative MLE
Reconsider equation (1.5) and note that if δ is given the cost function is separable into independent components, one for each source. This enables us to locate each source separately, given the assumed δ vector. Therefore, the problem can be solved by successive optimization of two-dimensional problems. Using this fact, we can devise the following iterative algorithm for the estimation of the clock offsets and the sources position:
1. Initialize: δ (0) ←0; Q (−1) ←inf; n←0
2. Q (n) ←0
3. For each source t=1, 2, . . . , N:
(a) Estimate p t given δ (n) using equation (1.5) (b) Q (n) ←Q (n) +∥({tilde over (m)} t −{tilde over ({circumflex over (r)} t −{tilde over (δ)} (n) )∥ 2






4.








δ
~


(

n
+
1

)




1
N





C
T



(

m
-
r

)



;

See






eq
.





(
1.9
)

.






5. If Q Δ (n) =|Q (n) −Q (n−1) |<ε then stop
6. Else n←n+1, go to step 2
Note that if the position of one source is known, then the clock offsets of the sensors that sense it can be estimated directly at the accuracy of the raw measurement. Additional refinement can then be achieved by using that estimation as the initial guess for the δ vector. A possible source with known location can be a sensor that is also allowed to transmit.
The above algorithm can be used for network-wide synchronization and localization as long as the number of measurements is not smaller than the number of unknowns.
Synchronization by Convex Optimization
Define the M (M−1)/2×M difference matrix, D, where each row consists of a single 1, a single −1 and zeros, such that Dm t is the vector whose entries are all the possible differences of the entries of m t . Define δ′ such that, δ=[0 δ′ T ] T and {tilde over (D)} as the difference matrix, D, with the first column omitted. Applying D to both side of equation (1.2) we get











Dm
t

=




Dr
t

+

D





δ

+

De
t









=




Dr
t

+


D
~



δ
′


+

De
t



,







(
1.11
)







since D1 M =0, and δ 1 =0 by definition. Note that Dr t is the vector holding all possible Time Difference of Arrival (TDOA) measurements. Using the triangle inequality we have |r t (i) −r t (j) |<d (i,j) , where d (i,j) is the distance between sensor i and sensor j. Collecting all possible pairs, (i, j), the triangle inequality becomes the component wise inequality −d Dr t d, where d is a vector whose entries are d (i,j) . Applying this result to (1.11) we get,



{tilde over (D)}δ′

Dm
t
−De
t
+d


− {tilde over (D)}δ′ −Dm t +De t +d. (1.12)

The set of δ′ vectors satisfying the above constraints form a polyhedron in M-1 space.
Assuming that De t is negligible, one can find a δ vector that satisfies the constraints by solving the Linear Programming (LP) feasibility problem:
Program 1.1 Clock Offset Feasibility Test
Find: δ
Subject to: ±{tilde over (D)}δ′ ±Dm t +d, t=1, . . . , N
This problem will return an arbitrary point in the feasible set defined by the constraints. A center point in the set would be favorable since its distance to the real vector will be on average less than any point on the boundary. One way of getting a center point of the polyhedron is finding the Maximum Volume Inscribed Ellipsoid (MVIE), which finds the center coordinates δ′ C of the biggest ellipsoid s defined as:
ε={ Gu+δ′ c |∥u ∥≦ 1 , uε M-1 , GεS M-1 ++ } (1.13)

that can fit inside of the polyhedron defined by the constraints. Here S M-1 ++ stands for positive definite M−1×M−1 symmetric matrix. Then the centering program is defined by:
Program 1.2 Maximum Volume Inscribed Ellipsoid Centering on Clock Offsets
Minimize: log det G −1
Subject to: ∥Ga i T ∥+a i δ′ c ≦b t i
t=1, . . . , N; i=1, . . . , M(M−1)

Where:
A=[{tilde over (D)} T −{tilde over (D)} T ] T
b t =[( Dm t +d ) T ( −Dm t +d ) T ] T (1.14)

a i is the i-th row of A, and b t i is the i-th element of b t . Note that this optimization problem also returns G, which describes the maximal volume ellipsoid shape. We will use G T G as a covariance matrix approximation for the estimation error of δ′.
The measure of uncertainty of the estimation of the 5 vector is useful in a number of ways. As noted earlier, given a source of known location, the clock offsets are readily found at raw measurement accuracy. Therefore, if we have a subset of more than three clock offsets estimates with high certainty, we can get a good source position estimation and thus a high-certainty estimation of the clock offsets for all the sensors that received a transmission from this source.
When the noise is significant we cannot discard the term De t from the constraints in (1.12). If we collect all the constraints related to a given sensor pair we get:
δ i −δ j ≦min({ D (i,j) m t −D (i,j) e t +d (i,j) } t=1 N )

δ i −δ j ≧max({ D (i,j) m t −D (i,j) e t −d (i,j) } t=1 N )

where D (i,j) is the row in D that relates to the i, j delta pair. The measurement error vector, e t , is unknown. We can ignore the measurement error and still use the min and max operators, but this approach will result in large errors.
Instead, we introduce a function that encourages small errors, the Pseudo-Likelihood function, which provides the likelihood of a value of Δ ij δ i −δ j given the constraints imposed on d (i,j) for each sensor pair using all measurements made by the pair. The Pseudo-Likelihood function ƒΔ ij of Δ ij is defined by





M
t

(

i
,
j

)






min
2



(





m
t

(
i
)


-

m
t

(
j
)


-

(

x
+

d

(

i
,
j

)



)




,




m
t

(
i
)


-

m
t

(
j
)


-

(

x
-

d

(

i
,
j

)



)





)









L
t

(

i
,
j

)





{




1




if








x
-

(


m
t

(
i
)


-

m
t

(
j
)



)





<

d

(

i
,
j

)








exp


{

-


M
t

(

i
,
j

)



4


σ
2




}




otherwise











f

Δ
ij




(
x
)







∏

t
∈

T
ij





L
t

(

i
,
j

)





∫

-
∞

∞




∏

t
∈

T
ij





L
t

(

i
,
j

)











where T ij is the set of sources that were measured by both sensor i and sensor j, which here include all sources.
Using the pseudo-likelihood function we can obtain the pseudo-probability that Δ ij ε(l ij , h ij ). We select Δε(l ij , h ij ) so that Δ ij is within the interval with pseudo-probability 1−α. Since the pseudo-likelihood is normalized, it has the properties of a probability density function, therefore:






∫

l
ij


h
ij






f

Δ
ij




(
x
)





x



=

1
-
α





As there is a degree of freedom in the choice of l ij and h ij , these elements will be chosen such that ∥h ij −l ij ∥ is minimized.
When noise is introduced, the ML estimator is such that it is not necessary to estimate the full δ vector, but only its projection Bδ. Estimating Bδ cannot be achieved directly by using MVIE since the domain of Bδ has M−1 non-singular dimensions, making its volume in M always zero for any set of constraints. Therefore any inscribed ellipsoid volume will always be zero, making any volume maximization impossible. To overcome this limitation, we apply the MVIE only to the projection subspace defined by B. This subspace is the span of the eigenvectors of B corresponding to the unity eigenvalues.
We define the matrix V, whose columns are the eigenvectors of B whose corresponding eigenvalues are different from zero. Collecting the likelihood functions ƒΔ ij for all i, j, we can derive an estimate for the Bδ vector using MVIE centering. Estimating the Bδ vector using MVIE centering under the constraints imposed by the pseudo-likelihood measure and its inherent singularity requires a modification of Program 1.2:
Program 1.3 Maximum Volume Inscribed Ellipsoid Centering on Clock Offsets Under Pseudo-Likelihood Imposed Bounds
Minimize: log det G −1
Subject to: ∥Ga i T ∥+a i {tilde over (δ)}′ c ≦b i
i=1, . . . , M(M−1)

Return: {tilde over (δ)} c ←v{tilde over (δ)}′ c
{tilde over (G)}←VGV T

Where:
A=[v T D T −v T D T ] T
b=[h Δ T (α) l Δ T (α)] T (1.15)

b i is the i-th element of b; h Δ T (α) and l Δ T (α) are the upper and lower bound vectors imposed by α, via the pseudo-likelihood function on all delta pairs; {tilde over (δ)} c is the MVIE estimate of Bδ; and {tilde over (G)} describes the uncertainty ellipsoid of the estimation.
Note that A in Program 1.3 is not sparse. If δ′ c were to be estimated using the MVIE instead of {tilde over (δ)}′ c , then A would be sparse, and would therefore enable lower complexity computation without loss of accuracy.
If Program 1.3 returns the non-feasible token, then the value of a is decreased, and the solution is repeated.
MVIE gives an initial estimation of the target position by embedding the estimated vector in the source measurement model, which gives:
Bm t =B ( r t +e t )+δ c +e{tilde over (δ)} c (1.16)

where e {tilde over (δ)} c is the MVIE estimation error of {tilde over (δ)}. If we model the MVIE estimation error as an independent noise with the covariance matrix G T G, then the initial source position estimate can be found by solving the following weighted least squares (WLS) optimization problem:








argmin


x
t

,

y
t





(


B


(


m
t

-

r
t


)


-


δ
~

c


)


T




Σ
†



(


B


(


m
t

-

r
t


)


-


δ
~

c


)



)




where Σ=G T G+Bσ t 2 , and σ t 2 is the measurement noise variance of the source. After locating all of the sources using the above estimator, the computation can jump to step 4 of the iterative ML algorithm presented above and continue iterating until convergence is achieved. Two other possible ways to proceed are
1. Perform gradient ascent on the full ML cost using the MVIE as the initial guess; 2. Use the MVIE initial estimate as the a priori information in maximum a posteriori estimation (MAP).

Using G T G as a covariance matrix is conservative, since it describes the ellipsoid within which the clock offsets vector almost always lie. Therefore adding a constant factor to the matrix to convert it from a certainty ellipsoid to a covariance matrix is appropriate. Defining the constant factor as κ>1, the covariance matrix for the MVIE clock offset estimation is







G
T


G

κ

.




Methods are known in the art for computing K to convert certainty ellipsoid to a covariance matrix of a multi-variate normal distribution, but K can also be determined empirically.
The MVIE/ML estimator performs well under the imposed constraints. The MVIE/ML estimator even after only one ML iteration comes very close to the converged ML performance. This feature makes the combined MVIE/ML estimator very attractive in terms of processing time. Comparing the results of the combined MVIE/ML estimator to the known clock offset case, we observe that even in the first iteration, the penalty of not knowing the clock offsets is not very large. Moreover, even when σ n is on the order of the distance between the sensors (which is a highly nonlinear configuration), the MVIE/ML estimator converges successfully. Moreover the MVIE can also be used as a priori information in a MAP estimator.
To simplify the description above, it was assumed that all sensors intercept all the sources. It is straightforward to extend the above results to the more general case.
Note also that the ML estimator cannot use measurements of sources that are received by three sensors or less, but MVIE can.
One further point to note is that clock bias is actually the measurement bias, meaning that it contains any propagation delays inside of the sensor. For example, a sensor that has an antenna connected with a long cable will include the cable propagation time as part of the bias. In sensing systems, this effect should generally be calibrated. The method described above provides sensor self-calibration of such delays.
2D Bounds on DTOA Measurements
In the previous section, the MVIE used constraints based on measurements of a source by a pair of sensors. This section will present constraints based on measurements of a source by a sensor triplet. Methods to incorporate these constraints into the MVIE will also be introduced.
Let there be three sensors with position coordinates q i . Set direction vectors v ij as:
v =q j −q i (2.1)

Define two angles:
α ∠( v 01 ,v 02 )

β ∠( v 12 ,−v 01 ) (2.2)

where the convention is that for vectors μ, ν the angle ∠(μ, ν) is positive if the ν direction is restored by counterclockwise rotation of μ by less than a π rad turn. The noiseless DTOA measurement made by a pair sensors on a target positioned at p is defined, in metric units, as:
ψ ij ( p )=∥ p−q j ∥−∥p−q i ∥ (2.3)

Measurement space is defined as the R 2 space (ψ 01 , ψ 02 ) A nine-segment {u i } i=0 8 path in space is established to map to the bound in measurement space. The path will traverse the plane spanned by vectors v 01 , v 02 , as follows:
u 0 ( t 0 )= q 0 −t 0 v 01
u 1 ( t 1 )= q 0 −t 1 v 02
u 2 ( t 2 )= q 1 +t 2 v 01
u 3 ( t 3 )= q 1 −t 3 v 12
u 4 ( t 4 )= q 2 +t 4 v 02
u 5 ( t 5 )= q 2 +t 5 v 12
u 6 (φ 0 )= q 0 +rT (φ 0 ) v 01 , φ 0 ε[0, α]

u 7 (φ 1 )= q O +rT (φ 1 ) v 01 , φ 1 ε[π−β, π]

u 8 (φ 2 )= q 0 +rT (φ 2 ) v 01 , φ 2 ε[π+α, 2π−β]

t i >0, ∀ i (2.4)

where r goes to infinity, and T(φ) is the rotation matrix for a counter clock wise rotation of φ degrees.
Traveling the path segments in space translates to the following path in measurement space:
h 0 ( l 0 )= l 0 [|v 01 |, |v 02 |] T +(1− l 0 )[| v 01 |, |v 02 |cos(α−π)] T

h 1 ( l 1 )= l 1 [|v 01 |, |v 02 |] T +(1− l 1 )[| v 01 |cos(π+α), | v 02 |] T

h 2 ( l 2 )= l 2 [−|v 01 |, |v 12 |−|v 01 |] T +(1− l 2 )[−| v 01 |, −|v 02 |cos α]

h 3 ( l 3 )= l 3 [−|v 01 |, |v 12 |−|v 01 |] T +(1− l 3 )[−| v 01 |cos β, −| v 02 |cos(α+β)] T

h 4 ( l 4 )= l 4 [|v 12 |−|v 02 |, −|v 02 |] T +(1− l 4 )[−| v 01 |cos α, −| v 02 |] T

h 5 ( l 5 )= l 5 [|v 12 |−|v 02 |, −|v 02 |] T +(1− l 5 )[| v 01 |cos β, | v 02 |cos(α+β)] T

l i ε[0,1]∀ i

h 6 (φ 0 )=−[| v 01 |cos φ 0 , |v 02 |cos(α−φ 0 )] T

φ 0 ε[0,α]

h 7 (φ 1 )=−[| v 01 |cos φ 1 , |v 02 |cos(α−φ 1 )] T

φ 1 ε[π−β, π]

h 8 (φ 2 )=−[| v 01 |cos φ 2 , |v 02 |cos(α−φ 2 )] T

φ 2 ε[π+α,2π−β] (2.5)

The elementary bound, derived from the triangle inequality, −|ν ij |≦ψ ij ≦|ν ij |, is directly responsible for the linear part of the bounding path. Therefore the additional information gained by considering two-dimensional bounds is found in the nonlinear part of the bounding path (namely h 6,7,8 ).
To avoid the complexity of incorporating the nonlinear bound in the convex optimization described above, it is possible to find the tangents to the nonlinear part of the bound. Each tangent will act as a half-space bound on the offset values. The more tangents we use, the tighter the bound will be, but at the cost of greater complexity.
Bound Tangents
The nonlinear part of the bound is composed of three sections of the ellipse:
ψ 02 =−|ν 02 |cos(α−φ)

ψ 01 =−ν 01 |cos(φ)

φε[0, α]∪[π−β, π]∪[+α, 2π−β] (2.6)

Taking the partial derivative of ψ 01 and ψ 02 by φ gives:










∂

ψ
02



∂
ϕ


=


-



v
02






sin


(

α
-
ϕ

)













∂

ψ
01



∂
ϕ


=




v
01





sin


(
ϕ
)








(
2.7
)







Dividing the two expressions results in:










∂

ψ
02



∂

ψ
01






ϕ


=

-





v
02





sin


(

α
-
ϕ

)







v
01





sin


(
ϕ
)









(
2.8
)







The tangent equation is then:











ψ
02

=




ψ
02




ϕ





+

(



ψ
01

-

ψ
01





ϕ


)





∂

ψ
02



∂

ψ
01







ϕ









=





-



v
02






(


cos


(

α
-
ϕ

)


+


sin


(

α
-
ϕ

)



tan





ϕ



)


-






v
02





sin


(

α
-
ϕ

)







v
01





sin


(
ϕ
)






ψ
01















q
0



(
ϕ
)



+



q
1



(
ϕ
)





ψ
01

.









(
2.9
)







As noted above, there are three segments of the ellipse that are part of the bound. We take K tangents for each segment, evenly spaced in terms of φ so that:









h
6

:

ϕ
∈


{


α





k


K
+
1


}


k
=
1

K











h
7

:

ϕ
∈


{

π
-
β
+


β





k


K
+
1



}


k
=
1

K











h
8

:

ϕ
∈


{

π
+
α
+



(

π
-
β
-
α

)


k


K
+
1



}


k
=
1

K







(
2.10
)







The segments h 6,7 are always in the lower part of the bound, so that their tangents pose a lower bound, while h 8 is always on top, so that its tangents pose an upper bound.
One-Sided Pseudo Likelihood and Tangent Constraints on the Clock Offsets
The bounds on a pair of DTOA measurements made on a single source are related to the set of possible clock offsets. Let the measurement made on a source t by sensor s be:
m t (s)=r t (s) τ t +δ s +e t (s) (2.11)

Define {tilde over (m)} (k,s,p) m t (p) −m t (k) −q1(φ)(m t (s) −m t (k) ) and Δ ij =δ j −δ i . Expanding this expression gives:












m
~

t

(

k
,
s
,
p
,
ϕ

)




=
Δ






m
t

(
p
)


-

m
t

(
k
)


-



q
1



(
ϕ
)




(


m
t

(
s
)


-

m
t

(
k
)



)










=




ψ
t

(
pk
)


+

Δ
kp

-



q
1



(
ϕ
)




(


ψ
t

(
sk
)


+

Δ
sk


)


+


e
~

t













=




ψ
t

(
pk
)


-



q
1



(
ϕ
)




ψ
t

(
sk
)



+

Δ
kp

-



q
1



(
ϕ
)




Δ
sk


+


e
~

t










=
>

<







q
0



(
ϕ
)


+

Δ
kp

-



q
1



(
ϕ
)




Δ
sk


+


e
~

t









=
Δ







q
0



(
ϕ
)


+


Δ
~

ksp

(
ϕ
)


+


e
~

t









(
2.12
)







where {tilde over (e)} t e t (p) +(q 1 (φ)−1)e t (k) −q 1 (φ)e t (s) and ψ t (ks) =r t (s) −r t (k) . The last equation defines the relation between the bound on the DTOA measurements and the clock offsets. The direction of the inequality is determined by the value of φ: For φε[0, α]∪[π−β, π] it will be ≧ and for φε[π+α, 2π−β] it will be ≦.
To fuse all of the measurements made by all the sensors we again turn to the pseudo likelihood function. The pseudo likelihood function ƒ {tilde over (Δ)} ksp (φ) of {tilde over (Δ)} ksp (φ) is defined by:






m
~

t

(

k
,
s
,
p
,
ϕ

)




=
Δ




m
t

(
p
)


-

m
t

(
k
)


-



q
1



(
ϕ
)




(


m
t

(
s
)


-

m
t

(
k
)



)










Ψ


(
x
)




=
Δ



exp


{

-



(



m
~

t

(

k
,
s
,
p
,
ϕ

)


-


q
0



(
ϕ
)



)

2


2



σ
~

t
2




}









L


m
~

t

(

k
,
s
,
p
,
ϕ

)





=
Δ



{





1




if





x




=
>

<





m
~

t

(

k
,
s
,
p
,
ϕ

)


-


q
0



(
ϕ
)









Ψ


(
x
)




otherwise











f


Δ
~


k
,
s
,
p
,
ϕ





(
x
)





=
Δ





∏

t
∈

T
ksp









L


m
~

t

(

k
,
s
,
p
,
ϕ

)






∫

-
∞

∞




∏

t
∈

T
ksp









L


m
~

t

(

k
,
s
,
p
,
ϕ

)












where {tilde over (σ)} t 2 =2σ t 2 (1+q1(φ)), and T ksp is the set of all sensor triplets. The direction of the inequality is determined by the value of φ as before. The pseudo likelihood function yields the constraint






Δ
~

ksp

(
ϕ
)





=
<

>



h
ksp
ϕ





w.p. 1−ε. This is a linear constraint on the clock offsets that can be incorporated into the MVIE optimization problem.
Since this is a one-sided constraint, some a priori knowledge is needed on the bound of {tilde over (Δ)} ksp (φ) on its other side. For this purpose, the bounds can be derived from the elementary bounds, or the lowest feasible value can be used.
Localization and Passive Sensor Network Synchronization Under a Linear Clock Model
In this section, the above methods are expanded to include clock skew estimation by convex methods. With slight approximations, the skew estimation is independent of the offset estimation and can be achieved by similar methods.
Consider M sensors and N sources. The s-th sensor has an internal clock with offset denoted by δ s and skew denoted by θ s . We use sensor number 0 as a reference sensor, and therefore we set δ 0 =0 and θ 0 =1. Let m t (s) be the TOA measurement performed by the s-th sensor for the t-th source. Denote by q s , p t the known coordinate vector of the sensor and the unknown coordinate vector of the source, respectively. Then r t (s) = 1/c∥q s −p t ∥ is the propagation time between source t and sensor s. Let τ t be the unknown transmit time. Then
m t (s) =θ s ( r t (s) +τ t )+δ s +e t (s) (3.1)

where e t (s) is a random measurement error with zero mean and a standard deviation of σ t (s) .
It can be reasonably assumed that all clock skews can be described by a slight deviation from unity that is denoted by η:
θ s =1+η s (3.2)

With reasonable values of η, it can be shown that
θ S r t (s) ≈r t (s) (3.3)

is a good approximation since η s r t (s) <<σ t (s) . For the same reason we will assume that multiplying the noise by any clock skew does not change the noise statistics.
Given this model, the problem of self-synchronized localization can be defined as follows: Using all measurements m t (s) made by the sensor network, estimate δ s , θ s , p t ∀s,t where s=1, 2, . . . M−1; t=1, 2, . . . N.
The self-synchronized localization problem, in a planar geometry, has 3N+2(M−1) unknowns: 2N unknown source coordinates, N unknown transmit times, M−1 sensor time offsets, and M−1 clock skews w.r.t. the reference sensor. If all sensors receive the signals of all the sources, there are MN TOA measurements. Thus, the problem is well posed if MN≧3N+2(M−1). Define the vectors associated with source t,
m t [m t (1) , m t (2) . . . m t (M-1) ] T ; m t0 [m t (0) , 0 . . . 0] T ;
r t [r t (1) , r t (2) . . . r t (M-1) ] T ; r t (s) 1/ c∥q s −p t ∥;

1 M [ 1 , 1 , . . . 1 ] T ; δ [δ 1 , δ 2 . . . δ M-1 ] T ;

θ [θ 1 , θ 2 . . . θ M-1 ] T ; e t [ e t (0) , e t (1) . . . e t (M-1) ] T

{tilde over (δ)} δ⊕θ; {tilde over (θ)} 1 M-1 ⊕θ

A {tilde over (δ)} [0, I M-1 ] T ; A {tilde over (θ)} t [0, diag[m t ]] T
where ⊕ is defined as the element-wise division operator. Using the above definitions, the measurements defined in (3.1) become,
m t0 =r t +1 Mτ t +A {tilde over (δ)} {tilde over (δ)}−A {tilde over (θ)} t {tilde over (θ)}+e t . (3.4)

When the error vector is Gaussian, the Maximum Likelihood cost function is







Q


=
Δ




∑

t
=
1

N












m

t





0


-

r
t

-


1
M



τ
t


-


A

δ
~




δ
~


+



A

θ
~


t



θ
~





2

.






(
3.5
)







The cost function is minimized w.r.t. the time offsets by:












τ
^

t

=





(


1
M
T



1
M


)


-
1




1
M
T



(


m

t





0


-

r
t

-


A

δ
~




δ
~


+



A

θ
~


t



θ
~



)








=




1
M



1
M
T



(


m

t





0


-

r
t

-


A

δ
~




δ
~


+



A

θ
~


t



θ
~



)









(
3.6
)







Substituting this result back in (3.5) yields:











Q
=




∑

t
=
1

N











(


I
M

-


1
M



1
M



1
M
T



)



(


m

t





0


-

r
t

-


A

δ
~




δ
~


+



A

θ
~


t



θ
~



)




2








=




∑

t
=
1

N










B


(


m

t





0


-

r
t

-


A

δ
~




δ
~


+



A

θ
~


t



θ
~



)




2









=




∑

t
=
1

N










(



m
~

t

-


r
~

t

-


A
t



γ
~



)



2



,










where




(
3.7
)








B


=
Δ




I
M

-


1
M



1
M



1
M
T




;


A
t



=
Δ



[


BA

δ
~


,

-

BA


θ
~

t




]













m
~

t



=
Δ



Bm

t





0



;



r
~

t



=
Δ



Br
t


;


γ
~



=
Δ




[


δ
~

,

θ
~


]

.







(
3.8
)







Collecting all vectors for t=1, 2, . . . ,N gives:
m [{tilde over (m)} 1 T , {tilde over (m)} 2 T . . . {tilde over (m)} N T ] T ; r [{tilde over (r)} 1 T , {tilde over (r)} 2 T . . . {tilde over (r)} N T ] T ;
e [{tilde over (e)} 1 T , {tilde over (e)} 2 T . . . {tilde over (e)} N T ] T ; C [A 1 , A 2 . . . A N ] T . (3.9)

Thus, the cost function for minimization is now:
Q=∥m−r−C{tilde over (γ)}∥ 2 (3.10)

The minimum w.r.t. {tilde over (γ)} is obtained for
{tilde over ({circumflex over (γ)}=( C T C ) −1 C T ( m−r ) (3.11)

Substituting back in (3.10) gives:








Q
=





[

I
-


1
N



CC
T



]



(

m
-
r

)




2


,




(
3.12
)







As a result, the search is over only {p t } t=1 N (2N unknowns). To ensure that the number of equations is not smaller than the number of unknowns, at least three sources and seven sensors are required (for the minimal number of sources). Thus, solving the above equation for three sources requires a search within a 6 dimensional space.
Iterative MLE
Reconsider equation (3.7) and note that if {tilde over (γ)} is given, the cost function is separable into independent components, one for each source. This separation enables controller 28 to locate each source separately, given the assumed {tilde over (γ)} vector. Therefore, the problem can be solved by successive optimization of two-dimensional problems. Using this fact, the following iterative algorithm can be applied for the estimation of the clock offsets and the source positions:
1. Initialize: {tilde over (γ)} (0) ←[0 M-1 T , 1 M-1 T ] T ; Q (−1) ←inf; n← 0
2. Q (n) ←0
3. For each source t=1, 2, . . . , N:
(a) Estimate p t given γ (n) using equation (3.7). (b) Q (n) ←Q (n) +∥({tilde over (m)} t −{tilde over ({circumflex over (r)} t −{tilde over (γ)} (n) )∥ 2

4. {tilde over (γ)} (n+1) ←(C T C) −1 C T (m−r); See eq. (3.11).
5. If Q Δ (n) =|Q (n) −Q (n−1) |<ε then stop
6. Else n←n+1, go to step 2
Self-Synchronized Localization by Convex Optimization
Controller 28 starts by collecting all measurements made by a pair of sensors k, s. For a source t the measurement of sensor k is given by Eq. 3.1. Taking the difference between the measurements made by sensors k and s on source t gives:
m t (k) −m t (s) =θ k ( r t (k) +τ t )+δ k +e t (k) −θ s ( r t (s) +τ t )−δ s −e t (s) ≈r t (k) −r t (s) +τ t (θ k −θ s )+δ k +e t (k)−δ s −e t (s) =φ t ks +τ t (θ k −θ s )+δ k −δ s +e t (k) −e t (s) (3.25)

where φ t ks r t (k) −r t (s) is the DTOA measurement on source t by sensors k,s.
We define:
Δ ks δ k −δ s

dm t ks m t (k) −m t (s) (3.26)

The unsynchronized DTOA measurement for source t by sensors k and s is then:
dm t ks ≈φ t ks +τ t (θ k −θ s )+Δ ks +e t (k) −e t (s) (3.27)

Taking the difference between two unsynchronized DTOA measurements of different sources gives:
dm t ks −dm p ks ≈φ t ks −φ p ks +(τ t −τ p )(θ k −θ s )+ e t (k) −e t (s) +e p (k) −e p (s) =φ t ks −φ p ks +(τ t −τ p )(θ k −θ s )+ {tilde over (e)} t,9 (k,s)

where {tilde over (e)} t,p (k,s) e t (k) −e t (s) +e p (k) −e p (s) . When considering a sensor pair, the relative clock skew may be defined as Θ ks θ k /θ s . Applying this concept gives:
dm t ks −dm p ks ≈φ t ks −φ p ks +(τ t −τ p )(Θ ks −1)+ {tilde over (e)} t,p (k,s) =φ t ks −φ p ks +(τ t −τ p )(η ks )+ {tilde over (e)} t,p (k,s) (3.28)

Since in Eq. 3.28, τ t −τ p is multiplied by the clock skew deviation η, only a crude estimation of τ t −τ p is needed to get an accurate clock skew estimation. The following approximation can be used for the Tx time difference:







=



1
M




∑

k
=
0


M
-
1








[


m
t

(
k
)


-

m
p

(
k
)



]





=
Δ



Δ






T

t
,
p








(
3.29
)







The summation is over the common sensing sensors of t and p.
Dividing by the estimated time difference gives:










dm

t
ks


-

dm

p
ks




Δ






T

t
,
p




≈




φ

t
ks


-

φ

p
ks




Δ






T

t
,
p




+

η
ks

+



e
~


t
,
p


(

k
,
s

)



Δ






T

t
,
p









(
3.30
)







Finally we get:











dm

t
ks


-

dm

p
ks




Δ






T

t
,
p




-



φ

t
ks


-

φ

p
ks




Δ






T

t
,
p





≈


η
ks

+



e
~


t
,
p


(

k
,
s

)



Δ






T

t
,
p









(
3.31
)







The triangle inequality gives bounds on η ks :










η
ks

+


n
~


t
,
p
,
k
,
s



≥




dm

t
ks


-

dm

p
ks




Δ






T

t
,
p




-


2






d
ks



c





Δ






T

t
,
p















η
ks

+


n
~


t
,
p
,
k
,
s



≤




dm

t
ks


-

dm

p
ks




Δ






T

t
,
p




+


2






d
ks



c





Δ






T

t
,
p










(
3.32
)







where d ks ∥q s −q k .
The pseudo likelihood function provides the likelihood of a value of η ks given the constraints imposed by Eq. 3.32 for each sensor pair using all measurements made by the pair. Assuming all measurement noise is i.i.d and has variance of σ t , the pseudo likelihood function ƒ η ks of η ks is defined by:









ddm

t
,
p


(

k
,
s

)




=
Δ




dm

t
ks


-

dm

p
ks












M

t
,
p


(

k
,
s

)




=
Δ




min
2



(










d

dm


t
,
p


(

k
,
s

)



Δ






T

t
,
p




+


2






d

k
,
s




c





Δ






T

t
,
p




-

η
ks




,











d

dm


t
,
p


(

k
,
s

)



Δ






T

t
,
p




-


2






d

k
,
s




c





Δ






T

t
,
p




-

η
ks







)











Ψ


(

η
ks

)




=
Δ



exp


{

-


Δ






T

t
,
p

2



M

t
,
p


(

k
,
s

)




8


σ
t
2




}











L

ddm

t
,
p



(

k
,
s

)




=
Δ



{





1




if









η
ks

-



d

dm


t
,
p


(

k
,
s

)



Δ






T

t
,
p








<


2






d

k
,
s




c





Δ






T

t
,
p










Ψ


(

η
ks

)




otherwise











f

η
ks




(
x
)





=
Δ





∏


{

t
,
p

}

∈

T

k
,
s










L

ddm

t
,
p



(

k
,
s

)





∫

-
∞

∞




∏


{

t
,
p

}

∈

T

k
,
s










L

ddm

t
,
p



(

k
,
s

)












(
3.33
)







Here T k,s is the set of source pairs that were measured by both sensor k and sensor s, which is assumed here to include all sources. It is assumed that ddm t,p (k,s) are uncorrelated with one another, but this approximation can easily be eliminated. From the pseudo likelihood function, we obtain E [η ks ], var[η ks ], and η ks ε(l ks , h ks ) w.p. 1−α.
The estimation for the relative clock skew is given by {circumflex over (Θ)}ks=1+{circumflex over (η)} ks . Therefore, bounds that were found on η ks can be translated into bounds on Θ ks . If η ks ε(l ks , h ks ) w.p. 1−α, then Θ ks ε(1+l ks , 1+h ks ) w.p. 1−α. Taking the natural logarithm of the inequalities imposed on Θ ks gives the following set of linear constraints on ln θ k :
ln Θ ks =ln θ k −ln θ s ε[ln(1+ l ks ), ln(1+ h ks )] w.p. 1−α. (3.34)

Collecting the linear constraints for all k, s sensor pairs, Maximum Volume Inscribed Ellipsoid (MVIE) centering can be used to find the estimate , and the related error covariance matrix can be approximated by G ln θ G ln θ T .
Program 3.1 Maximum Volume Inscribed Ellipsoid Centering on Clock Skews Under Pseudo Likelihood Imposed Bounds
Minimize: log det G ln θ −1
Subject to: ∥G ln θ a i T ∥+a i ln θ c ≦b i
i=1, . . . , M(M−1)

Where:
A=[{tilde over (D)} T −{tilde over (D)} T ] T
b=[h ln Θ T (α) l ln Θ T (α)] T (3.35)

b i is the i-th element of b, and h ln Θ T (α) and l ln Θ T (α) are the upper- and lower-bound vectors imposed by α, via the pseudo likelihood function, on all relative clock skews.
If the program returns the non-feasible token, the value of α can be decreased, and the solution repeated.
Note that G θ =G ln θ , since the error is much smaller then unity, and Taylor approximation holds firmly. Therefore, the estimator of the θ vector is:
{circumflex over (θ)}=exp( ); G θ =G ln θ (3.36)

After establishing an estimation of the clock skew vector {circumflex over (θ)} and deriving an approximation for its error covariance matrix: G θ G θ T , the next step is to estimate the clock offset vector δ. For this purpose, the measurements made by the sensors are normalized by their respective clock skew estimates as follows:









m
~

t

(
s
)


=



m
t

(
s
)




θ
^

s


=




θ
s



θ
^

s




(


r
t

(
s
)


+

τ
t


)


+


δ
s



θ
^

s


+

e
t

(
s
)








(
3.37
)







Applying Taylor approximation to





θ
s



θ
^

s





gives







θ
s



θ
^

s


≈

1
-

e

θ
s




,




where e θ s is the estimation error of {circumflex over (θ)} s . Embedding this approximation into Eq. 3.37 results in:












m
~

t

(
s
)


=





(

1
-

e

θ
s



)



(


r
t

(
s
)


+

τ
t


)


+


δ
s



θ
^

s


+

e
t

(
s
)









=




r
t

(
s
)


+

τ
t

+


δ
s



θ
^

s


-


e

θ
s




(


r
t

(
s
)


+

τ
t


)


+

e
t

(
s
)









≈




r
t

(
s
)


+

τ
t

+


δ
s



θ
^

s


-


e

θ
s




τ
t


+

e
t

(
s
)










(
3.38
)







The above equation states that the clock skew uncertainty is amplified by the source transmit (Tx) time. The Tx time can be referenced to a selected point in time. To minimize the noise amplification effect, the reference time can be set to the mean of the Tx times of all of the sources. Then τ t may be estimated by:









τ
0



=
Δ




1
N




∑

k
=
1

N







m
k

(
0
)














τ
^

t

=


m
t

(
0
)


-

τ
0







(
3.39
)







Using the above first-order approximation of τ t , the equivalent measurement difference noise for sensors k and s is:








σ
ks

=






τ
^

t
2



v
ks
T



G
θ



G
θ



v
ks


4

+

2


σ
t
2








(
3.40
)







where v ks T is a difference vector holding 1 and −1 in the k−1, s−1 rows respectively, and containing zeros elsewhere. (If s=1, then the −1 is missing from the vector.)

Given σ ks the pseudo likelihood measure can be applied to give bounds on







Δ
~

ks



=
Δ






δ
k



θ
^

k


-


δ
s



θ
^

s





=
Δ





δ
~

k

-


δ
~

s







for every s,k. The {tilde over (Δ)} pseudo likelihood measure is defined as follows:





d



m
~

t

(

i
,
j

)





=
Δ





m
~

t

(
i
)


-


m
~

t

(
j
)










M
t

(

i
,
j

)




=
Δ




min
2



(





d



m
~

t

(

i
,
j

)



-

(

x
+

d

(

i
,
j

)



)




,




d



m
~

t

(

i
,
j

)



-

(

x
-

d

(

i
,
j

)



)





)









Ψ


(
x
)




=
Δ



exp


{

-


M
t

(

i
,
j

)



2


(

σ
ij
2

)




}









L

d



m
~

t





=
Δ



{





1




if








x
-

d



m
~

t

(

i
,
j

)







<

d

(

i
,
j

)








Ψ


(
x
)




otherwise











f


Δ
~

ij




(
x
)





=
Δ





∏

t
∈

T
ij









L

d



m
~

t






∫

-
∞

∞




∏

t
∈

T
ij









L

d



m
~

t












where T ij is the set of sources that were measured by both sensor i and sensor j (taken to include all sources, as noted earlier). The pseudo likelihood function also gives E[{tilde over (Δ)} ij ], var[{tilde over (Δ)} ij ], and {tilde over (Δ)} ij ε(l ij , h ij ) w.p. 1−α.
Collecting the likelihood functions ƒ {tilde over (Δ)} ij for all i, j, the {tilde over (δ)} vector can be estimated using the error covariance matrix approximation G {tilde over (δ)} G {tilde over (δ)} T by using MVIE centering:
Program 3.2 Maximum Volume Inscribed Ellipsoid Centering on Clock Offsets Under Pseudo Likelihood Imposed Bounds
Minimize: log det G {tilde over (δ)} −1
Subject to: ∥G {tilde over (δ)} a i T ∥+a i {tilde over (δ)} c ≦b i
i=1, . . . , M(M−1)

Where:
A=[{tilde over (D)} T −{tilde over (D)} T ] T
b=[h {tilde over (Δ)} T (α) l {tilde over (Δ)} T (α)] T (3.41)

h {tilde over (Δ)} T (α) and l {tilde over (Δ)} T (α) are the upper- and lower-bound vectors imposed by α, via the pseudo likelihood function, on all {tilde over (δ)}pairs.
From {tilde over (δ)} c , an estimate of δ can be computed by multiplying it element-wise by {circumflex over (θ)}:
{circumflex over (δ)}={tilde over (δ)} c ⊙{circumflex over (θ)} (3.42)

This multiplication cancels the prior normalization and therefore introduces no additional errors.
Having estimated {circumflex over (θ)} and {circumflex over (δ)} with their respective approximations of the error covariance matrices, G θ G θ T , and G δ G δ T , the skew and bias can be removed from the sensor measurements as follows:













m
~

~

t

(
s
)


=





m
t
s

-


δ
^

s




θ
^

s








=






θ
s



θ
^

s




(


r
t

(
s
)


+

τ
t


)


+



δ
s

-


δ
^

s




θ
^

s


+

e
t

(
s
)









=




r
t

(
s
)


+

τ
t

+

e






δ
s


-


τ
t


e






θ
s


+

e
t

(
s
)










(
3.43
)







Defining {tilde over ({tilde over (m)} t =[{tilde over ({tilde over (m)} t (0) , {tilde over ({tilde over (m)} t (1) , . . . , {tilde over ({tilde over (m)} t (M-1) ] and calculating the covariance,









Σ
t

=


var


[

B




m
~

~

t


]


=


B


(


[



0


0




0




G
δ



G
δ
T





]

+

[



0


0




0




G
θ



G
θ
T



τ
t
2





]

+

I






σ
t
2



)



B



,




(
3.44
)







the optimal source position in the WLS sense reduces to the following optimization problem:










argmin

p
t




(

B


(




m
~

~

t

-


1
c






p
t

-

q
s






)


)


T




Σ
t

-
1




(

B


(




m
~

~

t

-


1
c






p
t

-

q
s






)


)






(
3.45
)







Thus, controller 28 can synchronize a sensor network with skewed, asynchronous clocks by measuring the TOA of a set of source signals. Using MVIE to get the initial guess helps avoid local minima in the cost function.
If the position of one source is known, the clock offset can be measured at the time of transmission at raw measurement accuracy. If a source transmits twice without changing position, then the clock skew of the sensors that sense it can be estimated directly at the accuracy of the raw measurement. Incorporating such measurements into the system model can increase the system accuracy. A source with known location can also be a sensor that is allowed to transmit. Periodic sources (such as some transmitting satellites) usually have a transmission period that is very short, so that adjacent transmissions have essentially the same position.
As noted earlier, the MVIE estimate together with its accuracy estimation can also be used as a priori probability of the unknowns in a MAP estimator.
The MVIE of the normalized clock offset can be estimated at a few points in time to increase accuracy if needed.
Even without assuming that all sources are received by all sensors, the above algorithm will still perform well with only slight modifications.
Methods Using Combinations of Satellites and Terrestrial Sources
In the description that follows, system 20 is assumed (with full generality) to comprise a set of M sensors 22 at given locations {q i } i=0 M-1 , a set of N s satellites 26 in orbit of unknown position {p i (s) } i=0 N s −1 , and a set of N t terrestrial sources 24 of unknown position {p i (t) } i=0 N t −1 . Denote by N the total number of sources received by the sensors N N t +N s , and set the origin of the coordinate system at the center of the sensor network deployment area. The orientation of the coordinate system is set to North West Up.
The time offset of sensor s is δ (s) . Therefore, the TOA measurement of source t (satellite or terrestrial in origin) by sensor s is
m t (s) =r t (s) +τ t +δ (s) +e t (s) , (4.1)

wherein τ t is the unknown transmission time of the signal, r t (s) is the time of flight from source t to sensor s, and e t (s) is zero mean Gaussian error whose standard deviation is σ t (s) .
By defining the vectors:
m t [m t (1) , m t (2) . . . m t (M) ] T ;
r t [r t (1) , r t (2) . . . r t (M) ] T; r t (s) 1/ c∥q s −p t ∥

1 M [1, 1, . . . 1] T ; δ [δ 1 , δ 2 . . . δ M ] T ;

; e t [e t (1) , e t (2) . . . e t (M) ] T .
the measurements of source t can be written in vector form as:
m t =r t +1 M τ t +δ+e t . (4.2)

We use the same notation for both terrestrial and satellite sources, wherein the indexes t=0 . . . N t −1 are used for terrestrial sources and the indexes t=N t . . . N t +N s −1 are used for satellite sources.
For the sake of simplicity in the formulation we make the assumptions:
1. All of the terrestrial sources are intercepted by all of the sensors with the same error standard deviation, σ T ,
2. All of the satellites are intercepted by all of the sensors with the same error standard deviation σ S .
The problem to be solved is twofold:
1. Estimate the sensors clock offsets.
2. Estimate the source location using the available measurements.
For satellite signals the range r t (s) can be written as:











r
t

(
s
)


=




1
c






p
t

-

q
s











=




1
c








p
t



2

+




q
s



2

-

2






q
s
T



p
t











=




1
c








p
t



2

+




q
s



2






1
-


2






q
s
T



p
t







p
t



2

+




q
s



2












≈




1
c





p
t





(

1
-



q
s
T



p
t






p
t



2


-



(


q
s
T



p
t


)

2


2





p
t



4




)








≈




1
c





p
t





(

1
-



q
s
T



p
t






p
t



2



)








=





1
c





p
t




-


1
c



q
s
T




p
_

t










(
4.3
)







Therefore the vector r t is approximated by









r
t

≈



1
c





p
t





1
M


-

G



p
_

t










wherein




(
4.4
)






G


=
Δ





1
c



[


q
0







q
1






…






q

M
-
1



]


T





(
4.5
)







and p t is a unit vector in the direction of p t . The present methods use a projection of the range vector that is defined as:










r
~

t



=
Δ



Br
t









B


=
Δ



I
-


1
M




11
T

.








(
4.6
)







This means that:










r
~

t

≈


B


1
c





p
t





1
M


-

BG



p
_

t




=


-
BG





p
_

t

.






(
4.7
)







G is referred to as the geometry matrix. This approximation of the projected range vector is the reason that the satellites location can be described by two variables. For example, longitude and latitude, instead of three that are needed for a general point in space.
The second-order term in the Taylor expansion determines the approximation error. As an example, for GPS satellites at an orbital height of 20180 km, and a sensor network of 1 km diameter, the error term maximum value is:












(


q
s
T



p
t


)

2


2





p
t



3



≤





q
s
T



2


2




p
t






=



500
2


2
·
20180000


=

6.2





mm



,




(
4.8
)







In terms of clock synchronization, this is equivalent to an error of 18 ps. Looking at the approximation from the opposite direction, we may ask what is the maximal radius of the sensor network such that the approximation error is less then 1 m, for the same satellite orbital radius. We calculate:













q
s
T



2


2




p
t





=

1





m












q
s



=



2
·
20180000


=

6352






m
.








(
4.9
)







Neglecting the second order term is possible, as long as the possible deployment area of the network is limited. The results can be extended to wider-area networks, given crude information on the orbital radius of the satellites.
Returning to eq. (4.7), the domain of the vector {tilde over (r)} t is part of a subspace of M . Due to the structure of G, {tilde over (r)} t resides in a two- or three-dimensional subspace of M . The subspace will be two-dimensional for planar sensor configuration, and three-dimensional in the general case.
For ground-based sensor configurations, the domain of p t is the three-dimensional unit half-sphere such that:
p t · z ≧ 0, (4.10)

wherein z is the unit vector pointing up. This inequality holds since from any point on the surface of the earth, the intercepted signals arrive from above the horizon. In the rare case of space sensor formations, we would have a whole unit sphere as the domain of p t . On the other hand, if we have any information on the whereabouts of source t, we can use it to reduce the domain of p t to a specified solid angle segment. Although the present description focused on ground-based sensor configurations, it can be extended to more general cases with only slight modifications.
The vector {tilde over (r)} t is a linear transformation of p t , and therefore its domain is a linear mapping of the upper half of the unit sphere in onto M , which is a half ellipsoid in M . Singular Value Decomposition (SVD) of −BG reveals the exact shape of that half ellipsoid. We define the SVD of −BG as:









-
BG



=
Δ





U


[




Λ
R





0



]




V
T




=
Δ





[


R
T



H
T


]



[




Λ
R





0



]




V
T




,




(
4.11
)







wherein U and V are unitary square matrixes of size M×M, and 3×3 respectively; Λ R is the non negative singular value diagonal matrix of size 3×3 at most; R rows hold the left singular vectors related to the nonzero singular values; and the rest of the left singular vectors form the rows of H. The nonzero singular values define the lengths of the semi-axis of the ellipsoid, while the related left-singular vectors define the semi-axis of the ellipsoid.
When the sensor formation is planar, there are only two non-zero singular values in Λ R . In this case the domain of {tilde over (r)} t is a two-dimensional full ellipsoidal disk in M
As stated earlier for three-dimensional ground sensor formations, the domain of p t is a half ellipsoid. To know which half of the ellipsoid is the domain, we need to find the plane that separate the two halves. The plane normal pointing into the domain direction It is:
n =−BG z , (4.12)

This plane is not guaranteed to be aligned with the semi-axis of the ellipsoid. When the height variation of the sensor configuration is much smaller than the planar position variations, however, the plane normal is approximately aligned with the semi-axis of the ellipsoid.
In the above description, there was an implicit condition on the number of sensors. If there are only two sensors, then rank (BG)=1, and the domain of BG p t is a line segment. Three sensors are always on a plane or a line, so that the domain BG p t will be a line or an ellipsoidal disk. Only four sensors or more can be positioned in a non-planar configuration, and therefore make the domain of BG p t a half ellipsoid as discussed.
ML Estimator
The ML estimator for terrestrial sources without clock skew was derived above for the localization of a general source using TOA measurements. The cost function to minimize in that case was:







Q


=
Δ




∑

t
=
0


N
-
1













m
t

-

r
t

-


1
M



τ
t


-
δ



2

.






(
4.13
)







where r t is the vector of distances of the source t to all sensors, and τ t is the unknown source transmission time. The configuration containing satellites and terrestrial sources of unknown position and transmission time fits this cost function. Assuming the satellite and terrestrial sources are measured with the same error statistics yields:









Q
′





∑

t
=
0



N
T

-
1








m
t

-


r
t



(


x
t

,

y
t

,

z
t


)


-


1
M



τ
t


-
δ



2



+


∑

t
=

N
T




N
T

+

N
S

-
1








m
t

-


r
t



(


φ
t

,

θ
t


)


-


1
M



τ
t


-
δ



2






(
4.14
)







where r t (x t , y t , z t ) is the distance vector for a terrestrial source located at p t [x t , y t , z t ] T , and r t (φ t , θ t ) is the distance vector for a satellite source at azimuth θ t and elevation φ t . The transmission times τ t that minimize the cost function are given by:












τ
^

t

=





(


1
M
T



1
M


)


-
1




1
M
T



(


m
t

-

r
t

-
δ

)








=




1
M



1
M
T




(


m
t

-

r
t

-
δ

)

.









(
4.15
)







We now define:










B



I
M


-


1
M



1
M



1
M
T



;











m
~

t




Bm
t


;



r
~

t




Br
t


;


δ
~



B






δ
.







(
4.16
)







Substituting the transmission time estimates into the cost function and using these definitions gives:








Q
′

=



∑

t
=
0



N
T

-
1









m
~

t

-



r
~

t



(


x
t

,

y
t

,

z
t


)


-

δ
~




2


+


∑

t
=

N
T




N
T

+

N
s

-
1









m
~

t

-


r
t



(


φ
t

,

θ
t


)


-

δ
~




2







(
4.17
)







Collecting all vectors for t=0, 1, . . . , N S +N T −1 now gives:
Q′=∥m−r−Cδ∥ 2 , (4.18)

where
m= [{tilde over (m)} 0 T , {tilde over (m)} 1 T . . . {tilde over (m)} N T +N s −1 T ; r [{tilde over (r)} 0 T , {tilde over (r)} 1 T . . . {tilde over (r)} N T +N s −1 ] T ;
e [{tilde over (e)} 0 T , {tilde over (e)} 1 T . . . {tilde over (e)} N T +N s −1 ] T ; C [I M , I M . . . I M ] T . (4.19)

Substituting the clock offsets into the cost function gives:








Q
′

=






[

I
-


1
N



CC
T



]



(

m
-
r

)




2

.





(
4.20
)







Calculating the elements of r is straightforward for terrestrial sources. For satellite sources, we can use the fact that they are far away to write:











r
~

t





lim

R
->
∞




Br
t



=


-
BG




p
_

t



,




(
4.21
)







where R is the orbital radius of the satellite sources. Thus, finding the ML estimate requires a search in 3N T +2N S dimensions: three position coordinates for each terrestrial source and two bearing angles for each celestial source. As noted above, for ground-based sensor formations, the satellite directions are above the horizon. Therefore:








φ
t

∈


(

0
,

π
2


)

.





(
4.22
)







This criterion limits the search interval.
To avoid a brute-force search over so many dimensions, an estimate of {tilde over (δ)} can be used to decouple the problems of estimating the terrestrial source positions and satellite directions. The following iterative procedure can then be used to solve the ML estimator:
1. Initialize: δ (0) ←0; Q′ (−1) ←inf; n←0
2. Q′ (n) ←0
3. For each source t=1, 2, . . . , N:
(a) Estimate p t given {tilde over (δ)} (n) by minimizing ∥{tilde over (m)} t −{tilde over (r)} t −{tilde over (δ)} (n) ∥ 2 (b) Q′ (n) ←Q′ (n) +∥{tilde over (m)} t −{tilde over (r)} t ({circumflex over (p)} t )−{tilde over (δ)} (n) ∥ 2

4.






δ
~


(

n
+
1

)


←


1
N





C
T



(

m
-
r

)


.






5. If Q′ Δ (n) =|Q′ (n) −Q′ (n−1) |<ε then stop
6. Else n←n+1, go to step 2.
If the computation is found to have converged (step 56 in FIG. 4 ), controller 28 synchronizes the clocks of sensors 22 based on the current value of {tilde over (δ)} (step 58 ). Depending on application requirements, the controller may either send actual synchronization values to the sensors, or it may simply record and apply appropriate corrections to the clock readings received from the sensors. The controller may also output or otherwise apply the source location values given by the current elements of r (step 60 ).
For every iteration of this algorithm, controller 28 performs N S +N T nonlinear least square optimizations. To avoid convergence of the cost function to a local minimum (rather than the true minimum corresponding to the actual clock offsets and source positions), a good initial estimate of the source locations and/or clock offsets is useful. Such an estimate can reduce the computational load considerably by reducing the number of iterations required for convergence. In tracking applications, a previous estimate may be used as a good starting point, but in the absence of a previous estimate, other information may be used.
The following sections describe methods that can be used to find an initial point so that no more than a few iterations are needed. Moreover, given a good initial point, controller 28 can solve the original cost function using gradient methods, which are very effective.
Locating Satellite Direction
In the iterative method of FIG. 4 , the direction of a satellite given a guess of the clock offset vector is required. In this section we present a Lagrange multiplier approach to finding the required direction, which may be preferable to grid search methods. For this purpose, the optimization of a set of satellite source locations can be written as follows:






Minimize







Bm
t

+

BG



p
_

t


-

B





δ




2







p
_

t











Subject





to








p
_

t



=
1.







We define:



y

Bδ−Bm
t


A BG. (4.24)

Then the Lagrangian is:








L
=






A



p
_

t


-
y



2

-

λ


(

1
-



p
_

t
T




p
_

t



)













∂

∂


p
_

t




L

=



A
T



(


A



p
_

t


-
y

)


+

λ



p
_

t













∂

∂
λ



L

=

1
-






p
_

t



2

.







(
4.25
)







Equating




∂

∂


p
_

t






L to zero gives:
( A T A−I λ) p t =A T y

p t ( A T A−I λ) −1 A T y. (4.26)

Substituting the solution for p t in the expression for





∂

∂
λ



L




and equating to zero gives:
y T A ( A T A−I λ) −1 T ( A T A−I λ) −1 A T y= 1. (4.27)

A T A can be represented by SVD as:



A
T
A=V
T
ΛV


y T AV T (Λ− I λ) −1 (Λ− I λ) −1 VA T y= 1. (4.28)

Noting that Λ diag (γ 0 , γ 1 , γ 2 ), and defining VA T y α=[α 0 , α 1 , α 2 ] T we get:










α
0
2



(


γ
0

-
λ

)

2


+


α
1
2



(


γ
1

-
λ

)

2


+


α
2
2



(


γ
2

-
λ

)

2



=
1.




(
4.29
)







This equation is equivalent to finding the roots of a sixth degree polynomial. An efficient numerical solution for the roots can be found by seeking the eigenvalues of the companion matrix of the polynomial. One way to reduce the complexity in runtime is by realizing that the γ values are constant as long as the sensors are static, they are needed only once, at initialization.
After calculating the six possible values of λ opt and discarding any complex solutions, we place them in the equation for p t to get possible directions of the satellite. Controller 28 can test which of the real solutions is the optimal one by evaluating the cost function for each possible value, thus assuring that the global optimum is chosen.
A weight matrix W may be used in the original problem:









Minimize






W


(


Bm
t

+

BG



p
_

t


-

B





δ


)




2







p
_

t










Subjectto








p
_

t



=
1

,







(
4.30
)







To solve the problem, y is replaced with Wy and A with WA. The use of the weight matrix extends the results to include correlated measurements and can be applied to reduce the dimension of the measurement vector, as explained below.
ML Decomposition for Satellite-Transmitted Signals
This section shows that the log likelihood cost function for signals from space can be divided into two separate cost functions. One is linear, while the other is nonlinear but is only three-dimensional. Controller 28 may decompose the cost function into such components in order to solve the problems of clock synchronization and satellite source direction more efficiently.
H and R are defined above as the null and range-space projectors of BG p t . We define:
T [H T , R T ] T . (4.31)

The matrix T is a unitary matrix, since it is a square matrix with orthonormal rows. Multiplying the source measurements m t by T does not reduce the information in the measurements. Proceeding with the measurement of the satellite signals gives:
Tm t =Tr t +T 1 M τ t +Tδ+Te t (4.32)

Solving the ML estimator then requires that controller 28 minimize the following cost function:







Q




∑

t
=
0



N
s

-
1








T


(


m
t

-

r
t

-


1
M



τ
t


-
δ

)




2

.






(
4.33
)







Transmission time is estimated as usual resulting in:










Q
=




∑

t
=
0



N
s

-
1













[


H
T

,

R
T


]

T



(


Bm
t

-

Br
t

-

B





δ


)




2








=





∑

t
=
0



N
s

-
1











H


(


Bm
t

-

B





δ


)




2


+


∑

t
=
0



N
s

-
1











R


(


Bm
t

-

Br
t

-

B





δ


)




2










(
4.34
)







since HBr t =0 by definition of H.
We now define:
δ ⊥ HBδ

δ R RBδ. (4.35)

Therefore:







Q
=



∑

t
=
0



N
s

-
1












HBm
t

-

δ
⊥




2


+


∑

t
=
0



N
s

-
1













RBm
t

-

RBr
t

-

δ
R




2

.







(
4.36
)







The two parts of the cost Q can be solved independently, thereby making the ML estimator simpler to compute. Because the measurement vectors HBm t and RBm t are uncorrelated, the estimation error covariance matrix is block diagonal. The ML estimators related to the two cost functions can thus be computed separately, as described below.
The ML estimator of δ ⊥ can be derived from the partial cost function:








Q
⊥



=
Δ




∑

t
=
0



N
s

-
1













HBm
t

-

δ
⊥




2

.






(
4.37
)







For this purpose, we define:



m
t
⊥

HBm
t





e
t
⊥

HBe
t


m ⊥ [m 0 ⊥ T , m 1 ⊥ T , . . . , m N s −1 ⊥ T ] T
e ⊥ [e 0 ⊥ T , e 1 ⊥ T , . . . , e N s −1 ⊥ T ] T
C ⊥ 1 N s I (4.38)

wherein is the Kronecker Product. Now we can write:
Q ⊥ =∥m ⊥ −C ⊥ δ ⊥ ∥ 2 . (4.39)

The estimator of δ ⊥ that minimizes the cost function is:









δ
^

⊥

=


1
N



C

⊥
T





m
⊥

.






(
4.40
)







It can be shown that HBH T is idempotent, and H can be chosen such that:








HBH
T

=


[



0


0




0


I



]

.





(
4.41
)







Furthermore, regardless of the source locations, the estimation accuracy depends only on the number of signals measured. The positions of sensors 22 also do not affect the estimation accuracy, as long as the sensors are confined to an area such that the linear approximation of the satellite ranges holds.
A single source is sufficient to establish an estimation of the null space projection of the clock offsets (although this is not the case for the range space). Estimating the clock offsets in null space is sufficient to localize terrestrial sources with reasonable accuracy. For a non-planar sensor configuration, sources confined to a plane can be localized if at least six sensors observe the signals, and for sources that are not in a plane at least seven sensors are required. For a planar sensor configuration, sources confined to a plane can be localized if at least five sensors observe the signals, whereas for sources that are not confined to a plane, at least six sensors are required.
The fact that we can choose H such that HBH T has zero off-diagonal elements can speed up the estimation process.
For satellite signals, the nonlinear part of the cost function can be expressed as follows:








Q
R

=


∑

t
=
0



N
s

-
1













RBm
t

-

RBr
t

-

δ
R




2

.






(
4.42
)







Controller 28 can estimate δ R in the presence of RBr t as a nuisance parameter. In this calculation, since R=RB, the measurement vector RBm t elements are independent and identically distributed Gaussian random variables. The mode of calculation depends on the sensor formation: If the sensors are confined to a plane, then RBr t can be any value inside an ellipse, whereas if the sensor distribution is in 3D space, RBr t is distributed on a 3D ellipsoidal half shell, which enables better accuracy.
First we consider the case of a planar sensor configuration. In this case the problem of estimating δ R is reduced to finding the possible centers of an ellipse of known dimensions given a set of points in the ellipse domain corrupted by noise. The set of possible centers can be found, for example, by calculating the mean of the points (which is guaranteed to be inside of the ellipse) and then expanding the set of possible points by propagating out from that point. Controller 28 can determine whether a point is in the domain of possible offsets by checking whether an elliptical disk with its center at that point include all of the measured points in its domain. Regardless of how the set of points is found, its mean can be written as {circumflex over (δ)} R , and its empirical covariance matrix as Σ R .
For the case of a non-planar sensor configuration, because RBr t resides on a 3D ellipsoidal half-shell, estimating {circumflex over (δ)} R is reduced to finding the ellipsoid center given a set of points that are located on the ellipsoid half shell in the noiseless case, or are near this shell in the noisy case. This problem can be solved in a number of ways, including high-dimensional ML estimation, low-dimensional iterative ML estimation, and ellipsoid surface fitting.
The high-dimensional ML estimator takes the range space cost function and minimizes it for all satellite directions p t and range-projected clock offsets δ R . This is an optimization problem in 3+2N S dimensions which is easy to solve as long as the number of satellites is small enough.
The low-dimensional iterative ML estimator is similar to the iterative ML algorithm described above, but is applied only to minimize the cost function with respect to satellite directions and a 3D δ R vector. Each iteration solves two or three dimensions at a time and is inherently fast. This method uses a two-step iterative process: Until convergence do ML Estimation of δ R given the current estimation of p t ; and then update the values of { p t } t=0 N s −1 using ML estimation based on the new δ R estimate. This step can be accomplished by the Lagrange multiplier technique presented above, using R as the weighting matrix W. This estimation process thus comprises an averaging operation followed by an eigenvalue calculation of a 6×6 matrix. This estimator is therefore fast as long as the iteration count is reasonable.
Estimation Clock Offset Range Space Using Ellipsoid Fitting
The surface fitting method uses the fact that an ellipsoid center is to be fitted to noisy points, which is again a 3D problem with fast convergence properties. It is based generally on techniques described by Ahn et al., in “Orthogonal Distance Fitting of Implicit Curves and Surfaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5):620-638 (2002), which is incorporated herein by reference. This fitting method is a good approximation of the ML estimator and is relatively simple to apply in the present case since the ellipsoid to be fitted is of known shape and orientation, so the only parameters left to fit are the ellipsoid center coordinates.
The problem of 3D ellipsoid fitting can be framed as follows: Given the set of noisy points {RBm t } t=0 N s −1 , find the 3D ellipsoid center that minimizes the weighted sum of the squared distances from the noisy measurements to the ellipsoid. The cost function to minimize is thus:
C ( a )= d T P T Pd
d=[d 1 , d 2 , . . . d N s ]
d i =∥x i −x′ i ( a )∥ (4.43)

Here a is the proposed ellipsoid center, x is the noisy point, x′ is the closest point to x that is on the ellipsoid centered at a, P T P is a weighting matrix, and d i is the Euclidean distance between x i and x′ i . It is easier to consider x, x′ in a coordinate system that is centered at a and aligned with the eigenvectors given by the rows of R. In that coordinate system the ellipsoid is given by the following implicit function:








F


(

x
′

)


=




x
1
′2


λ
1


+


x
2
′2


λ
2


+


x
3
′2


λ
3


-
1

=
0





(
4.44
)







wherein x′=[x′ 1 , x′ 2 , x′ 3 ] T , and λ i i=1, 2,3 are the non-zero eigenvalues of BGG T B T , related to the eigenvectors defined by the rows of R.
The ellipsoid center estimation may be carried out using the following orthogonal distance fitting algorithm to find the ellipsoid center â:
1. â←â 0 Δa←∞k←0
2. While ∥Δa∥>v thr
2.1. For All measurements x, calculate x′ using Eq. (4.45) 2.2. Calculate Δa using Eq. (4.47) 2.3. â←â+η k Δa 2.4. k←k+1

End While
3. Calculate cov(â) using Eq. (4.48)
4. δ R ←â
5. Σ R ←cov(â)
In step 2.2, x′ can be found using a generalized Newton-Raphson method, starting from the initial guess x′ 0 =x:











∂
f


∂

x
′





|
k



Δ






x
′



=


-

f


(
x
)





|
k



,


x

k
+
1

′

=


x
k
′

+

Δ






x
′








(
4.45
)







wherein:







f
=

[






x
1
′2


λ
1


+


x
2
′2


λ
2


+


x
3
′2


λ
3


-
1








-
2







x
1




λ
2



(


x
2

-

x
2
′


)



+

2






x
2




λ
1



(


x
1

-

x
1
′


)











-
2







x
2




λ
3



(


x
3

-

x
3
′


)



+

2






x
3




λ
2



(


x
3

-

x
3
′


)







]





(
4.46
)







In step 2.2, Δa is found using:



J
T
P
T
PJΔa=−J
T
P
T
Pd


Δ a =−( J T P T PJ ) −1 J T P T Pd| k

â k+1 =â k +η k Δa (4.47)

wherein





J


=
Δ




∂
d


∂
a



,




and ηε(0,1) is a constant that helps convergence in noisy situations. In simulations, the inventors found it useful to set η=0.9.
In step 3, the covariance is found using
{circumflex over (δ)} R=â

Σ R =cov (δ R )=σ S 2 ( J T J ) −1 . (4.48)

The above algorithm for ellipsoid center estimation requires inverting matrices only of size 3×3. Because this algorithm uses the steepest descent at the ellipsoid center update, as defined by Δa, whereas the previous algorithm uses ML estimation of the center under the assumption that the satellites directions are known, the present algorithm may converge in fewer steps, although each step is a bit more complex.
Regardless of the method used to estimate the range space, it is important to start the iterative process with a good initialization of â (or {circumflex over (δ)} R ) in order to avoid reaching a local minimum. The points to be fitted, assuming a small sensor height variation, reside on the upper or lower half of an ellipsoid, and the sign of −RBG· z can be evaluated to identify the part of the ellipsoid on which the points are located. (If the height variation is significant, then the initial guess is different but can still be derived in a straightforward manner.) A good initial guess for the ellipsoid center, â, would put the measured points in the vicinity of the correct half of the ellipsoid. Such an initial guess could be performed as follows:
1. Set (RBm) xy equal the average for each of the x,y coordinates of RBm t .
2. â 0 xy ← (RBm) xy
3. Define: ε>0
4. if −RBG·{circumflex over (z)}≧0
4.1 â 0 z ←min((RBm) z )−ε

5. Else
5.1 â 0 ←max((RBm) z )+ε

EndIf
6.






a
^

0

←


[





a
^


0
xy

T





a
^


0
z





]

T





Fusing Null and Range Space Clock Offset Estimates
By combining the above estimates for the null space and range space of the clock offset vector Bδ, controller 28 can now establish full synchronization of sensors 22 using satellite sources 26 . For this purpose, the estimations of the range and null projections may be treated as the measurements:








[





δ
^

⊥







δ
^

R




]

=




[



H




R



]


B





δ

+

[



nR




nH



]




=
Δ




TB





δ

+

n
.







(
4.49
)







The error elements n H , n R have the covariance matrices Σ {circumflex over (δ)} ⊥ and Σ R respectively and are uncorrelated. Since Σ {circumflex over (δ)} ⊥ is singular, the ML solution is given by:







=



(


T
T



Σ
†


T

)

†



T
T




Σ
†



[





δ
^

⊥







δ
^

R




]







(
4.50
)







wherein Σ blkdiag (Σ {circumflex over (δ)} ⊥ , Σ R ), and blkdiag is a block matrix whose blocks are the indicated matrices. Since T is unitary, the ML estimator becomes:











=




T
T


Σ






TT
T




Σ
†



[





δ
^

⊥







δ
^

R




]









=




T
T



[





δ
^

⊥







δ
^

R




]














cov


(
)


=


T
T


Σ






T
.







(
4.51
)







To estimate the directions of the satellite sources, is inserted into the ML cost function:
Q t ∥B ( m t −r t )− ∥ 2 , (4.52)

and controller 28 finds the solution that minimizes the cost for every satellite t. Alternatively, the Lagrange multipliers described above may be used for this purpose.
Thus, controller 28 is able to synchronize a set of sensors 22 deployed over a wide area using satellites having unknown orbital parameters and time references. The directions to the satellites are estimated as a by-product. The accuracy of the synchronization is only limited by the radio bandwidth, signal/noise ratio (SNR), observation time, and the number of sources processed.
Locating Terrestrial Sources
Given only the null-space offset projection {circumflex over (δ)} ⊥ , controller 28 can establish synchronized time-based localization of terrestrial sources 24 . This approach can be useful since estimating {circumflex over (δ)} R is more demanding, and cannot be accomplished by the above methods with fewer than three celestial signals. Moreover, this sort of localization enables estimation of the full clock offset vector Bδ, as explained below.
Although HBr t =0 for celestial sources, this is not the case for terrestrial sources 24 . Therefore, if there is a sufficient number of sensors 22 receiving terrestrial signals, it is possible to get a synchronized localization of the terrestrial sources by solving:



HBm
t
=HBr
t
+HBδ+HBe
t


HBm t −{circumflex over (δ)} ⊥ =HBr t +e {circumflex over (δ)} ⊥ +HBe t (4.53)

wherein m t is now the vector of TOA measurements of terrestrial source t, and e {circumflex over (δ)} ⊥ is the estimation error of {circumflex over (δ)} ⊥ .
Since the error e {circumflex over (δ)} ⊥ is uncorrelated with e t , the expected estimation error under small error approximation is given by:












cov


(

p
t

)


=




(


L
t
T



H
T



Σ
t
†



HL
t


)


-
1








=




(



σ
S
2


N
S


+

σ
T
2


)




(


L
t
T



H
T



HBH
T



HL
t


)


-
1










=




(



σ
S
2


N
S


+

σ
T
2


)




(



L
t
T



L
t


-


L
t
T



R
T



RL
t



)


-
1




,










wherein








L
t



=
Δ





∂

Br
t



∂

p
t



=



∂


r
~

t



∂

p
t



.







(
4.54
)







Alternatively, controller 28 may locate terrestrial sources 24 using the fully-estimated offset vector and the terrestrial source sensor measurements:
Bm t =Br t +Bδ+Be t (4.55)

In this case, p t is found by minimizing:
argmin p t ( Bm t −Br t − ) T {tilde over (Σ)} t † ( Bm t −Br t − )

{tilde over (Σ)} t =T T ΣT+Bσ T 2 . (4.56)

The expected estimation error under linear approximation is given by:
cov ( p t )=( L t T {tilde over (Σ)} t † L t ) −1 (4.57)

This estimation will thus provide better localization performance than the solution based only on null-space offset projection.
Refining Clock Offset Estimation Using Terrestrial Source
The accuracy of the clock offset estimation for sensors 22 may be improved by considering the localization of terrestrial sources 24 . After refining the clock offsets, controller 28 can improve the localizations of the terrestrial sources and continue iterating to convergence. Convergence is assured, as improving the clock offset estimation accuracy increases the accuracy of localization of the terrestrial sources and of the directions of the satellite sources, and vice versa.
The ML estimator for Bδ may be derived in this case as follows: The error of {circumflex over (p)} t is a vector in two or three dimensions, whereas {tilde over ({circumflex over (r)} is a vector in M dimensions. We define the error vectors:



e
p

t


p
t
−{circumflex over (p)}
t


e {tilde over (r)} t {tilde over (r)} t −{tilde over ({circumflex over ( r )} t . (4.58)

There is a linear relationship between the error vectors, assuming the error is small:
e {tilde over (r)} t =L t e pt . (4.59)

The error covariance matrix of {tilde over (r)} t is given by:
cov ({tilde over ({circumflex over ( r )} t )= L t cov ( p t ) L t T , (4.60)

which is clearly singular and of the same rank as cov(p t ) (which is rank 2 or 3 depending on the sources distribution in a plane or in three dimensional space). Eigenvalue decomposition of cov({tilde over ({circumflex over (r)}) gives:
cov ({tilde over ({circumflex over ( r )} t )= U t Λ t U t T

U t =[R t T , H t T ]
Λ t =diag(λ t 1 , λ t 2 , λ t 3 , 0, . . . , 0)




R
t
R
t
T
=I


H t H t T =I, (4.61)

where the rows of R t are the eigenvectors of cov({tilde over ({circumflex over (r)} t ) corresponding to the non-zero eigenvalues, while the rows of H t are the eigenvectors corresponding to the zero eigenvalue, and λ t 3 =0 in the case of planar sensor formation.
Now we calculate the covariance of H t e {tilde over (r)} t :











cov


(


H
t



e


r
~

t



)


=




H
t



U
t



Λ
t



U
t
T



H
t
T








=





H
t



[


R
t
T

,

H
t
T


]






Λ
t



[


R
t
T

,

H
t
T


]


T



H
t
T








=




[

0
,
I

]




Λ
t



[

0
,
I

]









=


0







(
4.62
)







This expression means that the first two moments of the projected error H t e {tilde over (r)} t are zero, and under the assumption of Gaussian distribution yields:
H t e {tilde over (r)} t =0, Almost Sure. (4.63)

Since p t is unknown, the evaluation of L t and cov(p t ) is performed using the estimate of p t .
Coming back to the source measurement equation, multiplying from the left by H t gives:
H t Bm t =H t {tilde over (r)} t +H t Bδ+H t Be t (4.64)

This equation is modified to compensate by {tilde over ({circumflex over (r)} t :












H
t



(


Bm
t

-



r
~

^

t


)


=





H
t



e


r
~

t



+


H
t


B





δ

+


H
t



Be
t










=





H
t


B





δ

+


H
t



Be
t




,







(
4.65
)







The result is a linear measurement of a projection of the sensor clock offsets vector. Concatenating measurements from all of the terrestrial sources gives:





[





H
0



(


Bm
0

-



r
~

^

0


)








H
1



(


Bm
1

-



r
~

^

1


)






⋮






H


N
t

-
1




(





Bm


N
t

-
1


-








r
~

^



N
t

-
1





)





]

=



[




H
0






H
1





⋮





H


N
t

-
1





]


B





δ

+


[





H
0


B













0











H
1


B

























⋱









0














H


N
t

-
1



B


























]



[




e
0






e
1





⋮






e


N
t

-
1


,




]







which is completely independent of the localization errors.
Writing all of the equations we have on Bδ at this point gives:





[





H
0



(


Bm
0

-



r
~

^

0


)








H
1



(


Bm
1

-



r
~

^

1


)






⋮






H


N
t

-
1




(





Bm


N
t

-
1


-








r
~

^



N
t

-
1





)













]

=




[




H
0






H
1





⋮





H


N
t

-
1






H




R



]





B





δ












+












[





H
0


B





































H
1


B













0



















⋱




































H


N
t

-
1



B





















0





















σ
S
2


N
S




HB





































∑
R








]



[




e
0






e
1





⋮





e

N
t







e
⊥






e
R




]



















The ML estimator is established using WLS with the following definitions:





m

B





δ




=
△



[





(


H
0



(


Bm
0

-



r
~

^

0


)


)

T





(


H
1



(


Bm
1

-



r
~

^

1


)


)

T



…






(


H


N
t

-
1




(


Bm


N
t

-
1


-



r
~

^



N
t

-
1



)


)

T








]











A

B





δ




=
△





[




H
0
T




H
1
T



…



H


N
t

-
1

T




H
T




R
T




]








=
△





[




H
T
T




H
T




R
T




]











∑

H
T












=
△




σ
T
2



blkdiag


(



H
0



BH
0
T


,


H
1



BH
1
T


,




…
,


H

N
t




BH

N
t

T



)











∑

B





δ












=
△




σ
T
2



blkdiag
(


∑

H
T











,


∑


δ
^

⊥











,

∑
R












)







enables writing the estimator for Bδ as:








=



(


A

B





δ

T




∑

B





δ

†







A

B





δ




)

†



A

B





δ

T




∑

B





δ

†







m

B





δ
















cov


(
)




=
△






(


A

B





δ

T




∑

B





δ

†







A

B





δ




)

†







=





[



R
T




∑
R
†






R


+


H
T




∑
⊥
†






H


+


H
T
T




∑

H
T

†







H
T




]

†

.









(
4.66
)







A similar formulation can be applied when the range space measurements are not used as part of the estimation process. In this case, the range measurements are simply omitted from the WLS formulation, and the position error covariance is modified accordingly. In the case of low SNR, performing a few iterations of this process provides a solid estimate even though the assumption in Eq. (4.63) does not hold perfectly at first.
At this point the only information that is left unused to improve the estimate of the clock offsets is the terrestrial measurements R t Bm t . These measurements can be expressed as:
R t ( Bm t −{tilde over ({circumflex over ( r )} t )= R t Bδ+R t Be t +R t e {tilde over (r)} t , (4.67)

This equation is solved iteratively, as the uncertainty in the values of the clock offsets is dependent on the uncertainty in the terrestrial source position, which is again dependent on the uncertainty in the clock offsets. Therefore, it is advantageous first to re-estimate the terrestrial source locations using the refined clock offsets. It is simpler to consider the original measurement for the second iteration:
Bm t −{tilde over ({circumflex over ( r )} t=Bδ+Be t +e {tilde over (r)} t , (4.68)

It is a good approximation to say that these measurements are relatively uncorrelated to the clock offset estimations derived from the satellites signals, Since the little correlation that exists originates from the current position error, which is only partially correlated to the clock offset measurements derived from the satellites signals.
An expression may be developed as follows for the covariance matrix of:
m T [( Bm 0 −{tilde over ({circumflex over ( r )} 0 ) T , . . . , ( Bm 1 {tilde over ({circumflex over ( r )} 1 ) T , . . . , ( Bm N T −1 −{tilde over ({circumflex over ( r )} N T −1 ) T ] T . (4.69)

For this purpose, the error element may be expressed as follows:












Be
t

+

e


r
~

t



=




Be
t

+


L
t



e

p
t










=




Be
t

+




L
t



(


L
t
T





∑
~

t
†







L
t



)


†



L
t
T





∑
~

t
†








L
t



(


Be
t

+

)












=
△






Be
t

+



L
~

t



(


Be
t

+

)









=





(

I
+


L
~

t


)



Be
t


+



L
~

t



.










(
4.70
)







Now we can write the covariance matrix of m T :
cov ( m T ) Σ T

(Σ T ) i,i =σ T 2 ( I+{tilde over (L)} i ) B ( I+{tilde over (L)} i ) T +{tilde over (L)} i Σ Bδ {tilde over (L)} i T

(Σ T ) i,j ={tilde over (L)} i Σ Bδ{tilde over (L)} j T . (4.71)

Combining all measurements of the sensor clock offsets finally gives:





[




m
T







δ
^

⊥







δ
^

R




]

=



[





1

N
T


⊗
I





H




R



]


B





δ

+

n
T









∑

n
T












=
△




E


(


n
T



n
T
T


)


=

blkdiag
(


∑
T






,


∑
⊥






,

∑
R








)







The optimal estimator is established using WLS. Defining the following:
y ƒ [m T T , {circumflex over (δ)} ⊥ T , {circumflex over (δ)} R T ] T

A ƒ [1 N T I ) T , H T , R T ] T
Σ ƒ blkdiag(Σ T , Σ ⊥ , Σ R )

the estimator is given by:
= A ƒ T Σ ƒ † A ƒ ) † A ƒ T Σ ƒ † y ƒ

cov ( )=( A ƒ T Σ ƒ † A ƒ ) † .

After estimating the clock offsets, controller 28 may again re-estimate the locations of terrestrial sources 24 , and repeat until convergence as described above.
In some embodiments it is possible to skip the steps that use RBm t and return, or alternately do the final refinement using gradient methods on the original cost function and measurement vector.
Based on the above estimators, it can be shown that even with only one satellite source 26 , it is possible to achieve accurate synchronization and localization as long as there is a terrestrial source 24 that is received by at least six or seven sensors (depending on whether they are distributed in a plane or in 3D space). In other words, for any combination of satellite sources 26 and terrestrial sources 24 , as long as they are received by sufficient number of sensors 22 , the estimators defined above are well posed and have performance directly related to the measurement error.
The Navigation Problem
The problem of navigation of a moving object in system 20 is equivalent to assuming that a sensor of unknown position is added to the network. This addition does not change the form of the measurement model. Considering only celestial sources, for example, the only difference is that now one row of the G matrix is unknown, and another clock offset is added.
Defining s T as the unknown sensor position and δ s as its clock offset, the estimator may be written as:











Bm
t

=





-

B


[



G





s
T




]






p
_

t


+

B


[



δ





δ
S




]


+

Be
t








=





-

B


(


[



G




0



]

+

[



0





s
T




]


)






p
_

t


+

B


[



δ




0



]


+

B


[



0





δ
S




]


+

Be
t









(
4.72
)







Assuming 1 T δ=0, as is expected from the estimation process of the clock offsets, leads to:





Bm
t

=



-

B


[



G




0



]






p
_

t


+


B


[



0





s
T




]





p
_

t


+

[



δ




0



]

+

B


[



0





δ
S




]


+

Be
t






Rearranging the equation gives:






Bm
t

=



Γ
t



(



p
_

t

,
δ

)


+



A
t



(


p
_

t

)




[



s





δ
S




]


+

Be
t



,




wherein:










Γ
t



(



p
_

t

,
δ

)




=
△





-

B


[



G




0



]






p
_

t


+

[



δ




0



]












A
t



(


p
_

t

)




=
△



-


B


[



0


0






p
_

t
T




-
1




]


.







(
4.73
)







Collecting the equations for all t gives:





m
=


Γ


(



{


p
_

i

}


i
=
0



N
S

-
1


,
δ

)


+


A


(


{


p
_

i

}


i
=
0



N
S

-
1


)




[



s





δ
S




]


+
e


,




wherein:
Γ({ p i } i=0 N s −1 , δ) [Γ 0 T , Γ 1 T , . . . , Γ N s −1 ] T

A ({ p i } i=0 N s −1 ) [ A 0 T , A 1 T , . . . , A N s −1 ] T . (4.74)

Substituting for the satellite directions and the sensor clock offsets with their estimates (based on the methods described above without the use of the sensor of unknown position) gives:





m
=


Γ


(



{



p
_

^

i

}


i
=
0



N
S

-
1


,

δ
^


)


+


A


(


{



p
_

^

i

}


i
=
0



N
S

-
1


)




[



s





δ
S




]


+
e


,




The navigation problem is thus reduced to a weighed least squares estimation of the values:








[




s
^







δ
^

S




]

=



(


A
T


A

)


-
1






A
T



(

m
-
Γ

)


.






(
4.75
)







This estimation can be used as an initial point for the minimization of the full ML cost presented in Eq. (4.13), with the only difference being that the position of one of the sensors is unknown. Starting from the initial estimate given by Eq. (4.75), controller 28 can use gradient methods to find the optimal point in terms of ML cost.
The problem framed above can be extended to the case of multiple sensors of unknown position by solving the LS estimation for each of these sensors. The ML estimator can use these initial estimates to find the optimum of the full ML cost, and in so doing also refine the estimates of the known sensors clock offsets and the satellite directions. Terrestrial sources can also be incorporated into the ML cost function.
APPLICATION EXAMPLES
FIG. 5 is a schematic, pictorial illustration showing a navigation system 70 based on a network of sensors 22 , in accordance with an embodiment of the present invention. The sensor network in this example is deployed in an airport, with controller 28 housed in a control center 72 . Airplanes 74 are also allowed to carry sensors 76 (or to be able to transmit or reflect a signal that sensors 22 can detect). Sources that can be used by the system include ground sources 24 (such as beacons, radar signals), aerial sources (airplane beacons 76 ), and sky sources (satellites 26 ). System 70 will be generally immune to jamming and spoofing, unlike GNSS systems.
There are two possible modes of navigation in system 70 :
a. Standalone mode: The measurements of sensor 76 are used only to resolve its location and time offset. This mode is linear in the sensor position and clock offset, and therefore fast, and could be carried out by a processor (not shown) on board airplane 74 .
b. Joint mode: The measurements of sensor 76 are also used to improve all other system estimates, including the positions and time estimates of other airplane sensor.
The arrangement shown in FIG. 5 enables accurate airplane navigation, and the measurements of airplane sensors 76 can also be used to improve system accuracy and integrity even further using the methods described above. As noted earlier, the readings of sensor 76 can be used to improve clock synchronization, terrestrial source localization and satellite direction accuracy. Navigation is still possible even if only terrestrial sources are present, although the processing required is typically more complex.
FIG. 6 is a schematic, pictorial illustration of a computer system 80 with sensor-based synchronization, in accordance with an embodiment of the present invention. System 80 may comprise, for example, a computerized securities trading system, in which servers 82 are connected by a network 84 and user sensors 22 in accurately synchronizing their respective clocks based on signals from satellite sources 26 .
Trading time is of great importance in such systems, and time-stamping is regulated by law. In systems that rely on GPS-based synchronization, if the GPS receiver is jammed and accurate time stamping is not available, trading must stop until it is recovered. Spoofing of the trading system time could cause trades to be recorded at a loss.
In contrast to existing solutions, servers 82 use sensors 22 to implement spoof-proof and jamming-proof time-stamping, based on the methods of clock synchronization that are described above. As time transfer is enabled without the use of GNSS, the absolute time can be maintained by all servers 82 , which are unlikely to be GNSS jammed at the same time, or the servers as a group could perform time holdover until the total jamming has passed. System 80 is thus able to maintain normal operation even under jamming attacks and to detect and reject attempts at source spoofing quickly and robustly.
FIG. 7 is a schematic, pictorial illustration of a communication system 90 with sensor-based synchronization, in accordance with an embodiment of the present invention. System 90 comprises multiple base stations (BS) 92 , which are coupled via a network 94 to controller 28 . The base stations collect TOA information gathered by user equipment 96 , and controller 28 (or distributed controllers in base stations 92 ) uses this information in synchronizing the base station clocks. System 90 differs from the embodiments described above in that the positions of the sources (base stations 92 ) are known precisely, while the positions of the sensors (user equipment 96 ) may not be known accurately. Clock synchronization is accomplished, however, substantially as described above.
The precise synchronization that is achieved in system 90 can be used in various ways to improve network performance, such as reducing interference, increasing network capacity or bits per Hz, improving resource allocation, enabling Cooperative Multipoint (COMP) transmission in small and macrocell deployments, and supporting time-based localization techniques such as OTDOA (observed time difference of arrival), and UTDOA.
Assuming system 90 operates in accordance with the Long-Term Evolution (LTE) family of standards, clock synchronization in the system can be implemented as follows:
1. Collect OTDOA measurements or equivalent type of measurements from user equipment 96 .
a. Such measurements may be invoked by enabling active location request generation, which generates localization requests to the user equipment in the area of the base stations that are to be synchronized. b. If the user equipment also calculates its GPS position, the base stations may retrieve this information, as well, since then the UE will be regarded as a source (as well as a sensor) of known position and can improve performance as described above.
2. Process all measurements in controller 28 , as described above, and return the user equipment positions and base stations clock offsets and, if needed, their frequency offsets. 3. Update the base stations clocks accordingly.

The rate at which the process is repeated is dependent on the stability of the base stations clocks relative to one another. Optionally, the rate at which the above process is performed can be reduced by modeling the dynamics of the changing clock offsets.


Although the above example, relates specifically to LTE, other mobile network technologies (such as UMTS) that provide OTDOA-like measurements can use the methods described herein.
One such measurement type is UTDOA (Uplink TDOA), which is performed by dedicated sensors called LMUs (Location Measurement Units). The LMU can be an integral part of the base station or a separate unit, installed on the base station or in another position. When using UTDOA measurements, the emitters are the user equipment (UE), and the LMUs are considered the sensors of known position. Using the methods described herein, the LMUs clocks are synchronized, while the UE locations are also resolved. Moreover, if the LMU clock is correlated to the base station clock, then the base stations and LMUs are also synchronized, enabling all of the benefits stated above and eliminating the need for a dedicated external synchronization unit in each LMU.
In another embodiment (not shown explicitly in the figures), sensors are used to gather information on the environment, and the locations of the sensors need to be determined (as in the case of Real Time Location Services, for example). These environmental sensors may be regarded as “sources” in the context of this embodiment, and localization of these sensors may be achieved based solely on the signals that they emit. The sensor measurements of these signals constitute the information gathered by the sensors that is relayed to a central node, so that no special transmissions are required for achieving sensor localization.
In such a network, in other words, there are two types of sensors:
1. Localization sensors 22 (which measure TOA), preferably of known position. 2. General sensing sensors, which gather sensing information on their environment (such as temperature, vibration, humidity, etc.) and serve as sources 24 .

The synchronization that is achieved among the type 1 sensors can be used to efficiently manage the network.


In some embodiments, synchronization may be the major interest and not localization. This situation can arise when, for example, a wireless network needs to manage wakeup times of its nodes. An embodiment of the present invention provides a good solution for such cases, since emitters are usually present in any environment. Thus, even if only pairwise distances of the sensors are known, synchronization can be achieved to some extent.
Additionally or alternatively, the techniques described herein can be used to check whether an existing system is synchronized and calibrated properly with respect to time offsets and skews, i.e., to detect the occurrence of synchronization faults. If the clock offsets and skews derived using the methods described above do not match those in the existing system, there may be a malfunction in the hardware or software of the existing system. In this case, the time offset and skew of the system can be recalibrated based on the synchronization described by the above methods, and this synchronization can also be used to provide a backup clock or even a set of such clocks for the system, thus affording maximal availability and reliability.
Although the embodiments disclosed above relate specifically to problems of sensor synchronization and emitter localization (along with navigation and spoofing detection), other problems that can be formulated in an equivalent manner can be also solved by the methods that are described herein. For example, the principles of the techniques described in the present patent application may be extended to equivalent embodiments that arise from the time/frequency duality between DTOA measurements and differential Doppler measurements. All such solutions are considered to be within the scope of the present invention.
It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.