Communication method and device

Abstract

The invention provides a communication method and device, relates to the technical field of wireless communication, and is used for improving the reliability of communication between nodes. The first node sends first information in a first COT of the first node, wherein the first information comprises a first identifier and a CRC bit of the first node; the first node transmits first data with a second node in the first COT, and the second node is a node establishing connection with the first node. After a first node competes for a channel, first information including a first identifier of the first node is sent to a second node in a first COT; after receiving the first information, the second node determines that the first node is a node connected with the second node according to the identifier of the first node in the first information; the second node can transmit the first data with the first node, thereby ensuring accurate data transmission between the first node and the second node.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a communication method and apparatus. Background Technology

[0002] The development of wireless local area networks (WLANs) has made wireless communication increasingly popular. The standards for WLANs developed by the Institute of Electrical and Electronics Engineers (IEEE) (i.e., the 802.11 protocol suite) have also evolved accordingly.

[0003] With the continuous development of IoT technology, short-range communication technologies such as WLAN may no longer adequately meet the needs of many application scenarios. Therefore, SparkLink communication technology for short-range communication has emerged. SparkLink communication technology supports SparkLink Basic (SLB) access technology. When the SLB operates in an unlicensed frequency band, the management (grant, G) node using SparkLink communication needs to compete for the channel. After the G node successfully acquires the channel, it can enter the communication state and transmit data. However, for the T node managed by the G node, the T node cannot know that the G node has acquired the channel, and therefore cannot communicate with the G node. Summary of the Invention

[0004] This application provides a communication method and apparatus to improve the reliability of communication between nodes.

[0005] In a first aspect, embodiments of this application provide a communication method. This method can be applied to a first node, a module (e.g., a circuit, chip, or chip system) within the first node, or a logical node, logical module, or software capable of implementing all or part of the functions of the first node. The first node is also referred to as a management node or management device. Taking its application to a first node as an example, the method includes: the first node transmitting first information during a first channel occupation time (COT) of the first node, the first information including a first identifier of the first node and cyclic redundancy check (CRC) bits; the first node transmitting first data with a second node during the first COT, the second node being a node connected to the first node.

[0006] Using the above method, after the first node successfully competes for the channel, within its first COT (Cross-Operating Time), the first node can send first information to the second node. This first information may include the first node's first identifier. Upon receiving the first information, the second node, based on the first node's identifier, determines that the first node is a node it is connected to. The second node can then confirm that the first node has successfully competed for the channel and that it is currently the first node's channel occupancy time. During this time, the second node can transmit first data with the first node, ensuring accurate data transmission between them and improving the reliability of communication. Furthermore, the first node sends the first information to the second node, carrying its first identifier. This first information includes CRC bits, and its length can be set according to actual needs. A longer first information allows for the indication of more identifiers when using it (e.g., when the first information includes N bits, the corresponding identifier pool can include 2...). N Using a unique identifier can reduce the probability of different nodes using the same ID, thereby further improving the reliability of communication between the first and second nodes.

[0007] In one possible implementation, the first node periodically sends first information within the first COT of the first node.

[0008] Using the above method, the first node can periodically send first information within the first COT. Based on each sent first information, the second node can determine a first cycle corresponding to the first information, so that the second node can transmit data with the first node within the first cycle. This method of periodically sending first information can improve the reliability of communication between the first node and the second node.

[0009] In one possible implementation, the first information includes the period length of the transmission period of the first information.

[0010] Using the above method, when the first node periodically sends the first information, the first information sent by the first node can include the period length of the first information transmission period. Therefore, after receiving the first information, the second node can determine a first period based on the period length included in the first information. This allows the second node to transmit data with the first node within the first period, ensuring reliable data transmission between the two nodes. Furthermore, the first node can flexibly configure the period length of the first information transmission period, increasing system flexibility. For example, the first node can configure a longer period length, reducing the number of first information transmissions and thus lowering transmission overhead; or the first node can configure a shorter period length, improving system reliability.

[0011] In one possible implementation, within the first COT, the time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

[0012] Using the above method, the first node sends the first information before the time domain resources for the transmission of the first data. In this way, the second node can receive the first information before the first data is transmitted. The second node can promptly know that the connected first node has competed for the communication channel and transmit data with the first node, thus not affecting the transmission of the first data between the second node and the first node.

[0013] In one possible implementation, the first identifier is determined based on the Layer 2 identifier of the first node; or, the first identifier is determined based on the Media Access Control (MAC) ID of the first node; or, the first identifier is randomly generated.

[0014] Using the methods described above, the first identifier can be flexibly generated in several different ways. Determining the first identifier based on a Layer 2 identifier or MAC ID allows for different first identifiers to be assigned to different nodes, thus preventing different nodes from using the same identifier. Random generation, since the first identifier is generated randomly, it can generate an identifier different from other nodes, thereby preventing different nodes from using the same identifier. Furthermore, the method of randomly generating the first identifier by the first node can also avoid exposing the first node's Layer 2 identifier or MAC ID, thereby improving communication security and better protecting the first node's privacy data.

[0015] In one possible implementation, the first identifier includes either the layer 2 identifier of the first node or the MAC ID of the first node.

[0016] By using the above method, since the Layer 2 identifier and MAC ID of different nodes are different, when the first identifier includes the Layer 2 identifier or the MAC ID of the first node, it can be guaranteed that the first identifier is different from the identifiers of other nodes.

[0017] In one possible implementation, the first identifier may also include the type information of the first node.

[0018] Using the above method, when the first identifier of the first node includes the type information of the first node, unnecessary connections can be reduced or avoided when the second node establishes an initial connection with the first node, based on the type of the first node.

[0019] In one possible implementation, the first node transmits the first information on a first channel within the first COT of the first node, wherein the first channel is one or more channels among at least one channel occupied by the first node in the first COT.

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

[0021] Using the above method, the first node can transmit first information on one or more first channels occupied by the first node within the first COT; the second node can determine that the first node has occupied the first channel based on the received first information. Since the first information transmitted is on the channel occupied by the first node within the first COT, the reliability of the first node's transmission of the first information can be guaranteed.

[0022] Secondly, embodiments of this application provide a communication method that can be applied to a second node, a module (e.g., a circuit, chip, or chip system) within the second node, or a logical node, logical module, or software capable of implementing 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. Taking its application to a second node as an example, the method includes: the second node receiving first information, the first information including a first identifier of the first node and a cyclic redundancy check (CRC) bit; the second node determining, based on the first information, a first resource as a resource occupied by the first node, the first node being a node that has established a connection with the second node; and the second node transmitting first data with the first node within the first resource.

