Access method, device and system

Abstract

The embodiment of the invention provides an access method, device and system, which are used for reducing the probability of collision of access information sent by a plurality of T nodes so as to improve the success rate of access. In the method, a terminal node can randomly select a time unit within a time period to send access information. The method comprises the following steps: receiving first broadcast information; and in response to the first broadcast information, sending the first access information on any time unit in the plurality of time units in the first time period.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to access methods, devices and systems. Background Technology

[0002] In a communication system, a grant (G) node can periodically send broadcast messages to terminal (T) nodes. After receiving (or detecting) the broadcast message from the G node, the T node can synchronize based on the broadcast message and trigger an access procedure to establish a wireless connection with the G node.

[0003] Typically, access resources are periodic. After completing synchronization based on broadcast information, node T can send access information on the next access resource to request access to node G. The access information can be scrambled using the identity (ID) of the sidelink synchronization signal (SLSS) selected by node T.

[0004] However, when multiple T nodes receive broadcast information simultaneously, they are likely to transmit access information on the same access resource, meaning the access resources used by multiple T nodes may overlap, leading to collisions. Since different T nodes may select different SLSS IDs, the access information transmitted by multiple T nodes on the same access resource will also be different. Access information transmitted by other T nodes can be considered interference to the access information transmitted by T1 node. Significant interference can easily cause the received signal-to-interference-plus-noise ratio (SINR) on the G node side to fall below the demodulation threshold, preventing the G node from properly demodulating the access information from T1 node, resulting in T1 node failing to connect to the G node. Summary of the Invention

[0005] This application provides an access method, apparatus, and system to reduce the probability of collisions in access information sent by multiple T nodes, thereby improving the access success rate.

[0006] To achieve the above objectives, the embodiments of this application adopt the following technical solutions:

[0007] In a first aspect, an access method is provided. The apparatus for executing the access method can be a terminal node, or a module applied in the terminal node, such as a chip or chip system. The access method includes: receiving first broadcast information; and in response to the first broadcast information, transmitting first access information at any time unit among a plurality of time units within a first time period.

[0008] In the access method provided in this application embodiment, a terminal node can send first access information at any time unit within a first time period. Since different terminal nodes may determine different time units for sending access information within the first time period, the access method provided in this application embodiment helps avoid multiple terminal nodes using the same access resource to send access information, thereby reducing the probability of collisions between access information sent by multiple terminal nodes. On the one hand, this helps the first management node to correctly demodulate the access information sent by multiple terminal nodes, improving the access success rate; on the other hand, it helps the communication system accommodate more terminal nodes, or increases the number of terminal nodes that can simultaneously access the first management node.

[0009] In conjunction with the first aspect described above, in one possible implementation, the time unit is a period; receiving the first broadcast information includes: receiving the first broadcast information during the first period; the first time period is located after the first period. In this scheme, the first broadcast information can be transmitted during the first period, and the first access information can be transmitted during any of the multiple time units within the first time period following the first period.

[0010] In conjunction with the first aspect described above, in one possible implementation, the period includes multiple sub-time units; receiving the first broadcast information in the first period includes: receiving the first broadcast information in a first sub-time unit within the first period; sending the first access information in any time unit among the multiple time units within the first time period includes: sending the first access information in a second sub-time unit within any period; the second sub-time unit corresponds to the first sub-time unit. In this scheme, the first broadcast information can be transmitted in the first sub-time unit within the first period, and the first access information can be transmitted in the second sub-time unit of any period within the first time period.

[0011] In conjunction with the first aspect described above, in one possible implementation, when access fails based on the first access information and the number of times the first access information is sent is less than a threshold, or when access fails based on the first access information and the number of multiple time units within the first time period does not reach a maximum value, the method further includes: sending the first access information in any time unit among the multiple time units within a second time period; wherein the number of multiple time units within the second time period is greater than or equal to the number of multiple time units within the first time period. In this scheme, the terminal node first sends the first access information within a shorter first time period. If access fails, the terminal node can send the first access information within a longer second time period. Since the terminal node can select time units to send the first access information within a wider range, the probability of collisions between access information sent by multiple terminal nodes can be reduced to a greater extent.

[0012] In conjunction with the first aspect described above, in one possible implementation, the number of multiple time units within the second time period is k times the number of multiple time units within the first time period, where k is an integer greater than 1. For example, k = 2 or 5.

[0013] In conjunction with the first aspect described above, in one possible implementation, the first access information is scrambled using a first-side link synchronization signal identifier (SLSS ID). If access fails based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or if access fails based on the first access information and the number of multiple time units within the first time period reaches a maximum value, the method further includes: sending second access information in any time unit within the multiple time units of a third time period; wherein the number of multiple time units in the third time period is equal to the number of multiple time units in the first time period, and the second access information is scrambled using a second SLSS ID. In this scheme, after multiple access failures, the terminal node can reselect an SLSS ID to access again, thereby further improving the access success rate.

[0014] In conjunction with the first aspect described above, in one possible implementation, the first broadcast information originates from a first management node, and the first access information is scrambled using a first SLSS ID. If access fails based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or if access fails based on the first access information and the number of multiple time units within the first time period reaches a maximum value, the method further includes: receiving a second broadcast information from a second management node; and in response to the second broadcast information, sending second access information in any time unit within the multiple time units of a fourth time period; wherein the second access information is scrambled using a second SLSS ID. In this scheme, after multiple access failures, the terminal node can reselect the management node and SLSS ID to attempt access and retry, thereby further improving the access success rate.

[0015] In conjunction with the first aspect described above, in one possible implementation, the threshold is preset, default, determined based on higher-level parameters, indicated by the first broadcast information, or corresponds to the first time period. In this scheme, when the threshold corresponds to the first time period, the total time for terminal nodes to attempt access can be limited. For example, if the first time period is short, the threshold value can be larger; if the first time period is long, the threshold value can be smaller.

[0016] In conjunction with the first aspect mentioned above, in one possible implementation, the number of multiple time units within the first time period is 2. n The maximum value is 2.N In this context, n is less than or equal to N, and both n and N are positive integers. For example, if n = 2 and N = 9, the length sequence of the time period corresponding to multiple access attempts by the terminal node can be {4, 8, 16, ..., 512}. That is, the number in the length sequence increases exponentially.

[0017] In conjunction with the first aspect described above, in one possible implementation, the number of time units within the first time period is preset, defaulted, determined based on higher-level parameters, or indicated by the first broadcast information. In this scheme, the first management node can estimate and broadcast a suitable number of time units within the first time period based on the number of terminal nodes in the current scenario. For example, if the number of terminal nodes is large, the first management node can broadcast a larger number of time units. Since terminal nodes can select time units within a wider range to send the first access information, the probability of collisions between access information sent by multiple terminal nodes can be reduced to a greater extent. Conversely, if the number of terminal nodes is small, the first management node can broadcast a smaller number of time units, enabling terminal nodes to connect to the first management node as quickly as possible.

[0018] In conjunction with the first aspect described above, in one possible implementation, the first time unit within the second time period is either the time unit in which access failed based on the first access information, or the first time unit after the access failure based on the first access information. In this scheme, the second time period can begin as early as possible after the access failure, thereby helping to reduce access latency.

[0019] Secondly, an access method is provided, wherein the device executing the access method can be a terminal node, or a module applied in the terminal node, such as a chip or chip system. The access method includes: receiving first broadcast information in a first sub-time unit; and, in response to the first broadcast information, sending first access information in any one of M second sub-time units, where M is an integer greater than 1, and the second sub-time unit corresponds to the first sub-time unit.

[0020] In conjunction with the second aspect above, in one possible implementation, if access fails based on the first access information and the number of times the first access information is sent is less than a threshold, or if access fails based on the first access information and M does not reach its maximum value, the method further includes: sending the first access information in any of the K second sub-time units; wherein K is an integer greater than or equal to M.

[0021] In conjunction with the second aspect mentioned above, in one possible implementation, K is k times M, where k is an integer greater than 1.

[0022] In conjunction with the second aspect above, in one possible implementation, the first access information is scrambled using the first side link synchronization signal identifier SLSS ID; if access fails based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or if access fails based on the first access information and M reaches its maximum value, the method further includes: sending second access information in any of the M second sub-time units; wherein the second access information is scrambled using the second SLSS ID.

[0023] In conjunction with the second aspect above, in one possible implementation, the first broadcast information comes from a first management node, the first sub-time unit corresponds to the first management node, and the first access information is scrambled with a first SLSS ID. If access fails based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or if access fails based on the first access information and M reaches its maximum value, the method further includes: receiving second broadcast information from a second management node in a third sub-time unit; responding to the second broadcast information, sending second access information in any of the M fourth sub-time units, where the third sub-time unit corresponds to the fourth sub-time unit and the second management node, and the second access information is scrambled with a second SLSS ID.

[0024] In conjunction with the second aspect above, in one possible implementation, the threshold is preset, default, determined according to higher-level parameters, indicated by the first broadcast information, or corresponds to M.

[0025] In conjunction with the second aspect above, in one possible implementation, M is 2. n The maximum value is 2. N n is less than or equal to N, and both n and N are positive integers.

[0026] In conjunction with the second aspect above, in one possible implementation, M is preset, default, determined according to higher-level parameters, or indicated by the first broadcast information.

[0027] In conjunction with the second aspect above, in one possible implementation, the K second sub-time units are located after the access failure based on the first access information.

[0028] Thirdly, a communication device is provided for implementing the above-described method. This communication device includes modules, units, or means corresponding to the implementation of the above-described method. These modules, units, or means can be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above-described functions.

[0029] In conjunction with the third aspect above, in one possible implementation, the communication device includes: a transmitting module and a receiving module; the receiving module is configured to receive first broadcast information; the transmitting module is configured to, in response to the first broadcast information, transmit first access information in any one of a plurality of time units within a first time period.

[0030] In conjunction with the third aspect above, in one possible implementation, the time unit is a period; the receiving module is specifically used to: receive the first broadcast information during the first period; the first time period is located after the first period.

[0031] In conjunction with the third aspect above, in one possible implementation, the period includes multiple sub-time units; the receiving module is specifically configured to: receive the first broadcast information in the first sub-time unit within the first period; the sending module is specifically configured to: send the first access information in the second sub-time unit within any period; the second sub-time unit corresponds to the first sub-time unit.

[0032] In conjunction with the third aspect above, in one possible implementation, when the communication device fails to access the network based on the first access information and the number of times the first access information is sent is less than a threshold, or when the communication device fails to access the network based on the first access information and the number of multiple time units within the first time period does not reach a maximum value, the sending module is further configured to send the first access information at any time unit among the multiple time units within the second time period; wherein the number of multiple time units within the second time period is greater than or equal to the number of multiple time units within the first time period.

[0033] In conjunction with the third aspect mentioned above, in one possible implementation, the number of multiple time units within the second time period is k times the number of multiple time units within the first time period, where k is an integer greater than 1.

[0034] In conjunction with the third aspect above, in one possible implementation, the first access information is scrambled using a first-side link synchronization signal identifier (SLSS ID). If the communication device fails to access the network based on the first access information, and the number of times the first access information is sent is greater than or equal to a threshold, or if the communication device fails to access the network based on the first access information, and the number of multiple time units within the first time period reaches a maximum value, the sending module is further configured to send second access information in any one of the multiple time units within the third time period; wherein the number of multiple time units within the third time period is equal to the number of multiple time units within the first time period, and the second access information is scrambled using a second SLSS ID.

[0035] In conjunction with the third aspect above, in one possible implementation, the first broadcast information comes from the first management node, and the first access information is scrambled using the first SLSS ID; when the communication device fails to access based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or when the communication device fails to access based on the first access information and the number of multiple time units within the first time period reaches a maximum value, the receiving module is further configured to receive the second broadcast information from the second management node; the sending module is further configured to respond to the second broadcast information and send the second access information in any time unit among the multiple time units within the fourth time period; wherein the second access information is scrambled using the second SLSS ID.

