<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Adaptive Dynamic Adjustment Kalman Filter (ADA-KF) for Robust Clock Synchronization in High-Mobility Wireless Environments</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xiao Jiang</string-name>
          <email>jiangxiao@bupt.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhongliang Deng</string-name>
          <email>dengzhl@bupt.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Songfeng Yang</string-name>
          <email>yangsf@bupt.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mingyang Ma</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Beijing University of Posts and Telecommunications</institution>
          ,
          <addr-line>No.10 Xitucheng Road, Haidian District, Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IPIN-WCAL 2025: Workshop for Computing &amp; Advanced Localization at the Fifteenth International Conference on Indoor Positioning and Indoor Navigation</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>High-precision time synchronization is essential for reliable communication in next-generation wireless systems such as 5G and the Internet of Things (IoT), particularly under high mobility and dynamic noise conditions. In this paper, we propose an Adaptive Dynamic Adjustment Kalman Filter (ADA-KF) to enhance both the accuracy and robustness of clock synchronization in such challenging environments. The proposed method incorporates a dual-residual sliding window mechanism combined with an Exponentially Weighted Moving Average (EWMA). ADA-KF uses residual variance, theoretically grounded in Maximum Likelihood Estimation (MLE), to adaptively update process and observation noise covariances. In 5G scenarios, precise synchronization between the base station (gNB) and user equipment (UE) is essential. However, traditional methods relying on fixed noise assumptions often struggle to perform efectively in rapidly changing wireless conditions. By adaptively updating the noise model in real time, ADA-KF greatly enhances filtering performance in non-stationary environments. Simulation results demonstrate that ADA-KF achieves faster convergence and higher estimation accuracy than existing methods under low SNR and high mobility conditions. These results indicate strong potential for its application in future communication systems.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Clock Synchronization</kwd>
        <kwd>Adaptive Kalman Filter</kwd>
        <kwd>Residual Variance Estimation</kwd>
        <kwd>High-Mobility Wireless Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>With the rapid evolution of wireless communication technology, particularly the widespread deployment
of the Internet of Things (IoT) and 5G networks, achieving high-precision time synchronization between
base station (gNB) and user equipment (UE) has become a critical foundation for ensuring ultra-low
latency and highly reliable communication. This requirement is especially prominent in application
scenarios that demand high timing accuracy, such as industrial automation and vehicle-to-everything
(V2X) systems. As illustrated in Figure 1, these time-sensitive applications are subject to dynamic
conditions such as mobility and channel variability. However, real-world application scenarios present
numerous challenges: the high mobility of terminal devices leads to frequent changes in their relative
positions with respect to base station; environmental temperature fluctuations may cause clock source
drift; and the uncertainty of wireless channels. These complex factors collectively result in significant
time-varying characteristics of clock ofset and clock skew. This severely limits the robustness and
accuracy of clock synchronization systems.</p>
      <p>
        Traditional clock synchronization methods typically rely on static noise assumptions, which result in
