# Reliability Analysis of Network Real-Time Kinematic

Authors: Mohammed Ouassou; Bent Natvig; Anna B. O. Jensen; Jørund I. Gåsemyr
Journal: Journal of Electrical and Computer Engineering
 (2018)

---

## Abstract

The multistate reliability theory was applied to the network real-time kinematic (NRTK) data processing chain, where the qualities of the network corrections, baseline residuals, and the associated variance-covariance matrices are considered as the system state vectors. The state vectors have direct influence on the rover receiver position accuracy. The penalized honored stochastic averaged standard deviation (PHSASD) is used to map the NRTK sensitive data, represented by the states vectors to different levels of performance. The study shows that the improvement is possible by identification of critical components in the NRTK system and implementation of some parallelism that makes the system more robust.


---

## Body

## 1. Introduction

High accuracy positioning with GNSS is carried out using both code and carrier phase data from the GNSS satellites. To obtain position accuracies at the cm or mm level using carrier phase data, an important part of the data processing is to estimate the initial oscillator phase offset, the so-called ambiguity, for each receiver-satellite pair. Resolution of ambiguities requires that the influence of most errors sources in the positioning process is reduced to the cm-level, and high accuracy positioning is therefore often done in a relative mode where the position of a GNSS receiver located in an unknown position (the rover) is determined relative to one or more reference stations located in positions known on beforehand [1].With relative carrier phase based GNSS positioning the effects of the distance-dependent error sources such as uncertainties in satellite positions and atmospheric effects on the satellite signals induced by the ionosphere and troposphere are reduced. Also the effects of satellite and receiver clock errors in the positioning process are reduced by relative positioning, and all this in combination makes it possible to resolve the ambiguities and thereafter obtain positions for the rover at the cm or mm level.For high accuracy GNSS positioning in real time, the real time kinematic (RTK) technique has been developed. Traditionally this is based on a reference station transmitting data to the rover where the data is used in estimation of the position of the rover in a relative or differential mode [2].Using a network of reference stations for RTK, the so-called NRTK technique, provides the opportunity for applying more advanced algorithms for estimation of the distance-dependent errors within the network and thereby possibilities for providing a more robust service. Such operational NRTK services exist in many regions and countries today and have become an indispensable tool in high accuracy navigation and surveying.A brief description of the NRTK functionality is as follows: the first step is collection of raw observations from the network of reference stations, solving the ambiguities within the reference network, and generating error estimates. Then an interpolation/smoothing scheme is applied to generate the NRTK corrections for the user location. For information on how to avoid a loss of information under interpolation of NRTK data, the interested reader is referred to [3].The NRTK corrections are then transmitted to rover receivers. Several NRTK techniques exist and the most commonly used at present are, for instance, the Master Auxiliary Concept (MAC) [4, 5], the Virtual Reference Station (VRS) concept [6], and the FKP techniques [7], as well as the Network Adjustment (NetAdjust) concept developed by Raquet and Lachapelle [8, 9].Multistate system reliability theory has been a research topic for many years, for instance, extension of the system from two-state to multistate reliability [10, 11] to compute the mean performance level at any given time t and stochastic evaluation and bound computation of multistate coherent systems [12], further, studies on application of reliability analysis to GNSS data processing [2], a comparative GNSS reliability analysis [13], reliability analysis under GNSS weak signals [14], accuracy and reliability of multi-GNSS real-time precise positioning [15], and robust reliability testing in case of signal degradation environment [16, 17].In order to avoid confusion between the reliability theory definition used in different fields, we refer to the traditional reliability theory to the context of statistical testing based on the theory developed by Baarda [18], while component, system, binary, and multistate reliability terms will be used in case of component and system reliability computation.Our aim is to provide the user in the field with continuously high quality corrections with the ability to identify the periods for which the reliability of the network RTK performance is reduced in terms of accuracy and availability. Therefore, solution quality indicators describing the reliability of the network RTK are needed to transfer the status of the network to the user in the field. Intensive research has been conducted recently in this field to derive these quality indicators and can be classified into two main classes; (i) spatially correlated (ionosphere, troposphere, and orbital) error indicators; (ii) residuals errors indicators. Most network RTK used quality indicators are residual integrity monitoring (RIM) and irregularity parameters (IP) quality indices [19], residual interpolation uncertainty (RIU) [20], geometry-based quality indicator (GBI) [21], and ionospheric index I95 [20]. An elegant presentation summarizing the network RTK quality indicators can be found in [22].In order to apply reliability analysis to a NRTK system, the starting point is the decomposition of the block diagrams of NRTK processing chain into simple components and computation of the system reliability. Figure1 shows three levels of data processing modules, the network, the baseline, and the rover receiver modules, where R denotes rover, S denotes reference station, and (dX,dY,dZ) denote errors in the position X, Y, Z coordinates, respectively. Based on these levels, we can build the reliability block diagrams for the NRTK processing chain and compute the reliability for the entire system.Figure 1
NRTK processing chain. The left panel shows NRTK module that produces the network corrections. The curved line indicates the output generated by the network module. Middle panel shows the local and the baseline processing module. Right panel shows the rover position solution module.The rest of the paper is organized as follows:Section2: brief introduction to component, system, and binary state reliability theory and deterministic and stochastic reliability.Section3: NRTK blocks diagram determination and module reliability computations.Section4: multistate reliability theory applied to NRTK processing chain.Section5: some test results.Section6: procedures used to validate the NRTK system reliability.Section7: discussions and conclusion.Test data used in this investigation is described in AppendixA.


## 2. Reliability Analysis

The aim of this section is to introduce the basic of the component, system, and binary state reliability theory, including deterministic and stochastic reliability, followed by decomposing the block diagrams of the NRTK processing chain into simple components, and compute the entire system reliability. The description of the structural relationship between the components and the system must be defined. Figure2 illustrates the concept and each main block will be treated separately in the coming sections.Figure 2
Network real-time kinematic processing chain main modules. Dotted lines describe the components dependency from different levels.


### 2.1. Structure Functions

In order to construct the entire reliability block diagram of the NRTK data integrity, it is necessary to define the elementary building blocks as Bernoulli indicator function [23, pp. 28-29]. The function will signal if a unit or system is functioning or not.A random variableX is said to be a Bernoulli random variable if its probability function is given by (1). The indicator and structure functions are given below by following the notation given by Natvig [24]:(1)Xi=1,successwithprobabilityp,0,failurewithprobability1-p.


#### 2.1.1. Bernoulli Indicator Function

Letxi denote the indicator function of component, i. Then we have(2)xi=1,ifthei’thcomponentisfunctioning,0,otherwise.


#### 2.1.2. System Structure Function

Let the state vectorx=(x1,x2,…,xn) give which components are functioning and which are not.Letϕ(x) denote the Bernoulli indicator of the state vector, x. Then we have(3)ϕx=1,ifthesystemisfunctioning0,otherwiseϕ(x) is the structure function of the system.


#### 2.1.3. Series Structure Function

The series structure functionϕs(x) worksif and only if all components of the state vector x are functioning. The series structure function ϕs(x) reads(4)ϕsx=min⁡x1,x2,…,xn=∏i=1nxi.


#### 2.1.4. Parallel Structure Function

The parallel structure functionϕp(x) worksif and only if at least one of the components of the state vector x is functioning. The parallel structure function ϕp(x) reads(5)ϕpx=max⁡x1,x2,…,xn=1-∏i=1n1-xi=∐i=1nxi,where ∐ is read “ip” and denotes the parallel coupling operator.


#### 2.1.5.k-out-of-n Structure Function

A system composed ofn components which is functioningif and only if at leastk components are functioning is called ak-out-of-n structure(6)ϕk,nx=1,if∑i=1nxi≥k,0,otherwise.Note that the structure functions given by (4) and (5) are ann-out-of-n structure and an1-out-of-n structure, respectively. Other structure functions exist, for instance, the bridge Natvig [24, p. 12].


### 2.2. System Reliability Computation

The structure functions are defined; now is time to compute the system reliability. We move from the deterministic model to the stochastic one by introducing the random variables. Some notations are needed to represent the state vector, structure function, and the reliability. We follow the notations given by Hoyland and Rausand [25, Chaps. 3–5]. We denote the state variables of the n independent component at time t by(7)X1t,X2t,…,Xnt.The corresponding state vector and the structure function are denoted, respectively, by(8)Xt=X1t,X2t,…,Xnt,ϕXt.The probabilities of interest are presented by(9)PXit=1=pitfori=1,2,…,n,PϕXt=1=pst,where pi(t) is the component reliability while ps(t) is the system reliability. Assuming that the components are independent, then the computation of the reliability of the state vector X(t) and the system ϕ(X(t)) at time t are defined as the expectation operator(10)EXit=0·PXit=0+1·PXit=1=pitfori=1,2,…,n.Let R denote the system reliability, then we have(11)EϕXt=pst=Rp1t,p2t,…,pnt=Rpt.To avoid confusion, pi=P(Xi(t)=1) is the probability of functioning of the ith component and referred to as the component reliability.


#### 2.2.1. Reliability of Series Structures

The reliability functionRs(p) of the series system of n independent components is given by the expression:(12)Rsp=PϕXt=1=PXit=1∀i=1,2,…,n=∏i=1npit.If all components have the same p(t), (12) becomes p(t)n. For n=5 and p=0.99, then the reliability Rs(p)=0.951.An important remark is that the reliability of a series structure is at most as reliable as the least reliable component, that is,Rs(p)≤mini⁡(pi(t)).


#### 2.2.2. Reliability of Parallel Structures

The reliability functionRp(p) of the parallel system of n independent components is given by the expression:(13)Rpp=PϕXt=1=PXit=1forsomei=1,2,…,n=1-PXit=0∀i=1,2,…,n=1-∏i=1n1-pitIf all components have the same p(t), (13) becomes 1-1-p(t)n. For n=5 and p=0.99, then the reliability Rp(p)=1.An important remark is that the reliability of a parallel structure is at least as reliable as the most reliable component, that is,R(p)≥maxi⁡(pi(t)).Details on how to compute the reliability of parallel structure in general are given in AppendixC.


#### 2.2.3. Reliability ofk-out-of-n Structures

The reliability functionR(k-n)(p) of thek-out-of-n system of n independent components with equal probability pi(t)=p is given by the expression:(14)Rk-np=PϕXt=1=P∑i=1nXit≥k=∑i=knni·pi1-pn-i.


## 2.1. Structure Functions

In order to construct the entire reliability block diagram of the NRTK data integrity, it is necessary to define the elementary building blocks as Bernoulli indicator function [23, pp. 28-29]. The function will signal if a unit or system is functioning or not.A random variableX is said to be a Bernoulli random variable if its probability function is given by (1). The indicator and structure functions are given below by following the notation given by Natvig [24]:(1)Xi=1,successwithprobabilityp,0,failurewithprobability1-p.


### 2.1.1. Bernoulli Indicator Function

Letxi denote the indicator function of component, i. Then we have(2)xi=1,ifthei’thcomponentisfunctioning,0,otherwise.