[0036] In conjunction with the third aspect above, in one possible implementation, the threshold is preset, default, determined according to higher-level parameters, indicated by the first broadcast information, or corresponds to the first time period.

[0037] In conjunction with the third aspect mentioned above, in one possible implementation, the number of multiple time units within the first time period is 2. n The maximum value is 2. N n is less than or equal to N, and both n and N are positive integers.

[0038] In conjunction with the third aspect above, in one possible implementation, the number of multiple time units within the first time period is preset, defaulted, determined according to higher-level parameters, or indicated by the first broadcast information.

[0039] In conjunction with the third aspect above, in one possible implementation, the first time unit within the second time period is: the time unit in which the communication device fails to access the network based on the first access information, or the first time unit after the communication device fails to access the network based on the first access information.

[0040] Fourthly, a communication device is provided for implementing the above-described method. This communication device includes modules, units, or means corresponding to the implementation of the above-described method. These modules, units, or means can be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above-described functions.

[0041] In conjunction with the fourth aspect above, in one possible implementation, the communication device includes: a transmitting module and a receiving module; the receiving module is configured to receive first broadcast information in a first sub-time unit; the transmitting module is configured to, in response to the first broadcast information, transmit first access information in any one of M second sub-time units, where M is an integer greater than 1, and the second sub-time unit corresponds to the first sub-time unit.

[0042] In conjunction with the fourth aspect above, in one possible implementation, when the communication device fails to access the network based on the first access information and the number of times the first access information is sent is less than a threshold, or when the communication device fails to access the network based on the first access information and M does not reach its maximum value, the sending module is further configured to: send the first access information in any of the K second sub-time units; wherein K is an integer greater than or equal to M.

[0043] In conjunction with the fourth aspect mentioned above, in one possible implementation, K is k times M, where k is an integer greater than 1.

[0044] In conjunction with the fourth aspect above, in one possible implementation, the first access information is scrambled using the first side link synchronization signal identifier SLSS ID; when the communication device fails to access based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or when the communication device fails to access based on the first access information and M reaches its maximum value, the sending module is further configured to: send the second access information in any of the M second sub-time units; wherein the second access information is scrambled using the second SLSS ID.

[0045] In conjunction with the fourth aspect above, in one possible implementation, the first broadcast information comes from the first management node, the first sub-time unit corresponds to the first management node, and the first access information is scrambled with a first SLSS ID. If the communication device fails to access the network based on the first access information, and the number of times the first access information is sent is greater than or equal to a threshold, or if the communication device fails to access the network based on the first access information, and M reaches its maximum value, the receiving module is further configured to: receive the second broadcast information from the second management node in the third sub-time unit; the sending module is further configured to, in response to the second broadcast information, send the second access information in any of the M fourth sub-time units, where the third sub-time unit corresponds to the fourth sub-time unit and the third sub-time unit corresponds to the second management node, and the second access information is scrambled with a second SLSS ID.

[0046] In conjunction with the fourth aspect above, in one possible implementation, the threshold is preset, default, determined according to higher-level parameters, indicated by the first broadcast information, or corresponds to M.

[0047] In conjunction with the fourth aspect mentioned above, in one possible implementation, M is 2. n The maximum value is 2. N n is less than or equal to N, and both n and N are positive integers.

[0048] In conjunction with the fourth aspect above, in one possible implementation, M is preset, default, determined according to higher-level parameters, or indicated by the first broadcast information.

[0049] In conjunction with the fourth aspect above, in one possible implementation, the K second sub-time units are located after the communication device fails to access the network based on the first access information.

[0050] In conjunction with the third or fourth aspect above, in one possible design the communication device further includes a Bluetooth module for realizing Bluetooth signal transmission and / or a Wi-Fi module for realizing Wi-Fi signal transmission. One or more of the StarScan module, Bluetooth module or Wi-Fi module share at least one of the following: radio frequency (RF) unit, modem unit, media access control (MAC) unit, and central processing unit (CPU).

[0051] In conjunction with the third or fourth aspect above, in one possible design, the StarSignal module and the Wi-Fi module for realizing Wi-Fi signal transmission are located in different subsystems of the communication device. The subsystem of the StarSignal module and the subsystem of the Wi-Fi module are integrated in the communication device with at least one of the following: Bluetooth system, StarSignal Low Power SLE system, Global Navigation Satellite System (GNSS), Always On system, Power Management Unit (PMU), Clock Management Unit (CMU), Flash memory, application system, and audio system.

[0052] In conjunction with the third or fourth aspect above, in one possible design, the StarSignal module and the Wi-Fi module for implementing Wi-Fi signal transmission are located in the same subsystem of the communication device. The subsystems of the StarSignal module and the Wi-Fi module are integrated in the communication device with at least one of the following: Bluetooth system, StarSignal Low Energy (SLE) system, Global Navigation Satellite System (GNSS), Always On system, Power Management Unit (PMU), Clock Management Unit (CMU), Flash memory, application system, and audio system.

[0053] In conjunction with the third or fourth aspect above, in one possible design, the communication device further includes a Bluetooth module for realizing Bluetooth signal transmission and / or a Wi-Fi module for realizing Wi-Fi signal transmission. At least one of the Bluetooth module or Wi-Fi module and the star flash module coexist and communicate with each other through different antennas. The coexistence strategy includes at least one of the following: frequency division multiplexing, code division multiplexing, time division multiplexing, channel avoidance, or aggregation scheduling.

[0054] In conjunction with the third or fourth aspect above, in one possible design, the communication device further includes a Bluetooth module for implementing Bluetooth signal transmission and / or a Wi-Fi module for implementing Wi-Fi signal transmission. At least one of the Bluetooth module or Wi-Fi module and the star flash module coexist and communicate with each other through the same antenna. The coexistence strategy includes at least one of the following: frequency division multiplexing, code division multiplexing, time division multiplexing, software static strategy, or message transmission arbitration PTA strategy.

[0055] Fifthly, a communication device is provided, comprising: a processor; the processor being coupled to a memory and, after reading computer instructions stored in the memory, executing the method as described in the first or second aspect above according to the instructions.

[0056] In conjunction with the fifth aspect above, in one possible implementation, the communication device further includes a memory for storing computer instructions.

[0057] In conjunction with the fifth aspect above, in one possible implementation, the communication device further includes a communication interface; this communication interface is used for the communication device to communicate with other devices. For example, the communication interface may be a transceiver, an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or related circuitry, etc.

[0058] In conjunction with the fifth aspect above, in one possible implementation, the communication device can be a chip or a chip system. When the communication device is a chip system, it can be composed of chips or may include chips and other discrete components.

[0059] In conjunction with the fifth aspect above, in one possible implementation, when the communication device is a chip or chip system, the aforementioned communication interface can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The aforementioned processor can also be embodied as a processing circuit or logic circuit.

[0060] A sixth aspect provides a communication system, comprising: a management node, and a terminal node performing the method described in the first or second aspect above.

[0061] In a seventh aspect, a computer-readable storage medium is provided that stores instructions which, when executed on a computer, enable the computer to perform the methods described in the first or second aspect above.

[0062] Eighthly, a computer program product containing instructions is provided that, when run on a computer, enables the computer to perform the methods described in the first or second aspect above.

[0063] Ninth aspect, a chip is provided, the chip comprising: a processor, the processor being configured to execute instructions that cause a device including the chip to perform the method described in the first or second aspect.

[0064] In conjunction with the ninth aspect above, in one possible implementation, the chip also includes a memory for storing instructions.

[0065] The technical effects of any possible implementation of aspects two through nine can be found in the first aspect or the technical effects of different implementations of the first aspect, and will not be repeated here. Attached Figure Description

[0066] Figure 1 A diagram illustrating the attempts of nodes T1 and T2 to connect to node G1;

[0067] Figure 2 A schematic diagram of a communication system provided in an embodiment of this application;

[0068] Figure 3 A flowchart illustrating an access method provided in an embodiment of this application;

[0069] Figure 4 A schematic diagram illustrating T1 node and T2 node attempting to access G1 node as provided in an embodiment of this application;

[0070] Figure 5 A schematic diagram of a chip architecture provided in an embodiment of this application;

[0071] Figure 6 This is a schematic diagram of another chip architecture provided in an embodiment of this application;

[0072] Figure 7 This is another schematic diagram of a chip architecture provided in an embodiment of this application;

[0073] Figure 8 This is another schematic diagram of a chip architecture provided in an embodiment of this application;

[0074] Figure 9 A schematic diagram of a chip module framework provided in an embodiment of this application;

[0075] Figure 10 This is a schematic diagram of another chip module framework provided in an embodiment of this application;

[0076] Figure 11 This is a schematic diagram of another chip module framework provided in an embodiment of this application;

[0077] Figure 12 A schematic diagram illustrating the framework of a software static strategy provided in an embodiment of this application;

[0078] Figure 13 A schematic diagram illustrating the framework of a hardware arbitration time-division (PTA) strategy provided in an embodiment of this application;

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

[0080] Figure 15 This is a schematic diagram of the composition of a communication device provided in an embodiment of this application. Detailed Implementation

[0081] Currently, broadcast information sent by G nodes can be carried on the physical sidelink broadcast channel (PSBCH). The broadcast information may include the G node identifier and the SLSS ID selected by the G node. Understandably, the broadcast information may also include other information. In addition to broadcast information, G nodes can also send a first signal and a second signal. The first and second signals are used for synchronization. For example, the first signal can be the primary synchronization signal (PSS), and the second signal can be the secondary synchronization signal (SSS). The PSS and SSS sent by the G node can be generated based on the SLSS ID selected by the G node, and the broadcast information can be scrambled using the SLSS ID selected by the G node.

[0082] After receiving broadcast information, PSS, and SSS, node T can synchronize and, for example, send access information, PSS, and SSS to node G on the next access resource. The access information can also be referred to as message (Msg)1. The access information can be carried on the PSBCH. The access information may include the G node identifier and the SLSSID selected by node T. It is understood that the access information may also include other information. The PSS and SSS sent by node T can be generated based on the SLSS ID selected by node T.

[0083] Afterwards, node G can respond to the access information by sending Msg2 to node T. After receiving Msg2, node T can send Msg3 to node G on the resource indicated in Msg2. After receiving Msg3, node G can send Msg4 to node T to complete the access process.

[0084] Taking two nodes T1 and T2 as an example, Figure 1 This diagram illustrates the attempt by two nodes to access node G1. The access resource and the broadcast resource used to transmit broadcast information have a period of 160 milliseconds (ms). In the frequency domain, both the broadcast resource and the access resource occupy 6 resource blocks (RBs) at the center frequency of the system bandwidth. Within the same period, the access resource can be located in the next subframe of the broadcast resource. The events that occur are described below in chronological order.

[0085] In subframe s1, nodes T1 and T2 receive broadcast information from node G1.

[0086] On s2, node T1 completes synchronization based on the broadcast information from node G1. Optionally, within the time range for receiving broadcast information, node T1 can also receive broadcast information from other G nodes besides node G1, and determine that the target node for attempted access is node G1. Optionally, node G1 is the management node with the highest signal strength within the time range for receiving broadcast information from node G1 and optional other G nodes. It is understood that node T1 processes the broadcast information received from node G1 and optional other G nodes within this time range, and the processing is completed at s2. It is understood that on s2, node T1 completes synchronization based on the broadcast information from node G1, indicating that the synchronization completion time is located on subframe s2.

[0087] On s3, node T2 completes synchronization based on broadcast information from node G1. Optionally, within the time range for receiving broadcast information, node T2 can also receive broadcast information from other G nodes besides node G1, and determine that the target node for attempted access is node G1. Optionally, node G1 is the management node with the highest signal strength within the time range for receiving broadcast information from node G1 and optional other G nodes. It is understood that node T2 processes the broadcast information received from node G1 and optional other G nodes within this time range, and the processing is completed at s3. In actual implementation, nodes T1 and T2 can also complete synchronization on the same subframe, i.e., s2 and s3 are located in the same subframe. It is understood that on s3, node T2 completes synchronization based on broadcast information from node G1, indicating that the synchronization completion time is located on subframe s3.

