Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wenqiao Ma

dblp:342/3009 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0008-4241-1752ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 50% Internet of things and sensor networks · 50%
Theoretical computer science
1 paper
Information theory · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
network synchronization
1.012026
Competitive Learning-Based Clock Parameters Estimation for PTP Synchronization With Unknown Delay Distributions · IEEE Trans. Commun. 2026
Internet of things and sensor networks
time synchronization
1.012026
Competitive Learning-Based Clock Parameters Estimation for PTP Synchronization With Unknown Delay Distributions · IEEE Trans. Commun. 2026
Information theory
estimation theory
1.012026
Competitive Learning-Based Clock Parameters Estimation for PTP Synchronization With Unknown Delay Distributions · IEEE Trans. Commun. 2026
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.312026
Competitive Learning-Based Clock Parameters Estimation for PTP Synchronization With Unknown Delay Distributions · IEEE Trans. Commun. 2026

Methods — techniques the papers use, named apart from their topics

robust estimation · 3.0rival penalized expectation maximization · 3.0competitive learning · 3.0
YearPublicationVenuePosition
2026 Competitive Learning-Based Clock Parameters Estimation for PTP Synchronization With Unknown Delay Distributions
abstract
Clock synchronization is a crucial requirement for coordinated activities in distributed networks. As an effective solution, Precision Time Protocol (PTP) is tailored to provide tight synchronization which, however, suffers from packet delay variation (PDV). Therefore, it is a challenging task to mitigate the uncertainties of PDV so that clock skew and offset can be estimated with higher accuracy and robustness. Under the assumption of delay symmetry, PDV is caused by unavailable prior information about the statistical distributions of stochastic delay. This paper investigates a robust estimator that can achieve joint estimation for clock skew and offset under delay with unknown distributions by employing the competitive learning-based rival penalized expectation maximization (RPEM) algorithm to learn the unknown probability density function (pdf) of stochastic delay. Moreover, for the asymmetric delay scenario, besides the unknown delay distributions, delay asymmetry is another important influence on synchronization accuracy. Therefore, the optimal invariant robust estimator is developed to simultaneously handle the performance degradation caused by delay asymmetry and unknown delay distributions. The estimator can even cope with the scenario where the random delays in the uplink and downlink follow different distributions. The effectiveness of the estimation schemes is validated by the computer simulations.
Heng Wang 0003, Wenqiao Ma, Xiaojiang Liu, Xiong Zhu, Min Li 0005
IEEE Trans. Commun.3
2025 Multi-Hop Timestamp-Free Synchronization With Arbitrary Distributed Delays in Wireless Networks
abstract
Timestamp-free synchronization protocol is tailored to provide a global time understanding for resource-limited wireless networks as it eliminates timestamp interaction, thereby minimizing additional resource overheads. However, the existing two-hop based timestamp-free protocols are not suitable for synchronizing all nodes in multi-hop networks, as they necessitate multiple response times to establish the timestamp relationship between each pair of neighboring nodes. To this end, we introduce a novel multi-hop timestamp-free synchronization protocol. The proposed protocol allows any two nodes to be synchronized using only local timestamps and the skew estimates embedded within packets traversing the reverse path. Furthermore, considering that synchronization accuracy suffers from delay variation resulting from packet loss or retransmission in wireless networks, we derive a Pitman estimator to estimate the clock skew under arbitrary delay models, given known information. To further target unknown arbitrary delay distributions, we approximate the probability density function (pdf) of stochastic delays using a Gaussian mixture model, and then learn the pdf using the rival penalized expectation maximization algorithm. With the aid of the learned pdf, the robustness-enhanced Pitman estimator is derived, which is robust against arbitrary distributed delays without known knowledge. The effectiveness and performance enhancement of estimators are validated by simulations.
Heng Wang 0003, Wenqiao Ma, Xiaojiang Liu, Min Li 0005
IEEE Trans. Wirel. Commun.2
2023 Robust Clock Skew and Offset Estimation for PTP Synchronization With Unknown Delay Distributions
abstract
Clock synchronization is crucial requirement for coordinated activities in distributed networks. Precision Time Protocol (PTP) is a popular synchronization scheme to provide tight synchronization which, however, suffers from packet delay variation (PDV). In real networks, prior information on the statistical distribution of stochastic delays is always unavailable. Therefore, it is significant to estimate the clock skew and offset in the presence of stochastic delays with unknown statistical distributions. This paper investigates a robust estimation approach applicable to scenarios where the delay distributions are unknown, which utilizes the Gaussian mixture model to approximate the probability density function (pdf) of random delays, and then employs the rival penalized expectation maximization (RPEM) algorithm to learn mixture model parameters. The optimum invariant estimators for the clock skew and offset are derived based on the learned pdfs of random delays. The effectiveness of the estimation scheme is validated by the computer simulations.
Heng Wang 0003, Wenqiao Ma, Xiaojiang Liu
GLOBECOM2