### 2.1.2. System Structure Function

Let the state vectorx=(x1,x2,…,xn) give which components are functioning and which are not.Letϕ(x) denote the Bernoulli indicator of the state vector, x. Then we have(3)ϕx=1,ifthesystemisfunctioning0,otherwiseϕ(x) is the structure function of the system.


### 2.1.3. Series Structure Function

The series structure functionϕs(x) worksif and only if all components of the state vector x are functioning. The series structure function ϕs(x) reads(4)ϕsx=min⁡x1,x2,…,xn=∏i=1nxi.


### 2.1.4. Parallel Structure Function

The parallel structure functionϕp(x) worksif and only if at least one of the components of the state vector x is functioning. The parallel structure function ϕp(x) reads(5)ϕpx=max⁡x1,x2,…,xn=1-∏i=1n1-xi=∐i=1nxi,where ∐ is read “ip” and denotes the parallel coupling operator.


### 2.1.5.k-out-of-n Structure Function

A system composed ofn components which is functioningif and only if at leastk components are functioning is called ak-out-of-n structure(6)ϕk,nx=1,if∑i=1nxi≥k,0,otherwise.Note that the structure functions given by (4) and (5) are ann-out-of-n structure and an1-out-of-n structure, respectively. Other structure functions exist, for instance, the bridge Natvig [24, p. 12].


## 2.1.1. Bernoulli Indicator Function

Letxi denote the indicator function of component, i. Then we have(2)xi=1,ifthei’thcomponentisfunctioning,0,otherwise.


## 2.1.2. System Structure Function

Let the state vectorx=(x1,x2,…,xn) give which components are functioning and which are not.Letϕ(x) denote the Bernoulli indicator of the state vector, x. Then we have(3)ϕx=1,ifthesystemisfunctioning0,otherwiseϕ(x) is the structure function of the system.


## 2.1.3. Series Structure Function

The series structure functionϕs(x) worksif and only if all components of the state vector x are functioning. The series structure function ϕs(x) reads(4)ϕsx=min⁡x1,x2,…,xn=∏i=1nxi.


## 2.1.4. Parallel Structure Function

The parallel structure functionϕp(x) worksif and only if at least one of the components of the state vector x is functioning. The parallel structure function ϕp(x) reads(5)ϕpx=max⁡x1,x2,…,xn=1-∏i=1n1-xi=∐i=1nxi,where ∐ is read “ip” and denotes the parallel coupling operator.


## 2.1.5.k-out-of-n Structure Function

A system composed ofn components which is functioningif and only if at leastk components are functioning is called ak-out-of-n structure(6)ϕk,nx=1,if∑i=1nxi≥k,0,otherwise.Note that the structure functions given by (4) and (5) are ann-out-of-n structure and an1-out-of-n structure, respectively. Other structure functions exist, for instance, the bridge Natvig [24, p. 12].


## 2.2. System Reliability Computation

The structure functions are defined; now is time to compute the system reliability. We move from the deterministic model to the stochastic one by introducing the random variables. Some notations are needed to represent the state vector, structure function, and the reliability. We follow the notations given by Hoyland and Rausand [25, Chaps. 3–5]. We denote the state variables of the n independent component at time t by(7)X1t,X2t,…,Xnt.The corresponding state vector and the structure function are denoted, respectively, by(8)Xt=X1t,X2t,…,Xnt,ϕXt.The probabilities of interest are presented by(9)PXit=1=pitfori=1,2,…,n,PϕXt=1=pst,where pi(t) is the component reliability while ps(t) is the system reliability. Assuming that the components are independent, then the computation of the reliability of the state vector X(t) and the system ϕ(X(t)) at time t are defined as the expectation operator(10)EXit=0·PXit=0+1·PXit=1=pitfori=1,2,…,n.Let R denote the system reliability, then we have(11)EϕXt=pst=Rp1t,p2t,…,pnt=Rpt.To avoid confusion, pi=P(Xi(t)=1) is the probability of functioning of the ith component and referred to as the component reliability.


### 2.2.1. Reliability of Series Structures

The reliability functionRs(p) of the series system of n independent components is given by the expression:(12)Rsp=PϕXt=1=PXit=1∀i=1,2,…,n=∏i=1npit.If all components have the same p(t), (12) becomes p(t)n. For n=5 and p=0.99, then the reliability Rs(p)=0.951.An important remark is that the reliability of a series structure is at most as reliable as the least reliable component, that is,Rs(p)≤mini⁡(pi(t)).


### 2.2.2. Reliability of Parallel Structures

The reliability functionRp(p) of the parallel system of n independent components is given by the expression:(13)Rpp=PϕXt=1=PXit=1forsomei=1,2,…,n=1-PXit=0∀i=1,2,…,n=1-∏i=1n1-pitIf all components have the same p(t), (13) becomes 1-1-p(t)n. For n=5 and p=0.99, then the reliability Rp(p)=1.An important remark is that the reliability of a parallel structure is at least as reliable as the most reliable component, that is,R(p)≥maxi⁡(pi(t)).Details on how to compute the reliability of parallel structure in general are given in AppendixC.


### 2.2.3. Reliability ofk-out-of-n Structures

The reliability functionR(k-n)(p) of thek-out-of-n system of n independent components with equal probability pi(t)=p is given by the expression:(14)Rk-np=PϕXt=1=P∑i=1nXit≥k=∑i=knni·pi1-pn-i.


## 2.2.1. Reliability of Series Structures

The reliability functionRs(p) of the series system of n independent components is given by the expression:(12)Rsp=PϕXt=1=PXit=1∀i=1,2,…,n=∏i=1npit.If all components have the same p(t), (12) becomes p(t)n. For n=5 and p=0.99, then the reliability Rs(p)=0.951.An important remark is that the reliability of a series structure is at most as reliable as the least reliable component, that is,Rs(p)≤mini⁡(pi(t)).


## 2.2.2. Reliability of Parallel Structures

The reliability functionRp(p) of the parallel system of n independent components is given by the expression:(13)Rpp=PϕXt=1=PXit=1forsomei=1,2,…,n=1-PXit=0∀i=1,2,…,n=1-∏i=1n1-pitIf all components have the same p(t), (13) becomes 1-1-p(t)n. For n=5 and p=0.99, then the reliability Rp(p)=1.An important remark is that the reliability of a parallel structure is at least as reliable as the most reliable component, that is,R(p)≥maxi⁡(pi(t)).Details on how to compute the reliability of parallel structure in general are given in AppendixC.


## 2.2.3. Reliability ofk-out-of-n Structures

The reliability functionR(k-n)(p) of thek-out-of-n system of n independent components with equal probability pi(t)=p is given by the expression:(14)Rk-np=PϕXt=1=P∑i=1nXit≥k=∑i=knni·pi1-pn-i.


## 3. Reliability in the NRTK Processing Chain

The aim of this section is to determine the structure functions, NRTK module’s reliability, and the corresponding block diagrams.


### 3.1. Considerations around NRTK Data Processing

Some considerations around the NRTK data integrity are introduced below as a background for the design process and to ease the discussions in the following sections. For more information on GNSS data processing, the reader is referred to [1, 2, 26, 27]. The key to precise positioning is the correct ambiguity resolution and validation. With ambiguities resolved to wrong integer numbers, there will be offsets in the position solution, and with float ambiguities (ambiguities that are not fixed to integer values) the position solution is inaccurate and also very unstable and sensitive to changes in satellite geometry.Good satellite-receiver geometry, as, for instance, expressed by the so-called DOP factor (dilution of precision), is important to perform successful ambiguity resolution and achieve centimeter level accuracy in real time.Spatiotemporal models that describe well the variations of the spatially correlated errors in the corrections field are also an important key for reliable NRTK positioning.Robust estimation algorithms to handle large data sets are also a key factor becoming more important in the future as observations from several GNSS systems to a larger degree will be combined in one processing loop. Today, most NRTK systems operate with data from the American GPS and the Russian GLONASS system. Including data from the European Galileo as well as the Chinese Beidou systems in NRTK operations will soon be the norm for most NRTK services. With satellites from more GNSS systems being available the satellite-receiver geometry on the rover side is improved. This is especially important when the user is operating in constricted environments such as narrow street canyons or forest areas.


### 3.2. NRTK Corrections Reliability Analysis

The main function of the NRTK is to provide the rover in the field with high quality corrections on an epoch-by-epoch basis.From Figure2, five modules MN,i are defined for the network and the reliability of each module will be evaluated. Mi,j corresponds to level i∈{N,B,R} and module j∈{1,2,…,5}, where N stands for network, B for baseline, and R for rover receiver. For instance, the module MN,1 corresponds to the first network module, the Station Data Integrity, as shown in Figure 2, and MR,1 denotes the first of the rover modules, i.e., the Prediction Function as shown in Figure 2.


#### 3.2.1. Reference Receivers Data Integrity