[0023] Using the above method, after receiving the first information, the second node determines that the first node is a node it is connected to based on the identifier of the first node in the first information. The second node can then determine that the first node has won the channel contention and that the current channel occupancy time is that of the first node. During the channel occupancy time of the first node, the second node can transmit the first data with the first node, thereby ensuring accurate data transmission between the first and second nodes and improving the reliability of communication between them. Additionally, the first node sends the first information to the second node, which carries the first node's first identifier. The first information includes CRC bits, and its length can be set according to actual needs. When the length of the first information is longer, more identifiers can be indicated when indicating node identifiers (for example, when the first information includes N bits, the corresponding identifier pool can include 2). N Using a unique identifier can reduce the probability of different nodes using the same ID, thereby further improving the reliability of communication between the first and second nodes.

[0024] In one possible implementation, the second node determines a first period based on the received first information and the period length of the sending period of the first information, and the first resource is the resource in the first period.

[0025] Using the above method, when the first node periodically sends the first information, after receiving the first information, the second node can determine a first period based on the received first information and the period length of the first information's sending period. Thus, the second node can transmit data with the first node on the first resource of the first period, ensuring reliable data transmission between the first node and the second node thereafter.

[0026] In one possible implementation, the second node determines the resources for the first period based on the resources received from the first information.

[0027] Using the above method, when the first node periodically sends the first information, the second node determines a resource for a first period based on the resource for receiving the first information. Thus, the second node can transmit data with the first node on a resource for a first period, ensuring reliable data transmission between the first node and the second node thereafter.

[0028] In one possible implementation, the first information includes the period length of the transmission period of the first information.

[0029] Using the above method, when the first node periodically sends the first information, the first information sent by the first node may include the period length of the first information sending period. Thus, after receiving the first information, the second node can determine a first period based on the period length included in the first information. In this way, the second node can transmit data with the first node within the first period, ensuring reliable data transmission between the first node and the second node thereafter.

[0030] In one possible implementation, the time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

[0031] Using the above method, the first node sends the first information before the time domain resources for the transmission of the first data. In this way, the second node can receive the first information before the first data is transmitted. The second node can promptly know that the connected first node has competed for the communication channel and transmit data with the first node, thus not affecting the transmission of the first data between the second node and the first node.

[0032] In one possible implementation, the first identifier includes either the layer 2 identifier of the first node or the MAC ID of the first node.

[0033] By using the above method, since the Layer 2 identifier and MAC ID of different nodes are different, when the first identifier includes the Layer 2 identifier or the MAC ID of the first node, it can be guaranteed that the first identifier is different from the identifiers of other nodes.

[0034] In one possible implementation, the first identifier may also include the type information of the first node.

[0035] Using the above method, when the first identifier of the first node includes the type information of the first node, unnecessary connections can be reduced when the second node establishes an initial connection with the first node, based on the type of the first node.

[0036] In one possible implementation, the second node determines the first resource on the first channel based on the first channel through which the first information is received.

[0037] Using the above method, the first node can send first information on one or more first channels occupied by the first node within the first COT. Since the first information sent is the channel occupied by the first node within the first COT, the second node can transmit first data with the first node on the first resource of the first channel, which can ensure the reliability of the first node sending the first information.

[0038] Thirdly, this application provides a communication device that has the functions of the first aspect above. For example, the communication device includes modules, units or means corresponding to the operations involved in the first aspect above. The modules, units or means can be implemented by software, or by hardware, or by a combination of software and hardware.

[0039] Fourthly, this application provides a communication device that has the functions of the second aspect above. For example, the communication device includes modules, units or means corresponding to the operations involved in the second aspect above. The modules, units or means can be implemented by software, hardware or a combination of software and hardware.

[0040] Fifthly, this application provides a communication device including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory stores part or all of the necessary computer program or instructions for implementing the functions described in the first aspect. The one or more processors can execute the computer program or instructions, causing the communication device to implement the methods in any possible design or implementation of the first aspect. The interface circuit is used to implement the communication functions within the communication device and / or the communication functions between the communication device and other devices or components.

[0041] The aforementioned communication device may be a first node, a module in the first node (e.g., a circuit, a chip, or a chip system), or a logic node, logic module, or software that can implement all or part of the functions of the first node.

[0042] Sixthly, this application provides a communication device including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory stores part or all of the necessary computer program or instructions for implementing the functions described in the second aspect above. The one or more processors are executable to carry out the computer program or instructions, causing the communication device to implement the methods in any possible design or implementation of the second aspect above. The interface circuit is used to implement the communication functions within the communication device and / or the communication functions between the communication device and other devices or components.

[0043] The aforementioned communication device may be a second node, a second module (e.g., a circuit, a chip, or a chip system), or a logic node, logic module, or software capable of implementing all or part of the second function.

[0044] In a seventh aspect, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed, implement the method in any of the possible designs of the first to second aspects described above.

[0045] Eighthly, this application provides a computer program product comprising a computer program or instructions that, when executed, implement the method in any of the possible designs of the first to second aspects described above.

[0046] Ninthly, this application provides a communication system including a first node for performing any possible implementation of the first aspect described above, and a second node for performing any possible implementation of the second aspect described above.

[0047] For the various aspects from the third to the ninth aspects mentioned above, and the technical effects that each aspect may achieve, please refer to the above description of the technical effects that various possible solutions can achieve for each aspect of the first aspect and each aspect of the second aspect. They will not be repeated here. Attached Figure Description

[0048] Figure 1 A schematic diagram of a communication protocol architecture provided in an embodiment of this application;

[0049] Figure 2 A schematic diagram of subcarrier planning provided in an embodiment of this application;

[0050] Figure 3 This is a schematic diagram of a superframe structure provided in an embodiment of this application;

[0051] Figure 4 This application provides a schematic diagram of a network architecture for a communication system.

[0052] Figure 5 A flowchart illustrating a communication method provided in an embodiment of this application;

[0053] Figure 6 A schematic diagram of the structure of a first piece of information provided in an embodiment of this application;

[0054] Figure 7 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0055] Figure 8 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0056] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the embodiments of this application will be further described in detail below with reference to the accompanying drawings.

[0057] The following describes the communication system architecture to which the communication method provided in this application is applicable. It should be noted that this description is for the convenience of those skilled in the art and is not intended to limit the scope of protection claimed in this application.

