Communication method and apparatus

By having the G node send an identifier and CRC bit information after channel contention, the problem of the T node being unable to know the channel occupancy is solved, thus achieving reliability and security of data transmission between nodes.

WO2026037205A1PCT designated stage Publication Date: 2026-02-19HUAWEI TECH CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2025/113598
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-08-15
Filing Date
2025-08-08
Publication Date
2026-02-19

AI Technical Summary

Technical Problem

In Starflash communication technology, node T cannot know that node G has won the channel, which makes it impossible to communicate with node G and affects the reliability of communication.

Method used

After a G node wins a channel, it sends first information, including a first node identifier and CRC bits, within the first COT. The second node determines the channel occupancy status based on the received information and performs data transmission. The first information may include CRC bits and a period length to improve reliability.

Benefits of technology

By periodically sending the first message, the second node can accurately determine the channel occupancy time, ensuring the reliability of data transmission, reducing the probability of different nodes having the same identifier, and improving communication security and system flexibility.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025113598_19022026_PF_FP_ABST
    Figure CN2025113598_19022026_PF_FP_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of wireless communications, and provides a communication method and apparatus, which are used for improving the reliability of communication between nodes. The method comprises: a first node sending first information within a first COT of the first node, the first information comprising a first identifier of the first node and CRC bits; and, the first node transmitting first data with a second node within the first COT, the second node being a node that has established a connection with the first node. In the present application, after winning contention for a channel, the first node sends the first information comprising the first identifier of the first node to the second node within the first COT; upon receiving the first information, the second node determines, on the basis of the identifier of the first node in the first information, that the first node is a node connected to the second node; the second node can then transmit the first data with the first node, thereby ensuring that data transmission is accurately performed between the first node and the second node.
Need to check novelty before this filing date? Find Prior Art

Description

Communication method and apparatus

[0001] Cross-reference to Related Applications

[0002] This application claims priority to the Chinese Patent Application No. 202411127970.8, filed on August 15, 2024, and entitled “A communication method and apparatus”, the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] The present application relates to the technical field of wireless communication, and in particular to a communication method and apparatus. BACKGROUND

[0004] The development of wireless local area network (WLAN) makes wireless communication more and more popular. The standards (i.e., 802.11 protocol group) for WLAN formulated by the Institute of Electrical and Electronics Engineers (IEEE) also evolve continuously.

[0005] With the continuous development of Internet of Things technology, short-distance communication technologies such as WLAN technology may not be able to well meet more application scenarios and needs, and therefore, sparklink communication technology for short-distance communication emerges as the times require. The sparklink communication technology supports sparklink basic (SLB) access technology. When SLB works in an unlicensed frequency band, a grant (G) node using the sparklink communication technology needs to occupy a channel through competition. After the G node competes for the channel, it can enter a communication state and transmit data in the communication state. However, for a T node managed by the G node, the T node cannot know that the G node has competed for the channel, and therefore cannot communicate with the G node. SUMMARY

[0006] The present application provides a communication method and apparatus to improve the reliability of communication between nodes.

[0007] In a first aspect, an embodiment of the present application provides a communication method, which can be applied to a first node, a module (such as a circuit, a chip or a chip system, etc.) in the first node, or a logic node, a logic module or software capable of realizing all or part of the functions of the first node. The first node is also referred to as a management node or a management device, etc. Taking the application to the first node as an example, the method comprises: sending, by the first node, first information in a first channel occupation time (COT) of the first node, wherein the first information comprises a first identifier of the first node and cyclic redundancy check (CRC) bits; and transmitting, by the first node, first data with a second node in the first COT of the first node, wherein the second node is a node connected with the first node.

[0008] Through the above method, after the first node competes for the channel, the first node can send the first information to the second node in the first COT of the first node, and the first information can comprise the first identifier of the first node; in this way, after the second node receives the first information, the second node determines, according to the identifier of the first node in the first information, that the first node is a node connected with itself, and then the second node can determine that the first node has competed for the channel and is currently in the channel occupation time of the first node, and the second node can transmit the first data with the first node in the channel occupation time of the first node, thereby ensuring accurate data transmission between the first node and the second node and improving the reliability of communication between the first node and the second node. In addition, the first node sends the first information to the second node, the first information carries the first identifier of the first node, and the first information is information comprising CRC bits, and the length of the first information can be set according to actual needs, and when the length of the first information is relatively long, more identifiers can be indicated when the identifier of the node is indicated through the first information (for example, when the first information comprises N bits, the corresponding identifier pool can comprise 2N identifiers), which can reduce the probability of different nodes adopting the same ID, thereby further improving the reliability of communication between the first node and the second node. N

[0009] In a possible implementation method, the first node periodically sends the first information in the first COT of the first node.

[0010] Through the above method, the first node can periodically send the first information in the first COT, and based on the first information sent each time, the second node can determine a first period corresponding to the first information, so that the second node can transmit data with the first node in the first period, and this periodic sending of the first information can improve the reliability of communication between the first node and the second node.

[0011] ​In a possible implementation, the first information includes a period length of a period of transmission of the first information.

[0012] By the above method, when the first node periodically transmits the first information, the first information transmitted by the first node can include the period length of the period of transmission of the first information, so that the second node can determine a first period according to the period length included in the first information after receiving the first information, so that the second node can transmit data with the first node in the first period, thereby ensuring reliable transmission of data between the first node and the second node. In addition, the first node can flexibly configure the period length of the period of transmission of the first information through the first information, which can increase the flexibility of the system; for example, the first node can configure a longer period length through the first information, which can reduce the number of transmissions of the first information, thereby reducing the transmission cost of the first information; or the first node can configure a shorter period length through the first information, which can improve the reliability of the system.

[0013] In a possible implementation, the transmission time domain resource of the first information is before the transmission time domain resource of the first data in the first COT.

[0014] By the above method, the first node transmits the first information before the transmission time domain resource of the first data, so that the second node can receive the first information before the transmission of the first data, and the second node can timely learn that the connected first node has contended for the communication channel and perform data transmission with the first node, thereby not affecting the transmission of the first data between the second node and the first node.

[0015] In a possible implementation, the first identifier is determined according to a layer 2 identifier of the first node; or the first identifier is determined according to medium access control identifier information (MAC ID) of the first node; or the first identifier is randomly generated.

[0016] By the above method, the first identifier can be flexibly generated in multiple different ways. The way of determining the first identifier based on the layer 2 identifier or the MAC ID can determine different first identifiers for different nodes, thereby avoiding the same identifier being used by different nodes. The way of randomly generating the first identifier can generate different identifiers from other nodes, thereby avoiding the same identifier being used by different nodes; in addition, the way of randomly generating the first identifier by the first node can also avoid exposing the layer 2 identifier or the MAC ID of the first node, thereby improving the communication security and better protecting the private data of the first node.

[0017] In a possible implementation, the first identifier includes a layer 2 identifier of the first node or a MAC ID of the first node.

[0018] By the above method, since the layer 2 identifier and the MAC ID of different nodes are different, when the layer 2 identifier of the first node or the MAC ID of the first node is included in the first identifier, it can be ensured that the first identifier is different from the identifiers of other nodes.

[0019] In a possible implementation method, the first identifier further includes type information of the first node.

[0020] By the above method, when the type information of the first node is included in the first identifier of the first node, when the second node establishes an initial connection with the first node, unnecessary connections can be reduced or avoided according to the type of the first node.

[0021] In a possible implementation method, the first node transmits the first information on the first channel in the first COT of the first node, and the first channel is one or more of the at least one channel occupied by the first node in the first COT.

[0022] Optionally, when the first node transmits the first information on multiple first channels, the content of the first information transmitted by the first node on different first channels can be the same or different, and the first information transmitted on each first channel includes the first identifier of the first node.

[0023] By the above method, the first node can transmit the first information on one or more first channels occupied by the first node in the first COT; and the second node can determine that the first channel is occupied by the first node according to the received first information. Since the first information transmitted by the first node is the channel occupied by the first node in the first COT, the reliability of the first node transmitting the first information can be ensured.