Generation of high quality raw observations at reference receivers requires reliable hardware (HWC) and software (SWC) components. Expensive hardware and sophisticated algorithms are keys to achieve this goal. Figure3 shows the concept and each component will be treated separately in the next sections.Figure 3
Main block diagram of moduleMN,1.Let software and hardware components be represented by the modulesMN,1,X and MN,1,Y, respectively.Software Component of Module M N , 1 Definition. SWC requires an ensemble of sequential checks on raw observations. This includes(i)
Letx1,1 denote the satellite data integrity algorithm. This algorithm will discard the measurements from unhealthy satellite(s) or from satellite(s) for which we do not have the orbital data.(ii)
Letx1,2 denote controlled cycle-slip algorithm. This task requires investigation of carrier phase discontinuities by examination of loss of lock (LLI) indicator and signal-to-noise ratio (SNR) flags.(iii)
Letx1,3 denote uncontrolled cycle-slips in the observations. The algorithm uses the observation combinations for this purpose. The interested reader is referred to [27, pp. 95–101].(iv)
Letx1,4 denote the reference receiver clock offset reset algorithm. Continual corrections are carried out to reduce the effect of the jump. The receiver clock offset (jump with ±1 ms) must be detected and corrected because they cause jump in carrier phase.(v)
Letx1,5 denote outliers detection and repair algorithm.(vi)
Letx1,6 denote the low elevation angle. Algorithm prunes satellite(s) based on their low elevation angle.(vii)
Letx1,7 denote the minimum observations required to generate the corrections. At least 4 observation types are needed (L1, L2, P1, and P2). For more information about the observation types provided by satellites, the reader is referred to [28].(viii)
Letx1,8 denote the reference receiver clock stability algorithm.(ix)
Letx1,9 denote the multipath mitigation algorithm.(x)
Letx1,10 denote the reweighting algorithm. All units are parallel coupled.
(1)
Letx[1,10,1] denote a low elevation reweighting algorithm.(2)
Letx[1,10,2] denote a scintillation reweighting algorithm.(3)
Letx[1,10,3] denote a signal-to-noise reweighting algorithm.Figure5 shows the block diagram of the network reweighting algorithm component x1,10.Block Diagram and Reliability of Software Component. The structure function of the software component is well described by the 5-out-of-10 structure function. This means that the more algorithms check is, the more reliable raw observations become.In order to produce reliable raw observations of high quality, it is necessary to perform at least five checks from a total of ten. With ten algorithms’ check, we can generate high quality raw observations while five algorithms’ check will produce acceptable level raw observations. The selection of the algorithms is independent of the order.The structure functionΦ(x) of Figure 4 is given by the expression(15)Φx=max⁡min⁡x1,1,x1,2,x1,3,x1,4,x1,5,min⁡x1,1,x1,2,x1,3,x1,4,x1,6,…,min⁡x1,6,x1,7,x1,8,x1,9,x1,10.Assuming that the individual algorithms are independent with equal probability p(t), then the reliability of software component is(16)pst=Pyt≥5=∑x=51010xpx1-p10-x.Due to the fact that yt~binom(n,p(t)). The block diagram of the xN,1,10 is given by Figure 5.Figure 4
Block diagram of software component of network moduleMN,1.Figure 5
Block diagram of the network unitx1,10.The corresponding reliability reads(17)pN,1,10=pN,10,1+pN,10,2+pN,10,3-pN,10,1pN,10,2+pN,10,1p1,10,3+pN,10,2pN,10,3+pN,10,1pN,10,2pN,10,3.Hardware Component of Module M N , 1. The qualities of the GNSS receiver, firmware robustness, GNSS antenna, and choke ring quantify the hardware component. Figure 6 shows the block diagram of the hardware component of the network module MN,1.Figure 6
Block diagram of hardware component of moduleMN,1. The left block describes the GNSS receiver and the right is for the GNSS antenna.The elements of the hardware component of the network moduleMN,1 are as follows:(i)
Lety1,1 denote the GNSS receiver type.(ii)
Lety1,2 denote the rover software known as firmware to decode the GNSS signals.(iii)
Lety1,3 denote the GNSS antenna type.(iv)
Lety1,4 denote the choke ring that allows better reception of low elevation angle GPS satellites and improved multipath rejection.(v)
Lety1,5 denote duplicated system (as discussed in the next section).The structure functionΦ(y) is given by the expression(18)Φy=min⁡max⁡y1,1,y1,2,max⁡y1,3,y1,4=y1,1∐y1,2y1,3∐y1,4=y1,1+y1,2-y1,1y1,2y1,3+y1,4-y1,3y1,4.The reliability of the hardware of the module MN,1 reads(19)pst=p1,1+p1,2-p1,1p1,2p1,3+p1,4-p1,3p1,4.Hardware Component Improvement. In order to ensure continuous raw data delivery at the station, duplicated hardware components are recommended. This task is accomplished by a parallel coupling of the module MN,1, defined by Figure 6. Applying the definition of reliability computation of parallel coupling (Equation (C.2)), the duplicated HWC reliability reads(20)pt=pst+pst-pst2=pst2-pst,where ps(t) is given by the Equation (19). The drawback of a duplicated system is the financial issues.


#### 3.2.2. Network Ambiguity Resolution

As mentioned in Section3.1. The key for precise positioning is the correct ambiguity resolution and validation. The module MN,2 is composed of two main parts, the first part is the ambiguity processing algorithms performance, and the second part is the statistical ambiguity quality indicators derived from the processing chain of the ambiguity.The components of the moduleMN,2 are as follows:(i)
Letx2,1 denote the float solution of the ambiguity obtained via least square or Kalman filter.(ii)
Letx2,2 denote the LAMBDA method [29] applied to a float solution to reduce the search space and to obtain a fix solution.(iii)
Letx2,3 denote the validation procedures to validate the final solution.(iv)
Letx2,4 denote the administration of the ambiguities.(v)
Letx2,5 denote the success rate of the ambiguities resolution.(vi)
Letx2,6 denote the ambiguity dilution of precision (ADOP) [30]. ADOP measures the precision of the ambiguities and can be viewed as a quality indicator.(vii)
Letx2,7 denote time to fix.The block diagram of theMN,2 is given by Figure 7.Figure 7
Network ambiguity resolution moduleMN,2. The first block of this figure represents the ambiguity processing algorithms and the second block is the ambiguity quality indicators.Structure Function of M N , 2. The structure function of the module MN,2 reads(21)Φx=min⁡max⁡Φ1x,max⁡Φ2x=min⁡maxx2,1,x2,2,x2,3,x2,4,maxx2,5,x2,6,x2,7=1-∏i=141-x2,i1-∏i=571-x2,i.Reliability of M N , 2. Reliability of the module MN,2 reads(22)pst=1-∏i=141-p2,i1-∏i=571-p2,i=min⁡P1,P2=P1P2dropping the index 2 in the expression of ps(t) and compute P1 and P2(23)P1t=∑i=14pi-∏i=14pi-p1p2+p1p3+p1p4+p2p3+p2p4+p3p4+p1p2p3+p1p2p4+p1p3p4+p2p3p4,P2t=∑i=57pi+∏i=57pi-p5p6+p5p7+p6p7.


#### 3.2.3. Network Corrections Quality

The quality of the network corrections depends on various parameters, for instance, the estimation algorithms, network status (sparse/dense), the covariance functions, and the smoothing/interpolation algorithms. The components of the moduleMN,3 are as follows:(i)
Letx3,1 denote the network reference receivers’ separation. Dense network is attractive because the network corrections are better estimated with short distances between reference receivers.(ii)
Letx3,2 denote the quality of the estimation algorithm used to estimate the parameter vector θ∈Θ.(iii)
Letx3,3 denote the quality of the covariance function used to model the network correlation errors.(iv)
Letx3,4 denote the quality of the interpolation algorithm used to generate the user corrections. Parallel interpolation algorithms will enhance the quality of the user corrections generation and avoid the information loss.Block Diagram of M N , 3. The block diagram of the module MN,3 is given by Figure 8.Figure 8
Block diagram of network correction quality moduleMN,3.Structure Function of M N , 3. The structure function of the module MN,3 reads(24)Φx=min⁡x3,1,x3,2,x3,3,x3,4=∏i=14x3,i.Reliability of M N , 3. Dropping the index 3, the reliability of MN,3 reads(25)pst=∏i=14p3,i.Amelioration Potential of M N , 3. Our aim is to provide the user in the field with high quality corrections on an epoch-by-epoch basis. The interpolation/smoothing algorithm plays a central role. We can implement different parallel interpolation/smoothing algorithms that compete about the quality of service parameters. The corrections will be sent from the algorithm with higher score. For more information on this topic, the interested reader is referred to [3].In this case, replacing the componentx3,4 with a parallel structure function ϕ(x3,4)=max⁡(y1,y2,…,y5), the computation of the new block diagram is straightforward.Letqi denote the functioning probability of unit yi (Figure 9) for i=1,2,…,5. Then the reliability of x3,4 reads(26)ps3,4t=∑i=15qi+∏i=15qi-q1q2+q1p3+q1p4+q1p5+q2q3+q2q4+q2q5+q3q4+q3q5+q4q5+q1q2q3+q1q2q4+q1q2q5+q2q3q4+q2q3q5+q3q4q5-q1q2q3q4+q1q2q3q5+q2q3q4q5.Figure 9
Improved block diagram of moduleMN,3. The component x3,4 is replaced by a parallel structure function ϕ(y).The improved reliability of moduleMN,3 reads(27)ps=ps3,4∏i=13p3,i.


#### 3.2.4. Network Data Integrity

The moduleMN,4 responsibility is to carry out the quality control on the corrections field and the corresponding variance-covariance matrices. This includes the following:(i)
Letx4,1 denote global test statistics to detect any extremal events that can bias the rover position, corrections field investigation.(ii)
Letx4,2 denote the inspection of variance-covariance matrices for Heywood effects algorithm [31].(iii)
Letx4,3 denote the application of the imputation algorithm to compute the statistics.(iv)
Letx4,4 denote the total variance monitoring algorithm.(v)
Letx4,5 denote the generalized variance monitoring algorithm.Serial coupling is the appropriate choice for the moduleMN,4 and the block diagram is given by Figure 10.Figure 10
Block diagram of moduleMN,4.Block Diagram of M N , 4. See Figure 10.Structure Function of M N , 4. The structure function of the module MN,4 reads(28)Φx=min⁡x4,1,x4,2,x4,3,x4,4,x4,5=∏i=15x4,i.Reliability of M N , 4. Reliability of the module MN,4 reads(29)pst=∏i=15p4,i.


#### 3.2.5. Network Probability Score

The moduleMN,5 computes the network quality indicators in terms of the successfully ambiguities resolution and the quality of the network corrections. This is the first state vector of the system under investigation.(i)
Letx5,1 denote quality indicator for the corrections field.(ii)
Letx5,2 denote quality indicator for the uncertainty of corrections field.(iii)
Letx5,3 denote quality indicator for the ambiguities expressed by ADOP from Section 3.2.2.(iv)
Letx5,4 denote the number of common satellites used in the computation.(v)
Letx5,5 denote the number of rejected satellites from computation.Note thatx5,1 and x5,2 are actually the network RTK quality indicators (RIM, IP, RIU, GBI, and ionospheric status indicator), defined in Section 1.Serial coupling is the appropriate choice for the moduleMN,5 and the block diagram is represented by Figure 11.Figure 11
Block diagram of moduleMN,5.Block Diagram of M N , 5. See Figure 11.Structure Function of M N , 5. The structure function of MN,5 reads(30)Φx=min⁡x5,1,x5,2,x5,3,x5,4,x5,5=∏i=15x5,i.Reliability of Module M N , 5. The reliability of M1,5 reads(31)pst=∏i=15p5,i.


### 3.3. NRTK Baseline Reliability Analysis

This is the second level of the NRTK data processing. The corrections generated by the network are involved to generate the computation point (CP), then the unknown rover coordinates are determined relative to the computation point. This method is known as the relative positioning technique.Similarity between the baseline and the network data processing exists as we see in the coming subsections.


#### 3.3.1. Rover Receiver Data Integrity

The moduleMB,1 is similar to the module MN,1 defined in Section 3.2.1. The quality of the raw observations collected by the rover receiver depends strongly on the statistics methods used to check for anomalies. All variables defined in the module MN,1 are applicable to the module MB,1.


#### 3.3.2. Baseline Ambiguity Resolution

The moduleMB,2 is similar to the module MN,2 defined in Section 3.2.2. All variables defined for the module MN,2 are applicable to the module MB,2.


#### 3.3.3. Baseline Data Integrity

The moduleMB,3 is similar to the module MN,4 defined in Section 3.2.4. All variables defined for the module MN,4 are applicable to the module MB,3.


#### 3.3.4. Baseline Probability Score

The moduleMB,4 is similar to the module MN,5 defined in Section 3.2.5. All variables defined for the module MN,5 are applicable to the module MB,4.


### 3.4. NRTK Rover Reliability Analysis

The investigation of the rover position error is the final check. The quality is measured in terms of standard deviations of the topocentric coordinates(δe,δn,δu).


#### 3.4.1. Rover Prediction Function