[0088] On frame s4, nodes T1 and T2 send access information to node G1. Clearly, since nodes T1 and T2 are both sending access information in the same subframe, i.e., on s4, a collision occurs.

[0089] For access information sent by node T1, access information sent by node T2 can be considered interference. When node T1 collides with more other T nodes besides node T1 in the same subframe, if the interference is large, for example, when the number of other T nodes is 3, the signal-to-interference-plus-noise ratio (SINR) on the G node side is likely to fall below the demodulation threshold. This prevents the G node from properly demodulating the access information from node T1, causing node T1 to fail to access the G node. In other words, the number of T nodes that the communication system can accommodate is less than 4, meaning the number of T nodes that can simultaneously access the G node is limited, thus restricting the application scenarios of the communication system. It is understood that for access information sent by node T2, access information sent by node T1 can be considered interference. It is understood that the above is only an example based on the number of T nodes; the actual level of interference is related to the number of colliding T nodes, the number of access information from different colliding T nodes, the distance between each T node and the G node, and the signal strength of the access information received by the G node from each T node. This application embodiment does not limit this.

[0090] To address this issue, in this embodiment, a T node can randomly (or arbitrarily) select a time unit within a time period to send access information. This allows different T nodes to select different time units, which helps avoid collisions caused by multiple T nodes using the same access resource to send access information.

[0091] It should be noted that broadcast information may take one time unit to transmit, or it may take two consecutive time units to transmit.

[0092] Understandably, a time unit can be any of the following: symbol, time slot, subframe, radio frame, superframe, ms, s, etc.

[0093] Alternatively, a time unit can also be called a sub-time unit.

[0094] Optionally, the broadcast information occupying a time unit can be understood as the broadcast information being located within a time unit. The broadcast information may occupy some or all of the time-domain resources within that time unit. For example, if the time unit is a subframe, the broadcast information may occupy some or all of the symbols within that subframe.

[0095] It should be understood that the embodiments described in this application describe the use of time-domain resources and do not impose constraints on frequency-domain resources.

[0096] The communication method provided in this application embodiment can be used in any communication system, such as a third-generation partnership project (3GPP) communication system, for example, a device-to-device (D2D) communication system, a new radio (NR) vehicle-to-everything (V2X) system, a machine-to-machine (M2M) communication system, an internet of things (IoT) system, a narrow band-internet of things (NB-IoT) system, enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), a long-term evolution (LTE) system, a fifth-generation (5G) mobile communication system, a hybrid LTE and 5G network system, an NR system, and various types of future communication systems, or a non-terrestrial communication network. Network (NTN) systems (such as satellite communication systems) and non-3GPP communication systems are not restricted.

[0097] The communication method provided in this application can also be applied to, but is not limited to, short-range wireless communication systems and wireless communication systems that support longer-distance transmission (such as 1 to 18 km, or over 18 km) (such as the future StarSpark wireless communication system). The short-range wireless communication system can include short-range wireless communication technology (also known as StarSpark 1.0 technology), which has advantages such as ultra-low latency, ultra-high reliability, and precise synchronization, and is suitable for applications in smart cars, smart homes, smart terminals, and smart manufacturing. For example, applications in smart car scenarios include: immersive in-vehicle sound field & noise reduction, wireless interactive projection, and 360-degree panoramic surround view, which can achieve an immersive interactive experience and improve vehicle safety.

[0098] Wireless communication systems that support longer transmission distances (such as 1 to 18 km) mainly include future StarSpark wireless communication systems, such as StarSpark 2.0 wireless communication system and StarSpark 3.0 wireless communication system. They are not only suitable for communication scenarios with low latency requirements, such as the aforementioned vehicle communication and industrial control scenarios, but also for communication scenarios with low latency requirements.

[0099] In some possible implementations, the above-mentioned communication system may be used in conjunction with a mobile communication system, such as, but not limited to, fourth-generation (4G) communication systems (e.g., LTE systems), 5G communication systems (e.g., NR systems), and future mobile communication systems.

[0100] The following is based on Figure 2 Taking an example, the communication system provided in the embodiments of this application will be described.

[0101] Figure 2 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 2 As shown, the communication system may include at least one terminal node and at least one management node.

[0102] For example, Figure 2 The illustrated communication system can be a wireless short-range communication system.

[0103] In this embodiment, the management node can be a node in the wireless short-range communication system that has resource scheduling capabilities and sends control information such as resource management information and / or data scheduling information. The terminal node can be a node in the wireless short-range communication system that receives the control information such as resource management information and / or data scheduling information sent by the management node, and performs data transmission or reception based on the control information. For ease of description, the short-range protocol in the wireless short-range communication system is referred to as the Star Flash protocol in this embodiment.

[0104] In the StarScan protocol corresponding to StarScan technology, there are uplink and downlink transmissions between the management node and the terminal nodes. Uplink transmission is achieved through the T-link, which is the link between the terminal node and the management node, also known as the uplink. This link can carry data channels, access channels, feedback signals, etc., from the terminal node to the management node. The symbol used for T-link transmission is called the T symbol. Downlink transmission is achieved through the G-link, which is the link between the management node and the terminal nodes, also known as the downlink. This link can carry data channels, control channels, broadcast channels, synchronization signals, etc., from the management node to the terminal nodes. The symbol used for G-link transmission is called the G symbol.

[0105] A communication domain refers to the G-link and T-link resources of a management node in a communication system. A communication domain can also be referred to as a cell.

[0106] In this embodiment, the communication device has wireless communication capabilities and can be configured with multiple antennas. These multiple antennas may include at least one transmitting antenna for transmitting signals and at least one receiving antenna for receiving signals. Additionally, each communication device also includes a transmitter chain and a receiver chain. Those skilled in the art will understand that these chains may include multiple components related to signal transmission and reception (e.g., processors, modulators, multiplexers, demodulators, demultiplexers, or antennas). The communication device can be a management node or a terminal node, and this is not limited.

[0107] in, Figure 2The management node is located on the network side of the aforementioned communication system. It assists terminal nodes in achieving wireless access and is a device with wireless transceiver capabilities, or a chip or chip system that can be installed on such a device. This management node includes, but is not limited to: managing user equipment (UE), network equipment, access network equipment, access network nodes, radio access network (RAN) nodes, RAN entities or access nodes, base stations, evolved NodeBs (eNodeBs), access points (APs), transmission reception points (TRPs or transmission points (TPs), next-generation NodeBs (gNBs), future base stations in future mobile communication systems, base stations in future mobile communication systems, or access points (APs) in wireless fidelity (Wi-Fi) systems. The management node can be a macro base station, micro base station, indoor station, relay node, donor node, open radio access network (ORAN), or a radio controller in a centralized radio access network (CRAN) scenario. Management nodes can also be one or a group of antenna panels (including multiple antenna panels) in a 5G base station. Alternatively, they can be network nodes constituting a gNB, TRP, TP, or transmission measurement function (TMF), such as a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), a radio unit (RU), or a roadside unit (RSU) with base station functionality. Optionally, management nodes can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, the management node in vehicle-to-everything (V2X) technology can be an RSU. Optionally, management nodes can also be control units in autonomous driving, central controllers in smart factories / smart homes, handheld or automatic control remote sensors for flight equipment, etc. Optionally, management nodes can also be control devices such as central control or control panels, such as drone controllers or control units in industrial control.All or part of the functions of the management node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform). The management node in this application can also be a logical node, logical module, or software capable of implementing all or part of the management node functions.

[0108] In this application embodiment, the form of the management node is not limited. The device used to implement the function of the management node can be the management node itself; it can also be a device that supports the management node in implementing this function, such as a chip system. The device can be installed in the management node or used in conjunction with the management node.