significant performance degradation in highly dynamic and interfered environments, and failing to
meet the dual requirements of synchronization accuracy and robustness demanded by next-generation
communication systems. As shown in Figure 2, the 5G two-way time synchronization model achieves
basic synchronization by exchanging timestamps between gNB and UE over the uplink and downlink.
Although this model achieves high synchronization accuracy and strong interference resistance under
ideal conditions, its performance degrades in complex environments. The fixed parameter estimation
methods it relies on cannot adapt to dynamic noise characteristics, which are exacerbated by high-speed
terminal movement and oscillator imperfections. To overcome these limitations, previous studies have
attempted to introduce state estimation methods such as Kalman Filter (KF) for modeling and tracking
[
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. However, most current methods still rely on fixed noise statistical models and lack adaptability
to dynamic heterogeneous network environments [
        <xref ref-type="bibr" rid="ref4">4, 5, 6, 7</xref>
        ], necessitating more flexible and eficient
solutions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>In the field of time synchronization, early research primarily focused on the IEEE 1588 Precision
Time Protocol (PTP) and the Network Time Protocol (NTP). The pioneering work of Mills [8] laid
the foundation for internet time synchronization. Although these protocols perform well in wired
networks, they struggle to achieve nanosecond-level precision in wireless scenarios due to variable
delays, multipath efects, and dynamic channel conditions. As a result, researchers have increasingly
adopted state-space models to tackle clock synchronization, with a focus on the estimation and correction
of clock ofset and clock skew. Among these, KF and its variants have received significant attention.
Mehra et al. [9] proposed an innovative method for variance identification and iterative optimal gain
adjustment, enabling optimal gain updates under unknown noise covariances. However, this method
relies heavily on suficient steady-state observational data, making it dificult to adapt to highly dynamic
or short-term synchronization tasks. Moreover, its strong prior assumptions about the structure of
process noise limit its flexibility in practical applications. To enhance filter robustness in dynamic
environments, Zheng et al. [10] introduced a Robust Adaptive Unscented Kalman Filter, which addresses
the challenges of unknown or varying process and observation noise covariances in nonlinear systems.
This method incorporates a fault detection mechanism that dynamically updates covariance matrices
based on innovations and residuals, improving estimation accuracy while reducing computational
burden. However, due to its reliance on threshold-triggered abrupt adjustments, it struggles to maintain
stable estimates in scenarios with frequent small-scale noise fluctuations. Huang et al. [ 11] proposed a
Sliding Window Variational Adaptive Kalman Filter (SWVAKF), which jointly estimates state and noise
covariance within a sliding window using Bayesian inference. It demonstrates strong performance
under slowly varying noise conditions. However, its reliance on complex inverse-Wishart priors and
backward smoothers results in high computational cost and suboptimal real-time performance in rapidly
changing noise environments. In addition, Zuo et al. [12] proposed a joint estimation algorithm based
on correlation detection and implicit synchronization (CDIS-JE) that allows clock ofset estimation at
the physical layer without increasing communication overhead. However, this method relies on a fixed
topology and ideal reference nodes, limiting its adaptability.</p>
      <p>In the context of 5G applications, Werner et al. [13] proposed an Extended Kalman Filter method
based on DoA/ToA fusion for joint estimation of node position and clock ofset. However, its noise model
is fixed and lacks online adaptability, limiting its efectiveness in dynamic environments. Goodarzi et al.
[14] combined BP and BRF to propose a hybrid Bayesian synchronization algorithm that balances global
accuracy and edge synchronization eficiency. However, its strategy relies on a structured network and
ifxed noise model, making it dificult to adapt to rapidly changing wireless environments. Hu et al. [ 15]
combined 5G NR multipath measurements with UWB systems and proposed an iterative maximum
likelihood algorithm that improves positioning accuracy in GNSS-denied environments. Although
the method efectively addresses positioning in 5G systems, it relies on a fixed error model and lacks
adaptive covariance mechanisms, and its high dependence on 5G infrastructure limits its applicability
in heterogeneous networks.</p>
      <p>To address the above issues, we propose a novel clock synchronization algorithm called ADA-KF
(Adaptive Dynamic Adjustment Kalman Filter). This method is based on a dual-residual mechanism that
continuously records both measurement and prediction residuals using a sliding window. It employs
the Maximum Likelihood Estimation (MLE) principle to obtain unbiased estimates of residual variances.
Additionally, an Exponentially Weighted Moving Average (EWMA) strategy and an adaptive smoothing
factor are introduced to dynamically update the covariance matrices, enabling online modeling of
nonstationary noise and adaptive adjustment of the filter structure. While maintaining the convergence
properties of the classical KF, the proposed algorithm significantly enhances synchronization accuracy
and robustness in dynamic environments. The main contributions are as follows:
• An Adaptive Dynamic Adjustment Kalman Filter algorithm (ADA-KF) for clock synchronization
is proposed, which can dynamically update the noise covariance based on residual statistics.
• A dual residual sliding window mechanism is constructed to dynamically model non-stationary
noise, efectively improving the filter’s robustness and convergence speed under complex
conditions.
• The introduction of MLE principle and EWMA smoothing strategy enables dynamic and stable
updates of the covariance.
• System-level simulations demonstrate that ADA-KF outperforms existing methods under
challenging conditions such as high mobility and low signal-to-noise ratio (SNR).</p>
    </sec>
    <sec id="sec-3">
      <title>3. Proposed Approach</title>
      <sec id="sec-3-1">
        <title>3.1. System Model</title>
        <p>We adopt a standard second-order clock model to represent the local clock behavior of each node. The
state vector is defined as:
where   denotes the clock ofset and  represents the clock skew.</p>
        <p>The state transition model is given by:
where the transition matrix is:
The observation model is:
where ∆  denotes the sampling interval. The process noise w− 1 is modeled as a zero-mean Gaussian
random variable with time-varying covariance Q:
x =
︂[   ︂]</p>
        <p>x = Ax− 1 + w− 1</p>
        <p>︂[ 1 ∆ ]︂</p>
        <p>A = 0 1
w− 1 ∼  (0, Q)
z = Hx + v
(1)
(2)
(3)
(4)
(5)</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Dual-Residual Sliding Window Mechanism</title>
        <sec id="sec-3-2-1">
          <title>After each filtering step, two types of residuals are recorded:</title>
          <p>• Measurement residual:
• Prediction residual:</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>For each component, we have:</title>
          <p>r = z −</p>
          <p>Hxˆ|− 1
r = xˆ| −</p>
          <p>Axˆ− 1|− 1
︁( ˆ

( ) = ˆ −

 − 1 + ˆ− 1∆  , 
() = ˆ −

ˆ
− 1
︁)
Each residual sequence is stored in a sliding window of length :
• Measurement residual bufer:
• Prediction residual bufer:
The sample variances of these bufers are then used to estimate the noise covariances:
ℛ = {r− +1, . . . , r}</p>
          <p>ℛ = {r− +1, . . . , r}</p>
          <p>
            ˆ
R = Var(),
ˆ
Q = Var()
where H = [
            <xref ref-type="bibr" rid="ref1">1, 0</xref>
            ]. The observation noise v is also modeled as a zero-mean Gaussian noise with
time-varying covariance R:
          </p>
          <p>v ∼  (0, R)</p>
          <p>Traditional methods typically assume Q and R to be fixed, which limits performance in highly
dynamic environments. To address this, we propose an online adaptive estimation strategy that uses a
sliding window of historical residuals to estimate noise covariances. Following the MLE principle, the
sample variances of these residuals provide unbiased estimates for Q and R, thereby improving the
iflter’s adaptability under non-stationary noise.</p>
          <p>()2
1</p>
          <p>∑︁
=− +1
⎡ (︁</p>
          <p>⎣</p>
          <p>())︁ 2</p>
          <p>In practical clock synchronization systems, clock ofset and clock skew are distinct error sources.
Clock ofset reflects a fixed initial deviation, while clock skew accumulates over time. For model
simplification and filter stability, we assume a proportional relationship between the two process noise
terms:
( ) =  (),  ≪
1
where  is a small scalar constant indicating that the ofset noise is significantly smaller than the
skew noise. Although this assumption is not physically derived, it is widely adopted in practice to
simplify the state model, as skew variation typically dominates ofset drift over short time intervals.
This simplification improves KF convergence and robustness in dynamic environments.</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. MLE-Inspired Covariance Update</title>
        <p>According to Mehra’s covariance matching theory[9], the MLE estimate of noise covariance is consistent
under the following conditions:</p>
        <p>E[r
(r
)⊤] = R,</p>
        <p>E[r(r
)⊤] = Q
Thus, we treat the sample covariance over the sliding windows as an unbiased estimator.
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Adaptive Factor Update</title>
        <p>To balance responsiveness and stability while mitigating abrupt fluctuations caused by sample variance
jumps,we apply an EWMA mechanism with adaptive smoothing factors   and   for dynamic update:
R = (1 −  )R− 1 +  Rˆ MLE
Q = (1 −  )Q− 1 +  Qˆ MLE
(17)
(18)</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Algorithm Summary</title>
        <p>We summarize the complete filtering procedure in Algorithm 1.
Algorithm 1 ADA-KF: Adaptive Dynamic Adjustment Kalman Filter</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Simulation Results</title>
      <p>We conducted extensive simulations to evaluate the performance of the proposed ADA-KF under
dynamic wireless synchronization scenarios, including high mobility and varying noise levels. To
simulate diferent SNR conditions (ranging from –20 dB to 20 dB), zero-mean Gaussian noise was added
to the system. All experiments were implemented in MATLAB with a fixed sampling interval. Each
simulation was repeated 100 times, and the average results were reported.</p>
      <p>ADA-KF is compared with three representative approaches: the KF with fixed process and observation
noise covariances, the CDIS-JE algorithm, and the SWVAKF. In contrast to these methods, ADA-KF
employs a dual-residual sliding window mechanism and adaptively updates noise covariances using
sample variance estimates. To prevent abrupt changes in the estimated covariances, an EWMA is
applied to smooth the updates. This process is theoretically supported by MLE consistency theory,
which justifies the use of residual variances as unbiased estimators under suitable assumptions. This
combined adaptive mechanism enables ADA-KF to respond more efectively and stably to dynamic and
time-varying noise conditions.</p>
      <p>Figure 3 illustrates the convergence behavior of the clock ofset estimation under moderate noise
conditions (SNR = 0 dB). A sliding window of 20 samples was applied to compute the root mean square
error (RMSE) of clock ofset  , enabling analysis of short-term fluctuations and convergence trends.
Compared to the standard KF (blue line), CDIS-JE (green line), and SWVAKF (magenta line), ADA-KF
achieves faster convergence and maintains a significantly lower steady-state RMSE. These results
confirm the method’s improved stability and enhanced noise suppression capability under moderate
conditions.</p>
      <p>To further investigate performance under challenging environments, we simulated a high-mobility
scenario with SNR = –10 dB and UE speed of 120 km/h. The convergence point is defined as the first
time step when the RMSE of clock ofset  drops below 10e-8, measured in frame numbers. Table 1
presents the comparative performance of ADA-KF and other methods, including convergence frame
and RMSE values for both clock ofset  and clock skew .</p>
      <p>As shown in the table, ADA-KF achieves the fastest convergence (22 frames) and the lowest RMSE
for both clock ofset and clock skew, demonstrating its superior convergence speed and estimation
accuracy in this challenging scenario. These improvements confirm the efectiveness of adaptive noise
covariance adjustment in high-mobility and noisy environments.</p>
      <p>To evaluate robustness under various noise conditions, we conducted experiments under varying SNR
levels from –20 dB to 20 dB (–20, –10, 0, 10, 20 dB). Figures 4 (a) and (b) show the RMSE performance
of clock ofset  and clock skew , respectively. Across all tested SNR levels, ADA-KF consistently
outperforms other methods. The advantage of ADA-KF is especially pronounced under low-SNR
conditions (–20 dB and –10 dB), where the fixed-parameter KF sufers severe degradation due to its
inability to adapt process and measurement noise covariances to the actual noise environment. CDIS-JE
benefits from its lightweight correlation-based design but shows limited resilience against channel
noise, particularly in skew estimation, where the cumulative efect necessitates long-term tracking.
SWVAKF adapts to noise statistics via variational Bayesian inference and achieves competitive accuracy,
but its sliding-window structure leads to slower adaptation to abrupt noise changes compared to
ADAKF’s dual-residual updating mechanism. As the SNR increases, all methods improve due to enhanced
signal quality. However, ADA-KF consistently achieves lower RMSE. Notably, ADA-KF and SWVAKF
demonstrate significantly better skew estimation than CDIS-JE and KF, confirming the importance of
adaptive state-space modeling for robust clock synchronization in dynamic wireless environments.
(a)
(b)</p>
    </sec>
    <sec id="sec-5">
      <title>5. CONCLUSIONS</title>
      <p>In this paper, we have proposed an innovative ADA-KF algorithm for clock synchronization in wireless
networks, specifically designed to address the challenges arising from high mobility and dynamic noise
environments. By incorporating a sliding window mechanism and leveraging sample variance estimates
for covariance estimation, the ADA-KF algorithm adapts to time-varying noise. These estimates are
theoretically supported by MLE consistency theory and are further stabilized using EWMA smoothing.
As a result, ADA-KF achieves superior performance compared to other methods, providing faster
convergence and better synchronization accuracy. The method exhibits significant improvements in
both convergence speed and steady-state error, particularly in low SNR and high-speed environments.
Future research can explore deploying ADA-KF in practical 5G/6G deployments and integrating it with
deep learning models to further improve noise estimation accuracy and scalability.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was supported by the National Key Research and Development Program of China under
Grant No.2022YFB3904702.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>The authors declare that OpenAI tool was used to assist in improving the language fluency of this paper.
All content, ideas, and conclusions are those of the authors, and the AI tool did not contribute to the
results or analysis.
[5] Y.-C. Wu, Q. Chaudhari, E. Serpedin, Clock synchronization of wireless sensor networks, IEEE</p>
      <p>Signal Processing Magazine 28 (2010) 124–138.
[6] B. Sundararaman, U. Buy, A. D. Kshemkalyani, Clock synchronization for wireless sensor networks:
a survey, Ad hoc networks 3 (2005) 281–323.
[7] S. Ganeriwal, R. Kumar, M. B. Srivastava, Timing-sync protocol for sensor networks, in:
Proceedings of the 1st international conference on Embedded networked sensor systems, 2003, pp.
138–149.
[8] D. L. Mills, Internet time synchronization: the network time protocol, IEEE Transactions on
communications 39 (2002) 1482–1493.
[9] R. Mehra, On the identification of variances and adaptive kalman filtering, IEEE Transactions on
automatic control 15 (1970) 175–184.
[10] B. Zheng, P. Fu, B. Li, X. Yuan, A robust adaptive unscented kalman filter for nonlinear estimation
with uncertain noise covariance, Sensors 18 (2018) 808.
[11] Y. Huang, F. Zhu, G. Jia, Y. Zhang, A slide window variational adaptive kalman filter, IEEE</p>
      <p>Transactions on Circuits and Systems II: Express Briefs 67 (2020) 3552–3556.
[12] Z. Zuo, W. Liu, J. Lei, P. Yang, Joint estimation of clock skew and ofset of listening nodes in
wireless sensor networks based on correlation detection, in: 2024 IEEE International Conference
on Smart Internet of Things (SmartIoT), IEEE, 2024, pp. 516–522.
[13] J. Werner, M. Costa, A. Hakkarainen, K. Leppanen, M. Valkama, Joint user node positioning
and clock ofset estimation in 5g ultra-dense networks, in: 2015 IEEE Global Communications
Conference (GLOBECOM), IEEE, 2015, pp. 1–7.
[14] M. Goodarzi, D. Cvetkovski, N. Maletic, J. Gutiérrez, E. Grass, Synchronization in 5g networks:
a hybrid bayesian approach toward clock ofset/skew estimation and its impact on localization,
EURASIP Journal on Wireless Communications and Networking 2021 (2021) 1–22.
[15] Q. Hu, L. Wang, Y. Luo, Y. Cheng, Z. Kou, Z. Xie, Iterative maximum-likelihood estimation algorithm
for clock ofset and skew correction in uwb systems assisted by 5g nr multipath, Measurement
242 (2025) 115823.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Giorgi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Narduzzi</surname>
          </string-name>
          ,
          <article-title>Performance analysis of kalman-filter-based clock synchronization in ieee 1588 networks</article-title>
          ,
          <source>IEEE transactions on instrumentation and measurement 60</source>
          (
          <year>2011</year>
          )
          <fpage>2902</fpage>
          -
          <lpage>2909</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bar-Shalom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kirubarajan</surname>
          </string-name>
          ,
          <article-title>Estimation with applications to tracking and navigation: theory algorithms and software</article-title>
          , John Wiley &amp; Sons,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Timestamp-free clock parameters tracking using extended kalman ifltering in wireless sensor networks</article-title>
          ,
          <source>IEEE Transactions on Communications</source>
          <volume>69</volume>
          (
          <year>2021</year>
          )
          <fpage>6926</fpage>
          -
          <lpage>6938</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Joint clock ofset and skew estimation based on correlated propagation delays in internet of bio-nano things</article-title>
          ,
          <source>IEEE Internet of Things Journal</source>
          <volume>11</volume>
          (
          <year>2023</year>
          )
          <fpage>6232</fpage>
          -
          <lpage>6240</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>