This moduleMR,1 uses information from the double-difference variance-covariance matrix to compute the prediction of the position error. The number of satellites used in the computation is considered as a parameter.(i)
Letx3,1 denote inspection of the main diagonal of variance-covariance matrix.(ii)
Letx3,2 denote the total variance monitoring algorithm.(iii)
Letx3,3 denote the generalized variance monitoring algorithm.


#### 3.4.2. Rover Position Error

This moduleMR,2 computes the standard deviations of the rover position error (δe,δn,δu) and assigns a final score to determine the state of the rover receiver accuracy.


## 3.1. Considerations around NRTK Data Processing

Some considerations around the NRTK data integrity are introduced below as a background for the design process and to ease the discussions in the following sections. For more information on GNSS data processing, the reader is referred to [1, 2, 26, 27]. The key to precise positioning is the correct ambiguity resolution and validation. With ambiguities resolved to wrong integer numbers, there will be offsets in the position solution, and with float ambiguities (ambiguities that are not fixed to integer values) the position solution is inaccurate and also very unstable and sensitive to changes in satellite geometry.Good satellite-receiver geometry, as, for instance, expressed by the so-called DOP factor (dilution of precision), is important to perform successful ambiguity resolution and achieve centimeter level accuracy in real time.Spatiotemporal models that describe well the variations of the spatially correlated errors in the corrections field are also an important key for reliable NRTK positioning.Robust estimation algorithms to handle large data sets are also a key factor becoming more important in the future as observations from several GNSS systems to a larger degree will be combined in one processing loop. Today, most NRTK systems operate with data from the American GPS and the Russian GLONASS system. Including data from the European Galileo as well as the Chinese Beidou systems in NRTK operations will soon be the norm for most NRTK services. With satellites from more GNSS systems being available the satellite-receiver geometry on the rover side is improved. This is especially important when the user is operating in constricted environments such as narrow street canyons or forest areas.


## 3.2. NRTK Corrections Reliability Analysis

The main function of the NRTK is to provide the rover in the field with high quality corrections on an epoch-by-epoch basis.From Figure2, five modules MN,i are defined for the network and the reliability of each module will be evaluated. Mi,j corresponds to level i∈{N,B,R} and module j∈{1,2,…,5}, where N stands for network, B for baseline, and R for rover receiver. For instance, the module MN,1 corresponds to the first network module, the Station Data Integrity, as shown in Figure 2, and MR,1 denotes the first of the rover modules, i.e., the Prediction Function as shown in Figure 2.


### 3.2.1. Reference Receivers Data Integrity

Generation of high quality raw observations at reference receivers requires reliable hardware (HWC) and software (SWC) components. Expensive hardware and sophisticated algorithms are keys to achieve this goal. Figure3 shows the concept and each component will be treated separately in the next sections.Figure 3
Main block diagram of moduleMN,1.Let software and hardware components be represented by the modulesMN,1,X and MN,1,Y, respectively.Software Component of Module M N , 1 Definition. SWC requires an ensemble of sequential checks on raw observations. This includes(i)
Letx1,1 denote the satellite data integrity algorithm. This algorithm will discard the measurements from unhealthy satellite(s) or from satellite(s) for which we do not have the orbital data.(ii)
Letx1,2 denote controlled cycle-slip algorithm. This task requires investigation of carrier phase discontinuities by examination of loss of lock (LLI) indicator and signal-to-noise ratio (SNR) flags.(iii)
Letx1,3 denote uncontrolled cycle-slips in the observations. The algorithm uses the observation combinations for this purpose. The interested reader is referred to [27, pp. 95–101].(iv)
Letx1,4 denote the reference receiver clock offset reset algorithm. Continual corrections are carried out to reduce the effect of the jump. The receiver clock offset (jump with ±1 ms) must be detected and corrected because they cause jump in carrier phase.(v)
Letx1,5 denote outliers detection and repair algorithm.(vi)
Letx1,6 denote the low elevation angle. Algorithm prunes satellite(s) based on their low elevation angle.(vii)
Letx1,7 denote the minimum observations required to generate the corrections. At least 4 observation types are needed (L1, L2, P1, and P2). For more information about the observation types provided by satellites, the reader is referred to [28].(viii)
Letx1,8 denote the reference receiver clock stability algorithm.(ix)
Letx1,9 denote the multipath mitigation algorithm.(x)
Letx1,10 denote the reweighting algorithm. All units are parallel coupled.
(1)
Letx[1,10,1] denote a low elevation reweighting algorithm.(2)
Letx[1,10,2] denote a scintillation reweighting algorithm.(3)
Letx[1,10,3] denote a signal-to-noise reweighting algorithm.Figure5 shows the block diagram of the network reweighting algorithm component x1,10.Block Diagram and Reliability of Software Component. The structure function of the software component is well described by the 5-out-of-10 structure function. This means that the more algorithms check is, the more reliable raw observations become.In order to produce reliable raw observations of high quality, it is necessary to perform at least five checks from a total of ten. With ten algorithms’ check, we can generate high quality raw observations while five algorithms’ check will produce acceptable level raw observations. The selection of the algorithms is independent of the order.The structure functionΦ(x) of Figure 4 is given by the expression(15)Φx=max⁡min⁡x1,1,x1,2,x1,3,x1,4,x1,5,min⁡x1,1,x1,2,x1,3,x1,4,x1,6,…,min⁡x1,6,x1,7,x1,8,x1,9,x1,10.Assuming that the individual algorithms are independent with equal probability p(t), then the reliability of software component is(16)pst=Pyt≥5=∑x=51010xpx1-p10-x.Due to the fact that yt~binom(n,p(t)). The block diagram of the xN,1,10 is given by Figure 5.Figure 4
Block diagram of software component of network moduleMN,1.Figure 5
Block diagram of the network unitx1,10.The corresponding reliability reads(17)pN,1,10=pN,10,1+pN,10,2+pN,10,3-pN,10,1pN,10,2+pN,10,1p1,10,3+pN,10,2pN,10,3+pN,10,1pN,10,2pN,10,3.Hardware Component of Module M N , 1. The qualities of the GNSS receiver, firmware robustness, GNSS antenna, and choke ring quantify the hardware component. Figure 6 shows the block diagram of the hardware component of the network module MN,1.Figure 6
Block diagram of hardware component of moduleMN,1. The left block describes the GNSS receiver and the right is for the GNSS antenna.The elements of the hardware component of the network moduleMN,1 are as follows:(i)
Lety1,1 denote the GNSS receiver type.(ii)
Lety1,2 denote the rover software known as firmware to decode the GNSS signals.(iii)
Lety1,3 denote the GNSS antenna type.(iv)
Lety1,4 denote the choke ring that allows better reception of low elevation angle GPS satellites and improved multipath rejection.(v)
Lety1,5 denote duplicated system (as discussed in the next section).The structure functionΦ(y) is given by the expression(18)Φy=min⁡max⁡y1,1,y1,2,max⁡y1,3,y1,4=y1,1∐y1,2y1,3∐y1,4=y1,1+y1,2-y1,1y1,2y1,3+y1,4-y1,3y1,4.The reliability of the hardware of the module MN,1 reads(19)pst=p1,1+p1,2-p1,1p1,2p1,3+p1,4-p1,3p1,4.Hardware Component Improvement. In order to ensure continuous raw data delivery at the station, duplicated hardware components are recommended. This task is accomplished by a parallel coupling of the module MN,1, defined by Figure 6. Applying the definition of reliability computation of parallel coupling (Equation (C.2)), the duplicated HWC reliability reads(20)pt=pst+pst-pst2=pst2-pst,where ps(t) is given by the Equation (19). The drawback of a duplicated system is the financial issues.


### 3.2.2. Network Ambiguity Resolution

As mentioned in Section3.1. The key for precise positioning is the correct ambiguity resolution and validation. The module MN,2 is composed of two main parts, the first part is the ambiguity processing algorithms performance, and the second part is the statistical ambiguity quality indicators derived from the processing chain of the ambiguity.The components of the moduleMN,2 are as follows:(i)
Letx2,1 denote the float solution of the ambiguity obtained via least square or Kalman filter.(ii)
Letx2,2 denote the LAMBDA method [29] applied to a float solution to reduce the search space and to obtain a fix solution.(iii)
Letx2,3 denote the validation procedures to validate the final solution.(iv)
Letx2,4 denote the administration of the ambiguities.(v)
Letx2,5 denote the success rate of the ambiguities resolution.(vi)
Letx2,6 denote the ambiguity dilution of precision (ADOP) [30]. ADOP measures the precision of the ambiguities and can be viewed as a quality indicator.(vii)
Letx2,7 denote time to fix.The block diagram of theMN,2 is given by Figure 7.Figure 7
Network ambiguity resolution moduleMN,2. The first block of this figure represents the ambiguity processing algorithms and the second block is the ambiguity quality indicators.Structure Function of M N , 2. The structure function of the module MN,2 reads(21)Φx=min⁡max⁡Φ1x,max⁡Φ2x=min⁡maxx2,1,x2,2,x2,3,x2,4,maxx2,5,x2,6,x2,7=1-∏i=141-x2,i1-∏i=571-x2,i.Reliability of M N , 2. Reliability of the module MN,2 reads(22)pst=1-∏i=141-p2,i1-∏i=571-p2,i=min⁡P1,P2=P1P2dropping the index 2 in the expression of ps(t) and compute P1 and P2(23)P1t=∑i=14pi-∏i=14pi-p1p2+p1p3+p1p4+p2p3+p2p4+p3p4+p1p2p3+p1p2p4+p1p3p4+p2p3p4,P2t=∑i=57pi+∏i=57pi-p5p6+p5p7+p6p7.


### 3.2.3. Network Corrections Quality

The quality of the network corrections depends on various parameters, for instance, the estimation algorithms, network status (sparse/dense), the covariance functions, and the smoothing/interpolation algorithms. The components of the moduleMN,3 are as follows:(i)
Letx3,1 denote the network reference receivers’ separation. Dense network is attractive because the network corrections are better estimated with short distances between reference receivers.(ii)
Letx3,2 denote the quality of the estimation algorithm used to estimate the parameter vector θ∈Θ.(iii)
Letx3,3 denote the quality of the covariance function used to model the network correlation errors.(iv)
Letx3,4 denote the quality of the interpolation algorithm used to generate the user corrections. Parallel interpolation algorithms will enhance the quality of the user corrections generation and avoid the information loss.Block Diagram of M N , 3. The block diagram of the module MN,3 is given by Figure 8.Figure 8
Block diagram of network correction quality moduleMN,3.Structure Function of M N , 3. The structure function of the module MN,3 reads(24)Φx=min⁡x3,1,x3,2,x3,3,x3,4=∏i=14x3,i.Reliability of M N , 3. Dropping the index 3, the reliability of MN,3 reads(25)pst=∏i=14p3,i.Amelioration Potential of M N , 3. Our aim is to provide the user in the field with high quality corrections on an epoch-by-epoch basis. The interpolation/smoothing algorithm plays a central role. We can implement different parallel interpolation/smoothing algorithms that compete about the quality of service parameters. The corrections will be sent from the algorithm with higher score. For more information on this topic, the interested reader is referred to [3].In this case, replacing the componentx3,4 with a parallel structure function ϕ(x3,4)=max⁡(y1,y2,…,y5), the computation of the new block diagram is straightforward.Letqi denote the functioning probability of unit yi (Figure 9) for i=1,2,…,5. Then the reliability of x3,4 reads(26)ps3,4t=∑i=15qi+∏i=15qi-q1q2+q1p3+q1p4+q1p5+q2q3+q2q4+q2q5+q3q4+q3q5+q4q5+q1q2q3+q1q2q4+q1q2q5+q2q3q4+q2q3q5+q3q4q5-q1q2q3q4+q1q2q3q5+q2q3q4q5.Figure 9
Improved block diagram of moduleMN,3. The component x3,4 is replaced by a parallel structure function ϕ(y).The improved reliability of moduleMN,3 reads(27)ps=ps3,4∏i=13p3,i.