[0024] In a second aspect, an embodiment of the present application provides a communication method, which can be applied to a second node, a module (such as a circuit, a chip or a chip system, etc.) in the second node, or a logic node, a logic module or software capable of realizing all or part of the functions of the second node. The first node is also referred to as a terminal node, a managed node or a managed device, etc. Taking the application to the second node as an example, the method includes: the second node receives first information, the first information including a first identifier of a first node and a cyclic redundancy check (CRC) bit; the second node determines, according to the first information, that a first resource is a resource occupied by the first node, the first node being a node that establishes a connection with the second node; and the second node transmits first data with the first node in the first resource.

[0025] By the above method, after the second node receives the first information, the second node determines that the first node is the node connected by itself according to the identifier of the first node in the first information, and then the second node can determine that the first node has contended for the channel and the current channel occupation time of the first node. In the channel occupation time of the first node, the second node can transmit first data with the first node, so as to ensure accurate data transmission between the first node and the second node and improve the reliability of communication between the first node and the second node. In addition, the first node sends the first information to the second node, the first information carries the first identifier of the first node, and the first information is information containing CRC bits. The length of the first information can be set according to actual needs. When the length of the first information is relatively long, more identifiers can be indicated when the identifier of the node is indicated by the first information (for example, when the first information includes N bits, the corresponding identifier pool can include 2 N identifiers), which can reduce the probability of different nodes using the same ID, thereby further improving the reliability of communication between the first node and the second node

[0026] In a possible implementation method, the second node determines a first period according to the received first information and the period length of the transmission period of the first information, and the first resource is a resource in the first period.

[0027] By the above method, when the first node periodically transmits the first information, after the second node receives the first information, the second node can determine a first period according to the received first information and the period length of the transmission period of the first information, so that the second node can transmit data with the first node on the first resource of the first period, thereby ensuring reliable data transmission between the first node and the second node.

[0028] In a possible implementation method, the second node determines the resource of the first period according to the resource on which the first information is received.

[0029] By the above method, when the first node periodically transmits the first information, the second node determines the resource of the first period according to the resource on which the first information is received, so that the second node can transmit data with the first node on the resource of the first period, thereby ensuring reliable data transmission between the first node and the second node.

[0030] In a possible implementation method, the first information includes the period length of the transmission period of the first information.

[0031] In the method, when the first node periodically transmits the first information, the first information transmitted by the first node can include a period length of a transmission period of the first information, so that the second node can determine a first period according to the period length included in the first information after receiving the first information, and the second node can transmit data with the first node in the first period, thereby ensuring reliable transmission of data between the first node and the second node.

[0032] In a possible implementation, the transmission time domain resource of the first information is before the transmission time domain resource of the first data.

[0033] In the method, the first node transmits the first information before the transmission time domain resource of the first data, so that the second node can receive the first information before the transmission of the first data, and the second node can learn in time that the first node connected competes for the communication channel and transmits data with the first node, thereby not affecting the transmission of the first data between the second node and the first node.

[0034] In a possible implementation, the first identifier includes a Layer 2 identifier of the first node or a MAC ID of the first node.

[0035] In the method, because the Layer 2 identifiers and the MAC IDs of different nodes are different, when the first identifier includes the Layer 2 identifier of the first node or the MAC ID of the first node, it can be ensured that the first identifier is different from identifiers of other nodes.

[0036] In a possible implementation, the first identifier further includes type information of the first node.

[0037] In the method, when the first identifier of the first node includes the type information of the first node, when the second node establishes an initial connection with the first node, unnecessary connections can be reduced according to the type of the first node.

[0038] In a possible implementation, the second node determines the first resource on the first channel according to the first channel on which the first information is received.

[0039] In the method, the first node can transmit the first information on one or more first channels occupied by the first node in the first COT, and because the first information on which the first information is transmitted is the channel occupied by the first node in the first COT, the second node can transmit the first data with the first node on the first resource on the first channel, thereby ensuring the reliability of the transmission of the first information by the first node.

[0040] In a third aspect, the present application provides a communication apparatus, which has the functions of the first aspect. For example, the communication apparatus includes modules, units or means corresponding to the operations of the first aspect, which are specifically implemented by software or by hardware, or by a combination of software and hardware.

[0041] In a fourth aspect, the present application provides a communication apparatus, which has the functions of the second aspect. For example, the communication apparatus includes modules, units or means corresponding to the operations of the second aspect, which are specifically implemented by software or by hardware, or by a combination of software and hardware.

[0042] In a fifth aspect, the present application provides a communication apparatus, which includes an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory is used to store part or all of the necessary computer programs or instructions for implementing the functions of the first aspect. The one or more processors can execute the computer programs or instructions, which, when executed, cause the communication apparatus to implement the method in any possible design or implementation manner of the first aspect. The interface circuit is used to implement the communication function within the communication apparatus and / or the communication function of the communication apparatus with other apparatuses or components.

[0043] The communication apparatus can be the first node, a module (for example, a circuit, a chip or a chip system, etc.) in the first node, or a logical node, a logical module or software capable of implementing all or part of the functions of the first node.

[0044] In a sixth aspect, the present application provides a communication apparatus, which includes an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory is used to store part or all of the necessary computer programs or instructions for implementing the functions of the second aspect. The one or more processors can execute the computer programs or instructions, which, when executed, cause the communication apparatus to implement the method in any possible design or implementation manner of the second aspect. The interface circuit is used to implement the communication function within the communication apparatus and / or the communication function of the communication apparatus with other apparatuses or components.

[0045] The communication apparatus can be the second node, a module (for example, a circuit, a chip or a chip system, etc.) in the second node, or a logical node, a logical module or software capable of implementing all or part of the functions of the second node.

[0046] In a seventh aspect, the present application provides a computer readable storage medium, which stores a computer program or instructions, when the computer program or instructions are executed, the method in any possible design of the first aspect to the second aspect is implemented.

[0047] In an eighth aspect, the present application provides a computer program product, which comprises a computer program or instructions, when the computer program or instructions are executed, the method in any possible design of the first aspect to the second aspect is implemented.

[0048] In a ninth aspect, the present application provides a communication system, which comprises a first node for executing the method in any possible design of the first aspect, and a second node for executing the method in any possible design of the second aspect.

[0049] The above-mentioned aspects in the third aspect to the ninth aspect and the technical effects that can be achieved by the aspects are described above in the aspects in the first aspect and the aspects in the second aspect, and will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0050] Fig. 1 is a schematic diagram of a communication protocol architecture provided by an embodiment of the present application;

[0051] Fig. 2 is a schematic diagram of a subcarrier planning provided by an embodiment of the present application;

[0052] Fig. 3 is a schematic diagram of a structure of a superframe provided by an embodiment of the present application;

[0053] Fig. 4 is a schematic diagram of a network architecture of a communication system provided by an embodiment of the present application;

[0054] Fig. 5 is a schematic diagram of a flow of a communication method provided by an embodiment of the present application;

[0055] Fig. 6 is a schematic diagram of a structure of first information provided by an embodiment of the present application;

[0056] Fig. 7 is a schematic diagram of a structure of a communication device provided by an embodiment of the present application;

[0057] Fig. 8 is a schematic diagram of a structure of a communication device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0058] In order to make the purpose, technical scheme and advantages of the embodiments of the present application more clear, the embodiments of the present application will be further described in detail below with reference to the drawings.

[0059] The following introduces a communication system architecture to which the communication method provided by the present application is applicable. It should be noted that these introductions are for the convenience of those skilled in the art to understand and do not constitute a limitation on the scope of protection claimed by the present application.

[0060] At present, the sparklink alliance provides a communication protocol architecture of the sparklink communication technology, which can provide access technologies including a sparklink basic (SLB) access technology and a sparklink low energy (SLE) access technology. FIG. 1 is a schematic diagram of a communication protocol architecture of the sparklink communication technology involved in an embodiment of the present application. Referring to FIG. 1, the protocol architecture includes a basic application layer, a basic service layer, and a sparklink access layer (which can also be referred to as an access layer), and the basic application layer and the basic service layer can be collectively referred to as a sparklink upper layer. The following introduces each layer in the protocol architecture respectively.