[0058] Currently, the SparkLink Alliance provides the communication protocol architecture for SparkLink communication technology. This protocol architecture can provide access technologies including SparkLink Basic (SLB) access technology and SparkLink Low Energy (SLE) access technology. Figure 1 This is a schematic diagram of the communication protocol architecture of the Starflash communication technology involved in the embodiments of this application. See also... Figure 1 As shown, the protocol architecture includes a basic application layer, a basic service layer, and a StarShine access layer (also known as the access layer). The basic application layer and the basic service layer can be collectively referred to as the StarShine upper layer. The following sections will introduce each layer in the protocol architecture.

[0059] Basic application layer: includes various general frameworks; in order to enable communication between different devices on different platforms, the basic application layer has defined frameworks for various possible and universally applicable application scenarios.

[0060] The basic service layer includes the control plane and the data plane. The control plane primarily 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, as well as transmission control adaptation protocols, transmission control protocol / internet protocol (TCP / IP), and transparent transmission protocols.

[0061] The StarFlash access layer includes an SLB module and an SLE module. The SLB module can also be referred to as the SLB access layer, and the SLE module as the SLE access layer. The SLB module communicates via SLB access technology. SLB access technology has high bandwidth communication capabilities and can support high-bandwidth services such as wireless screen projection and video calls. It offers high data throughput and fast data transmission speeds. However, SLB access technology has relatively high power consumption and a longer access process.

[0062] In SLB access technology, communication equipment includes grant node devices (G nodes) and terminal node devices (T nodes). A G node represents the node that sends data scheduling information at the access layer, while a T node represents the node that receives data scheduling information and sends data according to that information. It is also specified that G nodes can broadcast, and T nodes can scan for information. During the establishment of an SLB connection between G nodes and T nodes, T nodes are allowed to scan for and discover G nodes and send connection requests to connect to them.

[0063] The SLE module communicates via SLE access technology. SLE features low-power communication capabilities; when the SLE module is idle (i.e., not connected to other devices), it can broadcast device information and data on three fixed broadcast channels, enabling rapid discovery and connection, thus saving device power. However, SLE access technology supports relatively small bandwidth and has a slower data transmission speed. Therefore, it is typically used for services with low bandwidth requirements, such as audio playback via wireless headphones or mobile phone control of smart home devices.

[0064] It is understood that the communication protocol architecture shown above is only one possible example, and other possible protocol layers may also be included in the communication protocol architecture. This application embodiment does not limit this.

[0065] based on Figure 1 The communication protocol architecture is illustrated below. The relevant terminology used in StarScan communication technology is explained below. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terminology and to facilitate understanding of the embodiments of this application, and should not be construed as strict limitations on the terminology within the scope of protection claimed in this application.

[0066] 1. Channel bandwidth of Starflash communication technology

[0067] The operating frequency band of StarFlash communication technology (such as SLB access technology) can be a low frequency band, such as 5150MHz-5350MHz or 5725MHz-5850MHz, with a minimum channel (or carrier) bandwidth of 20MHz, and supports channel bandwidths of 40 / 60 / 80 / 100 / 160 / 320MHz, which are composed of multiple consecutive 20MHz bandwidths aggregated together. Figure 2 A schematic diagram of subcarrier planning for a 20MHz bandwidth is shown below. Figure 2As shown, a 20MHz operating bandwidth channel consists of 39 consecutive subcarriers with a subcarrier spacing of 480kHz. The 39 subcarriers are numbered 0, 1, ... 38 in ascending order of their corresponding frequencies. Subcarrier 19 (the 20th subcarrier) is a DC subcarrier and does not carry information. In a 20MHz bandwidth channel, resources are reserved at the lowest and highest frequencies as guard intervals, namely the left guard interval and the right guard interval, respectively. For example, the parameter format for a 20MHz bandwidth channel can be found in Table 1.

[0068] Table 1

[0069] parameter 20MHz fs (sampling frequency) 30.72MHz NDFT (DFT points) 64 ΔF (subcarrier spacing) 480kHz TDFT (symbol period) 1 / 0.480 = 2.08 μs Ts (sampling interval) 1 / 0.03072 = 32.55 ns TGI = 5Ts (Short Protection Interval) 5 / 0.03072 = 162.76 ns TGI = 14Ts (Long Protection Interval) 14 / 0.03072 = 455.73 ns

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

[0071] 2. Time-domain resource unit

[0072] The time-domain resource units involved in the embodiments of this application may include superframes, radio frames, and symbols. Among them, a superframe is a time unit composed of multiple radio frames, a radio frame is a smaller time unit than a superframe, and a symbol is a smaller time unit than a radio frame.

[0073] Regarding superframes and radio frames: StarSpeed ​​communication technology employs Time Division Duplex (TDD). Specifically, StarSpeed ​​communication technology (such as SLB access technology) uses superframes to achieve communication between G nodes and T nodes. A superframe can contain 48 radio frames, each radio frame including 10 symbols. These symbols can be orthogonal frequency division multiplexing (OFDM) symbols or discrete fourier transformation-spread-OFDM (DFT-s-OFDM) symbols, where DFT-s-OFDM symbols can be understood as a special type of OFDM symbol. Furthermore, the StarSpeed ​​communication system also supports half-superframes containing 24 radio frames. In the parameters for the low-frequency band shown in Table 1 or Table 2, the duration of each symbol (i.e., symbol period) is approximately 2.0833 microseconds (μs), the duration of each radio frame is approximately 20.833 μs, and the duration of each superframe is approximately 1 millisecond (ms).

[0074] Figure 3 This is a schematic diagram of a possible superframe structure. (Example) Figure 3 As shown, this superframe includes radio frames 0 to 47. For example, radio frame 0 includes 10 OFDM symbols, of which 4 are G symbols, 3 are T symbols, 2 are GAP symbols, and 1 is an SG symbol; radio frame 47 includes 10 OFDM symbols, of which 4 are G symbols, 3 are T symbols, 2 are GAP symbols, and 1 is an ST symbol. Here, G symbols represent symbols used by G nodes to send (G link) information to T nodes, T symbols represent symbols used by T nodes to send (T link) information to G nodes, SG / ST represent the symbol resources available for overhead symbols in G / T symbols respectively, and the overhead symbol resources of each radio frame can be flexibly configured to 0, 1, or 2 symbols. GAP is the handover interval between G and T symbols.

[0075] 3. Channel contention mechanism