[0109] in, Figure 2In this context, a terminal node is a device, equipment, module, chip, or chip system with transceiver capabilities. A terminal node can also be other devices with terminal functions; for example, it can be a device that acts as a terminal in device-to-device (D2D) communication, such as a member UE. This terminal node can also be referred to as a terminal device, UE, access terminal, subscriber unit, user station, mobile station (MS), mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user equipment. The terminal nodes in the embodiments of this application can be mobile phones, cellular phones, smartphones, tablets, mice, remote controls, styluses, set-top boxes, routers, cameras, screens, smart screens, wireless data cards, personal digital assistant computers (PDAs), wireless modems, handsets, laptop computers, smartwatches, smart bracelets, wireless headphones, electronic whiteboards, machine-type communication (MTC) terminals, computers with wireless transceiver capabilities, virtual reality (VR) terminals, augmented reality (AR) terminals, smart home devices (e.g., refrigerators, televisions, air conditioners, washing machines, rice cookers, table lamps, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, and transportation security. Wireless terminals in various applications include those for smart cities, smart homes, vehicle terminals, vehicle screens, vehicle audio systems, car keys, roadside units (RSUs) with terminal functionality, and flying equipment (e.g., intelligent robots, hot air balloons, drones, airplanes). The terminal node in this application can also be an onboard module, onboard unit, onboard component, onboard chip, or onboard unit embedded within a vehicle as one or more components or units.

[0110] The embodiments of this application do not limit the device form of the terminal. The device used to implement the function of the terminal node can be the terminal node itself; it can also be a device that supports the terminal node in implementing the function, such as a chip system. The device can be installed in the terminal node or used in conjunction with the terminal node. In the embodiments of this application, the chip system can be composed of chips or can include chips and other discrete devices.

[0111] It should be noted that the solutions in the embodiments of this application can also be applied to other communication systems, and the corresponding names can be replaced by the names of the corresponding functions in other communication systems.

[0112] Based on the above description of the terminal node and the management node, optionally, the communication method provided in the embodiments of this application can be implemented by the aforementioned terminal node or management node, or by components of the terminal node or management node, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal node or management node, without limitation.

[0113] The following is combined with Figure 1 and Figure 2 Please refer to the following Figure 3 The access method provided in the embodiments of this application is described below, wherein the first management node can be Figure 2 In the communication system shown, the management node and the terminal node can be... Figure 2 Any terminal node in the communication system shown.

[0114] Figure 3 A flowchart of an access method provided in an embodiment of this application is shown below. Figure 3 As shown, the method includes:

[0115] Step S301: The first management node sends a first broadcast message. Correspondingly, the terminal node receives the first broadcast message from the first management node.

[0116] The relevant description of the first broadcast information can be found in the aforementioned description of the broadcast information, and will not be repeated here.

[0117] Step S302: In response to the first broadcast information, the terminal node sends first access information to the first management node at any time unit among multiple time units within the first time period. Accordingly, the first management node receives the first access information.

[0118] The access information in this application embodiment can also be referred to as an access request message. The time period in this application embodiment can also be referred to as a time domain range. Any time unit in this application embodiment can be a time unit randomly selected or arbitrarily selected by the terminal node.

[0119] Optionally, the time unit is a period; step S301 includes: the first management node sending first broadcast information to the terminal node in the first period. Correspondingly, the terminal node receives the first broadcast information from the first management node in the first period. The first time period is located after the first period. In this scheme, the first broadcast information can be transmitted in the first period, and the first access information can be transmitted in any of the multiple time units within the first time period after the first period. Optionally, the first period included in the first time period can also be the first period for receiving broadcast information.

[0120] The following description uses a time unit as an example. The term "period" can also be replaced with "time unit".

[0121] Optionally, the period includes multiple sub-time units; the first management node sends a first broadcast message to the terminal node in the first period. Correspondingly, the terminal node receives the first broadcast message from the first management node in the first period, including: the first management node sending the first broadcast message to the terminal node in the first sub-time unit within the first period. Correspondingly, the terminal node receives the first broadcast message from the first management node in the first sub-time unit within the first period. The terminal node sends first access information to the first management node in any one of the multiple time units within the first time period, including: sending the first access information in a second sub-time unit within any period; the second sub-time unit corresponds to the first sub-time unit. In this scheme, the first broadcast message can be transmitted in the first sub-time unit within the first period, and the first access information can be transmitted in the second sub-time unit of any period within the first time period. It can be understood that the first sub-time unit is the sub-time unit for receiving broadcast information, and the second sub-time unit is the sub-time unit corresponding to or for sending access information within the sub-time unit for receiving broadcast information.

[0122] For example, a sub-time unit can be a subframe. A period can, for example, contain 160 subframes, or a period can, for example, consist of 160 subframes. In other words, the length of a period can be the length of 160 subframes, i.e., 160ms.

[0123] In this embodiment, the second sub-time unit corresponds to the first sub-time unit. This can be understood as follows: the first sub-time unit can be used by the first management node to send first broadcast information, and the second sub-time unit can be used by the terminal node to send first access information. It is understood that the broadcast information and access information are periodic, and the resources used for broadcast information transmission in each period correspond to the resources used for access information in each period; that is, the second sub-time unit in each period corresponds to the first sub-time unit in each period. The first access information is sent by the terminal node in response to the first broadcast information and is used by the terminal node to request access to the first management node. In this embodiment, the first sub-time unit can also be referred to as broadcast resource, and the second sub-time unit can also be referred to as access resource.

[0124] Understandably, the lengths of the first and second sub-time units can be the same or different. For example, the first sub-time unit may consist of two subframes, and the second sub-time unit may consist of one subframe; or, both the first and second sub-time units may consist of one subframe.

[0125] It should be noted that the first sub-time unit used for broadcast information transmission can also be multiple sub-time units. For example, two sub-time units. These multiple sub-time units are time-domain continuous. It is understood that the first sub-time unit in the embodiments of this application can also be replaced with at least one first sub-time unit. When the first sub-time unit is replaced with at least one first sub-time unit, the other descriptions and protection points of the embodiments of this application still apply.

[0126] For example, the second sub-time unit of each cycle is the next sub-time unit of the first sub-time unit of each cycle. It can be understood that when the first sub-time unit contains multiple subframes, the second sub-time unit is the next subframe of the last subframe in the first sub-time unit; or, when at least one first sub-time unit is multiple first sub-time units, the second sub-time unit is the next sub-time unit of the last sub-time unit among the multiple first sub-time units. For example, at least one first sub-time unit contains one or two first sub-time units.

[0127] The second sub-time unit corresponds to the first sub-time unit, or it can be described as: the second sub-time unit corresponds to the first broadcast information.

[0128] The first and second sub-time units can be configured to occur periodically, and their periods can be the periods or time units described above, such as 160ms. The position of the first sub-time unit can be the same within each period, and the position of the second sub-time unit can also be the same within each period. For example, the position of the first sub-time unit in each period could be the second subframe out of 160 subframes, and the position of the second sub-time unit in each period could be the third subframe out of 160 subframes. In other words, the time interval between the first and second sub-time units within the same period can be the same. This time interval can be, for example, one subframe.

[0129] The first time period is the first time period after synchronization is completed according to the first broadcast information. Its first time unit is the first time unit after synchronization is completed according to the first broadcast information. The first time unit after synchronization is completed according to the first broadcast information can be the time unit after synchronization is completed according to the first broadcast information, or the next time unit after synchronization is completed according to the first broadcast information, or the time unit where the first second sub-time unit after synchronization is completed according to the second broadcast information is located.

[0130] Optionally, the number of multiple time units within the first time period is preset, default, determined according to higher-level parameters, or indicated by the first broadcast information. It is understood that the indication by the first broadcast information can be direct or indirect. Specifically, in the scheme where the number of multiple time units within the first time period or the number of sub-time units of multiple second sub-time units is indicated by the first broadcast information, the first management node can estimate and broadcast an appropriate number of multiple time units within the first time period or the number of sub-time units of multiple second sub-time units based on the number of terminal nodes in the current scenario. For example, if the number of terminal nodes is large, the number of time units broadcast by the first management node can be large. Since terminal nodes can select time units within a wider range to send first access information, the probability of collisions between access information sent by multiple terminal nodes can be reduced to a greater extent. Conversely, if the number of terminal nodes is small, the number of time units broadcast by the first management node can be small, so that terminal nodes can connect to the first management node as quickly as possible.

[0131] Regarding the number of multiple time units within the first time period, and any one or more of the minimum, maximum, threshold, or limit values ​​described below, the indicated value is used when there is an indication in the broadcast information; when there is no indication in the broadcast information, a pre-configured value, a default value, or a value determined according to higher-level parameters is used. For example, when the broadcast information occupies one time unit, it can be used to indicate at least one of the above five values, that is, at least one of the above five values ​​is determined according to the indication in the broadcast information; when the broadcast information occupies two consecutive time units, at least one of the above five values ​​can use a pre-configured value, a default value, or a value determined according to higher-level parameters. It is understood that the above five values ​​can be determined in different ways.

[0132] In the access method provided in this application embodiment, a terminal node can send first access information at any time unit within a first time period. Since different terminal nodes may determine different time units for sending access information within the first time period, the access method provided in this application embodiment helps avoid multiple terminal nodes using the same access resource to send access information, thereby reducing the probability of collisions between access information sent by multiple terminal nodes. On the one hand, this helps the first management node to correctly demodulate the access information sent by multiple terminal nodes, improving the access success rate; on the other hand, it helps the communication system accommodate more terminal nodes, or increases the number of terminal nodes that can simultaneously access the first management node.

[0133] Step S302 above can be understood as the first execution of the access method provided in this application embodiment, or it can be understood as the Mth execution of the access method provided in this application embodiment. Here, M is an integer greater than 1. In other words, step S302 above can be understood as the terminal node's first attempt to access the first management node, or it can be understood as the terminal node's Mth attempt to access the first management node.

[0134] When step S302 above is understood as the terminal node's first attempt to access the first management node, the first time unit within the first time period is the first time unit after the terminal node completes synchronization based on the first broadcast information, including the first time unit of the second sub-time unit. It can be understood that "after completing synchronization based on the first broadcast information" could also mean after the terminal node has finished processing the first broadcast information, or after the terminal node is ready to begin the access process; this is not limited here.

[0135] Optionally, if a terminal node fails to access the system based on the first access information and the number of times the first access information is sent is less than a threshold, or if a terminal node fails to access the system based on the first access information and the number of multiple time units within the first time period does not reach its maximum value, the access method provided in this application embodiment further includes: the terminal device sending the first access information in any time unit among the multiple time units within the second time period; wherein the number of multiple time units within the second time period is greater than or equal to the number of multiple time units within the first time period. This scheme can be understood as the terminal node attempting to access the first management node for the second or M+1th time. In other words, step S302 can be understood as the terminal node's previous attempt to access the first management node, and this scheme can be understood as the terminal node's subsequent attempt to access the first management node. That is, step S302 and this scheme describe two adjacent attempts by the terminal node to access the first management node. In this scheme, the terminal node first sends the first access information within a shorter first time period. If access fails, the terminal node can send the first access information within a longer second time period. Since the terminal node can select time units to send the first access information within a wider range, the probability of collisions between access information sent by multiple terminal nodes can be reduced to a greater extent.

[0136] Sending the first access information at any time unit within the multiple time units of the second time period can be understood as sending the first access information at a second sub-time unit within any time unit of the multiple time units of the second time period. The correspondence between the second sub-time unit and the first sub-time unit is as described above.

[0137] In one possible implementation, the terminal node first sends first access information in any one of multiple time units within a first time period. If access fails, it sends first access information in any one of multiple time units within a second time period. The number of multiple time units in the second time period is equal to the number of multiple time units in the first time period, and so on, until the number of times the first access information is sent equals a threshold. That is, if the terminal node fails to access based on the first access information and the number of times the first access information is sent is less than the threshold, a next access attempt is made, and so on. The number of multiple time units is preset, default, determined according to higher-layer parameters, or indicated by the first broadcast information.

[0138] Optionally, the threshold can be preset, default, determined based on higher-level parameters, indicated by the first broadcast information, or correspond to a first time period. In this scheme, when the threshold corresponds to the first time period, the total time for terminal nodes to attempt access can be limited. For example, if the first time period is short, the threshold value can be larger; if the first time period is long, the threshold value can be smaller.

[0139] For example, the length of the time period corresponding to each access attempt by the terminal node can be the same, constant, fixed, or a fixed value. For instance, the length of the time period corresponding to the terminal node's first access attempt can be 4 time units; if the first access attempt fails, the length of the time period corresponding to the terminal node's second access attempt is still 4 time units; if the second access attempt fails, the length of the time period corresponding to the terminal node's third access attempt is still 4 time units. Similarly, the terminal node can make multiple access attempts until a threshold is reached. When the length of the time period corresponding to each access attempt is 4 time units, the threshold can be 16; when the length of the time period corresponding to each access attempt is 50 time units, the threshold can be 8; when the length of the time period corresponding to each access attempt is 100 time units, the threshold can be 4; and when the length of the time period corresponding to each access attempt is 500 time units, the threshold can be 1.

[0140] In one possible implementation, the terminal node first sends first access information in any one of multiple time units within a first time period. At this time, the number of multiple time units is at its minimum. When access fails, the terminal node sends first access information in any one of multiple time units within a second time period. The number of multiple time units in the second time period is greater than the number of multiple time units in the first time period, and so on, until the number of multiple time units within the time period reaches its maximum. That is, if the terminal node fails to access based on the first access information, and the number of multiple time units within the first time period has not reached its maximum, the number of multiple time units within the time period is increased, and another access attempt is made, and so on. The number of multiple time units within the time period of the first access attempt is the minimum, and the maximum number of multiple time units within the possible access time period is the maximum. The minimum is preset, default, determined by higher-layer parameters, or indicated by the first broadcast information, and the maximum is preset, default, determined by higher-layer parameters, or indicated by the first broadcast information. It is understood that the methods for determining the minimum and maximum can be different. For example, the minimum is preset, and the maximum is indicated by the first broadcast information.

[0141] Optionally, in each access attempt, the number of time units contained in the time interval is between a minimum and a maximum value, determined from smallest to largest within a given sequence. It is understood that both the minimum and maximum values ​​are values ​​determined from the given sequence. Optionally, the maximum value is greater than or equal to the minimum value.

[0142] For example, the given sequence is {4, 20, 50, 100, 200, 300, 400, 500}. For instance, if the minimum value is determined to be 4 and the maximum value to be 100, then the first access attempt sends access information in any time unit within a time period containing 4 time units. If the access fails, the second attempt sends access information in any time unit within a time period containing 20 time units. If that also fails, access information is then sent in any time unit within time periods containing 50 and 100 time units, respectively. Optionally, the given sequence can also be referred to as a set of candidate values.

[0143] For example, the sequence (hereinafter referred to as the "length sequence") actually used by the terminal node when attempting to access the network can be part or all of a given sequence. The given sequence can be predefined, preconfigured, configured, or determined based on higher-level parameters. For example, the given sequence could be {4, 20, 50, 100, 200, 300, 400, 500…}. It should be noted that the sequences or sets given in this embodiment are not required to include all values; they may include only some values, and / or include values ​​other than those given in the sequence or set. This is not limited here.

[0144] In one possible implementation, the terminal node can obtain the given sequence described above. The first broadcast information may carry the minimum and maximum values ​​of the length sequence. For example, the first broadcast information may carry 20 and 300. After receiving the first broadcast information, the terminal node can determine that the length sequence of the time period corresponding to the multiple access attempts is {20, 50, 100, 200, 300}.

[0145] Optionally, the numerical values ​​in the given sequence have an exponential relationship, or increase exponentially. For example, powers of 2. For instance, {2} 2 ,2 3 ,2 4 ,2 5 ,2 6 ,2 7 ,2 8 ,2 9The sequence {4, 8, 16, 32, 64, 128, 256, 512} represents the exponential relationship between the number of time units within the first and second time periods. For example, powers of 4 or 5. For instance, if the minimum value is 4 and the maximum value is 512, the length of the time period corresponding to the terminal node's first access attempt could be 4 time units; if the first access attempt fails, the length of the time period corresponding to the terminal node's second access attempt could be 8 time units; if the second access attempt fails, the length of the time period corresponding to the terminal node's third access attempt could be 16 time units; and so on. If the eighth access attempt fails, the length of the time period corresponding to the terminal node's ninth access attempt could be 512 time units. Similarly, the terminal node can make multiple access attempts according to the length sequence until a threshold is reached, or until the length of the time period corresponding to the terminal node's access attempt reaches the maximum value in the length sequence.

[0146] Wherein, n or N can be preset, default, determined according to higher-level parameters, or indicated by the first broadcast information. Optionally, when the minimum and / or maximum values ​​are determined by the first broadcast indication, different state values ​​of the indication information correspond to different powers in the given sequence. For example, the indication information can be represented by 3 bits, where 000, 001, 010, 011, 100, 101, 110, and 111 correspond to powers of 2, 3, 4, 5, 6, 7, 8, and 9, respectively. The first management node can estimate and broadcast a suitable value for n, which should not be too small to avoid a high failure rate or collision rate in the first few attempts due to a large number of terminal nodes; the first management node can also estimate and broadcast a suitable value for N to control the number of times a terminal node attempts to access. Optionally, when the minimum and / or maximum values ​​are determined by the first broadcast indication, different state values ​​of the indication information correspond to different values ​​in the given sequence. For example, the indication information can be represented by 3 bits, where 000, 001, 010, 011, 100, 101, 110, and 111 correspond to 4, 8, 16, 32, 64, 128, 256, and 512 bits, respectively.

[0147] Optionally, the numerical values ​​in the given sequence are in a multiple relationship. Optionally, the number of multiple time units in the second time period is k times the number of multiple time units in the first time period, where k is an integer greater than 1. For example, k = 2 or 5. For example, {4, 20, 100, 500}. Optionally, when the minimum and / or maximum values ​​are determined by the first broadcast indication, different state values ​​of the indication information correspond to different numerical values ​​in the given sequence. For example, the indication information can be represented by 3 bits, where 000, 001, 010, 011, 100, 101, 110, and 111 correspond to 4, 20, 50, 100, 200, 300, 400, and 500, respectively.

[0148] In this embodiment of the application, the number of times the first access information is sent can be understood as the number of times the terminal node attempts to access the first management node.

[0149] Optionally, a terminal node's failure to access the network based on the first access information includes: the terminal node not receiving a response message for the first access information during the timer's execution. For example, the response message for the first access information could be Msg2.

[0150] Optionally, the first time unit within the second time period is either the time unit in which the terminal node fails to access the network based on the first access information, or the first time unit after the terminal node fails to access the network based on the first access information. In this scheme, the second time period can start as early as possible after the access failure, which helps to reduce access latency.

[0151] In this embodiment, if the access failure occurs first, and the second sub-time unit included in the time unit where the access failure occurs occurs later, then the first time unit in the second time period is: the time unit in which the terminal node fails to access based on the first access information. If the second sub-time unit included in the time unit where the access failure occurs occurs first, and the access failure occurs later, then the first time unit in the second time period is: the first time unit after the terminal node fails to access based on the first access information.

[0152] Optionally, access failure refers to the timer corresponding to the first access information timing out. This timer can be understood as the waiting time for Msg2 corresponding to the first access information. That is, if the terminal node has not received Msg2 corresponding to the first access information when the timer expires, the access fails. For example, the first time unit of the second time period is the first time unit after the timer expires, including the second sub-time unit. The second time period, after the timer expires, avoids the terminal node invalidally retransmitting the first access information when the actual access is successful but Msg2 has not yet been sent. This achieves the technical effect of saving terminal node power consumption and avoiding the occupation of access resources.

[0153] Optionally, the first time unit within the second time period can also be: the time unit following the last time unit included in the first time period; or, the first time unit included in the first time period.

[0154] For any time period other than the first time period after synchronization is completed according to the first broadcast information (such as the second time period), the first time unit of each subsequent access attempt is the first time unit after the previous access failure. The first time unit after the previous access failure can be the time unit where the previous access failure occurred, or the next time unit after the time unit where the previous access failure occurred, or the time unit containing the first second sub-time unit after the previous access failure.

[0155] Understandably, the first time period and / or the second time period include multiple time units that are consecutive in the time domain.

[0156] Taking a terminal node as T1 or T2, a first management node as G1, a cycle length of 160ms, a first time period of 4 cycles, and a second time period of 8 cycles as an example. Figure 4 This diagram illustrates nodes T1 and T2 attempting to connect to node G1. For descriptions of access and broadcast resources, please refer to [link to relevant documentation]. Figure 1 That will not be elaborated upon. The following is a description of the events in chronological order.

[0157] On s1, nodes T1 and T2 receive broadcast messages from node G1.

[0158] On s2, node T1 completes synchronization based on broadcast information from node G1. Optionally, within the time range for receiving broadcast information, node T1 can also receive broadcast information from other G nodes besides node G1 and determine node G1 as the target node for attempted access. Optionally, node G1 is the management node with the highest signal strength within the time range for receiving broadcast information from node G1 and other selectable G nodes. It is understood that node T1 processes the broadcast information received from node G1 and other selectable G nodes within this time range, and the processing is completed at s2. Afterwards, node T1 can randomly select a period or access resource within its corresponding first time period to send access information. For example, node T1 can choose the period containing s5, or node T1 can choose the access resource located on s5.

[0159] On s3, node T2 completes synchronization based on broadcast information from node G1. Optionally, within the time range of broadcast information reception, node T2 can also receive broadcast information from other G nodes besides node G1 and determine node G1 as the target node for attempted access. Optionally, node G1 is the management node with the highest signal strength within the time range of receiving broadcast information from node G1 and other selectable G nodes. Understandably, node T2 processes the broadcast information received from node G1 and other selectable G nodes within this time range, and the processing is completed at s3. In actual implementation, nodes T1 and T2 can also complete synchronization on the same subframe. Afterwards, node T2 can randomly select a period or access resource within its corresponding first time period to send access information. For example, node T2 can choose the period where s6 is located, or node T2 can choose the access resource located on s6.

[0160] On s5, node T1 sends access information to node G1.

[0161] On s6, node T2 sends access information to node G1.

[0162] On s7, the timer for node T1 expires, but Msg2 is still not received. Afterwards, node T1 can randomly select a period or access resource within its corresponding second time period to send access information. For example, node T1 can choose the period containing s9, or it can choose the access resource located on s9.

[0163] On s8, the timer for node T2 expired, but Msg2 was still not received. Afterwards, node T2 can randomly select a period or access resource within its corresponding second time period to send access information. For example, node T2 can choose the period containing s10, or it can choose the access resource located on s10.

[0164] On s9, node T1 sends access information to node G1 again.

[0165] On s10, node T2 sends access information to node G1 again.

[0166] from Figure 4 As can be seen, when node T1 first attempted to connect to G1, it sent the access information on s5, while node T2 sent it on s6. That is, the timing of the first access information transmissions by nodes T1 and T2 was different, and no collision occurred. When node T1 second attempted to connect to G1, it sent the access information on s9, while node T2 sent it on s10. Again, the timing of the second access information transmissions by nodes T1 and T2 was different, and no collision occurred.

[0167] In one possible implementation, the first access information is scrambled using a first SLSS ID. If the terminal node fails to access the network based on the first access information, and the number of times the first access information is sent is greater than or equal to a threshold, or if the terminal node fails to access the network based on the first access information, and the number of multiple time units within the first time period reaches a maximum value, the access method provided in this application further includes: the terminal node sending second access information to the first management node at any time unit within the multiple time units of the third time period; correspondingly, the first management node receives the second access information; wherein the number of multiple time units within the third time period is equal to the number of multiple time units within the first time period, and the second access information is scrambled using a second SLSS ID. For example, the number of multiple time units included in the third time period is equal to the number of time units included in the first time period when it is the first access attempt, that is, equal to the minimum value of the number of multiple time units included in the aforementioned first time period. In this scheme, after multiple access failures, the terminal node can reselect an SLSS ID to access the network again, thereby further improving the access success rate.

[0168] In the embodiments of this application, the first SLSS ID and the second SLSS ID may be the same or different, and there is no limitation.

[0169] Understandably, the SLSS ID can be replaced with an identifier. For example, the SLSS ID can be replaced with an identifier used for synchronization and / or access.

[0170] Optionally, the first time unit included in the third time period is: the first time unit including the second sub-time unit after the timer expires.

[0171] For example, the number of multiple time units in the third time period can be equal to the number of multiple time units in the time period corresponding to the first access attempt of the terminal node, that is, it can be equal to the minimum value in the length sequence (the minimum value of the number of multiple time units contained in the first time period mentioned above).

[0172] Optionally, after the terminal node reselects the SLSS ID, it can continue to make multiple access attempts according to the length sequence.

[0173] The following example illustrates the concept of a sequence with lengths of (4, 8, 16, ..., 512) and a threshold of 12.

[0174] The length of the time period corresponding to the first access attempt by the terminal node can be 4 time units.

[0175] If the first access attempt fails, the length of the time period corresponding to the second access attempt by the terminal node can be 8 time units.

[0176] If the second access attempt fails, the length of the time period corresponding to the third access attempt by the terminal node can be 16 time units.

[0177] Similarly, if the 8th access attempt fails, the time period corresponding to the terminal node's 9th access attempt can be 512 time units, reaching the maximum value. During the first 9 access attempts, the terminal node can scramble the first access information sent to the first management node using the first SLSS ID.

[0178] If the 9th access attempt fails, the time period corresponding to the 10th access attempt by the terminal node can be 4 time units. Furthermore, during the 10th access attempt, the terminal node can reselect the SLSS ID to scramble the access information. That is, during the 10th and subsequent access attempts, the second access information sent by the terminal node to the first management node can be scrambled using the second SLSS ID.

[0179] If the 10th access attempt fails, the length of the time period corresponding to the terminal node's 11th access attempt can be 8 time units.

[0180] If the 11th access attempt fails, the time period corresponding to the terminal node's 12th access attempt can be 16 time units. At this point, the number of access attempts made by the terminal node has reached the threshold, and the terminal node will stop making access attempts.

[0181] During the above access attempts, the first time unit corresponding to the terminal node's first access attempt is the first time unit after the terminal node completes synchronization according to the first broadcast information, including the first time unit of the second sub-time unit. The first time unit corresponding to the terminal node's second to twelfth access attempts is the first time unit after the timer expires, including the first time unit of the second sub-time unit. The timer is started when the terminal node last sent the first access information.

[0182] In another possible implementation, the first broadcast information comes from the first management node, and the first access information is scrambled using the first SLSS ID. If the terminal node fails to access the network based on the first access information, and the number of times the first access information is sent is greater than or equal to a threshold, or if the terminal node fails to access the network based on the first access information, and the number of multiple time units within the first time period reaches its maximum value, the access method provided in this application embodiment further includes: the second management node sending second broadcast information; correspondingly, the terminal node receiving the second broadcast information from the second management node. In response to the second broadcast information, the terminal node sends second access information to the second management node at any time unit within the fourth time period; correspondingly, the second management node receives the second access information. The second access information is scrambled using the second SLSS ID. In this scheme, after multiple access failures, the terminal node can reselect the management node and SLSS ID to attempt access again, thereby further improving the access success rate.

[0183] Optionally, the length of the fourth time period can be preset, default, determined according to higher-level parameters, or indicated by the second broadcast information. For a description of the length of the fourth time period, please refer to the description of the length of the first time period above. The length of the fourth time period can be the same as or different from the length of the first time period; there is no restriction.

[0184] In this embodiment of the application, the length sequence used by the terminal node when attempting to access the first management node (i.e., the length sequence corresponding to the first management node) may be the same as or different from the length sequence used by the terminal node when attempting to access the second management node (i.e., the length sequence corresponding to the second management node).

[0185] For example, the number of multiple time units within the fourth time period can be equal to the minimum value in the length sequence corresponding to the second management node.

[0186] Optionally, the first time unit included in the fourth time period is the first time unit including the second sub-time unit after the terminal node completes synchronization according to the second broadcast information.

[0187] For example, the second management node can be the management node with the highest signal quality or signal strength among multiple management nodes. In this case, the second management node and the first management node can be the same management node or different management nodes. Alternatively, the second management node can be the management node with the highest signal quality or signal strength other than the first management node among multiple management nodes. In this case, the second management node and the first management node can be different management nodes.

[0188] Among these, multiple management nodes are those discovered by the terminal nodes. In other words, the terminal node can receive broadcast information sent by multiple management nodes.

[0189] Optionally, if a terminal node fails to access the network based on the first access information, and the number of multiple time units within the first time period reaches its maximum value, but the number of times the first access information is sent is less than a threshold, the terminal node may attempt to access the network multiple times until the number of times the first access information is sent reaches the threshold. The length of the time period corresponding to these multiple access attempts can be the maximum value. If multiple access attempts still fail, the terminal node may reselect an SLSS ID to access the network again, or the terminal node may reselect a management node and SLSS ID to attempt access again.

[0190] Understandably, unless otherwise specified, the access process for the second access information can be referenced from the first access information, and will not be repeated here.

[0191] In this application's embodiments, "access failure" can be understood as "access failure once or multiple times." For example, a terminal node can attempt to access the network in 4 time units. If access fails, the terminal node can continue to attempt access in 4 time units until the number of failures reaches a threshold. Then, the terminal node can attempt to access the network in 8 time units. If access fails, the terminal node can continue to attempt access in 8 time units until the number of failures reaches a threshold. Afterward, the terminal node can attempt to access the network in 16 time units, and so on. The threshold can be preset, default, determined based on higher-layer parameters, or indicated by the first broadcast information. The following provides an example of the access method provided in this application's embodiments.

[0192] 1) Example 1