[0061] The basic application layer includes various general frameworks; in order to realize communication between different devices under different platforms, the basic application layer formulates frameworks for various possible and generally meaningful application scenarios.

[0062] The basic service layer includes a control plane and a data plane; the control plane mainly provides services such as device discovery and management. The data plane includes channel control data, broadcast data, service management data, real-time data, and reliable data, and also includes a transmission control adaptation protocol, a transmission control protocol / internet protocol (TCP / IP), a transparent transmission protocol, and the like.

[0063] The sparklink access layer includes an SLB module and an SLE module, wherein the SLB module can also be referred to as an SLB access layer, and the SLE module can also be referred to as an SLE access layer. The SLB module communicates through the SLB access technology. The SLB access technology has large bandwidth communication capability and can carry large bandwidth services such as wireless screen projection services and video call services, and the communication process has high data throughput and fast data transmission speed. However, the SLB access technology has relatively high power consumption and a long access time.

[0064] In the SLB access technology, the communication device includes a grant node device (referred to as G node device or G node for short) and a terminal node device (referred to as T node device or T node for short). The G node represents a node that sends data scheduling information in the access layer, and the T node represents a node that receives data scheduling information and sends data according to the data scheduling information in the access layer. It is also specified that the G node can send broadcast, and the T node can scan information. In the process of establishing an SLB connection between the G node and the T node, the T node is allowed to scan and discover the G node, and send a connection request to the G node to connect the G node.

[0065] The SLE module communicates through the SLE access technology. The SLE has low-power communication capability. When the SLE module is in an idle state (i.e., not connected to other devices), the SLE module can broadcast device information and data on three fixed broadcast channels, can be quickly discovered and connected, and helps to save device power. The SLE access technology supports a smaller bandwidth and slower data transmission speed, and therefore, the SLE access technology is usually used to process services with small bandwidth requirements, such as audio playback services based on wireless earphones and control services of smart home devices by mobile phones.

[0066] It can be understood that the communication protocol architecture shown above is only one possible example, and other possible protocol layers can also be included in the communication protocol architecture, which is not limited by the embodiments of the present application.

[0067] Based on the communication protocol architecture shown in FIG. 1, the related terms involved in the star flash communication technology are explained below. When not specifically stated, these explanations are to support the meaning of the related terms and make the embodiments of the present application easier to understand, and should not be regarded as a strict limitation on the terms in the scope of protection claimed by the present application.

[0068] 1. Channel bandwidth of star flash communication technology

[0069] The working frequency band of the star flash communication technology (such as the SLB access technology) can be a low frequency band, such as 5150MHz-5350MHz or 5725MHz-5850MHz, and the minimum channel (or carrier) bandwidth is 20MHz, and the channel bandwidth of 40 / 60 / 80 / 100 / 160 / 320MHz specifications is supported upwards, which is composed of a plurality of 20MHz bandwidths in an aggregated manner. FIG. 2 is a schematic diagram of subcarrier planning of a 20MHz bandwidth. As shown in FIG. 2, the channel of the 20MHz working bandwidth is composed of 39 consecutive subcarriers, and the subcarrier interval is 480KHz. The 39 subcarriers are sequentially numbered as 0, 1, …, 38 in the order of corresponding frequencies from low to high, wherein the subcarrier 19 (i.e., the 20th subcarrier) is a direct current subcarrier and does not carry information. In a 20MHz bandwidth channel, part of the lowest frequency and the highest frequency are reserved as protection intervals, respectively as the left protection interval and the right protection interval. For example, the parameter format of the 20MHz bandwidth can be referred to Table 1.

[0070] Table 1

[0071] In the above Table 1, the DFT point number can be understood as the number of sampling points used in DFT processing or the size of the filter in DFT processing. The DFT point number can also be replaced by the inverse discrete fourier transform (IDFT) point number, or the IDFT size, or the DFT size. The sampling frequency is equal to the product of the DFT point number and the subcarrier interval. The symbol period is determined according to the subcarrier interval. The sampling interval, the short guard interval and the long short guard interval are determined according to the sampling frequency. The specific meanings of the various parameters shown in Table 1 can refer to the existing communication standards, and will not be described here.

[0072] 2. Time domain resource unit

[0073] The time domain resource unit involved in the embodiments of the present application can include a superframe, a radio frame and a symbol. The superframe is a time unit composed of a plurality of radio frames, the radio frame is a smaller time unit than the superframe, and the symbol is a smaller time unit than the radio frame.

[0074] For superframe and radio frame: The starlink communication technology adopts time division duplex (TDD) mode. Specifically, the starlink communication technology (such as SLB access technology) adopts a superframe to realize communication between a G node and a T node. The superframe can contain 48 radio frames, and each radio frame includes 10 symbols, which can be orthogonal frequency division multiplexing (OFDM) symbols or discrete fourier transformation-spread-OFDM (DFT-s-OFDM) symbols. The DFT-s-OFDM symbol can be understood as a special OFDM symbol. In addition, the starlink communication system also supports a half superframe containing 24 radio frames. In the parameters of the low frequency band shown in Table 1 or Table 2, the duration of each symbol (i.e., the symbol period) is about 2.0833 microseconds (μs), the duration of each radio frame is about 20.833 μs, and the duration of each superframe is about 1 millisecond (ms).

[0075] FIG. 3 is a schematic diagram of the structure of a possible superframe. As shown in FIG. 3, the superframe includes radio frame 0 to radio frame 47. For example, radio frame 0 includes 4 G symbols, 3 T symbols, 2 GAP symbols, and 1 SG symbol in the 10 OFDM symbols; radio frame 47 includes 4 G symbols, 3 T symbols, 2 GAP symbols, and 1 ST symbol in the 10 OFDM symbols. Among them, the G symbol represents a symbol in which the G node sends (G link) information to the T node, the T symbol represents a symbol in which the T node sends (T link) information to the G node, the SG / ST respectively represents a symbol resource that can be used for overhead symbols in the G / T symbol, the overhead symbol resource of each radio frame can be flexibly configured as 0, 1 or 2 symbols, and the GAP is the switching interval of the G symbol and the T symbol.

[0076] 3. Channel contention mechanism

[0077] Channel contention refers to the process in which multiple communication devices compete for a channel during network transmission. However, in the case of a large number of communication devices or high communication concurrency of communication devices, the degree of channel contention can be very intense, thereby affecting the communication quality and causing phenomena such as data delay and packet loss. Channel contention parameters are used to control the channel contention ability of each terminal device, such as the enhanced distributed channel access (EDCA) parameters in a wireless communication network based on the 802.11 protocol. Channel contention parameters with appropriate parameter values can optimize the channel contention ability of terminal devices, so that the degree of contention conflict meets the requirements.

[0078] When the communication device working in the unlicensed frequency band adopts the star flash communication technology (such as SLB access technology), the communication device adopting the star flash communication technology may face the problem of multi-domain coexistence (such as multiple G nodes working in the same channel or the same area), multi-system coexistence (such as the communication device adopting the star flash communication technology and the communication device adopting the WiFi technology sharing the same channel, or the communication device adopting the star flash communication technology and the communication device adopting the WiFi technology being located in the same area). Based on the regulatory requirements of the country in the related frequency band (such as 2.4GHz or 5GHz), the communication devices of different domains or different systems need to compete for the channel to realize communication. Therefore, a certain communication device adopting the star flash communication technology needs to compete for the channel with other communication devices working in the same channel (or the same area) to realize its own communication, or needs to compete for the channel with the communication device working in the unlicensed frequency band and adopting other system technology (such as WiFi technology) to realize its own communication.

[0079] The requirements of the channel competition mechanism include:

[0080] a. Before occupying the channel each time, the clear channel assessment (CCA) needs to be performed, such as the evaluation time is not less than 16 microseconds (us) or 25us according to the frequency band and the type of the device.

[0081] b. After occupying the channel for a period of time, the channel needs to be released first, and then re-occupied.

[0082] 4. Device state of the communication device

[0083] For the communication device participating in the channel competition, the device state includes the idle state, the channel competition state and the communication state. Among them:

[0084] Idle state: In the idle state, the superframe of the SLB system does not send any signal. For example, in the channel competition period, if the communication device determines that the channel is in the idle state, no signal indicating the occupation of the channel is sent on all time domain resource units in the channel competition period.

[0085] Channel competition state: When the SLB system needs to send a signal before competing for the channel, the channel competition state is entered. For example, in the channel competition period, before the communication device sends the signal (such as the preamble message) occupying the channel, the communication device needs to compete for the channel first, and then the communication device enters the channel competition state.

[0086] Communication state: when the SLB system competes for the channel, it enters the communication state, and data is sent based on the superframe of the SLB system. For example, in the channel competition period, after the communication device successfully competes for the channel, it performs normal communication, and the communication device can perform data transmission within the COT.

[0087] 5. Communication domain

[0088] In a star flash communication system (such as an SLB system), a communication domain is composed of one management node (G node) and one or more terminal nodes (T node). The G node can occupy a specific group of subcarriers within a period of time, complete the interaction of control messages and data through the communication link established with the T node, and thus complete a specific communication function. From the perspective of air interface resources, a communication domain includes a G node and at least one T node, as well as a specific group of frequency domain resources and a specific period of time domain resources. In a specific application scenario, a single G node manages a certain number of T nodes, and the G node and the T nodes are connected to jointly complete a specific communication function.

[0089] In this application, "at least one" means one or more, and "multiple" means two or more. The association relationship between the associated objects is described as "and / or", which means that there can be three relationships, for example, A and / or B, which can represent the following three cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. In the textual description of this application, the character " / ", generally represents that the associated objects before and after it are in an "or" relationship; in the formula of this application, the character " / ", represents that the associated objects before and after it are in a "division" relationship.

[0090] It can be understood that the various numbers involved in the embodiments of the present application are only for convenient differentiation, and do not limit the scope of the embodiments of the present application. The size of the serial number of the above processes does not mean the execution order, and the execution order of the processes should be determined by its function and inherent logic.

[0091] The terms "system" and "network" in the embodiments of the present application can be used interchangeably. "At least one" refers to one or more, and "multiple" refers to two or more. The "and / or" describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B can represent the cases of A alone, A and B together, and B alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or multiple items. For example, "at least one of A, B or C" includes A, B, C, AB, AC, BC or ABC, and "at least one of A, B and C" can also be understood to include A, B, C, AB, AC, BC or ABC. In addition, unless otherwise specified, the ordinal numbers "first", "second" and the like mentioned in the embodiments of the present application are used to distinguish a plurality of objects, and are not used to limit the order, time sequence, priority or importance of the plurality of objects.

[0092] To facilitate understanding of the communication scheme provided by the embodiments of the present application, first, the network architecture applicable to the embodiments of the present application is described in detail taking the network architecture shown in FIG. 4 as an example. As shown in FIG. 4, the network architecture can include a plurality of communication devices (such as a first communication device and a second communication device), and the first communication device and the second communication device are both configured with the communication protocol architecture shown in FIG. 1, and can communicate with each other based on the communication protocol architecture using the starlink communication technology.

[0093] The communication device (such as the first communication device and the second communication device) in the embodiments of the present application can be a device in various fields. For example, a large-screen device, an AI sound box, a HiFi sound box, a temperature sensor or a humidity sensor and the like in the field of smart home; or a mobile phone, a tablet computer, a wearable device, an AR / VR device, a notebook computer, an UMPC, a netbook or a PDA and the like in the field of smart terminals; or a mechanical arm, a camera, a joystick, a monitor, a logistics vehicle or a smart shelf and the like in the field of smart manufacturing; or a vehicle-mounted device or other devices in the field of smart cars and the like. The embodiments of the present application do not limit the specific type of the communication device.

[0094] Exemplarily, the first communication device is a G-node, and the second communication device is a T-node; or the second communication device is a G-node, and the first communication device is a T-node. In a possible implementation, the roles of the communication devices can be determined according to input and output conditions of the communication devices, which include whether the communication device supports inputting information through a mouse, a keyboard, a screen or the like, whether the communication device supports outputting information through a screen or a loudspeaker or the like, and the like. For example, for a device such as a mobile phone or a tablet computer that is convenient for a user to input information, the role of the device is usually a T-node, and the device is by default a T-node in the SLB connection process. For a device such as a large-screen device or a smart speaker that is not convenient for a user to input information, the role of the device is usually a G-node, and the device is by default a G-node in the SLB connection process.

[0095] It can be understood that the communication method provided by the embodiments of the present application is applicable to communication between a G-node and a T-node, and can also be applicable to communication between a G-node and a G-node, or communication between a T-node and a T-node, and the specific implementation is not limited.

[0096] The network architecture and the service scenario described in the embodiments of the present application are for more clearly explaining the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. It can be known by a person of ordinary skill in the art that, with the evolution of network architecture and the appearance of new service scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0097] Although the embodiments of the present application mainly take deployment of a star flash communication network as an example, and take an SLB communication network as an example for illustration, it can be easily understood by a person skilled in the art that various aspects involved in the embodiments of the present application can be extended to other networks using various standards or protocols, for example, a high performance radio local area network (HIPERLAN), a wireless wide area network (WWAN), a wireless personal area network (WPAN) or other now known or later developed networks. Therefore, regardless of the coverage range and wireless access protocol used, various aspects provided by the embodiments of the present application can be applicable to any suitable wireless network.

[0098] The technical solutions of the embodiments of the present application can also be applied to various communication systems or networks, for example: a WLAN communication system, a wireless fidelity (Wi-Fi) system, a long term evolution (LTE) system, an LTE frequency division duplex (FDD) system, an LTE TDD system, a universal mobile telecommunication system (UMTS) system, a worldwide interoperability for microwave access (WiMAX) communication system, a 5th generation (5G) system or a new radio (NR) system, a future communication system, an internet of things (IoT) network or a vehicle to x (V2X) network, and the like. The above communication systems to which the present application is applicable are merely illustrative, and the communication systems to which the present application is applicable are not limited thereto. In this case, the following will not be repeated.

[0099] The present application supports IEEE protocols, such as IEEE 802.11be / Wi-Fi 7 / EHT protocol, IEEE 802.11bn / UHR / Wi-Fi 8 protocol, IEEE Integrated mmWave / Integrated millimeter wave / IMMW protocol, IEEE 802.15 / UWB protocol, or IEEE 802.11bf / sensing / sensing protocol; the present application can also support starlink / spark link / nearlink standard protocol.

[0100] At present, when the nodes in the SLB system work in the unlicensed frequency band, the G nodes using starlink communication technology occupy the channel by competition, and after the G nodes compete for the channel, they can enter the communication state and transmit data in the communication state. However, for the T nodes managed by the G nodes, the T nodes cannot know that the G nodes have competed for the channel, so they cannot communicate with the G nodes.

[0101] Based on this, the present application provides a communication method to provide a scheme for the G nodes to notify the T nodes after competing for the channel, so that the T nodes can communicate with the G nodes after the G nodes compete for the channel.

[0102] FIG. 5 shows a flowchart of a communication method according to an embodiment of the present application. The method is applicable to the network architecture shown in FIG. 4. In the following description, the first node and the second node are taken as examples of the execution subject, where the first node and the second node can correspond to the first communication device and the second communication device in FIG. 4. In the embodiments of the present application, the device for implementing the functions of the first node and the second node can be the first node and the second node, or a module or unit applicable to the first node and the second node, or a device (such as a chip system) capable of supporting the first node and the second node to implement the functions. In the following description, the first node and the second node are taken as examples. When the device for implementing the functions of the first node and the second node is a module or unit applicable to the first node and the second node, or a device capable of supporting the first node and the second node to implement the functions, the receiving / sending can be understood as input / output, i.e., the device communicates with other modules, units or components of the first node and the second node.