### 3.2.4. Network Data Integrity

The moduleMN,4 responsibility is to carry out the quality control on the corrections field and the corresponding variance-covariance matrices. This includes the following:(i)
Letx4,1 denote global test statistics to detect any extremal events that can bias the rover position, corrections field investigation.(ii)
Letx4,2 denote the inspection of variance-covariance matrices for Heywood effects algorithm [31].(iii)
Letx4,3 denote the application of the imputation algorithm to compute the statistics.(iv)
Letx4,4 denote the total variance monitoring algorithm.(v)
Letx4,5 denote the generalized variance monitoring algorithm.Serial coupling is the appropriate choice for the moduleMN,4 and the block diagram is given by Figure 10.Figure 10
Block diagram of moduleMN,4.Block Diagram of M N , 4. See Figure 10.Structure Function of M N , 4. The structure function of the module MN,4 reads(28)Φx=min⁡x4,1,x4,2,x4,3,x4,4,x4,5=∏i=15x4,i.Reliability of M N , 4. Reliability of the module MN,4 reads(29)pst=∏i=15p4,i.


### 3.2.5. Network Probability Score

The moduleMN,5 computes the network quality indicators in terms of the successfully ambiguities resolution and the quality of the network corrections. This is the first state vector of the system under investigation.(i)
Letx5,1 denote quality indicator for the corrections field.(ii)
Letx5,2 denote quality indicator for the uncertainty of corrections field.(iii)
Letx5,3 denote quality indicator for the ambiguities expressed by ADOP from Section 3.2.2.(iv)
Letx5,4 denote the number of common satellites used in the computation.(v)
Letx5,5 denote the number of rejected satellites from computation.Note thatx5,1 and x5,2 are actually the network RTK quality indicators (RIM, IP, RIU, GBI, and ionospheric status indicator), defined in Section 1.Serial coupling is the appropriate choice for the moduleMN,5 and the block diagram is represented by Figure 11.Figure 11
Block diagram of moduleMN,5.Block Diagram of M N , 5. See Figure 11.Structure Function of M N , 5. The structure function of MN,5 reads(30)Φx=min⁡x5,1,x5,2,x5,3,x5,4,x5,5=∏i=15x5,i.Reliability of Module M N , 5. The reliability of M1,5 reads(31)pst=∏i=15p5,i.


## 3.2.1. Reference Receivers Data Integrity

Generation of high quality raw observations at reference receivers requires reliable hardware (HWC) and software (SWC) components. Expensive hardware and sophisticated algorithms are keys to achieve this goal. Figure3 shows the concept and each component will be treated separately in the next sections.Figure 3
Main block diagram of moduleMN,1.Let software and hardware components be represented by the modulesMN,1,X and MN,1,Y, respectively.Software Component of Module M N , 1 Definition. SWC requires an ensemble of sequential checks on raw observations. This includes(i)
Letx1,1 denote the satellite data integrity algorithm. This algorithm will discard the measurements from unhealthy satellite(s) or from satellite(s) for which we do not have the orbital data.(ii)
Letx1,2 denote controlled cycle-slip algorithm. This task requires investigation of carrier phase discontinuities by examination of loss of lock (LLI) indicator and signal-to-noise ratio (SNR) flags.(iii)
Letx1,3 denote uncontrolled cycle-slips in the observations. The algorithm uses the observation combinations for this purpose. The interested reader is referred to [27, pp. 95–101].(iv)
Letx1,4 denote the reference receiver clock offset reset algorithm. Continual corrections are carried out to reduce the effect of the jump. The receiver clock offset (jump with ±1 ms) must be detected and corrected because they cause jump in carrier phase.(v)
Letx1,5 denote outliers detection and repair algorithm.(vi)
Letx1,6 denote the low elevation angle. Algorithm prunes satellite(s) based on their low elevation angle.(vii)
Letx1,7 denote the minimum observations required to generate the corrections. At least 4 observation types are needed (L1, L2, P1, and P2). For more information about the observation types provided by satellites, the reader is referred to [28].(viii)
Letx1,8 denote the reference receiver clock stability algorithm.(ix)
Letx1,9 denote the multipath mitigation algorithm.(x)
Letx1,10 denote the reweighting algorithm. All units are parallel coupled.
(1)
Letx[1,10,1] denote a low elevation reweighting algorithm.(2)
Letx[1,10,2] denote a scintillation reweighting algorithm.(3)
Letx[1,10,3] denote a signal-to-noise reweighting algorithm.Figure5 shows the block diagram of the network reweighting algorithm component x1,10.Block Diagram and Reliability of Software Component. The structure function of the software component is well described by the 5-out-of-10 structure function. This means that the more algorithms check is, the more reliable raw observations become.In order to produce reliable raw observations of high quality, it is necessary to perform at least five checks from a total of ten. With ten algorithms’ check, we can generate high quality raw observations while five algorithms’ check will produce acceptable level raw observations. The selection of the algorithms is independent of the order.The structure functionΦ(x) of Figure 4 is given by the expression(15)Φx=max⁡min⁡x1,1,x1,2,x1,3,x1,4,x1,5,min⁡x1,1,x1,2,x1,3,x1,4,x1,6,…,min⁡x1,6,x1,7,x1,8,x1,9,x1,10.Assuming that the individual algorithms are independent with equal probability p(t), then the reliability of software component is(16)pst=Pyt≥5=∑x=51010xpx1-p10-x.Due to the fact that yt~binom(n,p(t)). The block diagram of the xN,1,10 is given by Figure 5.Figure 4
Block diagram of software component of network moduleMN,1.Figure 5
Block diagram of the network unitx1,10.The corresponding reliability reads(17)pN,1,10=pN,10,1+pN,10,2+pN,10,3-pN,10,1pN,10,2+pN,10,1p1,10,3+pN,10,2pN,10,3+pN,10,1pN,10,2pN,10,3.Hardware Component of Module M N , 1. The qualities of the GNSS receiver, firmware robustness, GNSS antenna, and choke ring quantify the hardware component. Figure 6 shows the block diagram of the hardware component of the network module MN,1.Figure 6
Block diagram of hardware component of moduleMN,1. The left block describes the GNSS receiver and the right is for the GNSS antenna.The elements of the hardware component of the network moduleMN,1 are as follows:(i)
Lety1,1 denote the GNSS receiver type.(ii)
Lety1,2 denote the rover software known as firmware to decode the GNSS signals.(iii)
Lety1,3 denote the GNSS antenna type.(iv)
Lety1,4 denote the choke ring that allows better reception of low elevation angle GPS satellites and improved multipath rejection.(v)
Lety1,5 denote duplicated system (as discussed in the next section).The structure functionΦ(y) is given by the expression(18)Φy=min⁡max⁡y1,1,y1,2,max⁡y1,3,y1,4=y1,1∐y1,2y1,3∐y1,4=y1,1+y1,2-y1,1y1,2y1,3+y1,4-y1,3y1,4.The reliability of the hardware of the module MN,1 reads(19)pst=p1,1+p1,2-p1,1p1,2p1,3+p1,4-p1,3p1,4.Hardware Component Improvement. In order to ensure continuous raw data delivery at the station, duplicated hardware components are recommended. This task is accomplished by a parallel coupling of the module MN,1, defined by Figure 6. Applying the definition of reliability computation of parallel coupling (Equation (C.2)), the duplicated HWC reliability reads(20)pt=pst+pst-pst2=pst2-pst,where ps(t) is given by the Equation (19). The drawback of a duplicated system is the financial issues.


## 3.2.2. Network Ambiguity Resolution

As mentioned in Section3.1. The key for precise positioning is the correct ambiguity resolution and validation. The module MN,2 is composed of two main parts, the first part is the ambiguity processing algorithms performance, and the second part is the statistical ambiguity quality indicators derived from the processing chain of the ambiguity.The components of the moduleMN,2 are as follows:(i)
Letx2,1 denote the float solution of the ambiguity obtained via least square or Kalman filter.(ii)
Letx2,2 denote the LAMBDA method [29] applied to a float solution to reduce the search space and to obtain a fix solution.(iii)
Letx2,3 denote the validation procedures to validate the final solution.(iv)
Letx2,4 denote the administration of the ambiguities.(v)
Letx2,5 denote the success rate of the ambiguities resolution.(vi)
Letx2,6 denote the ambiguity dilution of precision (ADOP) [30]. ADOP measures the precision of the ambiguities and can be viewed as a quality indicator.(vii)
Letx2,7 denote time to fix.The block diagram of theMN,2 is given by Figure 7.Figure 7
Network ambiguity resolution moduleMN,2. The first block of this figure represents the ambiguity processing algorithms and the second block is the ambiguity quality indicators.Structure Function of M N , 2. The structure function of the module MN,2 reads(21)Φx=min⁡max⁡Φ1x,max⁡Φ2x=min⁡maxx2,1,x2,2,x2,3,x2,4,maxx2,5,x2,6,x2,7=1-∏i=141-x2,i1-∏i=571-x2,i.Reliability of M N , 2. Reliability of the module MN,2 reads(22)pst=1-∏i=141-p2,i1-∏i=571-p2,i=min⁡P1,P2=P1P2dropping the index 2 in the expression of ps(t) and compute P1 and P2(23)P1t=∑i=14pi-∏i=14pi-p1p2+p1p3+p1p4+p2p3+p2p4+p3p4+p1p2p3+p1p2p4+p1p3p4+p2p3p4,P2t=∑i=57pi+∏i=57pi-p5p6+p5p7+p6p7.


## 3.2.3. Network Corrections Quality