[0193] The terminal node can use the selected SLSS ID 1 to attempt access according to the minimum value in the length sequence; if access fails, the terminal node can attempt access according to the next value in the length sequence, and so on, until the number of times the first access information is sent reaches the threshold.

[0194] 2) Example 2

[0195] The terminal node can use the selected SLSS ID 1 to attempt to connect according to the minimum value in the length sequence; if the connection fails, the terminal node can attempt to connect according to the next value in the length sequence, and so on, until the maximum value in the length sequence is reached.

[0196] 3) Example 3

[0197] Based on Example 2, if access still fails, the terminal node can continue to attempt access according to the maximum value in the length sequence until the number of times the first access information is sent reaches the threshold.

[0198] For example, if the length sequence is {4 8 16} and the threshold is 4, then the number of time units that the terminal node attempts to access in the corresponding time period each time is 4, 8, 16, and 16 respectively.

[0199] 4) Example 4

[0200] If the connection still fails to connect based on Examples 1, 2, or 3 above, the terminal node can then reselect an SLSSID to attempt connection again. That is, the terminal node can use the selected SLSS ID 2 to repeat Examples 1, 2, or 3 above, starting from the minimum value in the length sequence.

[0201] SLSS ID 2 and SLSS ID 1 can be the same or different.

[0202] In Examples 1 through 4, the target management node that the terminal node attempts to access is always the first management node, and the terminal nodes can use the same length sequence. This can be understood as follows: when attempting to access the network by reselecting the SLSS ID, the minimum and maximum values ​​of its length sequence are the same as the minimum and maximum values ​​of the length sequence before the SLSS reselection.