[0103] As shown in FIG. 5, the method includes the following steps.

[0104] Step 500: The first node transmits first information in a first COT of the first node. Correspondingly, the second node receives the first information.

[0105] The first node can be a G node.

[0106] The second node is a node that establishes a connection with the first node; the second node can be a T node, and the first node and the second node belong to the same communication domain.

[0107] In the embodiments of the present application, the first COT is the time during which the first node occupies the communication channel. Optionally, the first COT can be the time during which the first node is in the communication state after switching from the channel contention state to the communication state; the first node can transmit the first information in the first COT after switching to the communication state. Alternatively, the first COT can include part or all of the time from when the first node contends for the communication channel to when the first node switches to the communication state, and the time during which the first node is in the communication state after switching from the channel contention state to the communication state; the first node can transmit the first information before switching to the communication state after contending for the channel, for example, the time during which the first node transmits the first information can be the start time of the first COT.

[0108] The first information transmitted by the first node in the first COT includes a first identifier of the first node; the first identifier is used to identify the identity of the first node.

[0109] Optionally, the first information further includes CRC bits.

[0110] The first information of the embodiment of the present application can be control information in a specific format. For example, as shown in FIG. 6, the first information includes CRC bits and a first identifier; optionally, when the first node periodically transmits the first information in the first COT, the first information can further include a period length, where the period length is the period length of the transmission period of the first information.

[0111] Optionally, the first information does not include service data. Based on this, the first information of the embodiment of the present application is a relatively short control information. In this way, after receiving the first information, the second node (for example, the T node) can quickly obtain the first identifier from the first information to determine whether the first information is the information transmitted by the first node connected by the second node; and since the first information is a relatively short control information, the overhead of the first node in transmitting the first information can be reduced.

[0112] The first identifier of the embodiment of the present application occupies a large number of bit positions. For example, the first identifier occupies more than 9 bits; for example, the first identifier can occupy 16 bits, 24 bits or 26 bits.

[0113] Based on this, when the first identifier occupies a large number of bit positions, the bit positions carrying the first identifier can correspond to more node identifiers (for example, when the first information includes N bits, the corresponding identifier pool can include 2 N identifiers), that is, can correspond to a larger identifier pool (ID pool), and the identifier pool includes identifiers of multiple nodes (for example, G nodes), which can reduce the probability of different nodes using the same ID.

[0114] The first node of the embodiment of the present application can determine the first identifier in multiple different ways, which will be described in detail below.

[0115] Determination method 1: the first identifier is determined according to the layer 2 identifier of the first node.

[0116] The layer 2 identifier can be a global unique identifier of a node (or a communication device) supporting the star flash technology, and the layer 2 identifiers of different nodes are different, based on which the identity of the node can be determined to distinguish it from other nodes.

[0117] When the first node determines the first identifier according to the layer 2 identifier of the first node, one possible implementation is that the first identifier includes the layer 2 identifier.

[0118] Optionally, the first identifier can further include other information, for example, the first identifier further includes type information of the first node.

[0119] The type information of the first node in the embodiments of the present application can include at least one of the following information: information indicating whether the first node is a constant power device, information indicating whether the first node is a device that is frequently moved, information indicating whether the first node is a mobile terminal (such as a mobile phone), and information indicating whether the first node is a smart display device (such as a smart television).

[0120] When the type information of the first node is included in the first identifier, when the second node establishes an initial connection with the first node, unnecessary connections can be reduced or avoided according to the type of the first node.

[0121] When the first node determines the first identifier according to the layer 2 identifier of the first node, another possible implementation is that the first node generates the first identifier based on the layer 2 identifier.

[0122] In another possible implementation, the length of the first identifier can be less than the length of the layer 2 identifier; based on this, the information overhead of the first node sending the first identifier can be reduced. Alternatively, the length of the first identifier can be equal to or greater than the length of the layer 2 identifier; based on this, the bits carrying the first identifier can correspond to more node identifiers, that is, can correspond to a larger identifier pool, thereby reducing the probability of different nodes using the same ID.

[0123] Optionally, the first node can perform hash processing on the layer 2 identifier, and use the hash value of the layer 2 identifier as the first identifier. In implementation, the layer 2 identifier includes multiple bits, and the first node can perform hash processing on part or all of the bits in the layer 2 identifier to obtain the first identifier; for example, the first node performs bitwise XOR operation on the high n bits and the low n bits of the layer 2 identifier to obtain the hash value of the layer 2 identifier as the first identifier, where n is a positive integer.

[0124] In addition, after the second node receives the first identifier generated based on the layer 2 identifier of the first node, the second node can perform double verification according to the layer 2 identifier of the first node to avoid misidentification.

[0125] In this another possible implementation, the first identifier can also include other information. For example, the first identifier also includes type information of the first node; when the type information of the first node is included in the first identifier, when the second node establishes an initial connection with the first node, unnecessary connections can be reduced according to the type of the first node. The information content included in the type information can be referred to in the foregoing description and will not be repeated here.

[0126] When the first node performs hash processing on the layer 2 identifier to obtain the first identifier, the first identifier information can include the hash value of the layer 2 identifier and the type information of the first node.

[0127] Based on the above determination manner 1, since the layer 2 identifiers of different nodes are different, the first identifier determined by the first node according to the layer 2 identifier of the first node is different from the identifiers of other nodes; after receiving the first information including the first identifier, the second node can accurately identify the first node based on the first identifier, thereby improving the communication reliability between nodes.

[0128] Determination manner 2: the first identifier is determined according to the media access control identifier (MAC ID) of the first node.

[0129] When the first node determines the first identifier according to the MAC ID of the first node, one possible implementation manner is that the first identifier includes the MAC ID.

[0130] Optionally, the first identifier can also include other information. For example, the first identifier also includes type information of the first node; when the first identifier includes the type information of the first node, when the second node establishes an initial connection with the first node, unnecessary connections can be reduced according to the type of the first node. The information content included in the type information can be referred to the description in the above, which is not repeated here.

[0131] When the first node determines the first identifier according to the MAC ID of the first node, another possible implementation manner is that the first node generates the first identifier based on the MAC ID.

[0132] In another possible implementation manner, the length of the first identifier can be less than the length of the MAC ID; based on this, the information overhead of the first node sending the first identifier can be reduced. Alternatively, the length of the first identifier can also be equal to or greater than the length of the MAC ID; based on this, the bit carrying the first identifier can correspond to more node identifiers, that is, it can correspond to a larger identifier pool, thereby the probability of different nodes using the same ID can be reduced.

[0133] Optionally, the first node can hash the MAC ID, and take the hash value of the MAC ID as the first identifier. In implementation, the MAC ID includes a plurality of bits, and the first node can hash part or all of the bits in the MAC ID to obtain the first identifier; for example, the first node can perform bitwise XOR operation on the high m bits and the low m bits of the MAC ID to obtain the hash value of the Layer 2 identifier as the first identifier, where m is a positive integer. For example, when the MAC ID includes 48 bits, the first node can perform bitwise XOR operation on the high 24 bits and the low 24 bits of the MAC ID to obtain the hash value of the 24-bit MAC ID; for another example, when the MAC ID includes 48 bits, the first node can perform bitwise XOR operation on the high 16 bits and the low 16 bits of the MAC ID to obtain the hash value of the 16-bit MAC ID.

[0134] In addition, after the second node receives the first identifier generated based on the MAC ID of the first node, the second node can perform double check according to the MAC ID of the first node to avoid misrecognition.

[0135] In the another possible implementation, the first identifier can further include other information. For example, the first identifier further includes type information of the first node; when the first identifier includes the type information of the first node, the second node can reduce unnecessary connection according to the type of the first node when establishing the initial connection with the first node. The information content included in the type information can refer to the description in the foregoing description, which is not repeated here.