[0076] Channel contention refers to the competition among multiple communication devices for a single communication channel during network transmission. However, when the number of communication devices is large or the concurrency is high, channel contention can become extremely intense, impacting communication quality and causing data delays, packet loss, and other issues. Channel contention parameters are used to control the channel contention capabilities of each terminal device, such as the Enhanced Distributed Channel Access (EDCA) parameters in 802.11-based wireless communication networks. Appropriate channel contention parameters can optimize the channel contention capabilities of terminal devices, ensuring that the level of contention meets requirements.

[0077] When communication devices operating in unlicensed frequency bands use Starlink communication technology (such as SLB access technology), they may face challenges such as multi-domain coexistence (e.g., multiple G nodes operating on the same channel or in the same area) and multi-system coexistence (e.g., communication devices using Starlink and WiFi technologies sharing the same channel, or being located in the same area). Based on national regulations for relevant frequency bands (e.g., 2.4GHz or 5GHz), communication devices from different domains or systems need to compete for channels to communicate. Therefore, a communication device using Starlink technology needs to compete for a channel with other communication devices operating on the same channel (or in the same area) to achieve its own communication, or it needs to compete for a channel with communication devices operating in unlicensed frequency bands using other system technologies (such as WiFi) to achieve its own communication.

[0078] The requirements for the channel contention mechanism include:

[0079] a. Before each channel is occupied, a clear channel assessment (CCA) must be performed. For example, depending on the frequency band and equipment type, the assessment time should be no less than 16 microseconds (µs) or 25µs.

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

[0081] 4. Equipment status of communication equipment

[0082] For communication devices participating in channel contention, the device states include idle state, channel contention state, and communication state. Among these:

[0083] Idle State: In the idle state, the SLB system's superframes do not transmit any signals. For example, during a contention channel period, if the communication device determines that the channel is idle, it will not transmit any signals indicating channel occupancy on any time-domain resource unit during the contention channel period.

[0084] Contention Channel State: When the SLB system needs to compete for the channel before it can send a signal, it enters the contention channel state. For example, during a contention channel period, before a communication device can send a signal that occupies the channel (such as a preamble message), it needs to compete for the channel, and thus enters the contention channel state.

[0085] Communication Status: When the SLB system successfully acquires a channel, it enters the communication status and transmits data based on superframes. For example, during a channel contention period, after successfully acquiring the channel, the communication device engages in normal communication and can transmit data within the COT (Content Over-The-Air).

[0086] 5. Communication domain

[0087] In a Starlink communication system (such as an SLB system), a communication domain consists of a management node (G node) and one or more terminal nodes (T nodes). A G node can occupy a specific set of subcarriers for a period of time, exchanging control messages and data through communication links established with T nodes, thereby completing specific communication functions. From the perspective of air interface resources, a communication domain includes a G node, at least one T node, a specific set of frequency domain resources, and a specific time domain resource. In specific application scenarios, a single G node manages a certain number of T nodes, and the G node connects with these T nodes to jointly complete specific communication functions.

[0088] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates an "or" relationship between the preceding and following related objects; in the formulas of this application, the character " / " indicates a "division" relationship between the preceding and following related objects.

[0089] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

[0090] The terms "system" and "network" in this application embodiment are used interchangeably. "At least one" refers to one or more, and "multiple" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, "at least one of A, B, or C" includes A, B, C, AB, AC, BC, or ABC; "at least one of A, B, and C" can also be understood as including A, B, C, AB, AC, BC, or ABC. Furthermore, unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in this application embodiment are used to distinguish multiple objects and are not used to limit the order, sequence, priority, or importance of multiple objects.

[0091] To facilitate understanding of the communication scheme provided in the embodiments of this application, firstly, let's take... Figure 4 The network architecture shown in the diagram is used as an example to illustrate the network architecture applicable to the embodiments of this application. For example... Figure 4 As shown, the network architecture may include multiple communication devices (such as a first communication device and a second communication device), both of which are configured with Figure 1 The intended communication protocol architecture is shown, and it enables communication between the two parties using StarScan communication technology based on this communication protocol architecture.

[0092] The communication devices (such as the first communication device and the second communication device) in this application embodiment can be devices from various fields. For example, in the field of smart homes, there are large-screen devices, artificial intelligence (AI) speakers, high fidelity (HiFi) speakers, temperature sensors, or humidity sensors; or in the field of smart terminals, there are mobile phones, tablets, wearable devices, augmented reality (AR) / virtual reality (VR) devices, laptops, ultra-mobile personal computers (UMPCs), netbooks, or personal digital assistants (PDAs); or in the field of smart manufacturing, there are robotic arms, cameras, joysticks, monitors, logistics vehicles, or smart shelves; or in the field of smart cars, there are in-vehicle devices or other devices. This application embodiment does not limit the specific type of communication device.

[0093] For example, 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 one possible implementation, the role of the communication device can be determined based on its input and output conditions, including whether the communication device supports inputting information via a mouse, keyboard, or screen, and whether it supports outputting information via a screen or speaker. For example, for devices such as mobile phones and tablets that facilitate user input, their role is typically a T node, and they default to acting as a T node during SLB connection. For devices such as large-screen devices and smart speakers that are not convenient for user input, their role is typically a G node, and they default to acting as a G node during SLB connection.

[0094] It is understood that the communication method provided in this application embodiment is applicable to communication between G nodes and T nodes, and can also be applied to communication between G nodes or between T nodes, without any specific limitation.

[0095] The network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0096] Although the embodiments of this application are primarily illustrated using the deployment of a Starlight communication network, particularly an SLB communication network, those skilled in the art will readily understand that the various aspects involved in the embodiments of this application can be extended to other networks employing various standards or protocols, such as high-performance radio local area networks (HIPERLANs), wireless wide area networks (WWANs), wireless personal area networks (WPANs), or other networks now known or developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in the embodiments of this application can be applied to any suitable wireless network.

[0097] The technical solutions of this application embodiment can also be applied to various communication systems or networks, such as: WLAN communication systems, Wireless Fidelity (Wi-Fi) systems, Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE TDD systems, Universal Mobile Telecommunication System (UMTS) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th Generation (5G) systems or New Radio (NR) systems, Future Communications systems, Internet of Things (IoT) networks, or Vehicle-to-Everything (V2X) networks, etc. The communication systems applicable to this application described above are merely illustrative examples; the application is not limited to these examples. These examples are uniformly described here and will not be repeated below.