The quality of the network corrections depends on various parameters, for instance, the estimation algorithms, network status (sparse/dense), the covariance functions, and the smoothing/interpolation algorithms. The components of the moduleMN,3 are as follows:(i)
Letx3,1 denote the network reference receivers’ separation. Dense network is attractive because the network corrections are better estimated with short distances between reference receivers.(ii)
Letx3,2 denote the quality of the estimation algorithm used to estimate the parameter vector θ∈Θ.(iii)
Letx3,3 denote the quality of the covariance function used to model the network correlation errors.(iv)
Letx3,4 denote the quality of the interpolation algorithm used to generate the user corrections. Parallel interpolation algorithms will enhance the quality of the user corrections generation and avoid the information loss.Block Diagram of M N , 3. The block diagram of the module MN,3 is given by Figure 8.Figure 8
Block diagram of network correction quality moduleMN,3.Structure Function of M N , 3. The structure function of the module MN,3 reads(24)Φx=min⁡x3,1,x3,2,x3,3,x3,4=∏i=14x3,i.Reliability of M N , 3. Dropping the index 3, the reliability of MN,3 reads(25)pst=∏i=14p3,i.Amelioration Potential of M N , 3. Our aim is to provide the user in the field with high quality corrections on an epoch-by-epoch basis. The interpolation/smoothing algorithm plays a central role. We can implement different parallel interpolation/smoothing algorithms that compete about the quality of service parameters. The corrections will be sent from the algorithm with higher score. For more information on this topic, the interested reader is referred to [3].In this case, replacing the componentx3,4 with a parallel structure function ϕ(x3,4)=max⁡(y1,y2,…,y5), the computation of the new block diagram is straightforward.Letqi denote the functioning probability of unit yi (Figure 9) for i=1,2,…,5. Then the reliability of x3,4 reads(26)ps3,4t=∑i=15qi+∏i=15qi-q1q2+q1p3+q1p4+q1p5+q2q3+q2q4+q2q5+q3q4+q3q5+q4q5+q1q2q3+q1q2q4+q1q2q5+q2q3q4+q2q3q5+q3q4q5-q1q2q3q4+q1q2q3q5+q2q3q4q5.Figure 9
Improved block diagram of moduleMN,3. The component x3,4 is replaced by a parallel structure function ϕ(y).The improved reliability of moduleMN,3 reads(27)ps=ps3,4∏i=13p3,i.


## 3.2.4. Network Data Integrity

The moduleMN,4 responsibility is to carry out the quality control on the corrections field and the corresponding variance-covariance matrices. This includes the following:(i)
Letx4,1 denote global test statistics to detect any extremal events that can bias the rover position, corrections field investigation.(ii)
Letx4,2 denote the inspection of variance-covariance matrices for Heywood effects algorithm [31].(iii)
Letx4,3 denote the application of the imputation algorithm to compute the statistics.(iv)
Letx4,4 denote the total variance monitoring algorithm.(v)
Letx4,5 denote the generalized variance monitoring algorithm.Serial coupling is the appropriate choice for the moduleMN,4 and the block diagram is given by Figure 10.Figure 10
Block diagram of moduleMN,4.Block Diagram of M N , 4. See Figure 10.Structure Function of M N , 4. The structure function of the module MN,4 reads(28)Φx=min⁡x4,1,x4,2,x4,3,x4,4,x4,5=∏i=15x4,i.Reliability of M N , 4. Reliability of the module MN,4 reads(29)pst=∏i=15p4,i.


## 3.2.5. Network Probability Score

The moduleMN,5 computes the network quality indicators in terms of the successfully ambiguities resolution and the quality of the network corrections. This is the first state vector of the system under investigation.(i)
Letx5,1 denote quality indicator for the corrections field.(ii)
Letx5,2 denote quality indicator for the uncertainty of corrections field.(iii)
Letx5,3 denote quality indicator for the ambiguities expressed by ADOP from Section 3.2.2.(iv)
Letx5,4 denote the number of common satellites used in the computation.(v)
Letx5,5 denote the number of rejected satellites from computation.Note thatx5,1 and x5,2 are actually the network RTK quality indicators (RIM, IP, RIU, GBI, and ionospheric status indicator), defined in Section 1.Serial coupling is the appropriate choice for the moduleMN,5 and the block diagram is represented by Figure 11.Figure 11
Block diagram of moduleMN,5.Block Diagram of M N , 5. See Figure 11.Structure Function of M N , 5. The structure function of MN,5 reads(30)Φx=min⁡x5,1,x5,2,x5,3,x5,4,x5,5=∏i=15x5,i.Reliability of Module M N , 5. The reliability of M1,5 reads(31)pst=∏i=15p5,i.


## 3.3. NRTK Baseline Reliability Analysis

This is the second level of the NRTK data processing. The corrections generated by the network are involved to generate the computation point (CP), then the unknown rover coordinates are determined relative to the computation point. This method is known as the relative positioning technique.Similarity between the baseline and the network data processing exists as we see in the coming subsections.


### 3.3.1. Rover Receiver Data Integrity

The moduleMB,1 is similar to the module MN,1 defined in Section 3.2.1. The quality of the raw observations collected by the rover receiver depends strongly on the statistics methods used to check for anomalies. All variables defined in the module MN,1 are applicable to the module MB,1.


### 3.3.2. Baseline Ambiguity Resolution

The moduleMB,2 is similar to the module MN,2 defined in Section 3.2.2. All variables defined for the module MN,2 are applicable to the module MB,2.


### 3.3.3. Baseline Data Integrity

The moduleMB,3 is similar to the module MN,4 defined in Section 3.2.4. All variables defined for the module MN,4 are applicable to the module MB,3.


### 3.3.4. Baseline Probability Score

The moduleMB,4 is similar to the module MN,5 defined in Section 3.2.5. All variables defined for the module MN,5 are applicable to the module MB,4.


## 3.3.1. Rover Receiver Data Integrity

The moduleMB,1 is similar to the module MN,1 defined in Section 3.2.1. The quality of the raw observations collected by the rover receiver depends strongly on the statistics methods used to check for anomalies. All variables defined in the module MN,1 are applicable to the module MB,1.


## 3.3.2. Baseline Ambiguity Resolution

The moduleMB,2 is similar to the module MN,2 defined in Section 3.2.2. All variables defined for the module MN,2 are applicable to the module MB,2.


## 3.3.3. Baseline Data Integrity

The moduleMB,3 is similar to the module MN,4 defined in Section 3.2.4. All variables defined for the module MN,4 are applicable to the module MB,3.


## 3.3.4. Baseline Probability Score

The moduleMB,4 is similar to the module MN,5 defined in Section 3.2.5. All variables defined for the module MN,5 are applicable to the module MB,4.


## 3.4. NRTK Rover Reliability Analysis

The investigation of the rover position error is the final check. The quality is measured in terms of standard deviations of the topocentric coordinates(δe,δn,δu).


### 3.4.1. Rover Prediction Function

This moduleMR,1 uses information from the double-difference variance-covariance matrix to compute the prediction of the position error. The number of satellites used in the computation is considered as a parameter.(i)
Letx3,1 denote inspection of the main diagonal of variance-covariance matrix.(ii)
Letx3,2 denote the total variance monitoring algorithm.(iii)
Letx3,3 denote the generalized variance monitoring algorithm.


### 3.4.2. Rover Position Error

This moduleMR,2 computes the standard deviations of the rover position error (δe,δn,δu) and assigns a final score to determine the state of the rover receiver accuracy.


## 3.4.1. Rover Prediction Function

This moduleMR,1 uses information from the double-difference variance-covariance matrix to compute the prediction of the position error. The number of satellites used in the computation is considered as a parameter.(i)
Letx3,1 denote inspection of the main diagonal of variance-covariance matrix.(ii)
Letx3,2 denote the total variance monitoring algorithm.(iii)
Letx3,3 denote the generalized variance monitoring algorithm.


## 3.4.2. Rover Position Error

This moduleMR,2 computes the standard deviations of the rover position error (δe,δn,δu) and assigns a final score to determine the state of the rover receiver accuracy.


## 4. Multistate Reliability Analysis

Since the rover position accuracy cannot be represented by a binary system with two performance level states as functioning or failed, the multistate system (MSS) approach is chosen to deal with situations where more than two levels of performance are considered. The material used to construct this section is from Natvig [32].


### 4.1. Definition of NRTK Performance Levels

Based on the values computed from the score modulesMN,5 (Section 3.2.5) and MB,4 (Section 3.3.4), respectively, a single judging number is assigned to determine the performance level of the rover position accuracy.The states represent level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic. Five states are defined for a NRTK system, namely,start,perfect,acceptable,rejected, andcatastrophic states.The rover position accuracy is well described by the state diagrams given by Figures12 and 13, respectively.(1)
State4: perfect functioning level. No complications. The user requirements regarding the position accuracy are satisfied.(2)
State3: acceptable position accuracy. Minor complications.(3)
State2: rejectable position accuracy. Major complications due to the atmosphere, multipath, or algorithms failure. The user requirements are not satisfied.(4)
State1: catastrophic state. The NRTK system is down and not delivering the corrections to the user in the field.(5)
State0: start state. The process always starts at this state and can reach any other states.Figure 12
Start state of the rover position accuracy.Figure 13
State diagram of the rover position accuracy.Note that the states0,4,3,2 are transient states while the state 1 is absorbing state.Note that the probabilitiesPi|j must be computed from real data.


### 4.2. Penalized Honored Stochastic Averaged Variance

Based on state vectors data, our aim is to construct the NRTK state diagram from the network and baseline. The variance-covariance matrix (VCM) is considered as the state vector and the average variance with respect to the number of observed satellites(nsat) is used to compute the quality indicator on an epoch-by-epoch basis. In addition, the number of rejected satellites (nrej) and the geometry factor (DOP) are used to penalize/honor the average variance.


#### 4.2.1. Penalized Average Variance Component

The total average variance computed from the VCM shall be penalized in case of rejection of satellite(s) with bad data and causes the increase of DOP indicator. The penalized function shall look similar to the following:(1)
Penalized least square (PLS) proposed by Green and Silverman [33, p. 5](32)Sg=∑i=1nyi-gti2+α∫abg′′x2dx,whereyi is the observations, g(ti) is the curve we fit to the data, g′′(·) is the second derivative of the function g(·), and α is the smoothing parameter and defines the rate of change between the residuals and local variations. Anyway, minimizing S(g) gives the best compromise between smoothness and goodness-of-fit. A large value of α will make the penalty term more in action, while with a small value the first term will be the main contribution.(2)
Information criteria type penalizing the model complexity. Denote byM the model to be investigated and dim(M) is the length of its parameter vector θ.Akaike’s information criterion (AIC) [34, Chap. 2](33)AICM=2log-likelihoodmaxM-2dimM.The Bayesian information criterion (BIC) of Schwarz (1978) takes the form of a penalized log-likelihood function where the penalty is equal to the logarithm of the sample size times the number of estimated parameters in the model [34, Chap. 3](34)BICM=2log-likelihoodmaxM-log⁡ndimM.


#### 4.2.2. Honored Average Variance Component

Detection and rejection of satellite(s) with bad data are a good thing. The check algorithms shall be honored as long as the DOP values remain in the acceptable region.The value of the horizontal dilution of precision (HDOP) is expected to be less or equal 2.0, that is,HDOP≤2.0.Forming a new stochastic variableTj=HDOPj-μHDOP, then we can monitor the values of Tj over time. Note that μHDOP corresponds to the mean value of the HDOP in time span Δt.


#### 4.2.3. Balanced Average Variance