[0136] When the first node hashes the MAC ID to obtain the first identifier, the first identifier information can include the hash value of the MAC ID and the type information of the first node.

[0137] According to the above determination mode 2, since the MAC IDs of different nodes are different, the first identifier determined by the first node according to the MAC ID of the first node is different from the identifiers of other nodes; after the second node receives the first information including the first identifier, the second node can accurately identify the first node based on the first identifier, thereby improving the communication reliability between nodes.

[0138] Determination mode 3: the first identifier is randomly generated.

[0139] Optionally, the first identifier can be a random number generated by the first node.

[0140] After the first node randomly generates the first identifier, the first node can identify the identity of the first node with the first identifier for a certain time length. It can be understood that, within the certain time length, the first node communicates with other nodes (for example, the second node) based on the first identifier. For example, the first node randomly generates the first identifier when establishing an initial connection with the second node. After the first node establishes a connection with the second node, the first node communicates with the second node based on the first identifier. After the first node randomly generates the first identifier again, the first node notifies the second node.

[0141] Based on the above determination method 3, since the first identifier is randomly generated, the first node can randomly generate an identifier different from other nodes, so that the first node generates an identifier different from other nodes. Based on the first identifier, the second node can accurately identify the first node, ensuring the reliability of inter-node communication. In addition, the first node randomly generates the first identifier, which can also avoid exposing the layer 2 identifier or MAC ID of the first node, thereby improving the communication security and better protecting the privacy data of the first node.

[0142] After the first node determines the first identifier based on any of the above determination methods, the first node can generate first information according to the first identifier. For example, the first information includes at least one of the first identifier, CRC bits, and the period length of the transmission period of the first information. The first node can transmit the first information in the first COT. In the implementation, the first node can transmit the first information in a plurality of different ways, which will be described below.

[0143] First information transmission method 1: the first node periodically transmits the first information in the first COT.

[0144] In this transmission method 1, the first node periodically transmits the first information in the first COT. Optionally, the first node can carry the first information in the periodically transmitted downlink control information in the first COT.

[0145] Since the first node of the embodiment of the application can periodically transmit downlink control information (DCI) in the first COT, based on this, the first node can carry the first information in the DCI, thereby realizing the periodic transmission of the first information.

[0146] For example, the downlink control information can be overhead resource indication information.

[0147] In the case where the first node periodically transmits the overhead resource indication information, the first node can carry the first information in each overhead resource indication information; or the first node can carry the first information in part of the overhead resource indication information, which is periodically distributed.

[0148] The overhead resource indication information can include configuration period indication information of system overhead, symbol number information indicating the system overhead, and radio frame communication resource indication information.

[0149] For example, the configuration period indication information can occupy 1 bit. When the configuration period indication information takes the value 0, it indicates that the configuration period is one superframe (48 radio frames); when the configuration period indication information takes the value 1, it indicates that the configuration period is half a superframe (24 radio frames).

[0150] The symbol number information indicating the system overhead can occupy 4 bits, which is used to indicate the symbol number of the system overhead under different configuration periods.

[0151] The radio frame communication resource indication information can occupy 40 bits. Each bit of the radio frame communication resource indication information indicates two first granularity subcarrier groups of frequency resources, and 5 bits of indication information are required for each symbol; the lowest bit corresponds to the two first granularity subcarrier groups at the lowest frequency position, and the highest bit corresponds to the two first granularity subcarrier groups at the highest frequency position. When the bit is 1, it indicates that the corresponding frequency resource is unavailable. The time domain granularity of the radio frame communication resource indication information is 1 symbol, and 8 bits are indicated. When the system adopts a normal cyclic prefix length, the lowest 5 bits of the 40 bits correspond to the first symbol of the radio frame, and each group of the subsequent 5 bits in order correspond to the subsequent symbols in the radio frame. When the system adopts an extended cyclic prefix length, the lowest 5 bits of the 40 bits correspond to the first symbol of the radio frame, and each group of the subsequent 5 bits in order correspond to the subsequent symbols in the radio frame, and the highest 5 bits are reserved.

[0152] In addition, the overhead resource indication information can also include 24 bits for carrying other information.

[0153] Optionally, the first information is carried in the bit position of the radio frame communication resource indication information in the overhead resource indication information of the embodiment of the application.

[0154] It should be noted that, when the system supports an extremely low latency service, the radio frame communication resource indication information in the overhead resource indication information carries useful information; for example, when the extremely low latency service is a noise reduction service, the radio frame communication resource indication information in the overhead resource indication information carries a noise reduction resource pool. In the case where the first node does not process the extremely low latency service, the bit position of the radio frame communication resource indication information in the overhead resource indication information can be used to carry other information, for example, the first information is carried in the bit position of the radio frame communication resource indication information in the overhead resource indication information in the embodiment of the application.

[0155] In a case that the first information is carried in the bit position of the radio frame communication resource indication information in the overhead resource indication information, the first node can send a broadcast message, and the broadcast message includes the first indication information. The first indication information is used to indicate that the first information is carried in the bit position of the radio frame communication resource indication information in the overhead resource indication information. For example, one reserved bit in the broadcast message can be used to carry the first indication information. For example, when the reserved bit in the broadcast message is 1, it indicates that the broadcast message includes the first indication information, which indicates that the first information is carried in the bit position of the radio frame communication resource indication information in the overhead resource indication information. When the reserved bit in the broadcast message is 0, it indicates that the bit position of the radio frame communication resource indication information in the overhead resource indication information carries the radio frame communication resource indication information.

[0156] In the first information, the period length of the transmission period of the first information can also be included. The period length of the transmission period can be the time interval between adjacent two first information transmissions.

[0157] When the period length of the transmission period of the first information is included in the first information, the first node can flexibly configure the period length of the transmission period of the first information through the first information, which can increase the flexibility of the system. For example, the first node can configure a longer period length through the first information, which can reduce the number of first information transmissions and thus reduce the transmission overhead of the first information. Or the first node can configure a shorter period length through the first information, which can improve the reliability of the system.

[0158] For example, when the first information is carried in the overhead resource indication information, the period length of the transmission period of the first information can be the time interval between adjacent two overhead resource indication information transmissions.

[0159] In the implementation, the period length of the transmission period of the first information can be included in each of the first information periodically transmitted by the first node, or the period length of the transmission period of the first information can be included in one or more of the first information periodically transmitted by the first node.

[0160] In this transmission mode 1, optionally, the first node transmits the first information on the first channel in the first COT. The first channel is one or more of the at least one channel occupied by the first node in the first COT.

[0161] In the embodiments of the present application, when the first node competes for multiple channels, the first node can send the first information on one or more first channels in the multiple channels within the first COT. For example, the first node can send the first information on one first channel in the multiple channels within the first COT; or the first node can send the first information on each channel in the multiple channels within the first COT.

[0162] Optionally, when the first node sends the first information on multiple first channels, the first information sent by the first node on different first channels can be the same or different, and the first information sent on each first channel includes the first identifier of the first node.

[0163] The first information sending mode 2: the first node sends the first information before sending the first data.

[0164] The first data is data transmitted between the first node and the second node.

[0165] In this sending mode, the transmission time domain resource of the first information is before the transmission time domain resource of the first data. Based on this, the first node sends the first information before the transmission time domain resource of the first data, so that the second node can receive the first information before the transmission of the first data, and the second node can learn the first node that competes for the communication channel in time and perform data transmission with the first node, thereby not affecting the transmission of the first data between the second node and the first node.

[0166] Optionally, the first node sends the first information through a preamble message; for example, the preamble message can be sent on the front time domain resource of the first COT, for example, the first node can send the preamble message at the start time within the first COT.

[0167] In this sending mode 2, optionally, the first node sends the first information on the first channel within the first COT; wherein the first channel is one or more channels in the at least one channel occupied by the first node in the first COT.