[0098] This application supports IEEE protocols, such as IEEE 802.11be / Wi-Fi 7 / EHT, IEEE 802.11bn / UHR / Wi-Fi 8, IEEE Integrated mmWave / IMMW, IEEE 802.15 / UWB, or IEEE 802.11bf / sensing; this application may also support Spark Link / NearLink standard protocols.

[0099] Currently, when nodes in an SLB system operate in unlicensed frequency bands, G nodes using StarSpark communication technology compete for channel access. Once a G node wins the channel, it can enter a communication state and transmit data. However, for T nodes managed by G nodes, the T nodes cannot know that the G node has won the channel, and therefore cannot communicate with the G node.

[0100] Based on this, this application provides a communication method for notifying a T node after a G node has successfully competed for a channel, enabling the T node to communicate with the G node after the G node has successfully competed for a channel.

[0101] Figure 5 This illustration shows a flowchart of a communication method provided in an embodiment of this application. The method is applicable to... Figure 4The network architecture is shown below. The following description uses the first node and the second node as the execution entities, where the first node and the second node can correspond to... Figure 4 The first and second communication devices are described in this application. In this embodiment, the apparatus for implementing the functions of the first and second nodes can be the first and second nodes themselves, or it can be a module or unit applicable to the first and second nodes, or an apparatus (e.g., a chip system) capable of supporting the first and second nodes in implementing this function. The following description uses the first and second nodes as examples. When the apparatus for implementing the functions of the first and second nodes is a module or unit applicable to the first and second nodes, or an apparatus capable of supporting the first and second nodes in implementing this function, receiving / transmitting can be understood as input / output; that is, the apparatus communicates with other modules, units, or components of the first and second nodes.

[0102] like Figure 5 As shown, the method includes:

[0103] Step 500: The first node sends the first message within its first COT. Correspondingly, the second node receives the first message.

[0104] For example, the first node can be a G node.

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

[0106] In this embodiment, the first COT is the time the first node occupies the communication channel. Optionally, the first COT can be the time the first node is in the communication state after switching from the contention channel state to the communication state; for example, the first node can send the first information within 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 wins the communication channel to when it switches to the communication state, and the time the first node is in the communication state after switching from the contention channel state to the communication state; for example, the first node can send the first information after winning the channel and before switching to the communication state, for example, the time when the first node sends the first information can be the start time of the first COT.

[0107] The first information sent by the first node within the first COT includes the first identifier of the first node; wherein, the first identifier is used to identify the identity of the first node.

[0108] Optionally, the first information may also include CRC bits.

[0109] The first information in this application embodiment can be control information in a specific format. For example, Figure 6 As shown, the first information includes CRC bits and a first identifier; optionally, when the first node periodically sends the first information within the first COT, the first information may also include a period length, wherein the period length is the period length of the sending period of the first information.

[0110] Optionally, the first information does not include business data. Based on this, the first information in this embodiment is a short control message. In this way, after receiving the first information, the second node (e.g., node T) can quickly obtain the first identifier from the first information to determine whether the first information was sent by the first node to which the second node is connected; and, since the first information is a short control message, the overhead of the first node sending the first information can be reduced.

[0111] The first identifier in this application embodiment occupies a relatively large number of bits. For example, the first identifier occupies more than 9 bits; for instance, the first identifier can occupy 16 bits, 24 bits, or 26 bits.

[0112] Therefore, when the number of bits occupied by the first identifier is large, the bits 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 Each identifier can correspond to a larger identifier pool (ID pool), which includes identifiers from multiple nodes (e.g., node G), thus reducing the probability of different nodes using the same ID.

[0113] The first node in this application embodiment can be determined in a variety of different ways. The determination of the first identifier will be described in detail below.

[0114] Method 1: The first identifier is determined based on the layer 2 identifier of the first node.

[0115] The Layer 2 identifier can be a globally unique identifier for nodes (or communication devices) that support Starflash technology. Different nodes have different Layer 2 identifiers. The identity of a node can be determined based on the Layer 2 identifier to distinguish it from other nodes.

[0116] When the first node determines the first identifier based on the first node's layer 2 identifier, one possible implementation is that the first identifier includes the layer 2 identifier.

[0117] Optionally, the first identifier may also include other information; for example, the first identifier may also include the type information of the first node.

[0118] The type information of the first node in this application embodiment may include, but is not limited to, at least one of the following: information indicating whether the first node is a constant electrical device, information indicating whether the first node is a frequently moved device, information indicating whether the first node is a mobile terminal (e.g., a mobile phone), and information indicating whether the first node is a smart display device (e.g., a smart TV).

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

[0120] When the first node determines the first identifier based on the layer 2 identifier of the first node, another possible implementation is that the first node processes the layer 2 identifier to generate the first identifier.

[0121] 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, they can correspond to a larger identifier pool, thereby reducing the probability of different nodes using the same ID.

[0122] Optionally, the first node can perform a hash operation 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 a hash operation on some or all of the bits in the layer 2 identifier to obtain the first identifier; for example, the first node performs a bitwise XOR operation on the high n bits and 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.

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

[0124] In this alternative implementation, the first identifier may also include other information. For example, the first identifier may also include type information of the first node; when the first identifier includes the type information of the first node, unnecessary connections can be reduced based on the type of the first node when the second node establishes an initial connection with the first node. The content of the type information can be found in the description above and will not be repeated here.

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

[0126] Based on the above determination method 1, since the layer 2 identifiers of different nodes are different, the first identifier determined by the first node based on its own layer 2 identifier 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 reliability of communication between nodes.

[0127] Method 2: The first identifier is determined based on the media access control identifier (MAC ID) information of the first node.

[0128] When the first node determines the first identifier based on the first node's MAC ID, one possible implementation is that the first identifier includes the MAC ID.

[0129] Optionally, the first identifier may also include other information. For example, the first identifier may also include the type information of the first node; when the first identifier includes the type information of the first node, unnecessary connections can be reduced when the second node establishes an initial connection with the first node based on the type of the first node. The content of the type information can be found in the description above and will not be repeated here.

[0130] When the first node determines the first identifier based on the first node's MAC ID, another possible implementation is that the first node processes the MAC ID to generate the first identifier.

[0131] In another possible implementation, the length of the first identifier can be less than the length of the MAC ID; this reduces the information overhead of the first node sending the first identifier. Alternatively, the length of the first identifier can be equal to or greater than the length of the MAC ID; this allows the bits carrying the first identifier to correspond to more node identifiers, i.e., a larger identifier pool, thereby reducing the probability of different nodes using the same ID.

