# US 2020/0288420 A1 · Communication Processing Method and Apparatus

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0288420 A1
- Document ID: US20200288420A1
- Status: Published application
- Kind: A1
- Application number: 16/884,320
- Filed: 2020-05-27
- Published: 2020-09-10
- Earliest claimed: 2017-11-27
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Yuanping Zhu; Mingzeng Dai; Rui Wang
- Web page: https://patentgrep.com/patent/US20200288420A1

## CPC

- H04J 3/0667: {Bidirectional timestamps, e.g. NTP or PTP for compensation of clock drift and for compensation of propagation delays (arrangements for monitoring round trip delays in packet switching networks H04L43/0864)}
- H04W 56/003: {Arrangements to increase tolerance to errors in transmission or reception timing}
- H04J 3/0673: {using intermediate nodes, e.g. modification of a received timestamp before further transmission to the next packet node, e.g. including internal delay time or residence time into the packet}
- H04W 56/00: Synchronisation arrangements
- H04W 56/0015: {one node acting as a reference for the others}
- H04W 56/005: {compensating for timing error by adjustment in the receiver}
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

This application provides a communication processing method and apparatus. The method includes: receiving, by a target node, a second message sent by a synchronization source node via at least one intermediate node, where the second message carries a receiving time of a first message from the target node at the synchronization source node and waiting time information of the first message at each of the at least one intermediate node; and determining, by the target node, a clock deviation between the target node and the synchronization source node based on a sending time of the first message at the target node and the second message.

## Claims

### Claim 1

A method, comprising:
receiving, by a target node, a second message sent by a synchronization source node via at least one intermediate node, wherein the second message carries first time information, and the first time information comprises:
a receiving time of a first message at the synchronization source node, the first message being sent by the target node; and
for each intermediate node of the at least one intermediate node, waiting time information of the first message at the respective intermediate node;
determining, by the target node, a clock deviation between the target node and the synchronization source node based on a sending time of the first message at the target node and the first time information comprised in the second message; and
sending, by the target node, a fourth message, wherein the fourth message indicates a hop count between the target node and the synchronization source node, and the hop count is usable by another target node to determine whether to perform clock synchronization with the target node.

### Claim 2 (depends on 1)

The method according to claim 1, wherein:
the second message further carries a sending time of the second message at the synchronization source node, and, for each intermediate node of the at least one intermediate node, waiting time information of the second message at the respective intermediate node; and
determining, by the target node, the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node and the first time information comprised in the second message comprises:
determining, by the target node, the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node, a receiving time of the second message at the target node, and the first time information comprised in the second message.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising:
receiving, by the target node, a third message sent by the synchronization source node via the at least one intermediate node, wherein the third message carries second time information, and the second time information comprises:
a sending time of the third message at the synchronization source node; and
for each intermediate node of the at least one intermediate node, waiting time information of the third message at the respective intermediate node; and
sending, by the target node based on the third message, the first message to the synchronization source node via the at least one intermediate node; and
wherein determining, by the target node, the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node and the first time information comprised in the second message comprises:
determining, by the target node, the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node, the first time information comprised in the second message, a receiving time of the third message at the target node, and the second time information comprised in the third message.

### Claim 4 (depends on 3)

The method according to claim 3, wherein the third message is sent by the synchronization source node and the at least one intermediate node in a broadcast or multicast manner.

### Claim 5

A method, comprising:
adding, by a first intermediate node to a first message received from a target node, waiting time information of the first message at the first intermediate node;
sending, by the first intermediate node, the first message;
receiving, by the first intermediate node, a second message, wherein the second message carries a receiving time of the first message at a synchronization source node, and, for each intermediate node of at least one intermediate node, waiting time information of the first message at the respective intermediate node, and the at least one intermediate node comprises the first intermediate node;
sending, by the first intermediate node, the second message; and
sending, by the first intermediate node, a fifth message, wherein the fifth message indicates a hop count between the first intermediate node and the synchronization source node, and the hop count is usable by another target node to determine whether to perform clock synchronization with the first intermediate node.

### Claim 6 (depends on 5)

The method according to claim 5, wherein before sending, by the first intermediate node, the second message, the method further comprises:
adding, by the first intermediate node, waiting time information of the second message at the first intermediate node to the second message.

### Claim 7 (depends on 5)

