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

MohammadJavad Hajikhani

dblp:133/4935 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · unresolved

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

Computer networks · 1 · 1 first-author

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 of things and sensor networks · 67% Internet architecture and protocols · 33%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › time synchronization
clock offset estimation
0.212016
A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks · IEEE/ACM Trans. Netw. 2016
Internet architecture and protocols › network synchronization
precision time protocol
0.212016
A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks · IEEE/ACM Trans. Netw. 2016
Internet of things and sensor networks
time synchronization
0.212016
A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks · IEEE/ACM Trans. Netw. 2016

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

recursive estimation · 0.2filtering · 0.2
YearPublicationVenuePosition
2016 A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks
abstract
In the context of the IEEE 1588 Precision Time Protocol (PTP), estimating the delay's bias is a problem that appears in both one-way (using transparent devices) or two-way message exchange mechanisms. For estimating the offset via the two-way message exchange mechanism, it is usually assumed that the expected value of delays in forward and reverse directions are equal. However, this is not a realistic assumption for packet-based wide area networks, where delays in down-link and up-link directions may have a significant difference. In this work, we propose a solution to estimate the random delay's bias and improve the synchronization accuracy of IEEE 1588. Our method is easy to implement and is compatible with the current version of the protocol. We compared our results to no bias correction and the Boot-strap method. In addition to the improvement in synchronization accuracy, our method allows us to update the slave clock recursively. The proposed method works well even in the presence of large frequency offsets and can also be implemented by using different filters.
MohammadJavad Hajikhani, Thomas Kunz, Howard M. Schwartz
IEEE/ACM Trans. Netw.1
2013 A recursive solution for improving the synchronization accuracy in wireless sensor networks
abstract
A two-way message exchange mechanism is at the core of many clock synchronization protocols. The basic concept of this method has been designed for symmetrical links, otherwise, depending on the level of asymmetric delays, large synchronization errors may occur. Many estimation based methods have been proposed so far for estimating the degree of asymmetry and reducing this error. However, many of them are solved for a specific distribution of link random delays. Moreover, imposing a high level of computational complexity upon network nodes is another problem of them. In this paper we introduce a recursive solution for improving the performance of the basic two-way message exchange mechanism. The advantage of this method is that it keeps the protocol simple and therefore easily implementable. The proposed method does not make any specific assumption about the distribution of the random delays. It also provides the network designer with some deployment flexibility, trading off convergence speed against stability.
MohammadJavad Hajikhani, Thomas Kunz, Howard M. Schwartz
IWCMC1