[0132] Optionally, the first node can hash the MAC ID and use the hash value of the MAC ID as the first identifier. In implementation, the MAC ID includes multiple bits, and the first node can hash some or all of the bits in the MAC ID to obtain the first identifier; for example, the first node performs a bitwise XOR operation on the high m bits and 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, a bitwise XOR operation can be performed on the high 24 bits and low 24 bits of the MAC ID to obtain a 24-bit hash value of the MAC ID; as another example, when the MAC ID includes 48 bits, a bitwise XOR operation can be performed on the high 16 bits and low 16 bits of the MAC ID to obtain a 16-bit hash value of the MAC ID.

[0133] In addition, after the second node receives the first identifier generated based on the MAC ID of the first node, it can perform double verification based on the MAC ID of the first node to avoid misidentification.

[0134] In this alternative implementation, the first identifier may also include other information. For example, the first identifier may also include type information of the first node; when the first identifier includes the type information of the first node, unnecessary connections can be reduced based on the type of the first node when the second node establishes an initial connection with the first node. The content of the type information can be found in the description above and will not be repeated here.

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

[0136] Based on the above determination method 2, since different nodes have different MAC IDs, the first identifier determined by the first node based on its own MAC ID 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 reliability of communication between nodes.

[0137] Method 3: The first identifier is randomly generated.

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

[0139] After the first node randomly generates a first identifier, it may use this first identifier to identify itself for a certain period of time. This can be understood as the first node communicating with other nodes (such as the second node) based on the first identifier within this certain period of time. For example, the first node randomly generates the first identifier when establishing an initial connection with the second node, and communicates with the second node based on the first identifier after establishing the connection; after the first node regenerates the first identifier randomly, it notifies the second node.

[0140] Based on the aforementioned determination method 3, since the first identifier is randomly generated, the first node can randomly generate an identifier different from other nodes, thus enabling the second node to accurately identify the first node and ensure reliable communication between nodes. Furthermore, the method of randomly generating the first identifier by the first node can also avoid exposing the first node's Layer 2 identifier or MAC ID, thereby improving communication security and better protecting the first node's privacy data.

[0141] In this embodiment of the application, after determining the first identifier based on any of the above determination methods, the first node can generate first information based on the first identifier. For example, the first information includes at least one of the following: the first identifier, CRC bits, and the period length of the first information transmission period. The first node can transmit the first information within a first COT (Content on Transmission). In practice, the first node can transmit the first information in various different ways, which will be described below.

[0142] First information transmission method 1: The first node periodically sends the first information within the first COT.

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

[0144] Since the first node in this embodiment can periodically send downlink control information (DCI) within the first COT, the first node can carry the first information in the DCI, thereby realizing the periodic transmission of the first information.

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

[0146] In this embodiment of the application, when the first node periodically sends overhead resource indication information, the first node may carry the first information in each overhead resource indication information; or the first node may carry the first information in a portion of the overhead resource indication information, wherein the portion of the overhead resource indication information is periodically distributed.

[0147] The overhead resource indication information may include configuration period indication information for system overhead, number of symbols indicating system overhead, and radio frame communication resource indication information.

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

[0149] The symbol count information indicating system overhead can occupy 4 bits, used to indicate the symbol count information of system overhead under different configuration periods.

[0150] The radio frame communication resource indication information can occupy 40 bits. Each bit of the radio frame communication resource indication information indicates two consecutive first-granularity subcarrier groups of frequency resources, and each symbol requires 5 bits of indication information; the least significant bit corresponds to the two first-granularity subcarrier groups at the lowest frequency position, and the most significant bit corresponds to the two first-granularity subcarrier groups at the highest frequency position. When a 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, indicating a total of 8 bits. When the system uses a regular cyclic prefix length, the least significant 5 bits of the 40 bits correspond to the first symbol of the radio frame, and the subsequent 5 bits are grouped sequentially to correspond to the subsequent symbols within the radio frame. When the system uses an extended cyclic prefix length, the least significant 5 bits of the 40 bits correspond to the first symbol of the radio frame, and the subsequent 5 bits are grouped sequentially to correspond to the subsequent symbols within the radio frame, with the most significant 5 bits reserved.

[0151] In addition, the overhead resource indication information may also include 24 bits to carry other information.

[0152] Optionally, in the overhead resource indication information of this application embodiment, the bit position used to carry the wireless frame communication resource indication information carries the first information.

[0153] It should be noted that when the system supports ultra-low latency services, the radio frame communication resource indication information in the overhead resource indication information carries useful information; for example, when the ultra-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. However, when the first node does not process ultra-low latency services, the bit positions of the radio frame communication resource indication information in the overhead resource indication information can be used to carry other information, for example, in this embodiment, the bit positions of the radio frame communication resource indication information in the overhead resource indication information carry first information.

[0154] When the first information is carried at 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. The broadcast message includes the first indication information, which indicates that the first information is carried at the bit position of the radio frame communication resource indication information in the overhead resource indication information. For example, a reserved bit in the broadcast message can be used to carry the first indication information; for instance, when the reserved bit in the broadcast message is 1, it indicates that the broadcast message includes the first indication information, indicating that the first information is carried at 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 radio frame communication resource indication information is carried at the bit position of the radio frame communication resource indication information in the overhead resource indication information.

[0155] In this embodiment of the application, the first information may further include the period length of the transmission period of the first information. The period length of the transmission period can be the time interval between two adjacent transmissions of the first information.

[0156] When the first information includes the period length of the first information's transmission period, the first node can flexibly configure the period length of the first information's transmission period, which can increase system flexibility. For example, the first node can configure a longer period length for 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 for the first information, which can improve system reliability.

[0157] 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 the transmission of two adjacent overhead resource indication information.

[0158] In practice, each first message periodically sent by the first node may include the period length of the sending period of the first message; or, each first message periodically sent by the first node may be one or more of the first messages periodically sent by the first node.

[0159] In this transmission method 1, optionally, the first node transmits the first information on the first channel within the first COT; wherein the first channel is one or more channels among at least one channel occupied by the first node in the first COT.

[0160] In this embodiment of the application, when the first node has won multiple channels, the first node can transmit the first information on one or more first channels among the multiple channels within the first COT. For example, the first node can transmit the first information on one of the multiple channels within the first COT; or the first node can transmit the first information on each of the multiple channels within the first COT.

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

[0162] Method 2 for sending first information: The first node sends the first information before transmitting the first data.

[0163] The first data refers to the data transmitted between the first node and the second node.