The method according to claim 5, wherein before adding, by the first intermediate node to the first message from the target node, waiting time information of the first message at the first intermediate node, the method further comprises:
receiving, by the first intermediate node, a third message, wherein the third message carries a sending time of the third message at the synchronization source node;
adding, by the first intermediate node to the third message, waiting time information of the third message at the first intermediate node; and
sending, by the first intermediate node, the third message.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the third message is sent by the synchronization source node and the first intermediate node in a broadcast or multicast manner.

### Claim 9 (depends on 5)

The method according to claim 5, wherein the first intermediate node is a terminal device or a relay node.

### Claim 10

A target node, comprising:
at least one processor; and
a non-transitory memory storing instructions, wherein the instructions are executable by the at least one processor to cause the target node to:
receive a second message from a synchronization source node via at least one intermediate node, wherein the second message carries first time information, and the first time information comprises:
a receiving time of a first message from the target node at the synchronization source node; and
for each intermediate node of the at least one intermediate node, waiting time information of the first message at the respective intermediate node;
determine a clock deviation between the target node and the synchronization source node based on a sending time of the first message at the target node and the first time information comprised in the second message; and
send a fourth message, wherein the fourth message indicates a hop count between the target node and the synchronization source node, and the hop count is usable by another target node to determine whether to perform clock synchronization with the target node.

### Claim 11 (depends on 10)

The node according to claim 10, wherein:
the second message further carries a sending time of the second message at the synchronization source node and, for each intermediate node of the at least one intermediate node, waiting time information of the second message at the respective intermediate node; and
the instructions being executable by the at least one processor to cause the target node to determine the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node and the first time information in the second message comprises the instructions being executable by the at least one processor to cause the target node to:
determine the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node, a receiving time of the second message at the target node, and the first time information comprised in the second message.

### Claim 12 (depends on 10)

The node according to claim 10, wherein the instructions are further executable by the at least one processor to cause the target node to:
receive a third message sent by the synchronization source node via the at least one intermediate node, wherein the third message carries second time information, and the second time information comprises:
a sending time of the third message at the synchronization source node; and
for each intermediate node of the at least one intermediate node, waiting time information of the third message at the respective intermediate node; and
send, based on the third message, a first message to the synchronization source node via the at least one intermediate node; and
wherein the instructions being executable by the at least one processor to cause the target node to determine the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node and the first time information comprised in the second message comprises the instructions being executable by the at least one processor to cause the target node to:
determine the clock deviation between the target node and the synchronization source node based on the sending time of the first message at the target node, the first time information in the second message, a receiving time of the third message at the target node, and the second time information in the third message.

### Claim 13 (depends on 12)

The node according to claim 12, wherein the third message is sent by the synchronization source node and the at least one intermediate node in a broadcast or multicast manner.

### Claim 14

A first intermediate node, comprising:
at least one processor; and
a non-transitory memory storing instructions, wherein the instructions are executable by the at least one processor to cause the first intermediate node to:
add, to a first message received from a target node, waiting time information of the first message at the first intermediate node;
send the first message;
receive a second message, wherein the second message carries a receiving time of the first message at a synchronization source node, and, for each intermediate node of at least one intermediate node, waiting time information of the first message at the respective intermediate node, and wherein the at least one intermediate node comprises the first intermediate node;
send the second message; and
send a fifth message, wherein the fifth message indicates a hop count between the first intermediate node and the synchronization source node, and the hop count is usable by another target node to determine whether to perform clock synchronization with the first intermediate node.

### Claim 15 (depends on 14)

The node according to claim 14, wherein the instructions are further executable by the at least one processor to cause the first intermediate node to:
add waiting time information of the second message at the first intermediate node to the second message before sending the second message.

### Claim 16 (depends on 14)

The node according to claim 14, wherein the instructions are further executable by the at least one processor to cause the first intermediate node to:
before adding, to the first message from the target node, waiting time information of the first message at the first intermediate node, receive a third message, wherein the third message carries a sending time of the third message at the synchronization source node;
add waiting time information of the third message at the first intermediate node to the third message; and
send the third message.

### Claim 17 (depends on 16)

The node according to claim 16, wherein the third message is sent by the synchronization source node and the first intermediate node in a broadcast or multicast manner.

### Claim 18 (depends on 14)

The node according to claim 14, wherein the first intermediate node is a terminal device or a relay node.