[0203] 5) Example 5

[0204] Based on Examples 1, 2, or 3 above, if access still fails, the terminal node reselects the SLSS ID, re-searches for broadcast information, and reselects the target management node to attempt access. Assume the reselected target management node is the second management node. Understandably, the terminal node redetermines the length sequence. Optionally, the redetermined length sequence can be referred to as the new length sequence. The method for determining the new length sequence is the same as the method for determining the length sequence described above. For example, the method for determining the minimum and / or maximum value of the new length sequence is the same as the method for determining the length sequence described above. This new length sequence is used by the terminal node to attempt access using the reselected SLSS ID. For example, if the second broadcast information sent by the second management node indicates a maximum and / or minimum value, then the new length sequence is determined based on the maximum and / or minimum value indicated in the second broadcast information. The specific method can be referred to above, and will not be repeated here.

[0205] Similarly, the number of multiple time units, thresholds, or threshold values ​​within a time period are also redefined. For details, please refer to the description of redefined new length sequences, maximum values, and minimum values.

[0206] Optionally, the first time unit of the first time period in which the SLSS ID is reselected for access is the first time unit after the last access failure before the SLSS ID reselection. It is understood that the first time unit after the last access failure before the SLSS ID reselection can be the time unit where the last access failure occurred, or the next time unit after the last access failure, or the time unit containing the first second sub-time unit after the last access failure. For example, this first time period is the fourth time period. It is understood that the first time unit of each subsequent access attempt is the first time unit after the previous access failure. Here, the first time unit after the previous access failure can be the time unit where the previous access failure occurred, or the next time unit after the previous access failure, or the time unit containing the first second sub-time unit after the previous access failure.

[0207] After synchronization is completed based on the second broadcast information, the terminal node can use the reselected SLSS ID 2 to attempt to access the second management node, starting from the minimum value in the new length sequence, in accordance with the methods described in Examples 1, 2, or 3 above.

[0208] The first management node and the second management node can be the same management node or different management nodes.

[0209] In Examples 4 and 5 above, in one possible implementation, after reselecting the SLSS ID, the number of times the first access information is sent can be reset to 0. In another possible implementation, after reselecting the SLSS ID, the number of times the first access information is sent is not reset; that is, the number of times the first access information is sent remains continuous after and before the reselection of the SLSS ID.

[0210] The above example represents the case where the terminal node attempts to access the corresponding time period multiple times in a subsequent attempt compared to the previous attempt. The following example represents the case where the terminal node attempts to access the corresponding time period multiple times with a fixed number of time units each time, that is, the number of time units that the terminal node attempts to access the corresponding time period multiple times remains unchanged each time.

[0211] 6) Example Six

[0212] The terminal node can use the selected SLSS ID 1 to attempt access according to the number of time units within that time period; if access fails, the terminal node can still attempt access according to the number of time units within that time period, and so on, until the number of times the first access information is sent reaches the threshold.

[0213] 7) Example 7

[0214] Building upon Example 6, if access still fails, the terminal node can reselect an SLSS ID and attempt to access again. That is, the terminal node can use the selected SLSS ID 2 to attempt access according to the number of time units within that time period; if access fails, the terminal node can still attempt access according to the number of time units within that time period, and so on, until the number of times the first access information is sent reaches the threshold. In other words, after reselecting the SLSS ID, the method for attempting access is the same as in Example 6.

[0215] SLSS ID 2 and SLSS ID 1 can be the same or different.

[0216] In Examples 6 and 7, the target management node that the terminal node attempts to access is the first management node, and the terminal node can use the number of time units within the same time period.

[0217] 8) Example 8

[0218] Based on Example 6 above, if the access still fails, the terminal node reselects the SLSS ID, searches for broadcast information again, and reselects the target management node to attempt access.

[0219] Assume the reselected target management node is the second management node. Understandably, the terminal node redetermines the number of time units within this time period. Optionally, the redetermined number of time units within the time period can be referred to as the new number of time units within the time period. The method for determining the new number of time units within the time period is the same as the method for determining the number of time units within the aforementioned time period. This new number of time units within the time period is used by the terminal node to attempt access using the reselected SLSS ID. For example, if the second broadcast message sent by the second management node indicates the number of time units within the time period, then the new number of time units within the time period is determined based on the maximum and / or minimum value indicated in the second broadcast message. The specific method can be referred to the above, and will not be repeated here.

[0220] Similarly, one or more of the thresholds or limits are also redefined. For details, please refer to the description of redefined number of time units in the new time period.

[0221] Optionally, the first time unit of the first time period in which the SLSS ID is reselected for access is the first time unit after the terminal node completes synchronization according to the second broadcast information. For example, this first time period is the fourth time period. It is understood that the first time unit after synchronization according to the second broadcast information can be the time unit in which synchronization is completed according to the second broadcast information, or the next time unit after synchronization is completed according to the second broadcast information, or the time unit containing the first second sub-time unit after synchronization is completed according to the second broadcast information. It is understood that, except for the time period of the first access attempt after reselecting the SLSS ID (i.e., the first time period), the first time unit of each subsequent access attempt is the first time unit after the previous access failure. Here, the first time unit after the previous access failure can be the time unit where the previous access failure occurred, or the next time unit after the previous access failure, or the time unit containing the first second sub-time unit after the previous access failure.

[0222] The terminal node can use the reselected SLSS ID 2 to attempt access according to the number of time units within the new time period. If access fails, the terminal node can still attempt access according to the number of time units within the new time period, and so on, until the number of times the first access information is sent reaches the threshold, at which point it can attempt to access the second management node. This can be understood as the method for attempting access after reselecting the SLSS ID and re-determining the number of time units within the new time period, as shown in Example 6.

[0223] The first management node and the second management node can be the same management node or different management nodes.

[0224] In Examples 7 and 8 above, in one possible implementation, the number of times the first access information is sent can be reset to 0 after the SLSS ID is reselected. In another possible implementation, the number of times the first access information is sent is not reset after the SLSS ID is reselected; that is, the number of times the first access information is sent remains continuous after the SLSS ID is reselected and before the SLSS ID is reselected.

[0225] The above description of the access method provided in the embodiments of this application is from the perspective of "time units". An alternative description is given below, wherein the following M second sub-time units can be located within the aforementioned first time period, and the following K second sub-time units can be located within the aforementioned second time period. M can be understood as the length of the first time period, or the number of time units contained in the first time period; K can be understood as the length of the second time period, or the number of time units contained in the second time period. The relevant descriptions of the first and second sub-time units, as well as the technical effects of the access method provided in the embodiments of this application, can be found in the foregoing embodiments and will not be repeated here.

[0226] In this process, the first management node sends a first broadcast message in the first sub-time unit; correspondingly, the terminal node receives the first broadcast message from the first management node in the first sub-time unit. Responding to the first broadcast message, the terminal node sends first access information in any of the M second sub-time units, where M is an integer greater than 1, and the second sub-time units correspond to the first sub-time units.

[0227] Optionally, if the terminal node fails to access the network based on the first access information and the number of times the first access information is sent is less than a threshold, or if the terminal node fails to access the network based on the first access information and M does not reach its maximum value, the access method provided in this application embodiment further includes: the terminal node sending the first access information to the first management node in any of the K second sub-time units. Correspondingly, the first management node receives the first access information from the terminal node. Wherein, K is an integer greater than or equal to M.

[0228] Optionally, K is k times M, where k is an integer greater than 1.

[0229] Optionally, the first access information is scrambled using a first SLSS ID. If the terminal node fails to access the network based on the first access information, and the number of times the first access information has been sent is greater than or equal to a threshold, or if the terminal node fails to access the network based on the first access information, and M reaches its maximum value, the access method provided in this embodiment further includes: the terminal node sending second access information to the first management node in any of the M second sub-time units. Correspondingly, the first management node receives the second access information from the terminal node. The second access information is scrambled using a second SLSS ID.

[0230] Optionally, the first broadcast information comes from the first management node, the first sub-time unit corresponds to the first management node, and the first access information is scrambled using the first SLSS ID. If the terminal node fails to access based on the first access information and the number of times the first access information is sent is greater than or equal to a threshold, or if the terminal node fails to access based on the first access information and M reaches its maximum value, the access method provided in this application embodiment further includes: the second management node sending second broadcast information in the third sub-time unit; correspondingly, the terminal node receiving the second broadcast information from the second management node in the third sub-time unit; the terminal node responding to the second broadcast information sending second access information in any of the M fourth sub-time units; correspondingly, the second management node receiving the second access information from the terminal node. The third sub-time unit corresponds to the fourth sub-time unit, the third sub-time unit corresponds to the second management node, and the second access information is scrambled using the second SLSS ID.