[0168] In the embodiments of the present application, when the first node competes for multiple channels, the first node can send the first information on one or more first channels in the multiple channels within the first COT. For example, the first node can send the first information on one first channel in the multiple channels within the first COT; or the first node can send the first information on each channel in the multiple channels within the first COT.

[0169] Optionally, when the first node sends the first information on multiple first channels, the first information sent by the first node on different first channels can be the same or different, and the first information sent on each first channel includes the first identifier of the first node.

[0170] Step 501: The second node determines, according to the first information, that the first resource is a resource occupied by the first node.

[0171] Optionally, the first resource is a resource determined by the second node to be able to transmit the first data with the first node.

[0172] After receiving the first information, the second node can determine, according to the first identifier of the first node included in the first information, whether the first resource is a resource occupied by the first node. For example, the second node determines that the first identifier included in the first information is the same as the identifier of the node connected to the second node, and then the second node can determine that the first resource is a resource occupied by the first node.

[0173] Since the first information includes the first identifier of the first node, after receiving the first information, the second node can determine, according to the first identifier included in the first information, that the first node sending the first information is the node connected to the second node, and then the second node can determine that the first node has contended for the communication channel, and the second node can transmit the first data with the first node in the first resource.

[0174] The first data transmitted between the second node and the first node can be uplink data or downlink data.

[0175] The specific manner in which the second node determines the first resource will be described in detail below. In the following description, the specific manner in which the second node determines the first resource is described separately for different cases of the first node sending the first information.

[0176] Case 1: The first node sends the first information by the first information sending manner 1.

[0177] When the first node periodically sends the first information by the first information sending manner 1 described above, after the second node receives the first information, the second node can determine the first resource according to the following manner:

[0178] Optionally, the second node determines a first period according to the received first information and the period length of the sending period of the first information, and the first resource is a resource in a first period.

[0179] Since in this case, the first node periodically sends the first information, the second node can determine a first period corresponding to each received first information.

[0180] The starting moment of the first period can be the moment when the second node receives the first information, or the starting moment of the first period can be the moment corresponding to a time length before the second node receives the first information. The first period can be a period of time starting from the starting moment of the first period and lasting for the period length of the transmission period of the first information.

[0181] The first resource of the embodiment of the application can be a resource in the first period corresponding to the first information. For example, the first resource can be part or all of the resources in the first period corresponding to the first information.

[0182] As a possible implementation, the second node determines the resource of a first period according to the resource of the received first information.

[0183] In implementation, the second node determines the time-frequency resource of a corresponding first period according to the time-frequency resource of the received first information.

[0184] It should be understood that the resource of the received first information of the second node can be understood as the resource of the transmitted first information of the first node.

[0185] For example, the second node receives the first information on P symbols, and the second node can determine the superframe or radio frame to which the P symbols belong as the resource of a period.

[0186] Optionally, the second node determines the first resource on the first channel according to the first channel of the received first information; wherein the first channel is one or more of the at least one channel occupied by the first node in the first COT. Based on this, the second node can determine the frequency domain resource corresponding to the first resource according to the first channel of the received first information.

[0187] Case 2: The first node transmits the first information by the first information transmission mode 2.

[0188] When the first node transmits the first information by the first information transmission mode 2 introduced above, the transmission time domain resource of the first information is before the transmission time domain resource of the first data. After the second node receives the first information, the second node can determine the first resource according to the following mode:

[0189] The second node determines the time domain resource after receiving the first information in the first COT as the time domain resource corresponding to the first resource.

[0190] Optionally, the second node determines the first resource on the first channel according to the first channel of the received first information; wherein the first channel is one or more of the at least one channel occupied by the first node in the first COT. Based on this, the second node can determine the frequency domain resource corresponding to the first resource according to the first channel of the received first information.

[0191] Step 502: The first node and the second node transmit first data in the first resource.

[0192] Alternatively, the first node and the second node transmit the first data in the first COT. Wherein, the first resource is part or all of the resources in the first COT of the first node.

[0193] Optionally, the first data can be downlink data sent by the first node to the second node, or the second data can be uplink data sent by the second node to the first node.

[0194] In implementation, in the first resource, the first node can send downlink data to the second node, and / or the second node can send uplink data to the first node.

[0195] In addition, in the first resource, the first node and the second node can also perform at least one of the following operations:

[0196] The second node synchronizes with the first node according to the synchronization information;

[0197] The second node receives downlink indication information sent by the first node;

[0198] The second node sends acknowledgement (ACK) information or negative acknowledgment (NACK) information to the first node.

[0199] FIG. 7 shows a possible exemplary block diagram of a communication device involved in the embodiments of the present application. As shown in FIG. 7, the communication device 700 can include modules or units for implementing the above-mentioned method embodiments. In one possible design, the communication device 700 includes a processing unit 701 and a communication unit 702. Optionally, the communication device 700 can also include a storage unit 703 for storing device program code and / or data.

[0200] The communication device 700 can be a first node side device in the above-mentioned embodiments, for example, a first node, a module (such as a circuit, a chip or a chip system, etc.) in the first node, or a logic node, a logic module or software capable of realizing all or part of the functions of the first node.

[0201] For example, in one embodiment, the communication unit 702 is configured to transmit first information in a first channel occupancy time (COT) of the first node, the first information comprising a first identifier of the first node and cyclic redundancy check (CRC) bits; and transmit first data with a second node in the first COT, the second node being a node that establishes a connection with the first node. The processing unit 701 is configured to generate the first information, and control the communication unit 702 to transmit the first information and transmit the first data with the second node.

[0202] In one possible implementation method, the communication unit 702 is configured to periodically transmit the first information in the first COT of the first node.

[0203] In one possible implementation method, the first information comprises a period length of a period of transmission of the first information.

[0204] In one possible implementation method, in the first COT, a time domain resource of transmission of the first information is before a time domain resource of transmission of the first data.

[0205] In one possible implementation method, the first identifier is determined according to a layer 2 identifier of the first node; or the first identifier is determined according to a MAC ID of the first node; or the first identifier is randomly generated.

[0206] In one possible implementation method, the first identifier comprises a layer 2 identifier of the first node or a MAC ID of the first node.

[0207] In one possible implementation method, the first identifier further comprises type information of the first node.

[0208] In one possible implementation method, the communication unit 702 is configured to transmit the first information on a first channel in the first COT of the first node, the first channel being one or more of at least one channel occupied by the first node in the first COT.

[0209] The communication apparatus 700 can also be a second node side apparatus in the above embodiments, for example, a second node, a module (such as a circuit, a chip or a chip system, etc.) in a second node, or a logic node, a logic module or software capable of realizing all or part of the functions of a second node.

[0210] For example, in one embodiment, the communication unit 702 is configured to receive first information, the first information comprising a first identifier of a first node and CRC bits; the processing unit 701 is configured to determine, according to the first information, a first resource as a resource occupied by the first node, the first node being a node establishing a connection with the second node; and the communication unit 702 is further configured to transmit first data with the first node in the first resource.

[0211] In one possible implementation method, the processing unit 701 is configured to determine, according to the received first information and a period length of a transmission period of the first information, a first period, the first resource being a resource in the first period.

[0212] In one possible implementation method, the processing unit 701 is configured to determine, according to a resource in which the first information is received, a resource of the first period.

[0213] In one possible implementation method, the first information comprises the period length of the transmission period of the first information.

[0214] In one possible implementation method, a time domain resource of the transmission of the first information is before a time domain resource of the transmission of the first data.

[0215] In one possible implementation method, the first identifier comprises a Layer 2 identifier of the first node or a MAC ID of the first node.

[0216] In one possible implementation method, the first identifier further comprises type information of the first node.

[0217] In one possible implementation method, the processing unit 701 is configured to determine, according to a first channel in which the first information is received, a first resource on the first channel.

