# US 10,313,038 B2 · Fast synchronization scheduling apparatus and method for time slotted channel hopping in congested industrial wireless network environment

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

- Number: US 10,313,038 B2
- Document ID: US10313038B2
- Status: Granted
- Kind: B2
- Application number: 15/770,743
- Filed: 2017-11-21
- Published: 2019-03-07
- Granted: 2019-06-04
- Earliest claimed: 2016-12-28
- Assignees: Pusan National University Industry-University Cooperation Foundation
- Applicants: Pusan National University Industry-University Cooperation Foundation
- Inventors: Sanghwa Chung; Jaeyoung Kim
- Web page: https://patentgrep.com/patent/US10313038B2

## CPC

- H04J 3/06: Synchronising arrangements {(for television systems H04N5/04; bit-synchronisation H04L7/00)}
- H04B 17/318: Received signal strength
- H04J 3/0694: {Synchronisation in a TDMA node, e.g. TTP}
- H04W 28/0284: {detecting congestion or overload during communication (monitoring arrangements H04L43/00)}
- H04W 28/06: Optimizing {the usage of the radio link}, e.g. header compression, information sizing {, discarding information (system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365)}
- H04W 56/001: {Synchronization between nodes}
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04J 3/10: Arrangements for reducing cross-talk between channels
- 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)
- H04B: TRANSMISSION
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

The present invention provides, on the basis of congestion of a network, an arrangement state of nodes, and a quality of a communication channel, a fast synchronization scheduling apparatus and method for reducing a listening time of a node that desires to join. The fast synchronization scheduling apparatus and method include a radio frequency (RF) transmission and reception module configured to transmit and receive RF signals from nearby channels, a received signal strength indicator (RSSI) reception and storage module configured to receive RSSI values from the RF signals received from the RF transmission and reception module and store the received RSSI values, a channel sorting module configured to measure Channel Quality Estimation (CQE) values of the respective channels by putting the RSSI values of the respective channels received from the RSSI reception and storage module into a CQE formula and to sort the channels in order of highest CQE value (highest channel quality) based on the measured CQE values, and a channel setting and advertisement packet (ADV) reception module configured to receive an input of a channel having the highest CQE value from the channel sorting module, set the channel, and start a listening operation to receive an ADV in the set channel.

## Claims

### Claim 1

A fast synchronization scheduling method for Time Slotted Channel Hopping (TSCH) in a congested industrial wireless network environment, the fast synchronization scheduling method comprising steps of:
(a) receiving RF signals from nearby channels;
(b) receiving advertisement packets (ADVs) and received signal strength indicator (RSSI) values from the RF signals and measuring Channel Quality Estimation (CQE) values of the respective channels by putting the RSSI values of the respective channels into a CQE formula, and collecting information about a number of coordinators and information about a good group; and
(c) delivering the information about the number of coordinators and a number of allocated ADV slots to a Personal Area Network (PAN) coordinator on the basis of the information about the number of the coordinators and the information about the good group that are collected from the step (b), and upon receiving an answer, generating an ADV message and transmitting the generated ADV message in a channel designated for each coordinator.

### Claim 2 (depends on 1)

The fast synchronization scheduling method of claim 1, wherein the step (b) further comprises:
storing the received RSSI values;
identifying a number of other coordinators;
sorting the channels in order of highest CQE value (highest channel quality) based on the measured CQE values; and
setting the number of coordinators and the good group by using the ADVs, the number of coordinators, and the CQE values that are identified, and selecting channels having a high CQE value.

### Claim 3 (depends on 2)

The fast synchronization scheduling method of claim 2, wherein the step (b) further comprises:
selecting, on the basis of a predetermined threshold value, a channel that is determined not to be congested among the channels sorted in order of highest CQE value.

### Claim 4 (depends on 1)

The fast synchronization scheduling method of claim 1, wherein the PAN coordinator serves to perform, on an entire topology that accords with allocation of ADV slots, scheduling on the basis of the good group and the number of coordinators.

### Claim 5

A fast synchronization scheduling method for Time Slotted Channel Hopping (TSCH) in a congested industrial wireless network environment, the fast synchronization scheduling method comprising:
(a) receiving information about a good group and information about the number of nearby coordinators with respect to each coordinator;
(b) calculating the number of coordinators that share a communication distance with each coordinator on the basis of the information received in step (a);
(c) calculating a number of channels classified as being part of the good group on the basis of a Channel Quality Estimation (CQE) value included in the information; and
(d) comparing the number of channels classified as being part of the good group with the calculated number of the coordinators, allocating a channel to each coordinator on the basis of a result of the comparison, and delivering the information about the allocation to each coordinator in a wireless manner.