[0231] In the embodiments of this application, different management nodes can send broadcast information at different times, that is, the first sub-time unit is usually different from the third sub-time unit.

[0232] Optionally, the threshold is preset, default, determined according to higher-level parameters, indicated by the first broadcast information, or corresponds to M.

[0233] Optionally, M is 2 n The maximum value is 2 N n is less than or equal to N, and both n and N are positive integers.

[0234] Optionally, M is preset, default, determined according to higher-level parameters, or indicated by the first broadcast information.

[0235] Optionally, the K second sub-time units are located after the terminal node fails to access the network based on the first access information. For example, the first second sub-time unit among the K second sub-time units is the first second sub-time unit after the terminal node fails to access the network based on the first access information.

[0236] Optionally, the M second sub-time units are located after the terminal node completes synchronization according to the first broadcast information. For example, the first second sub-time unit among the M second sub-time units is the first second sub-time unit after the terminal node completes synchronization according to the first broadcast information.

[0237] It is understandable that sending the first access information on the second sub-time unit of any time unit among multiple time units in the first time period is essentially the same as sending the first access information on any second sub-time unit among M second sub-time units. Therefore, the relevant statements can be substituted for each other and are mutually applicable.

[0238] It is understood that for other parts not specifically described, please refer to the foregoing description of the access method provided in the embodiments of this application from the perspective of "time unit".

[0239] Based on the above description of the timing of sending access information, in one possible implementation, the solution provided in this application embodiment is applicable to at least one of wireless communications such as Bluetooth (BT) communication, Sparklink (or Nearlink) communication, and Wi-Fi communication. In this application embodiment, BT and Bluetooth Low Energy (BLE) can refer to each other. Sparklink can include at least one of the following: Sparklink Low Energy (SLE), Sparklink Basic (SLB), or Sparklink Position (SLP). In this application embodiment, Sparklink and Sparklink Low Energy (SLE), Sparklink Basic (SLB), or Sparklink Position (SLP) can refer to each other.

[0240] The following describes some embodiments of the solution provided in this application.

[0241] Example 1:

[0242] Bluetooth (BT), Wi-Fi, and SparkLink (or NearLink) can all use the 2.4GHz or 5GHz frequency bands and have similarities. Some modules can be reused, thus saving chip cost, area, and power consumption. Chip resources can be highly reused, allowing for rapid iteration of multiple chips.

[0243] Wi-Fi and SLB can share a single RF architecture and path. For example... Figure 5 The diagram shown is a schematic representation of a chip architecture provided in an embodiment of this application. Figure 5 It is known that through design, resources such as central processing unit (CPU), radio frequency (RF) unit, analog baseband (ABB) unit, or modem can be shared, and some modules of media access control (MAC) layer can be reused, thereby saving chip area and reducing chip cost and power consumption.

[0244] like Figure 6The diagram shown is a schematic representation of another chip architecture provided in an embodiment of this application. Figure 6 It is known that the MAC units of BT, SLB and Wireless Fidelity (Wi-Fi) are implemented independently, while the RF units and Modem units of each mode are all shared.

[0245] like Figure 7 The diagram shown is a schematic representation of another chip architecture provided in an embodiment of this application. Figure 7 It can be seen that the MAC units of BT, SLB and Wi-Fi are implemented independently, and the Modems of BT, SLB and Wi-Fi are also implemented independently, while the RF units of each mode are all shared.

[0246] like Figure 8 The diagram shown is a schematic representation of another chip architecture provided in an embodiment of this application. Figure 8 It can be seen that the MAC units of BT, SLB and Wi-Fi are implemented independently. Some modes, such as Wi-Fi and SLB, share the same modem, while other modes, such as BT, have their modems implemented independently. All modes share the same RF.

[0247] Example 2:

[0248] The StarSpark chip can be manufactured using 14 / 28 / 40nm processes and packaged in chip-size packages (CSP), ball grid arrays (BGA), and quad flat no-lead (QFN) formats, employing either internal or external flash memory. Depending on the application scenario, at least one of the following subsystems can be integrated onto a single chip: power management unit (PMU), clock management unit (CMU), active optical network (AON), wireless local area network (WLAN), or BT, StarSpark, global navigation satellite system (GNSS), application (APP), and audio. This minimizes area, maximizes functionality, and improves performance and reliability.

[0249] This application provides a chip design approach where the stroboscopic subsystem is integrated with other subsystems onto a single chip. Depending on the product, the chip's subsystems can be tailored and combined, and the different subsystems are connected via a bus.

[0250] like Figure 9 The diagram shown is a schematic representation of a chip module framework provided in an embodiment of this application. Figure 9 It is understood that for products requiring BT or GNSS functional modules, and simultaneously needing to connect to Wi-Fi and satellite flash devices, Wi-Fi and SLB can be separated into different systems, and then combined with at least one of the following on a single chip: BT System, SLE System, GNSS System, Always On System, PMU, CMU, Flash memory, APP System, and Audio System. Different subsystems are connected via a bus.

[0251] like Figure 10 As shown, this is a schematic diagram of another chip module framework provided in an embodiment of this application. Figure 10 It is known that, in some embodiments, in order to save area and cost, Wi-Fi and SLB can be combined into one subsystem, and then combined with at least one of the following on a chip: BT System, SLE System, GNSS System, Always On System, PMU, CMU, Flash memory, APP System, AudioSystem, etc., with different subsystems connected to each other via a bus.

[0252] Example 3:

[0253] The Wi-Fi / SLB 2.4GHz band operates in the 2412–2472MHz range, while the BT / BLE / SLE band operates in the 2402–2480MHz range, which may cause mutual interference. Within the same core, SLB and Wi-Fi can allocate service time slots through software scheduling; however, there is a lack of unified scheduling for SLB and Wi-Fi / BT / BLE / SLE on different cores.

[0254] This application provides a communication coexistence scheme for SLB / Wi-Fi / SLE / BT / BLE. Based on whether SLB and Wi-Fi / SLE / BT / BLE share an antenna, the coexistence scenario is divided into coexistence with different antennas (using different antennas) and coexistence with the same antenna (using the same antenna), and different coexistence strategies are given.

[0255] For the coexistence of different antennas, if SLB and Wi-Fi coexist, it can be ensured that the transmit and receive frequencies of SLB and Wi-Fi are different (i.e., frequency division multiplexing). The software can handle this from the aspects of code division multiplexing, service cycle, and interval (i.e., frequency division multiplexing). If SLB and SLE / BT / BLE coexist, and the isolation requirement cannot be met, it is necessary to avoid the channels where SLE / BT / BLE is located (i.e., channel avoidance) to reduce the impact of SLE / BT / BLE. At the same time, an aggregation scheduling mechanism can be added to aggregate and centrally send SLE / BT / BLE data packets (i.e., aggregation scheduling) to reduce the probability of interference from SLE / BT / BLE.

[0256] For shared antenna coexistence, software static strategies or hardware arbitration time-division strategies (such as packet traffic arbitration, PTA) can be used. Frequency division multiplexing, code division multiplexing, and time division multiplexing can also be employed. The advantages of software static strategies are: low hardware requirements, minimal software modifications, and no dynamic radio frequency (RF) switching (such as RF recovery). The advantages of PTA strategies are: faster service state switching and finer granularity of switching time. Packet traffic arbitration (PTA) can also be called data packet traffic arbitration.

[0257] Taking the coexistence of SLB and SLE / BT / BLE as an example, such as Figure 11 The diagram shown is a framework illustration of a software static strategy provided in an embodiment of this application. Figure 11 As can be seen, the software static strategy can include: after SLB starts, the software configures the host to notify SLE / BT / BLE to exit the current RF path. In this scenario, SLE / BT / BLE can check the SLB startup flag, and the software can be configured to switch from the current RF path to another RF path. The chip needs to support software-configured switching.

[0258] Taking the coexistence of SLB and Wi-Fi as an example, such as Figure 12 The diagram shown is a framework illustration of a software static strategy provided in an embodiment of this application. Figure 12 As can be seen, the software static strategy can include: after SLB starts, the software configures the host to notify Wi-Fi to exit the current RF path. In this scenario, Wi-Fi can check the SLB startup flag, and the software can be configured to switch from the current RF path to another RF path. The chip needs to support software-configured switching.

[0259] For example, such as Figure 13The diagram illustrates a framework for a Transmission Protocol Arbitration (PTA) strategy provided in this application. The PTA can use an arbitrator to determine whether one or more of the following—SLB / Wi-Fi / SLE / BT / BLE—use the radio frequency (RF) and the RF occupancy status. For example, if an SLB needs to use the RF, it can request access from the arbitrator. The arbitrator can then decide whether the SLB is allowed to use the RF based on its access request, access policy, and actual occupancy status. The PTA architecture can be a two-line, three-line, or four-line architecture, etc., and can be designed and configured according to business requirements. Figure 13 As can be seen, the Transmission Arbitration (PTA) strategy includes time-division multiplexing of any combination of transmit (TX) and receive (RX) signals from each party in SLB / Wi-Fi / SLE / BT / BLE. The PTA module can transmit the occupancy status of the radio frequency channel to each party, using different level signals to indicate that the radio frequency channel is occupied by one or more of SLB / Wi-Fi / SLE / BT / BLE. This level signal is used to notify the software or hardware to perform the corresponding processing. Different services can also be assigned different PTA priorities, with higher-priority services able to preempt air interface resources.

[0260] It is understood that, in the above embodiments, the methods and / or steps implemented by the terminal node can also be implemented by components (e.g., chips, chip systems, or circuits) that can be used in the terminal node or by a device containing the terminal node; the methods and / or steps implemented by the first management node (or the second management node) can also be implemented by components (e.g., chips, chip systems, or circuits) that can be used in the first management node (or the second management node) or by a device containing the first management node (or the second management node).

[0261] It is understood that, in order to achieve the above-mentioned functions, the terminal node, the first management node, or the second management node includes the corresponding hardware structure and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware 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 each specific application, but such implementation should not be considered beyond the scope of this application.

[0262] This application embodiment can divide the terminal node, first management node, or second management node into functional modules according to the above method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division; other division methods may be used in actual implementation.

[0263] For example, the terminal node in the embodiments of this application can be adopted. Figure 14 This is implemented in the form of a communication device 1400. The communication device 1400 may include a transmitting module 1401 and a receiving module 1402. The communication device 1400 is used to implement the above... Figure 3 The terminal node function in the method embodiment shown, or the communication device 1400 is used to implement the above. Figure 4 The function of node T1 or node T2 in the method embodiment shown.

[0264] For example, when the communication device 1400 is used to implement Figure 3 In the method embodiment shown, the terminal node functions as follows: receiving module 1402 is used to receive first broadcast information; sending module 1401 is used to respond to the first broadcast information and send first access information in any time unit among multiple time units within a first time period.

[0265] For a more detailed description of the aforementioned transmitting module 1401 and receiving module 1402, please refer to [the relevant documentation]. Figure 3 and Figure 4 The relevant descriptions in the method embodiments shown.

[0266] In this embodiment, the communication device 1400 is presented in an integrated manner, divided into various functional modules. Here, "module" can refer to a specific ASIC, circuit, processor and memory executing one or more software or firmware programs, integrated logic circuit, and / or other devices that can provide the above-mentioned functions.

[0267] The transmitting module 1401 and receiving module 1402 in this application embodiment can be deployed in the Star Flash module, Bluetooth module or Wi-Fi module, or they can be deployed in other modules besides the Star Flash module, Bluetooth module or Wi-Fi module. This application embodiment does not specifically limit them in this regard.