[0218] It can be understood that the division of units in the above apparatus is only a logical functional division, one function can correspond to one functional unit, or two or more functions can be integrated into one functional unit. In actual implementation, all or part of the units can be integrated into one physical entity, or can be distributed in different physical entities. In addition, the above functional units can be realized in the form of hardware, or in the form of software, or in the form of hardware combined with software. Whether a certain function is executed in hardware or software depends on the specific application and design constraints of the technical scheme. Professional technicians can use different methods to implement the described functions for specific applications, but such implementation should not be considered beyond the scope of the present application.

[0219] In one example, the functional units in any of the above apparatuses can be one or more integrated circuits configured to implement the above methods, for example: one or more application specific integrated circuits (ASICs), or, one or more central processing units (CPUs), one or more microcontroller Units (MCUs), one or more digital signal processors (DSPs), or, one or more field programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0220] In one example, the storage unit 703 can include random access memory, flash memory, read only memory, programmable read only memory, electrically programmable read only memory and / or registers, etc.

[0221] FIG. 8 shows a possible exemplary block diagram of a communication apparatus involved in the embodiments of the present application. The communication apparatus 800 shown in FIG. 8 includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It can be understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication apparatus 800 can further include a memory 830 for storing instructions executed by the processor 810 or storing input data required by the processor 810 to run instructions or storing data generated after the processor 810 runs instructions.

[0222] When the communication apparatus 800 is used to implement the above method embodiments, the processor 810 is configured to implement the functions of the above processing unit 701, and the interface circuit 820 is configured to implement the functions of the above communication unit 702.

[0223] It can be understood that the processor in the embodiments of the present application can be a CPU, and can also be other general-purpose processors, DSPs, ASICs, FPGAs or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0224] The method steps in the embodiments of the present application can be implemented by means of hardware, or by means of a processor executing software instructions. The software instructions can be composed of corresponding software modules, which can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a mobile hard disk, a compact disc read-only memory (CD-ROM), or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor, so that the processor can read information from, and write information to, the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in the first node or the second node. Of course, the processor and the storage medium can also exist as discrete components in the first node or the second node.

[0225] The embodiments of the present application further provide a computer readable storage medium, which has stored thereon a computer program or instructions for implementing the method executed by the first node or the second node in the above method embodiments.

[0226] For example, the computer program or instructions, when executed by a computer, enable the computer to implement the method executed by the first node or the second node in the above method embodiments.

[0227] The embodiments of the present application further provide a computer program product containing a computer program or instructions, which, when executed by a computer, enable the computer to implement the method executed by the first node or the second node in the above method embodiments.

[0228] The embodiments of the present application further provide a communication system, which comprises the first node in the above embodiments and the second node in the above embodiments.

[0229] The embodiments of the present application further provide a chip device, which comprises a processor, and is configured to invoke computer programs or computer instructions stored in the memory, so that the processor executes the method provided in any of the embodiments shown in FIG. 5.

[0230] In a possible implementation manner, the input of the chip device corresponds to the receiving operation in any of the embodiments shown in FIG. 5, and the output of the chip device corresponds to the sending operation in any of the embodiments shown in FIG. 5.

[0231] Optionally, the processor is coupled to the memory through an interface.

[0232] Optionally, the chip device further comprises a memory, and the memory stores computer programs or instructions.

[0233] The processor mentioned in any of the above can be a general central processing unit, a microprocessor, an ASIC, or one or more integrated circuits for controlling the execution of the method provided in any of the embodiments shown in Fig. 5. The memory mentioned in any of the above can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM), and the like.

[0234] In the embodiments described above, all or part of the embodiments can be implemented by software, hardware, firmware, or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program refers to a set of instructions that instruct an electronic computer or other device with message processing capability to perform each step, and is usually written in a certain programming language and runs on a certain target architecture. When the computer program or instructions are loaded and executed on the computer, all or part of the processes or functions described in the embodiments of the present application are performed. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another, for example, the computer program or instructions can be transferred from one website, computer, server, or data center to another via wired or wireless means. The computer-readable storage medium can be any available medium accessible by a computer or a data storage device such as a server, data center, etc. that integrates one or more available media. The available media can be a magnetic medium, such as a floppy disk, a hard disk, a magnetic tape; an optical medium, such as a digital video disc; and a semiconductor medium, such as a solid-state disk. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile storage media.

[0235] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, optical storage, etc.) containing computer-usable program code.

[0236] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.

[0237] These computer program instructions can also be stored in a computer- readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instructions which implement the function specified in the flowchart block or blocks.

[0238] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.

[0239] Obviously, numerous modifications and variations of the present application are possible in light of the above teachings. It is therefore to be understood that within the scope of the claims and their equivalents, the application can be practiced otherwise than as specifically described.

Claims

1. A communication method characterized by comprising: The method applied to a first node comprises: sending first information in a first channel occupancy time (COT) of the first node, the first information comprising a first identifier of the first node and cyclic redundancy check (CRC) bits; transmitting first data with a second node in the first COT, the second node being a node connected with the first node.

2. The method of claim 1, wherein, The sending of the first information in the first COT of the first node comprises: periodically sending the first information in the first COT of the first node.

3. The method of claim 2, wherein, The first information comprises a period length of a sending period of the first information.

4. The method of claim 1, wherein, The transmission time domain resource of the first information is before the transmission time domain resource of the first data in the first COT.

5. The method according to any one of claims 1 to 4, characterized in that, The first identifier is determined according to a layer 2 identifier of the first node; or The first identifier is determined according to medium access control (MAC) identifier information of the first node; or The first identifier is randomly generated.

6. The method of claim 5, wherein, The first identifier further comprises type information of the first node.

7. The method according to any one of claims 1 to 6, characterized in that, The sending of the first information in the first COT of the first node comprises: sending the first information on a first channel in the first COT of the first node, the first channel being one or more channels of at least one channel occupied by the first node in the first COT.

8. A communication method characterized by comprising: The method applied to a second node comprises: receiving first information, the first information comprising a first identifier of a first node and cyclic redundancy check (CRC) bits; determining, according to the first information, a first resource as a resource occupied by the first node, the first node being a node connected with the second node; transmitting first data with the first node in the first resource.

9. The method of claim 8, wherein, The method further comprises: determining, according to the received first information and a period length of a sending period of the first information, a first period, the first resource being a resource in the first period.

10. The method of claim 9, wherein, The method further comprises: determining, according to a resource in which the first information is received, a resource of the first period.

11. The method of claim 9 or 10, wherein, The first information comprises a period length of a sending period of the first information.

12. The method of claim 8, wherein, The transmission time domain resource of the first information is before the transmission time domain resource of the first data.

13. The method according to any one of claims 8 to 12, characterized in that, The first identifier comprises a layer 2 identifier of the first node or medium access control (MAC) identifier information of the first node.

14. The method of claim 13, wherein, The first identifier further comprises type information of the first node.

15. The method according to any one of claims 8 to 14, characterized in that, The method further comprises: determining, according to a first channel in which the first information is received, a first resource on the first channel.

16. A communications device, characterized by A module for executing the method of any one of claims 1-7 or the method of any one of claims 8-15.

17. A communications device, characterized by A processor and an interface circuit, the processor being configured to communicate with other devices through the interface circuit to implement the method of any one of claims 1-7 or the method of any one of claims 8-15.

18. A computer program product, characterised in that, The computer program product comprises computer programs or instructions, which, when executed, implement the method of any one of claims 1-7, or implement the method of any one of claims 8-15.

19. A computer-readable storage medium, characterized in that, The storage medium stores computer programs or instructions, which, when executed, implement the method of any one of claims 1-7, or implement the method of any one of claims 8-15.

20. A communication system, characterized by Comprise: a first node for implementing the method of any one of claims 1-7, and a second node for implementing the method of any one of claims 8-15.

Citation Information

Patent Citations

  • Transmission medium sharing in a wireless communications network

    CN112237046A

  • Method and device for indicating signal transmission

    CN112398613A

  • Method for establishing SLB connection, electronic equipment and communication system

    CN116017377A

  • Method and device for operating SL DRX timer when receiving information related to shared cot from SL-u

    WO2024058542A1