[0164] In this transmission method, the time domain resources for transmitting the first information precede those for transmitting the first data. Based on this, the first node transmits the first information before the time domain resources for transmitting the first data. This allows the second node to receive the first information before the first data is transmitted, enabling the second node to promptly know that the connected first node has secured the communication channel and to transmit data with the first node, thus not affecting the transmission of the first data between the second and first nodes.

[0165] Optionally, the first node sends the first information via a preamble message; for example, the preamble message can be sent on the front time domain resources of the first COT, such as the first node can send the preamble message at the start time within the first COT.

[0166] In this transmission method 2, optionally, the first node transmits the first information on the first channel within the first COT; wherein the first channel is one or more channels among at least one channel occupied by the first node in the first COT.

[0167] In this embodiment of the application, when the first node has won multiple channels, the first node can transmit the first information on one or more first channels among the multiple channels within the first COT. For example, the first node can transmit the first information on one of the multiple channels within the first COT; or the first node can transmit the first information on each of the multiple channels within the first COT.

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

[0169] Step 501: The second node determines the first resource as the resource occupied by the first node based on the first information.

[0170] Optionally, the first resource is the resource determined by the second node that can transmit the first data with the first node.

[0171] After receiving the first information, the second node can determine whether the first resource is occupied by the first node based on the first identifier of the first node included in the first information. For example, if 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, then the second node can determine that the first resource is occupied by the first node.

[0172] Since the first information in this application embodiment includes the first identifier of the first node, after receiving the first information, the second node determines, based on the first identifier included in the first information, that the first node that sent the first information is the node connected to the second node, that the first node has competed for the communication channel, and the second node can transmit the first data with the first node within the first resource.

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

[0174] The following details the specific methods by which the second node determines the first resource. In this description, we will explain the specific methods by which the second node determines the first resource for different scenarios where the first node sends the first information.

[0175] Case 1: The first node sends the first information using the first information sending method 1.

[0176] When the first node periodically sends the first information using the first information sending method 1 described above, the second node, after receiving the first information, can determine the first resource according to the following method:

[0177] Optionally, the second node determines a first period based on the received first information and the period length of the first information's transmission period, and the first resource is the resource within a first period.

[0178] In this scenario, the first node periodically sends first information. For each received first message, the second node can determine the first period corresponding to that first message.

[0179] Specifically, for each first cycle, the start time of the first cycle can be the moment when the second node receives the first information, or the start time of the first cycle can be a time period corresponding to the period before the second node receives the first information. The first cycle can be a period of time that starts from the start time of the first cycle and continues for the length of the first information transmission cycle.

[0180] The first resource in this application embodiment can be a resource in the first period corresponding to the first information; for example, the first resource can be some or all of the resources in the first period corresponding to the first information.

[0181] As one possible implementation, the second node determines a resource for a first period based on the resources received from the first information.

[0182] During implementation, the second node determines the corresponding time-frequency resources for the first cycle based on the time-frequency resources received from the first information.

[0183] It should be understood that the resources received by the second node from the first information can be understood as the resources sent by the first node from the first information.

[0184] For example, the second node receives the first information on P symbols, and the second node can determine that the superframe or radio frame to which the P symbols belong is a resource of one cycle.

[0185] Optionally, the second node determines a first resource on the first channel based on the first channel through which the first information is received; wherein the first channel is one or more channels among at least one channels 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 based on the first channel through which the first information is received.

[0186] Case 2: The first node sends the first information through the first information sending method 2.

[0187] When the first node sends the first information using the first information transmission method 2 described above, the transmission time domain resources of the first information precede the transmission time domain resources of the first data. After receiving the first information, the second node can determine the first resource according to the following method:

[0188] The second node determines that the time-domain resource after receiving the first information within the first COT is the time-domain resource corresponding to the first resource.

[0189] Optionally, the second node determines a first resource on the first channel based on the first channel through which the first information is received; wherein the first channel is one or more channels among at least one channels 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 based on the first channel through which the first information is received.

[0190] Step 502: The first node and the second node transmit the first data within the first resource.

[0191] Alternatively, the first node and the second node transmit the first data within the first COT. Here, the first resource refers to some or all of the resources within the first COT of the first node.

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

[0193] In practice, within 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.

[0194] Additionally, within the first resource, at least one of the following operations can be performed between the first node and the second node:

[0195] The second node synchronizes with the first node based on the synchronization information.

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

[0197] The second node sends an acknowledgment (ACK) or a negative acknowledgment (NACK) message to the first node.

[0198] Figure 7 A possible exemplary block diagram of the communication device involved in an embodiment of this application is shown. For example... Figure 7 As shown, the communication device 700 may include modules or units for implementing the methods described in the embodiments above. In one possible design, the communication device 700 includes a processing unit 701 and a communication unit 702. Optionally, the communication device 700 may further include a storage unit 703 for storing device program code and / or data.

[0199] The communication device 700 can be a first node-side device in the above embodiments, such as a first node, a module (e.g., a circuit, a chip, or a chip system) in the first node, or a logic node, logic module, or software that can implement all or part of the functions of the first node.

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

[0201] In one possible implementation, the communication unit 702 is used to periodically send first information within the first COT of the first node.

[0202] In one possible implementation, the first information includes the period length of the transmission period of the first information.

[0203] In one possible implementation, within the first COT, the time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

[0204] In one possible implementation, the first identifier is determined based on the layer 2 identifier of the first node; or the first identifier is determined based on the MAC ID of the first node; or the first identifier is randomly generated.

[0205] In one possible implementation, the first identifier includes either the layer 2 identifier of the first node or the MACID of the first node.

[0206] In one possible implementation, the first identifier may also include the type information of the first node.

[0207] In one possible implementation, the communication unit 702 is used to transmit the first information on a first channel within the first COT of the first node, wherein the first channel is one or more channels among at least one channel occupied by the first node in the first COT.

[0208] The communication device 700 can also be a second node-side device in the above embodiments, such as a second node, a module in the second node (e.g., a circuit, a chip or chip system, etc.), or a logic node, logic module or software that can implement all or part of the functions of the second node.

[0209] For example, in one embodiment, the communication unit 702 is used to receive first information, the first information including a first identifier of the first node and a CRC bit; the processing unit 701 is used to determine, based on the first information, that the first resource is a resource occupied by the first node, the first node being a node that has established a connection with the second node; the communication unit 702 is also used to transmit first data with the first node within the first resource.