Our aim is to put together the pieces defined in Sections4.2.1 and 4.2.2, respectively, and find a way to balance between the satellite(s) rejection nrej and the HDOP value.The exponential reweighting algorithm type is an option. The algorithm places more importance to more recent data by discounting older data in an exponential manner. For epochj, let kj=((nobs,j-nrej,j)-nconst)/nsys, where nconst≥8 is the user defined parameter and corresponds to the minimum number of satellites required to compute a reliable solution and preserve a good HDOP value, and nsys=31 is the total satellites in GPS constellation.A suitable stabilization factorη∈[0,1] is chosen such that the penalized honored average variance (σphav) reads(35)σphasdη,k,T=1nsat∑i=1nsatci,i1/2︸first-term+1nj∑j=1njηkj+1-ηTj︸second-term,where ci,i are diagonal elements of the covariance matrix of the baseline, nobs,j is the number of satellites with valid data used in the computation, nrej,j is the number of rejected satellites by the algorithms, and nj is the window size which is user defined.


#### 4.2.4. Penalized Honored Average Variance Validation

The parameter vector of (35) is θ=(η,k,T). Our aim is to study the variation of the second term of (35) and try to get some valid answers.Full details of the penalized honored average standard deviation algorithm are given in AppendixB.


### 4.3. NRTK Residuals Contribution

NRTK residuals generated by the network and baseline data processing are considered as state vectors and will be to construct the state diagram. The procedure is defined as follows:(i)
choose the time windowΔt=10 seconds;(ii)
compute the standard deviation of the residualsσres. Figure 18 shows the concept;(iii)
choose a suitable strategy to map the computed values ofσres.


## 4.1. Definition of NRTK Performance Levels

Based on the values computed from the score modulesMN,5 (Section 3.2.5) and MB,4 (Section 3.3.4), respectively, a single judging number is assigned to determine the performance level of the rover position accuracy.The states represent level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic. Five states are defined for a NRTK system, namely,start,perfect,acceptable,rejected, andcatastrophic states.The rover position accuracy is well described by the state diagrams given by Figures12 and 13, respectively.(1)
State4: perfect functioning level. No complications. The user requirements regarding the position accuracy are satisfied.(2)
State3: acceptable position accuracy. Minor complications.(3)
State2: rejectable position accuracy. Major complications due to the atmosphere, multipath, or algorithms failure. The user requirements are not satisfied.(4)
State1: catastrophic state. The NRTK system is down and not delivering the corrections to the user in the field.(5)
State0: start state. The process always starts at this state and can reach any other states.Figure 12
Start state of the rover position accuracy.Figure 13
State diagram of the rover position accuracy.Note that the states0,4,3,2 are transient states while the state 1 is absorbing state.Note that the probabilitiesPi|j must be computed from real data.


## 4.2. Penalized Honored Stochastic Averaged Variance

Based on state vectors data, our aim is to construct the NRTK state diagram from the network and baseline. The variance-covariance matrix (VCM) is considered as the state vector and the average variance with respect to the number of observed satellites(nsat) is used to compute the quality indicator on an epoch-by-epoch basis. In addition, the number of rejected satellites (nrej) and the geometry factor (DOP) are used to penalize/honor the average variance.


### 4.2.1. Penalized Average Variance Component

The total average variance computed from the VCM shall be penalized in case of rejection of satellite(s) with bad data and causes the increase of DOP indicator. The penalized function shall look similar to the following:(1)
Penalized least square (PLS) proposed by Green and Silverman [33, p. 5](32)Sg=∑i=1nyi-gti2+α∫abg′′x2dx,whereyi is the observations, g(ti) is the curve we fit to the data, g′′(·) is the second derivative of the function g(·), and α is the smoothing parameter and defines the rate of change between the residuals and local variations. Anyway, minimizing S(g) gives the best compromise between smoothness and goodness-of-fit. A large value of α will make the penalty term more in action, while with a small value the first term will be the main contribution.(2)
Information criteria type penalizing the model complexity. Denote byM the model to be investigated and dim(M) is the length of its parameter vector θ.Akaike’s information criterion (AIC) [34, Chap. 2](33)AICM=2log-likelihoodmaxM-2dimM.The Bayesian information criterion (BIC) of Schwarz (1978) takes the form of a penalized log-likelihood function where the penalty is equal to the logarithm of the sample size times the number of estimated parameters in the model [34, Chap. 3](34)BICM=2log-likelihoodmaxM-log⁡ndimM.


### 4.2.2. Honored Average Variance Component

Detection and rejection of satellite(s) with bad data are a good thing. The check algorithms shall be honored as long as the DOP values remain in the acceptable region.The value of the horizontal dilution of precision (HDOP) is expected to be less or equal 2.0, that is,HDOP≤2.0.Forming a new stochastic variableTj=HDOPj-μHDOP, then we can monitor the values of Tj over time. Note that μHDOP corresponds to the mean value of the HDOP in time span Δt.


### 4.2.3. Balanced Average Variance

Our aim is to put together the pieces defined in Sections4.2.1 and 4.2.2, respectively, and find a way to balance between the satellite(s) rejection nrej and the HDOP value.The exponential reweighting algorithm type is an option. The algorithm places more importance to more recent data by discounting older data in an exponential manner. For epochj, let kj=((nobs,j-nrej,j)-nconst)/nsys, where nconst≥8 is the user defined parameter and corresponds to the minimum number of satellites required to compute a reliable solution and preserve a good HDOP value, and nsys=31 is the total satellites in GPS constellation.A suitable stabilization factorη∈[0,1] is chosen such that the penalized honored average variance (σphav) reads(35)σphasdη,k,T=1nsat∑i=1nsatci,i1/2︸first-term+1nj∑j=1njηkj+1-ηTj︸second-term,where ci,i are diagonal elements of the covariance matrix of the baseline, nobs,j is the number of satellites with valid data used in the computation, nrej,j is the number of rejected satellites by the algorithms, and nj is the window size which is user defined.


### 4.2.4. Penalized Honored Average Variance Validation

The parameter vector of (35) is θ=(η,k,T). Our aim is to study the variation of the second term of (35) and try to get some valid answers.Full details of the penalized honored average standard deviation algorithm are given in AppendixB.


## 4.2.1. Penalized Average Variance Component

The total average variance computed from the VCM shall be penalized in case of rejection of satellite(s) with bad data and causes the increase of DOP indicator. The penalized function shall look similar to the following:(1)
Penalized least square (PLS) proposed by Green and Silverman [33, p. 5](32)Sg=∑i=1nyi-gti2+α∫abg′′x2dx,whereyi is the observations, g(ti) is the curve we fit to the data, g′′(·) is the second derivative of the function g(·), and α is the smoothing parameter and defines the rate of change between the residuals and local variations. Anyway, minimizing S(g) gives the best compromise between smoothness and goodness-of-fit. A large value of α will make the penalty term more in action, while with a small value the first term will be the main contribution.(2)
Information criteria type penalizing the model complexity. Denote byM the model to be investigated and dim(M) is the length of its parameter vector θ.Akaike’s information criterion (AIC) [34, Chap. 2](33)AICM=2log-likelihoodmaxM-2dimM.The Bayesian information criterion (BIC) of Schwarz (1978) takes the form of a penalized log-likelihood function where the penalty is equal to the logarithm of the sample size times the number of estimated parameters in the model [34, Chap. 3](34)BICM=2log-likelihoodmaxM-log⁡ndimM.


## 4.2.2. Honored Average Variance Component

Detection and rejection of satellite(s) with bad data are a good thing. The check algorithms shall be honored as long as the DOP values remain in the acceptable region.The value of the horizontal dilution of precision (HDOP) is expected to be less or equal 2.0, that is,HDOP≤2.0.Forming a new stochastic variableTj=HDOPj-μHDOP, then we can monitor the values of Tj over time. Note that μHDOP corresponds to the mean value of the HDOP in time span Δt.


## 4.2.3. Balanced Average Variance

Our aim is to put together the pieces defined in Sections4.2.1 and 4.2.2, respectively, and find a way to balance between the satellite(s) rejection nrej and the HDOP value.The exponential reweighting algorithm type is an option. The algorithm places more importance to more recent data by discounting older data in an exponential manner. For epochj, let kj=((nobs,j-nrej,j)-nconst)/nsys, where nconst≥8 is the user defined parameter and corresponds to the minimum number of satellites required to compute a reliable solution and preserve a good HDOP value, and nsys=31 is the total satellites in GPS constellation.A suitable stabilization factorη∈[0,1] is chosen such that the penalized honored average variance (σphav) reads(35)σphasdη,k,T=1nsat∑i=1nsatci,i1/2︸first-term+1nj∑j=1njηkj+1-ηTj︸second-term,where ci,i are diagonal elements of the covariance matrix of the baseline, nobs,j is the number of satellites with valid data used in the computation, nrej,j is the number of rejected satellites by the algorithms, and nj is the window size which is user defined.


## 4.2.4. Penalized Honored Average Variance Validation

The parameter vector of (35) is θ=(η,k,T). Our aim is to study the variation of the second term of (35) and try to get some valid answers.Full details of the penalized honored average standard deviation algorithm are given in AppendixB.


## 4.3. NRTK Residuals Contribution

NRTK residuals generated by the network and baseline data processing are considered as state vectors and will be to construct the state diagram. The procedure is defined as follows:(i)
choose the time windowΔt=10 seconds;(ii)
compute the standard deviation of the residualsσres. Figure 18 shows the concept;(iii)
choose a suitable strategy to map the computed values ofσres.


## 5. NRTK Reliability Results

The aim of this section is to present the results from the analysis. The level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic shall be determined from the data.


### 5.1. Horizontal Dilution of Precision (HDOP)

The geometry of the visible satellites is considered as an important factor in achieving high quality results especially for point positioning and kinematic surveying. Anyway, the geometry changes with time due to the relative motion of the user and satellites. A measure of the instantaneous geometry is the dilution of precision (DOP) factor.The DOP values are computed from the variance-covariance matrix in the ECEF coordinate system and converted to the topocentric local coordinate system with its axes along the local north, east, and up (i.e., vertical) by rotational matrixR by applying the law of covariance propagation.The DOP value can be defined in various ways; PDOP value in the local system is identical to the value in the global system. In addition to the PDOP, two further DOP definitions are used; HDOP, the dilution of precision in the horizontal position, and VDOP, denoting the corresponding value for the vertical component. The interested reader is referred to (Hoffmann-Wellenhof et al., 2008) [1, pp. 262–270](36)GDOP=σe2+σn2+σu2+σt2,PDOP=σe2+σn2+σu2,HDOP=σe2+σn2,VDOP=σu2.Acceptable horizontal DOP value isHDOP≤2.0. Figure 14 shows the computed HDOP for the analyzed data set. In addition, Figure 15 shows the viewed satellites. Clearly, the number varies between 8 and 10 satellites.Figure 14
Computed HDOP values. Baseline of ~41 km, year: 2014, DOY: 85.Figure 15
Number of satellites used in the computation. Baseline of ~41 km, year: 2014, DOY: 85. Plotted as red dots connected by blue lines.


### 5.2. Rover Level of Performance Prediction

