# US 12,114,278 B2 · Synchronising network nodes > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,114,278 B2 - Document ID: US12114278B2 - Status: Granted - Kind: B2 - Application number: 17/583,318 - Filed: 2022-01-25 - Published: 2023-09-14 - Granted: 2024-10-08 - Earliest claimed: 2022-01-25 - Assignees: Kabushiki Kaisha Toshiba - Applicants: Kabushiki Kaisha Toshiba - Inventors: Adnan Aijaz; Aleksandar Stanoev - Web page: https://patentgrep.com/patent/US12114278B2 ## CPC - H04W 56/0015: {one node acting as a reference for the others} - H04W 56/0005: {synchronizing of arrival of multiple uplinks} - H04W 56/005: {compensating for timing error by adjustment in the receiver} - H04W 56/009: {Closed loop measurements} - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract A method of synchronizing clocks of a secondary node and primary node, the method comprising: the primary node transmitting a first message and an indication of that message's transmission time to the secondary node; the secondary node transmitting a second message to the primary node; the primary node transmitting a third message and an indication of that message's transmission time to the secondary node; the secondary node calculating a rate of its clock relative to the clock of the primary node using a ratio of times between the transmission and reception times of the first and third messages; and the secondary node calculating a time offset of its clock relative to the clock of the primary node using the calculated rate, a propagation delay and one of the indications of the transmission times of the first or third message. ## Claims ### Claim 1 A method comprising: a primary node transmitting a first message to a secondary node, the primary node including a radio, the secondary node including a radio; the primary node transmitting an indication of a transmission time of the first message to the secondary node; the secondary node transmitting a second message to the primary node; the primary node transmitting a third message to the secondary node; the primary node transmitting an indication of a transmission time of the third message to the secondary node; the secondary node calculating a rate of a clock of the secondary node relative to a clock of the primary node using a ratio of a time difference between the transmission time of the first message and the transmission time of the third message by the primary node to a time difference between a reception time of the first message and a reception time of the third message by the secondary node; the secondary node calculating a time offset of the clock of the secondary node relative to the clock of the primary node using the calculated rate, a value of a propagation delay between the primary node and the secondary node and one of the indication of the transmission time of the first message or the indication of the transmission time of the third message; and synchronizing the clock of the secondary node with the clock of the primary node. ### Claim 2 (depends on 1) A method according to claim 1 wherein the primary node determines the indication of the transmission time of the first message and the indication of the transmission time of the third message based at least in part on times at which the radio of the primary node transitions to a transmit state, and wherein the secondary node determines the indication of the transmission time of the third message based at least in part on a time at which the radio of the secondary node transitions to a transmit state. ### Claim 3 (depends on 1) A method according to claim 1 wherein the primary node and the secondary node do not transmit timestamps of transmission or reception times of any of the first, second, and third messages to each other. ### Claim 4 (depends on 1) A method according to claim 1 wherein at least one of: the indication of the transmission time of the first message is transmitted in a follow-up message between the transmission of the first message and the transmission of the second message; or the indication the transmission time of the third message is transmitted in a follow-up message after the transmission of the third message. ### Claim 5 (depends on 1) A method according to claim 1 further comprising the secondary node transmitting to the primary node one or more parameters indicative of a sum of: a secondary node residence time between a receipt of the indication of the transmission time of the first message and the transmission of the second message, and the transmission time of the first message. ### Claim 6 (depends on 5) A method according to claim 5 further comprising: an overhearing node other than the primary node and the secondary node overhearing the transmission of the one or more parameters indicative of the sum of the secondary node residence time and the transmission time of the first message, and the overhearing node calculating a time offset of a clock of the overhearing node relative to the clock of the primary node using: a propagation delay between the overhearing node and the secondary node; any fixed time between the transmission of the second message and the transmissions of the indication of the secondary node residence time by the secondary node; the residence time between the receipt of the indication of the transmission time of the first message and the transmission of the second message; any fixed time between the transmission of the first message and the transmissions of the indication of the transmission time of the first message by the primary node; and the transmission time of the first message. ### Claim 7 (depends on 5) A method according to claim 5 wherein the indication of the secondary node residence time and the one or more parameters indicative of the sum of the transmission time of the first message and the transmission of the second message are both transmitted in a follow-up message transmitted by the secondary node after the second message and received by the primary node before the transmission of the third message. ### Claim 8 (depends on 1) A method according to claim 1 wherein the indication of the transmission time of the first message to the secondary node is a difference between a reference time and a start of the first message. ### Claim 9 (depends on 1) A method according to claim 1 further comprising: the primary node transmitting an indication of a primary node residence time between a receipt of the indication of the transmission time of the first message and the transmission of the second message to the secondary node; and the secondary node calculating a propagation delay between the primary node and the secondary node based on: a time at which the secondary node transmitted the second message, a time at which the secondary node received the third message; and the primary node residence time. ### Claim 10 (depends on 9) A method according to claim 9 further comprising the secondary node calculating a time offset of the clock of the secondary node relative to the clock of the primary node based on the calculated propagation delay between the primary node and the secondary node, a time at which the secondary node received a message from the primary node, and an indication of a time at which the primary node transmitted the message that the secondary node received from the primary node. ### Claim 11 (depends on 1) One or more non-transitory storage media comprising computer instructions executable by one or more processors, the computer instructions when executed by the processors causing the processors to perform the method according to claim 1. ### Claim 12 A network node comprising a radio and a clock, the network node being configured to: receive a first message from a primary node; receive an indication of a transmission time of the first message by the primary node from the primary node; transmit a second message to the primary node; receive a third message from the primary node; receive an indication of a transmission time of the third message by the primary node from the primary node; calculate a rate of a clock of a network node relative to the clock of the primary node using a ratio of a time difference between the transmission time of the first message and the transmission time of the third message by the primary node to a time difference between a reception time of the first message and a reception time of the third message by the secondary network node; calculate a time offset of the clock of the secondary network node relative to the clock of the primary node using the calculated rate, a value of a propagation delay between the primary node and the secondary network node and one of the indication of the transmission time of the first message or the indication of the transmission time of the third message; and synchronizing the clock of the network node with the clock of the primary node. ### Claim 13 A method comprising: transmitting a packet from one of a first node and a second node to the other of the first node and the second node; a transmitting node counting a respective number of clock cycles of a clock of the transmitting node that occur during the transmission of the packet; a receiving node counting a respective number of clock cycles of a clock of the receiving node that occur during the receipt of the packet; the first node transmitting a respective number of clock cycles of a clock of the first node to the second node; the second node calculating a rate of a clock of the second node relative to a rate of the clock of the first node using a ratio between the respective number of clock cycles counted by the first node and the respective number of clock cycles counted by the second node; and synchronizing rates of clocks of the first node and the second node. ### Claim 14 (depends on 13) One or more non-transitory storage media comprising computer instructions executable by one or more processors, the computer instructions when executed by the processors causing the processors to perform the method according to claim 13.