[0268] This application embodiment also provides a method such as Figure 15 The communication device shown can be configured such that the first management node, the second management node, and the terminal node all adopt... Figure 15 The shown composition structure, or including Figure 15 The components shown. Figure 15 This is a schematic diagram of the composition of a communication device 150 provided in an embodiment of this application. The communication device 150 can be a first management node (or a second management node), or a chip or system-on-a-chip in the first management node (or the second management node); it can also be a terminal node, or a chip or system-on-a-chip in the terminal node.

[0269] The communication device 150 includes one or more processors 1501, a communication line 1502, and at least one communication interface. Figure 15 (This is merely an example illustration, using a communication interface 1504 and a processor 1501 as examples. Optionally, a memory 1503 may also be included.)

[0270] Processor 1501 may be a CPU, a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of programs according to the present application.

[0271] The communication line 1502 may include a path for connecting different components.

[0272] The communication interface 1504 can be a transceiver module used to communicate with other devices or communication networks, such as Ethernet, RAN, WLAN, etc. For example, the transceiver module can be a transceiver or a similar device. Optionally, the communication interface 1504 can also be a transceiver circuit located within the processor 1501, used to implement the processor's signal input and signal output.

[0273] The memory 1503 can be a device with storage functionality. For example, it can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions; random access memory (RAM) or other types of dynamic storage devices capable of storing information and instructions; electrically erasable programmable read-only memory (EEPROM); compact disc read-only memory (CD-ROM) or other optical disc storage; optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.); magnetic disk storage media or other magnetic storage devices; or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto. The memory can exist independently and be connected to the processor via communication line 1502. The memory can also be integrated with the processor.

[0274] The memory 1503 stores computer execution instructions for implementing the scheme of this application, and the processor 1501 controls the execution. The processor 1501 executes the computer execution instructions stored in the memory 1503, thereby implementing the access method provided in the embodiments of this application.

[0275] Alternatively, in this embodiment, the processor 1501 may execute the processing-related functions in the access method provided in the following embodiments of this application, and the communication interface 1504 may be responsible for communicating with other devices or communication networks. This embodiment does not specifically limit this.

[0276] The computer execution instructions in the embodiments of this application may also be referred to as application code, and the embodiments of this application do not specifically limit this.

[0277] In a specific implementation, as one example, the processor 1501 may include one or more CPUs, for example... Figure 15 CPU0 and CPU1 in the CPU.

[0278] In a specific implementation, as one example, the communication device 150 may include multiple processors, such as... Figure 15 Processors 1501 and 1507 are mentioned. Each of these processors can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor. A processor here can refer to one or more devices, circuits, and / or processing cores used to process data (such as computer program instructions).

[0279] In a specific implementation, as one embodiment, the communication device 150 may further include an output device 1505 and an input device 1506. The output device 1505 communicates with the processor 1501 and can display information in various ways.

[0280] The aforementioned communication device 150 can be a general-purpose device or a special-purpose device. For example, the communication device 150 can be a desktop computer, a portable computer, a network server, a handheld digital assistant (PDA), a mobile phone, a tablet computer, a wireless terminal device, a vehicle-mounted terminal device, an embedded device, or something else with... Figure 15 Devices with similar structures. This application does not limit the type of communication device 150 to any particular embodiment.

[0281] In a simplified embodiment, those skilled in the art will recognize that the communication device 1400 can employ... Figure 15 The communication device 150 shown is in the form of [example device].

[0282] for example, Figure 15 The processors 1501 and / or 1507 in the communication device 150 shown can invoke computer execution instructions stored in the memory 1503, causing the communication device 150 to execute the access method in the above-described method embodiment. Specifically, Figure 14 Some functions / implementations of the transmitting module 1401 and receiving module 1402 can be achieved via... Figure 15 The communication module connected to the communication interface 1504 in the middle is used to achieve this.

[0283] Since the communication device 150 provided in this embodiment can execute the above access method, the technical effects it can achieve can be referred to the above method embodiment, and will not be repeated here.

[0284] It should be noted that one or more of the above modules or units can be implemented by software, hardware, or a combination of both. When any of the above modules or units are implemented by software, the software exists as computer program instructions and is stored in memory. The processor can be used to execute the program instructions and implement the above method flow. The processor can be built into a SoC or ASIC, or it can be a separate semiconductor chip. In addition to the core that executes the software instructions for computation or processing, the processor may further include necessary hardware accelerators, such as field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), or logic circuits that implement dedicated logic operations.

[0285] When the above modules or units are implemented in hardware, the hardware can be any one or any combination of a CPU, microprocessor, digital signal processing (DSP) chip, microcontroller unit (MCU), artificial intelligence processor, ASIC, SoC, FPGA, PLD, application-specific digital circuit, hardware accelerator, or non-integrated discrete device, which can run the necessary software or perform the above method flow independently of software.

[0286] Optionally, embodiments of this application also provide a chip system, including: at least one processor and an interface, wherein the at least one processor is coupled to a memory via the interface, and when the at least one processor executes a computer program or instructions in the memory, the method in any of the above method embodiments is executed. In one possible implementation, the communication device further includes a memory. Optionally, the chip system may be composed of chips, or may include chips and other discrete devices; embodiments of this application do not specifically limit this.

[0287] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software programs, implementation can be, in whole or in part, in the form of a computer program product. This computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device containing one or more servers, data centers, etc., that can be integrated with the medium. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state disks, SSDs), etc.

[0288] Although this application has been described herein in conjunction with various embodiments, those skilled in the art, by reviewing the accompanying drawings, disclosure, and appended claims, will understand and implement other variations of the disclosed embodiments in carrying out the claimed application. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality. A single processor or other unit can implement several functions listed in the claims. While different dependent claims may recite certain measures, this does not mean that these measures cannot be combined to produce good results.

[0289] Although this application has been described in conjunction with specific features and embodiments, it is obvious that various modifications and combinations can be made thereto without departing from the spirit and scope of this application. Accordingly, this specification and drawings are merely exemplary illustrations of this application as defined by the appended claims, and are considered to cover any and all modifications, variations, combinations, or equivalents within the scope of this application. Clearly, those skilled in the art can make various alterations and modifications to this application without departing from the spirit and scope of this application. Thus, if such modifications and modifications of this application fall within the scope of the claims of this application and their equivalents, this application is also intended to include such modifications and modifications.

Claims

1. An access method, characterized by, The method comprises: receiving first broadcast information; in response to the first broadcast information, sending first access information in any time unit of a plurality of time units in a first time period.

2. The method of claim 1, wherein, The time unit is a period; The receiving first broadcast information comprises: receiving the first broadcast information in a first period; The first time period is located after the first period.

3. The method of claim 2, wherein, The period includes a plurality of sub-time units; The receiving the first broadcast information in the first period comprises: receiving the first broadcast information in a first sub-time unit in the first period; The sending the first access information in any time unit of a plurality of time units in a first time period comprises: sending the first access information in a second sub-time unit in any period; the second sub-time unit corresponds to the first sub-time unit.

4. The method according to any one of claims 1 to 3, characterized in that, In the case where the access according to the first access information fails, and the number of sending times of the first access information is less than a threshold value, or in the case where the access according to the first access information fails, and the number of time units in the first time period does not reach a maximum value, the method further comprises: sending the first access information in any time unit of a plurality of time units in a second time period; Wherein, the number of time units in the second time period is greater than or equal to the number of time units in the first time period.

5. The method of claim 4, wherein, The number of time units in the second time period is k times the number of time units in the first time period, and k is an integer greater than 1.

6. The method according to any one of claims 1 to 5, characterized in that, The first access information is scrambled by a first sidelink synchronization signal identifier (SLSSID); in the case where the access according to the first access information fails, and the number of sending times of the first access information is greater than or equal to a threshold value, or in the case where the access according to the first access information fails, and the number of time units in the first time period reaches a maximum value, the method further comprises: sending second access information in any time unit of a plurality of time units in a third time period; wherein, the number of time units in the third time period is equal to the number of time units in the first time period, and the second access information is scrambled by a second SLSSID.

7. The method according to any one of claims 1 to 5, characterized in that, The first broadcast information is from a first management node, and the first access information is scrambled by a first SLSSID; in the case where the access according to the first access information fails, and the number of sending times of the first access information is greater than or equal to a threshold value, or in the case where the access according to the first access information fails, and the number of time units in the first time period reaches a maximum value, the method further comprises: receiving second broadcast information from a second management node; in response to the second broadcast information, sending second access information in any time unit of a plurality of time units in a fourth time period; wherein, the second access information is scrambled by a second SLSSID.

8. The method according to any one of claims 4-7, characterized in that, The threshold value is preset, default, determined according to a high-level parameter, indicated by the first broadcast information, or corresponding to the first time period.

9. The method according to any one of claims 4-8, characterized in that, The number of time units in the first time period is 2 n The maximum value is 2 N n is less than or equal to N, n and N are positive integers.

10. The method according to any one of claims 1 to 9, characterized in that, A quantity of time units in the first time period is preset, default, determined according to a high-level parameter, or indicated by the first broadcast information.

11. The method of claim 4 or 5, wherein, The first time unit in the second time period is a time unit in which access fails according to the first access information, or a first time unit after access fails according to the first access information.

12. A communications device, characterized by The communication device comprises a sending module and a receiving module; The receiving module is configured to receive first broadcast information. The sending module is configured to send first access information on any time unit in a plurality of time units in a first time period in response to the first broadcast information.

13. The communication apparatus according to claim 12, wherein The time unit is a period; and the receiving module is specifically configured to receive the first broadcast information on a first period.

14. The communication apparatus according to claim 13, wherein The period comprises a plurality of sub-time units. The receiving module is specifically configured to receive the first broadcast information on a first sub-time unit in the first period. The sending module is specifically configured to send the first access information on a second sub-time unit in any period; and the second sub-time unit corresponds to the first sub-time unit.

15. The communication apparatus according to any one of claims 12-14, wherein, In a case where access fails according to the first access information and a quantity of times of sending the first access information is less than a threshold value, or in a case where access fails according to the first access information and a quantity of time units in the first time period does not reach a maximum value, The sending module is further configured to send the first access information on any time unit in a plurality of time units in a second time period. A quantity of time units in the second time period is greater than or equal to a quantity of time units in the first time period.

16. The communication apparatus according to any one of claims 12-15, wherein, The first access information is scrambled by a first sidelink synchronization signal identifier (SLSSID); in a case where access fails according to the first access information and a quantity of times of sending the first access information is greater than or equal to a threshold value, or in a case where access fails according to the first access information and a quantity of time units in the first time period reaches a maximum value, The sending module is further configured to send second access information on any time unit in a plurality of time units in a third time period. A quantity of time units in the third time period is equal to a quantity of time units in the first time period, and the second access information is scrambled by a second SLSSID.

17. The communication apparatus according to any one of claims 12-15, wherein, The first broadcast information is from a first management node, and the first access information is scrambled by a first SLSSID; in a case where access fails according to the first access information and a quantity of times of sending the first access information is greater than or equal to a threshold value, or in a case where access fails according to the first access information and a quantity of time units in the first time period reaches a maximum value, The receiving module is further configured to receive second broadcast information from a second management node. The sending module is further configured to send second access information on any time unit in a plurality of time units in a fourth time period in response to the second broadcast information. The second access information is scrambled by a second SL SSID.

18. A communications device, characterized by Comprising: a memory for storing a program, and a processor coupled to the memory, the processor being configured to execute the program stored in the memory; when the communication device is running, the processor executes the program, so that the communication device executes the method of any one of claims 1-11.

19. A computer-readable storage medium, characterized in that, A computer program stored thereon, which, when executed by a computer, causes the computer to perform the method of any one of claims 1-11.

20. A computer program product comprising computer programs or instructions, characterized in that, The computer program or instructions, when executed by a processor, implement the method of any one of claims 1-11.

21. A communication system, characterized by Comprising a management node, and a terminal node for executing the method of any one of claims 1-11.

Images