We will predict the rover level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic. Three classification lines are chosen in order to separate the computed average standard deviations using (35) into four decisions regions based on the values of σpred∈{0.2,.03,.4}. Figure 16 shows the concept.Figure 16
Computed penalized honored average standard deviation. Horizontal lines are used for classification. Baseline of ~41 km, year: 2014, DOY: 85.The computation ofσpred using (35) proceeds as follows:(i)
Based on the sliding window sizeΔt, form a data matrix from the baseline residuals. Compute the variance-covariance matrix VCMres and get and sort in ascending order the diagonal elements D.(ii)
Compute the averaged standard deviation, the first term of (35)(37)σavg=1nsat∑i=1nsatci,i1/2.(iii)
Generate a random numbernrej∈{0,1,2}, and compute Kj(38)Kj=nobs,j-nrej,j-nconstntot.(iv)
Compute the second term of (35)(39)σpen=1nj∑j=1njηkj+1-ηTj,whereTj is the HDOP computed from the solution variance-covariance matrix. The computed HDOP values are shown in Figure 14.


## 5.1. Horizontal Dilution of Precision (HDOP)

The geometry of the visible satellites is considered as an important factor in achieving high quality results especially for point positioning and kinematic surveying. Anyway, the geometry changes with time due to the relative motion of the user and satellites. A measure of the instantaneous geometry is the dilution of precision (DOP) factor.The DOP values are computed from the variance-covariance matrix in the ECEF coordinate system and converted to the topocentric local coordinate system with its axes along the local north, east, and up (i.e., vertical) by rotational matrixR by applying the law of covariance propagation.The DOP value can be defined in various ways; PDOP value in the local system is identical to the value in the global system. In addition to the PDOP, two further DOP definitions are used; HDOP, the dilution of precision in the horizontal position, and VDOP, denoting the corresponding value for the vertical component. The interested reader is referred to (Hoffmann-Wellenhof et al., 2008) [1, pp. 262–270](36)GDOP=σe2+σn2+σu2+σt2,PDOP=σe2+σn2+σu2,HDOP=σe2+σn2,VDOP=σu2.Acceptable horizontal DOP value isHDOP≤2.0. Figure 14 shows the computed HDOP for the analyzed data set. In addition, Figure 15 shows the viewed satellites. Clearly, the number varies between 8 and 10 satellites.Figure 14
Computed HDOP values. Baseline of ~41 km, year: 2014, DOY: 85.Figure 15
Number of satellites used in the computation. Baseline of ~41 km, year: 2014, DOY: 85. Plotted as red dots connected by blue lines.


## 5.2. Rover Level of Performance Prediction

We will predict the rover level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic. Three classification lines are chosen in order to separate the computed average standard deviations using (35) into four decisions regions based on the values of σpred∈{0.2,.03,.4}. Figure 16 shows the concept.Figure 16
Computed penalized honored average standard deviation. Horizontal lines are used for classification. Baseline of ~41 km, year: 2014, DOY: 85.The computation ofσpred using (35) proceeds as follows:(i)
Based on the sliding window sizeΔt, form a data matrix from the baseline residuals. Compute the variance-covariance matrix VCMres and get and sort in ascending order the diagonal elements D.(ii)
Compute the averaged standard deviation, the first term of (35)(37)σavg=1nsat∑i=1nsatci,i1/2.(iii)
Generate a random numbernrej∈{0,1,2}, and compute Kj(38)Kj=nobs,j-nrej,j-nconstntot.(iv)
Compute the second term of (35)(39)σpen=1nj∑j=1njηkj+1-ηTj,whereTj is the HDOP computed from the solution variance-covariance matrix. The computed HDOP values are shown in Figure 14.


## 6. NRTK Reliability Validation

The aim of this section is to introduce the procedures used to validate the NRTK system reliability. The level of performance ranging from the perfect functioning levelperfect down to the complete failure levelcatastrophic shall be determined from data.


### 6.1. NRTK State Diagram Definition

As we mentioned in the introduction, the key of the NRTK method is the measurement of the distance-dependent errors. The variations in the ionospheric and tropospheric fields are assumed constant in a period of timeΔt<10 s.Since we have access to the rover position error in the topocentric coordinates system(δe,δn,δu), the state diagram is computed as follows:(i)
Choose the time windowΔt=10 seconds.(ii)
For each component, compute the standard deviation of the rover position errorσp=(σe,σn,σu). Figure 17 shows the concept.(iii)
Based on the user requirements and the computed values ofσp, map this value to the performance defined levels, namely, the states S={0,1,2,3,4}.(iv)
Compute transitions probabilitiesPi|j from data. This task is accomplished by counting the frequencies and computing the associated probability, that is, ps=Ns/NT, where Ns is the number of times we are visiting the state s and NT is the total number of events.Figure 17
Standard deviations of the rover position errors(σe,σn,σu) in the topocentric coordinate system. Horizontal lines are used for classification. Baseline of ~1 km, year: 2013, DOY: 152.Figure 18
Standard deviation of the rover position error. Horizontal lines are threshold values. Baseline of ~1 km, year: 2013, DOY: 152.


### 6.2. States Transition Probabilities

We have computed the transition states probability based on Figure18, where the threshold Th values are defined, respectively, Th∈{0.25,.5,.75} cm. Note that ∑j=14Pi,j=1, for i=1,…,4(40)The limiting distribution is obtained by matrix multiplication of the transition matrix:(41)limn→∞⁡Pijn=πj,j≥0,(42)P50=0.33120.54430.07980.33210.54590.08000.33150.54490.0799.We see that each row of P(50) has almost identical entries; this confirms that (41) converges to some values as n→∞. It seems that the existence of a limiting probability that the process p will be in state j after a large number of transitions n, and the value is independent of the initial state.For this data set, the probability of being in state4 is 33.12%, state 3 is 54.59%, and state 2 is 8.0%.


### 6.3. State Diagram

Information from the network (Section3.2) and the baseline (Section 3.3) is combined in such way that a single judging number is mapped to the performance levels with states S={0,1,2,3,4} and the transitions probabilities Pi|j are obtained. This task is accomplished by counting the frequencies and computing the associated probability, that is, ps=Ns/NT, where Ns is the number of times we are visiting the state s and NT is the total number of events.In order to define a single judging number, various schemes are considered, for instance, an averaging scheme or to assign different weights to each component.


## 6.1. NRTK State Diagram Definition

As we mentioned in the introduction, the key of the NRTK method is the measurement of the distance-dependent errors. The variations in the ionospheric and tropospheric fields are assumed constant in a period of timeΔt<10 s.Since we have access to the rover position error in the topocentric coordinates system(δe,δn,δu), the state diagram is computed as follows:(i)
Choose the time windowΔt=10 seconds.(ii)
For each component, compute the standard deviation of the rover position errorσp=(σe,σn,σu). Figure 17 shows the concept.(iii)
Based on the user requirements and the computed values ofσp, map this value to the performance defined levels, namely, the states S={0,1,2,3,4}.(iv)
Compute transitions probabilitiesPi|j from data. This task is accomplished by counting the frequencies and computing the associated probability, that is, ps=Ns/NT, where Ns is the number of times we are visiting the state s and NT is the total number of events.Figure 17
Standard deviations of the rover position errors(σe,σn,σu) in the topocentric coordinate system. Horizontal lines are used for classification. Baseline of ~1 km, year: 2013, DOY: 152.Figure 18
Standard deviation of the rover position error. Horizontal lines are threshold values. Baseline of ~1 km, year: 2013, DOY: 152.


## 6.2. States Transition Probabilities

We have computed the transition states probability based on Figure18, where the threshold Th values are defined, respectively, Th∈{0.25,.5,.75} cm. Note that ∑j=14Pi,j=1, for i=1,…,4(40)The limiting distribution is obtained by matrix multiplication of the transition matrix:(41)limn→∞⁡Pijn=πj,j≥0,(42)P50=0.33120.54430.07980.33210.54590.08000.33150.54490.0799.We see that each row of P(50) has almost identical entries; this confirms that (41) converges to some values as n→∞. It seems that the existence of a limiting probability that the process p will be in state j after a large number of transitions n, and the value is independent of the initial state.For this data set, the probability of being in state4 is 33.12%, state 3 is 54.59%, and state 2 is 8.0%.


## 6.3. State Diagram

Information from the network (Section3.2) and the baseline (Section 3.3) is combined in such way that a single judging number is mapped to the performance levels with states S={0,1,2,3,4} and the transitions probabilities Pi|j are obtained. This task is accomplished by counting the frequencies and computing the associated probability, that is, ps=Ns/NT, where Ns is the number of times we are visiting the state s and NT is the total number of events.In order to define a single judging number, various schemes are considered, for instance, an averaging scheme or to assign different weights to each component.


## 7. Discussions and Conclusion

An improvement of the rover position accuracy can be achieved by applying procedures for multistate reliability analysis at the system and user level in NRTK. More concretely, the network corrections, baseline residuals, and the associated variance-covariance matrices are considered as the system states and have a direct influence on the rover position accuracy.The use of the multistate reliability analysis will help us to get some concrete answers to the following problems(i)
can we trust the corrections provided by NRTK to the user?(ii)
at which level?(iii)
what are the amelioration potentials?The weaknesses and the strengths of the system have to be identified and the amelioration potential can be achieved by modifying the serial critical components coupling into paralleled one with a cost effectiveness.The methods tested make it possible to identify the NRTK critical component with bad data so this can be eliminated or downweighted in the positioning process leading to an improvement in the rover position from epoch to epoch.It is expected that the suggested approach will reduce the number of wrong or inaccurate rover positions encountered by NRTK users in field, which subsequently will lead to a more efficient work flow for NRTK users.


## 8. Discussions

The rover position accuracy is well described by the state diagram. Based on the values computed by the score modules from the NRTK and the baseline, a single judging number is assigned that determines the performance rate of the rover position accuracyρ=e2+n2+u21/2, measured in terms of standard deviations σρ.The computation of probability of the rover position accuracy in time spanΔt=10 seconds is carried out as follows:(1)
Network RTK corrections score: based on algorithms efficiency defined in Section3.2, a probability p1∈[0,1] is assigned to the quality of the corrections.(2)
Baseline score: based on algorithms efficiency defined in Section3.3, a probability p3∈[0,1] is assigned to the quality of the baseline residuals.(3)
Rover raw observations score: based on algorithms efficiency used to edit the rover raw observations, a probabilityp2∈[0,1] is assigned to the quality of the rover raw observations.The validation process is carried out by computing the standard deviations of the rover position error(σn,σe,σu) of topocentric coordinates. A single number, σρ, is assigned and the corresponding state is obtained. Equation (43) shows the mapping used in this investigation(43)F:0,1×0,1×0,1⟼0,1Fp1,p2,p3⟼p∈0,1On future work, a monitor station will be used to revalidate our approach for quality control and to carry out classification with(i)
empirical mapping function between the observation and the position domains;(ii)
classification boundaries determination in the observation and position domains.



---

*Source: 8260479-2018-06-06.xml*