[0210] In one possible implementation, the processing unit 701 is configured to determine a first period based on the received first information and the period length of the sending period of the first information, wherein the first resource is the resource in the first period.

[0211] In one possible implementation, the processing unit 701 is configured to determine the resources for the first cycle based on the resources received from the first information.

[0212] In one possible implementation, the first information includes the period length of the transmission period of the first information.

[0213] In one possible implementation, the time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

[0214] In one possible implementation, the first identifier includes either the layer 2 identifier of the first node or the MAC ID of the first node.

[0215] In one possible implementation, the first identifier may also include the type information of the first node.

[0216] In one possible implementation, the processing unit 701 is configured to determine a first resource on the first channel based on the first channel that receives the first information.

[0217] It is understood that the division of units in the above-described device is merely 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 some units can be integrated onto a single physical entity, or distributed across different physical entities. Furthermore, the aforementioned functional units can be implemented in hardware, software, or a combination of both. Whether a function is executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for specific applications, but such implementations should not be considered beyond the scope of this application.

[0218] In one example, the functional unit in any of the above devices may be one or more integrated circuits configured to implement the above methods, such as: 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.

[0219] In one example, storage unit 703 may include random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory and / or registers, etc.

[0220] Figure 8 A possible exemplary block diagram of the communication device involved in the embodiments of this application is shown. Figure 8 The communication device 800 shown includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It is understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication device 800 may also include a memory 830 for storing instructions executed by the processor 810, or storing input data required for the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions.

[0221] When the communication device 800 is used to implement the above method embodiment, the processor 810 is used to implement the function of the processing unit 701, and the interface circuit 820 is used to implement the function of the communication unit 702.

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

[0223] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Furthermore, the ASIC can reside in a first node or a second node. Alternatively, the processor and storage medium can exist as discrete components in the first node or the second node.

[0224] This application also provides a computer-readable storage medium storing a computer program or instructions for implementing the method executed by the first node or the second node in the above method embodiments.

[0225] For example, when the computer program or instructions are executed by the computer, the computer can implement the method executed by the first node or the second node in the above method embodiments.

[0226] This application also provides a computer program product containing a computer program or instructions, which, when executed by a computer, causes the computer to implement the method executed by the first node or the second node in the above method embodiments.

[0227] This application also provides a communication system, which includes the first node and the second node described in the above embodiments.

[0228] This application also provides a chip device, including a processor, configured to call computer programs or computer instructions stored in the memory, so that the processor executes the above-described... Figure 5 The methods provided in any of the embodiments shown.

[0229] In one possible implementation, the input of the chip device corresponds to the above. Figure 5 In any of the embodiments shown, the receiving operation of the chip device corresponds to the above-described... Figure 5 The sending operation in any of the embodiments shown.

[0230] Optionally, the processor is coupled to the memory via an interface.

[0231] Optionally, the chip device may also include a memory in which computer programs or instructions are stored.

[0232] The processor mentioned above can be a general-purpose central processing unit, a microprocessor, an ASIC, or one or more processors used to control the above. Figure 5 The integrated circuit for program execution of the method provided in any of the embodiments shown. The memory mentioned above may be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, such as random access memory (RAM).

[0233] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program is a set of instructions that directs each step of an action of an electronic computer or other device with message processing capabilities. It is typically written in a programming language and runs on a target architecture. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. 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 website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be volatile or non-volatile, or it can include both types of storage media.

[0234] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, etc.) containing computer-usable program code.

[0235] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0236] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0237] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0238] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A communication method, characterized in that, Applied to the first node, the method includes: The first information is transmitted within the first channel occupancy time (COT) of the first node, and the first information includes the first identifier of the first node and cyclic redundancy check (CRC) bits. The first data is transmitted between the first COT and the second node, which is a node that has established a connection with the first node.

2. The method as described in claim 1, characterized in that, Sending the first information within the first COT of the first node includes: The first information is periodically sent within the first COT of the first node.

3. The method as described in claim 2, characterized in that, The first information includes the period length of the transmission period of the first information.

4. The method as described in claim 1, characterized in that, Within the first COT, the time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

5. The method according to any one of claims 1 to 4, characterized in that, The first identifier is determined based on the layer 2 identifier of the first node; or The first identifier is determined based on the Media Access Control (MAC) ID of the first node; or The first identifier is randomly generated.

6. The method as described in claim 5, characterized in that, The first identifier also includes the type information of the first node.

7. The method according to any one of claims 1 to 6, characterized in that, Sending the first information within the first channel occupancy time (COT) of the first node includes: Within the first COT of the first node, the first information is transmitted on a first channel, wherein the first channel is one or more channels among at least one channel occupied by the first node in the first COT.

8. A communication method, characterized in that, Applied to the second node, the method includes: Receive first information, the first information including the first identifier of the first node and cyclic redundancy check (CRC) bits; Based on the first information, the first resource is determined to be the resource occupied by the first node, and the first node is the node that has established a connection with the second node; Transmit the first data with the first node within the first resource.

9. The method as described in claim 8, characterized in that, The method further includes: Based on the received first information and the period length of the first information transmission period, a first period is determined, and the first resource is the resource in the first period.

10. The method as described in claim 9, characterized in that, The method further includes: Based on the resources received from the first information, the resources for the first period are determined.

11. The method as described in claim 9 or 10, characterized in that, The first information includes the period length of the transmission period of the first information.

12. The method as described in claim 8, characterized in that, The time-domain resources for transmitting the first information precede the time-domain resources for transmitting the first data.

13. The method according to any one of claims 8 to 12, characterized in that, The first identifier includes the Layer 2 identifier of the first node or the Media Access Control (MAC) ID of the first node.

14. The method as described in claim 13, characterized in that, The first identifier also includes the type information of the first node.

15. The method according to any one of claims 8 to 14, characterized in that, The method further includes: Based on the first channel that received the first information, determine the first resource on the first channel.

16. A communication device, characterized in that, Includes modules for performing the method according to any one of claims 1 to 7, or the method according to any one of claims 8 to 15.

17. A communication device, characterized in that, It includes a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit to implement the method of any one of claims 1 to 7, or to implement the method of any one of claims 8 to 15.

18. A computer program product, characterized in that, The computer program product includes a computer program or instructions that, when executed, implement the method of any one of claims 1 to 7, or the method of any one of claims 8 to 15.

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

20. A communication system, characterized in that, include: A first node for implementing the method of any one of claims 1 to 7, and a second node for implementing the method of any one of claims 8 to 15.

Images