Communication method and apparatus

Abstract

The present application relates to the technical field of communications, and provides a communication method and an apparatus. In the method, a RAN node may send a broadcast message to indicate N timing advances to a terminal, wherein amongst the N timing advances, different timing advances are associated with different regions, and N is an integer greater than 1. After receiving the broadcast message, the terminal may send first information to the RAN node for each of the N timing advances, any one of the N pieces of first information indicating a timing advance corresponding to said first information. If first information received by the RAN node in a first time window indicates a first timing advance, then the RAN node sends to the terminal second information used for indicating the first timing advance, such that the terminal determines to communicate with the RAN node on the basis of the first timing advance. Thus, the method allows terminals far away from RAN nodes to access networks without relying on GNSS information.

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202410946880.5, filed on July 12, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0003] In a communication system, a terminal can initiate random access to access the network. For example, the terminal can send a preamble to a radio access network (RAN) node. Correspondingly, the RAN node can receive the preamble on a random access channel occasion (RO) and send a random access response (RAR) to the terminal based on the preamble. After receiving the RAR, the terminal can send an uplink message to the RAN node based on the RAR and receive a conflict resolution message sent by the RAN node based on the uplink message, thus gaining access to the RAN node. However, when the distance between the terminal and the RAN node is large, the transmission delay between them is significant. In this case, the preamble sent by the terminal may arrive at the RAN node outside of the RO, meaning the RAN node may not receive the preamble, leading to terminal access failure.

[0004] To address the aforementioned issues, terminals can first acquire Global Navigation Satellite System (GNSS) information, determine the timing advance (TA) based on this information, and then initiate random access based on the timing advance. However, this method relies on GNSS information and only allows some terminals (such as those capable of acquiring GNSS information) to access the RAN node. Therefore, when the distance between the terminal and the RAN node is significant, how to enable the terminal to access the network without relying on GNSS information is a pressing problem that needs to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that enables terminals located far from RAN nodes to access the network without relying on GNSS information.

[0006] To achieve the above objectives, this application adopts the following technical solution:

[0007] Firstly, a communication method is provided, which can be executed by a second communication node. Here, the second communication node can refer to the second communication node itself, or to a processor, circuit, module, logic node, chip, or chip system within the second communication node that implements the method. For example, the second communication node is a terminal.

[0008] The method includes: receiving a broadcast message indicating N timing advances; sending first information to a first communication node for each of the N timing advances; receiving second information from the first communication node indicating the first timing advance; and communicating with the first communication node according to the first timing advance. Wherein, different timing advances are associated with different regions among the N timing advances, and N is an integer greater than 1. Any one of the N first messages indicates the timing advance corresponding to that first message. The first timing advance is included among the N timing advances, and the first information corresponding to the first timing advance is received by the first communication node in a first time window.

[0009] Based on the method provided in the first aspect above, the terminal can acquire N timing advances and send first information to the first communication node for each of the N timing advances. Since one of the N timing advances (such as the first timing advance) is suitable for the terminal, i.e., the correct timing advance, the first communication node can receive the first information indicating the first timing advance within the first time window. Subsequently, the terminal can determine the first timing advance based on the indication from the first communication node, and then perform uplink timing based on the first timing advance to synchronize with the first communication node, thereby accessing the first communication node. In the above method, the terminal can synchronize with the first communication node and thus access the first communication node without relying on GNSS information. Therefore, the above method allows terminals without GNSS capabilities to access the network. It should be understood that the above method is also applicable to terminals with GNSS capabilities. For example, when the terminal cannot reliably acquire GNSS information or wants to save power, the terminal can use the above method to access the network.

[0010] In one possible implementation, each of the N first messages is a randomly accessed message 1, and the second message is a randomly accessed message 2; or, each of the N first messages is a randomly accessed message A, and the second message is a randomly accessed message B; or, each of the N first messages is a randomly accessed message 3, and the second message is a randomly accessed message 4.

[0011] Based on the above possible implementation methods, the terminal can determine the first timing advance through messages 1 and 2 in the four-step random access, or through messages A and B in the two-step random access, and through messages 3 and 4 in the four-step random access.

[0012] In one possible implementation, N random access messages 1 occupy the same random access opportunity; or, N random access messages A occupy the same random access opportunity; or, N random access messages 3 occupy the same random access opportunity.

[0013] Based on the above possible implementation methods, the terminal can send the first information to the first communication node as soon as possible to reduce access latency.

[0014] In one possible implementation, among the N timing advances, different timing advances are associated with different random access resources, and the random access resources include at least one of random access timing or preamble.

[0015] Based on the above possible implementation methods, different random access resources can be associated with different timing advances, so that the terminal can use the corresponding random access resources to send the first information. It is understandable that if the random access resources used by the terminal to send the first information correspond to the resources used by the terminal to receive the second information, the terminal can also determine the corresponding random access resources based on the resources used to receive the second information, and determine the corresponding timing advance based on the random access resources. In this way, the second information may not carry information related to the first timing advance, thus saving signaling overhead.

[0016] In one possible implementation, N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

[0017] Based on the above possible implementation methods, a communication node that cannot obtain location information can initiate random access based on the first type of random access resources, so that the first communication node can determine the type of communication node that initiates random access.

[0018] In one possible implementation, the first time period is greater than or equal to a first threshold. The first time period is determined based on the length of the cyclic prefix of the first information, and the first threshold is determined based on a first difference, which is the absolute value of the difference between any two adjacent timing advances after N timing advances are arranged in order of magnitude.

[0019] Understandably, since the third difference between the timing advance associated with the terminal's location and the terminal's actual timing advance is less than the first difference, the first time period being greater than or equal to the first threshold can make the first time period greater than or equal to the third difference, so as to avoid a situation where part of the first information falls within the first time window and part falls outside the first time window.

[0020] In one possible implementation, in the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to a first value.

[0021] Based on the above possible implementation methods, it is possible to avoid the first information corresponding to other timing advances (such as timing advances other than the first timing advance among N timing advances) also falling into the random access timing.

[0022] Secondly, a communication method is provided, which can be executed by a first communication node. Here, the first communication node can refer to the first communication node itself, or to a processor, circuit, module, logic node, chip, or chip system within the first communication node that implements the method. For example, the first communication node is a RAN node.

[0023] The method includes: sending a broadcast message indicating N timing advances; receiving first information from a second communication node indicating a first timing advance within a first time window; and sending second information indicating the first timing advance to the second communication node. Among the N timing advances, different timing advances are associated with different regions, and N is an integer greater than 1. The first timing advance is included among the N timing advances and is used to determine the uplink timing of the second communication node.

[0024] Based on the method provided in the second aspect above, the RAN node can indicate a first timing advance to the second communication node based on the first information received in the first time window. This allows the second communication node to determine the first timing advance from among N timing advances, and then perform uplink timing based on the first timing advance to synchronize with the RAN node, thereby accessing the RAN node. Through this method, the second communication node can synchronize with the RAN node without relying on GNSS information, thus accessing the RAN node.

[0025] In one possible implementation, the first information is random access message 1, and the second information is random access message 2; or, the first information is random access message A, and the second information is random access message B; or, the first information is random access message 3, and the second information is random access message 4.

[0026] Based on the above possible implementation methods, the RAN node can determine the first timing advance for the second communication node through messages 1 and 2 in the four-step random access, or through messages A and B in the two-step random access, and through messages 3 and 4 in the four-step random access.

[0027] In one possible implementation, among the N timing advances, different timing advances are associated with different random access resources, and the random access resources include at least one of random access timing or preamble.

[0028] Based on the above possible implementations, after the RAN node receives the first information through the first time window, it can determine the resources for sending the second information based on the random access resources corresponding to the first information. This allows the second communication node to determine the corresponding random access resources based on the resources used by the RAN node to send the second information, and then determine the first timing advance based on those random access resources. In this way, the second information does not need to carry information related to the first timing advance, thus saving signaling overhead.

[0029] In one possible implementation, N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

[0030] Based on the above possible implementation methods, the RAN node can determine the type of communication node that initiates random access according to the random access resources.

[0031] In one possible implementation, the first time period is greater than or equal to a first threshold. The first time period is determined based on the length of the cyclic prefix of the first information. The first threshold is determined based on a first difference, which is the absolute value of the difference between any two adjacent timing advances after N timing advances are arranged in order of size.

[0032] Understandably, since the third difference between the timing advance associated with the area where the second communication node is located and the actual timing advance of the second communication node is less than the first difference, the first time period being greater than or equal to the first threshold can make the first time period greater than or equal to the third difference, so as to avoid the situation where part of the first information falls into the first time window and part falls outside the first time window.

[0033] In one possible implementation, in the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to a first value.

[0034] Based on the above possible implementation methods, it is possible to avoid the first information corresponding to other timing advances (such as timing advances other than the first timing advance among N timing advances) also falling into the random access timing.

[0035] Thirdly, a communication device is provided for implementing the method provided in the first aspect. This communication device can be the second communication node in the first aspect. The communication device includes modules, units, or means corresponding to the above method, which 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 functions.

[0036] In one possible implementation, the communication device may include a processing module and an interface module. The processing module can be used to implement the processing functions described in the first aspect and any possible implementation thereof. The processing module may be, for example, a processor. The interface module, also referred to as an interface unit, is used to implement the sending and / or receiving functions described in the first aspect and any possible implementation thereof. The interface module may consist of an interface circuit, a transceiver, a transceiver unit, or a communication interface.

[0037] In one possible implementation, the interface module is configured to receive a broadcast message indicating N timing advances, where different timing advances are associated with different regions, and N is an integer greater than 1; the processing module is configured to control the interface module to send first information to the first communication node for each of the N timing advances, where any one of the N first information indicates the timing advance corresponding to that first information; the interface module is further configured to receive second information from the first communication node, where the second information indicates a first timing advance, which is included in the N timing advances, and the first information corresponding to the first timing advance is received by the first communication node in a first time window; the processing module is further configured to control the interface module to communicate with the first communication node according to the first timing advance.

[0038] In one possible implementation, each of the N first pieces of information is a randomly accessed message 1, and the second piece of information is a randomly accessed message 2; or, each of the N first pieces of information is a randomly accessed message A, and the second piece of information is a randomly accessed message B; or, each of the N first pieces of information is a randomly accessed message 3, and the second piece of information is a randomly accessed message 4.

[0039] In one possible implementation, N random access messages 1 occupy the same random access opportunity; or, N random access messages A occupy the same random access opportunity; or, N random access messages 3 occupy the same random access opportunity.

[0040] In one possible implementation, among the N timing advances, different timing advances are associated with different random access resources, which include at least one of random access timing or preamble.

[0041] In one possible implementation, the N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

[0042] In one possible implementation, the first time period is greater than or equal to a first threshold, which is determined based on the length of the cyclic prefix of the first information. The first threshold is determined based on a first difference, which is the absolute value of the difference between any two adjacent timing advances after the N timing advances are arranged in order of size.

[0043] In one possible implementation, in the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to a first value.

[0044] Fourthly, a communication device is provided for implementing the method provided in the second aspect. The communication device can be the first communication node in the second aspect. The communication device includes modules, units, or means that implement the method described above. 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 functions described above.

[0045] In one possible implementation, the communication device may include a processing module and an interface module. The processing module can be used to implement the processing functions in the second aspect described above and any possible implementation thereof. The processing module may be, for example, a processor. The interface module, also referred to as an interface unit, is used to implement the sending and / or receiving functions in the second aspect described above and any possible implementation thereof. The interface module may consist of an interface circuit, a transceiver, a transceiver unit, or a communication interface.

[0046] In one possible implementation, the processing module is configured to control the interface module to send a broadcast message indicating N timing advances, with different timing advances associated with different regions, where N is an integer greater than 1; the processing module is also configured to control the interface module to receive first information from the second communication node in a first time window, the first information indicating a first timing advance, which is included in the N timing advances; the processing module is also configured to control the interface module to send second information to the second communication node, the second information indicating the first timing advance, which is used to determine the uplink timing of the second communication node.

[0047] In one possible implementation, the first information is random access message 1 and the second information is random access message 2; or, the first information is random access message A and the second information is random access message B; or, the first information is random access message 3 and the second information is random access message 4.

[0048] In one possible implementation, among the N timing advances, different timing advances are associated with different random access resources, which include at least one of random access timing or preamble.

[0049] In one possible implementation, the N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

[0050] In one possible implementation, the first time period is greater than or equal to a first threshold, which is determined based on the length of the cyclic prefix of the first information. The first threshold is determined based on a first difference, which is the absolute value of the difference between any two adjacent timing advances after the N timing advances are arranged in order of size.

[0051] In one possible implementation, in the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to a first value.

[0052] Fifthly, a communication device is provided for performing the method as described in any of the preceding aspects. The communication device may be the second communication node in the first aspect; or, the communication device may be the first communication node in the second aspect.

[0053] In one possible implementation, the communication device is a chip or a chip system. Optionally, when the communication device is a chip system, it can be composed of chips or may include chips and other discrete components.

[0054] A sixth aspect provides a communication device, comprising: at least one processor; configured to cause the communication device to perform the method described in any of the preceding aspects by executing a computer program (or computer-executable instructions) stored in a memory, and / or by means of logic circuitry. The communication device may be a second communication node as described in the first aspect; or, the communication device may be a first communication node as described in the second aspect. Optionally, the number of processors may be one or more.

[0055] In one possible implementation, the communication device also includes a memory.

[0056] In one possible implementation, the processor and memory are integrated together; or, the memory is independent of the processor.

[0057] In one possible implementation, the communication device further includes a communication interface for communicating with other devices, such as transmitting or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0058] In one possible implementation, the processor and / or memory also include an artificial intelligence (AI) module for implementing AI-related functions. The AI ​​module can implement AI functions through software, hardware, or a combination of both. For example, the AI ​​module may include a radio access network (RAN) intelligent controller (RIC) module. The AI ​​module could be a near real-time RIC or a non-real-time RIC.

[0059] In one possible implementation, the communication device is a chip or a chip system. Optionally, when the communication device is a chip system, it can be composed of chips or may include chips and other discrete components.

[0060] A seventh aspect provides a communication device, comprising: at least one processor and an interface circuit; the interface circuit being configured to receive a computer program or instructions and transmit them to the at least one processor; the at least one processor being configured to execute the computer program or instructions to cause the communication device to perform the method as described in any of the preceding aspects. The communication device may be a second communication node as described in the first aspect; or, the communication device may be a first communication node as described in the second aspect. Optionally, the number of processors may be one or more.

[0061] In one possible implementation, the at least one processor further includes an AI module for implementing AI-related functions. The AI ​​module can implement AI functions through software, hardware, or a combination of both. For example, the AI ​​module may include a RIC module. For instance, the AI ​​module can be a near real-time RIC or a non-real-time RIC.

[0062] In one possible implementation, the communication device is a chip or a chip system. Optionally, when the communication device is a chip system, it can be composed of chips or may include chips and other discrete components.

[0063] Eighthly, a computer-readable storage medium is provided that stores instructions which, when executed on a computer, cause the computer to perform the methods described in any of the preceding aspects.

[0064] Ninthly, a computer program product containing instructions is provided, which, when run on a computer, enables the computer to perform the methods described in any of the preceding aspects.

[0065] In a tenth aspect, a communication system is provided, comprising a second communication node for performing the method described in the first aspect and a first communication node for performing the method described in the second aspect.

[0066] The technical effects of any possible implementation of the third to tenth aspects can be found in the technical effects of any one of the first to second aspects or different possible implementations of any one aspect, and will not be repeated here.

[0067] Understandably, provided that the solutions do not contradict each other, the solutions in the above aspects can be combined. Attached Figure Description

[0068] Figure 1 is a schematic diagram of the communication system architecture provided in this application;

[0069] Figure 2A is a schematic diagram of the communication network provided in this application;

[0070] Figure 2B is a schematic diagram of the communication network provided in this application;

[0071] Figure 2C is a schematic diagram of the communication network provided in this application;

[0072] Figure 3 is a schematic diagram of the hardware structure of the communication device provided in this application;

[0073] Figure 4 is a flowchart illustrating the communication method provided in this application.

[0074] Figure 5 is a schematic diagram of the coverage area of ​​the first beam provided in this application;

[0075] Figure 6 is a schematic diagram of the terminal sending the first information provided in this application;

[0076] Figure 7 is a flowchart of the communication method provided in this application (II).

[0077] Figure 8 is a flowchart illustrating the communication method provided in this application.

[0078] Figure 9 is a flowchart illustrating the communication method provided in this application.

[0079] Figure 10 is a schematic diagram of the communication device provided in this application. Detailed Implementation

[0080] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0081] The method provided in this application can be used in various communication systems. For example, the communication system can be a Universal Mobile Telecommunications System (UMTS) system, a Long Term Evolution (LTE) system, a 5th Generation (5G) communication system, a Wireless Fidelity (WiFi) system, a 3rd Generation Partnership Project (3GPP) related communication system, a communication system evolving after 5G, or a system integrating multiple systems, etc., without limitation. Among them, 5G can also be referred to as New Radio (NR). The method provided in this application is described below using the communication system 1000 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided in this application.

[0082] Figure 1 shows a schematic diagram of the architecture of the communication system 1000 provided in this application. In Figure 1, the communication system 1000 may include one or more radio access network (RAN) nodes 101 (only one is shown) and terminals 102-104 that can communicate with the RAN nodes 101.

[0083] In Figure 1, RAN nodes can provide wireless access services to terminals. Specifically, each RAN node corresponds to a service coverage area, and terminals entering this area can communicate with the RAN node through the air interface to receive the wireless access services provided by the RAN node.

[0084] In this application, the RAN node, such as RAN node 101, can be a device with wireless transceiver capabilities that helps terminals achieve wireless access. A RAN node can be, for example, a node in a RAN or a node in an open access network (open RAN, O-RAN, or ORAN). A RAN node can also be referred to as an access network device, RAN entity, access node, or network device, etc. RAN nodes include, but are not limited to: evolved Node Bs (NodeBs, eNBs, or e-NodeBs) in LTE, next-generation eNBs (ng-eNBs) in next-generation LTE, gNodeBs or gNBs in NR, transmitting points (TPs) or transmission receiving points / transmission reception points (TRPs), 3GPP subsequent evolution base stations, base stations in future mobile communication systems, satellites, access points (APs) in WiFi systems, wireless relay nodes, wireless backhaul nodes, integrated access and backhaul (IAB) nodes, and network equipment in mobile switching center non-terrestrial network (NTN) communication systems. These can be deployed on low-altitude platforms, high-altitude platforms, or satellites. Base stations can be: macro base stations, micro base stations, pico base stations, small cells, relay stations, or balloon stations, etc. Multiple base stations can support networks using the same technology mentioned above, or they can support networks using different technologies mentioned above. A base station can contain one or more co-located or non-co-located TRPs. RAN nodes can also function as base stations in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, and machine-to-machine (M2M) communication. RAN nodes can also be radio controllers in cloud radio access network (CRAN) scenarios. RAN nodes can also be centralized units (CUs), distributed units (DUs), CU-control plane (CP), CU-user plane (UP), radio units (RUs), roadside units (RSUs) with base station functionality, wired access gateways, or core network elements. RAN nodes can also be servers, wearable devices, machine-to-machine communication devices, or vehicle-mounted devices. For example, access network equipment in V2X technology can be an RSU.The following explanation uses RAN nodes as base stations as an example. The multiple RAN nodes can be base stations of the same type or different types. Base stations can communicate with terminals directly or via relay stations. Terminals can communicate with multiple base stations using different technologies; for example, a terminal can communicate with a base station supporting LTE networks, or with a base station supporting 5G networks, and can also support dual connectivity with both LTE and 5G base stations.

[0085] In this application, the CU can perform the functions of the radio resource control (RRC) layer and the packet data convergence protocol (PDCP) layer of the base station. The CU can also perform the functions of the service data adaptation protocol (SDAP) layer. The DU can perform the functions of the radio link control (RLC) layer and the medium access control (MAC) layer of the base station. The DU can also perform some or all of the physical layer functions. The RU can be used to implement the transmission and reception functions of radio frequency signals. The CU and DU can be set up separately or included in the same network element, such as in the baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in the remote radio unit (RRU), active antenna unit (AAU), or remote radio head (RRH). It is understood that the CU can be classified as a network device in the access network or a network device in the core network; no limitation is made here.

[0086] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0087] The terminal in this application, such as terminal 102, terminal 103, or terminal 104, is a device with wireless transceiver capabilities. The terminal can be deployed on land, including indoors, outdoors, handheld, or vehicle-mounted; it can also be deployed on water (such as on ships); and it can be deployed in the air (such as on airplanes, balloons, and satellites). The terminal can also be referred to as a terminal device, which can be user equipment (UE), mobile station (MS), mobile terminal (MT), or a device used to provide voice or data connectivity to users. The UE includes handheld devices with wireless communication capabilities, vehicle-mounted devices (e.g., cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), wearable devices (e.g., smartwatches, smart bracelets, pedometers, etc.), or computing devices. For example, the UE can be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), satellite terminal, or computer with wireless transceiver capabilities. UE can also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless modem, a point-of-sale (POS) machine, customer-premises equipment (CPE), a smart robot, a robotic arm, workshop equipment, smart home devices (e.g., refrigerators, televisions, air conditioners, electricity meters, etc.), a wireless terminal in industrial control, a wireless terminal in autonomous driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in intelligent transportation, a wireless terminal in a smart city, a wireless terminal in a smart home, an in-vehicle terminal, a roadside unit (RSU) with terminal functionality, or a flying device (e.g., a smart robot, a hot air balloon, a drone, an airplane), etc. A terminal can also be other devices with terminal functionality; for example, a terminal can also be a device that performs terminal functionality in D2D communication.

[0088] By way of example and not limitation, in this application, the terminal can be a wearable device. Wearable devices, also known as wearable smart devices, are a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices that are worn directly on the body or integrated into a user's clothing or accessories. For example, wearable devices are not merely hardware devices, but also devices that achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include devices that are feature-rich, large in size, and can achieve complete or partial functions without relying on a smartphone, such as smartwatches or smart glasses, as well as devices that focus on only one type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0089] In this application, the terminal can be a terminal in an Internet of Things (IoT) system. IoT is an important component of future information technology development, and its main technical feature is connecting objects to networks through communication technologies, thereby realizing an intelligent network of human-machine interconnection and machine-to-machine interconnection. The terminal in this application can be a terminal in machine-type communication (MTC).

[0090] The terminal in this application can be an on-board module, on-board component, on-board chip, on-board unit (OBU), or telematics box (T-BOX) built into a vehicle as one or more components or units. The vehicle can implement the methods of this application through the built-in on-board module, on-board component, on-board chip, on-board unit, or T-BOX. The terminal can also be a complete vehicle device. Therefore, this application can be applied to vehicle networking, such as vehicle-to-everything (V2X), long-term evolution vehicle (LTE-V), and vehicle-to-vehicle (V2V).

[0091] Understandably, in some scenarios, the roles of RAN nodes and terminals are relative. For example, a helicopter or drone, which is usually configured as a terminal, can also be configured as a mobile base station, and a device that accesses the RAN via a helicopter or drone is configured as a terminal.

[0092] Understandably, the aforementioned communication system 1000 can be applied to various communication networks, such as NTN. Compared to terrestrial communication networks, NTN has its unique advantages. For example, NTN is less susceptible to damage from natural disasters or external forces and can provide wider coverage. Therefore, NTN can provide communication services to areas such as oceans and forests that cannot be covered by terrestrial communication networks. NTN can also enhance the reliability of existing communication networks, such as ensuring that users on airplanes, trains, and other transportation modes receive higher-quality communication services. Furthermore, NTN can provide more data transmission resources and improve network speed.

[0093] For example, the communication system 1000 described above can be applied to the communication networks shown in Figures 2A to 2C.

[0094] The communication network shown in Figure 2A includes terminals, satellites communicating with the terminals via air interface, ground stations communicating with the satellites via air interface, base stations communicating with the ground stations, a core network communicating with the base stations via a next-generation (NG) interface, and a data network communicating with the core network. RAN node 101 in the communication system 1000 corresponds to the ground station in Figure 2A and can have the functions of a ground station. Any one of the terminals 102 to 104 can correspond to a terminal in Figure 2A and can have the functions of that terminal.

[0095] The communication network shown in Figure 2B includes terminals, a satellite that communicates with the terminals via an air interface (the satellite has the function of a base station), a ground station that communicates with the satellite via an NG interface, a core network that communicates with the ground station via an NG interface, and a data network that communicates with the core network. RAN node 101 in the communication system 1000 corresponds to the satellite in Figure 2B and can have the function of the satellite. Any one of the terminals 102 to 104 can correspond to a terminal in Figure 2B and can have the function of that terminal.

[0096] The communication network shown in Figure 2C includes terminal 203, satellite 201 (which functions as a base station) communicating with terminal 203 via an air interface, ground station communicating with satellite 201 via an NG interface, core network communicating with ground station via an NG interface, and data network communicating with core network. This communication scenario also includes satellite 202 (which functions as a base station) communicating with satellite 201 via an Xn interface and terminal 204 communicating with satellite 202 via an air interface. RAN node 101 in communication system 1000 corresponds to satellite 201 in Figure 2C and can have the functions of satellite 201. Any terminal from terminal 102 to terminal 104 can correspond to terminal 203 in Figure 2C and can have the functions of terminal 203; alternatively, RAN node 101 in communication system 1000 corresponds to satellite 202 in Figure 2C and can have the functions of satellite 202. Any terminal from terminal 102 to terminal 104 can correspond to terminal 204 in Figure 2C and can have the functions of terminal 204.

[0097] The following section introduces the devices or network elements in the communication networks shown in Figures 2A to 2C.

[0098] Base stations can provide wireless access services, allocate wireless resources to terminals, and provide reliable wireless transmission protocols and data encryption protocols, etc.

[0099] The core network can provide at least one of the following services: user access control, mobility management, session management, user authentication, or accounting. The core network can include multiple functional entities, for example, it can be divided into control plane entities and data plane entities. The control plane entities can include at least one of the following: access and mobility management function (AMF) entities or session management function (SMF) entities. The AMF entity can be responsible for user access management, authentication, and mobility management. The SMF entity can be used for session management, session establishment, etc. The data plane entities can include user plane function (UPF) entities, which are responsible for managing user plane data transmission, traffic statistics, and other functions.

[0100] Ground stations can be responsible for forwarding signaling and service data between satellite base stations and the core network.

[0101] Data networks can be responsible for providing data services to users.

[0102] The air interface is the wireless link between the terminal and the base station. In this application, the air interface can refer to various types of air interfaces; for example, for a 5G network, the air interface refers to the 5G air interface.

[0103] The Xn interface is the interface between base stations, mainly used for signaling interactions such as handover.

[0104] The NG interface is the interface between the base station and the core network, mainly exchanging non-access stratum (NAS) signaling of the core network, as well as user service data.

[0105] The communication networks shown in Figures 2A to 2C above are based on 5G networks. If the 5G network is replaced with a 4G network, then the Xn interface in the figure can be replaced with the X2 interface, and the NG interface can be replaced with the S1 interface.

[0106] It is understood that the communication system 1000 shown in Figure 1 is for illustrative purposes only and is not intended to limit the technical solutions of this application. Those skilled in the art should understand that in specific implementations, the communication system 1000 may also include other devices, and the number of RAN nodes and terminals may be determined according to specific needs without limitation.

[0107] Optionally, each network element or device (such as a RAN node or terminal) in Figure 1 of this application may also be referred to as a communication device, which may be a general-purpose device or a special-purpose device. This application does not make any specific limitation on this.

[0108] Optionally, the functions of each network element or device (e.g., RAN node or terminal) in Figure 1 of this application can be implemented by one device, multiple devices working together, or one or more functional modules within a single device. This application does not impose specific limitations on these functions. It is understood that the aforementioned functions can be network elements in hardware devices, software functions running on dedicated hardware, a combination of hardware and software, or virtualization functions instantiated on a platform (e.g., a cloud platform).

[0109] In practical implementation, each network element or device (e.g., RAN node or terminal) in Figure 1 of this application can adopt the composition structure shown in Figure 3, or include the components shown in Figure 3. Figure 3 shows a schematic diagram of the hardware structure of a communication device applicable to this application. It is understood that the communication device 30 includes means of necessary forms such as modules, units, elements, circuits, or interfaces, which are appropriately configured together to execute the solution provided in this application. For example, the communication device 30 includes one or more processors 301 for implementing the method provided in this application.

[0110] Processor 301 can be a general-purpose processor or a dedicated processor. For example, processor 301 can be a baseband processor or a central processing unit (CPU). The baseband processor can be used to process communication protocols and communication data, while the CPU can be used to control the communication device 30 (such as a RAN node, terminal, or chip), execute software programs, and process data from the software programs. Optionally, in one design, processor 301 may include program 305 (sometimes also referred to as code or instructions), which can be run on processor 301 to cause the communication device 30 to perform the methods described in the embodiments below. In yet another possible design, communication device 30 includes circuitry (not shown in FIG3) for implementing the functions of the RAN node or terminal in the embodiments below.

[0111] Optionally, the communication device 30 may include one or more memories 303. The memory 303 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM), cache, or other type of dynamic storage device capable of storing information and instructions. It may also be an electrically erasable programmable read-only memory (EEPROM), a 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 is not limited thereto. The memory provided in this application may generally be non-volatile. Optionally, the memory 303 stores a program 307 (sometimes referred to as code or instructions), which can be run on the processor 301 to cause the communication device 30 to perform the methods described in the following method embodiments.

[0112] Optionally, the processor 301 may include an AI module 306, and / or the memory 303 may include an AI module 308. The aforementioned AI modules are used to implement AI-related functions. The AI ​​modules can be implemented through software, hardware, or a combination of both. For example, the AI ​​module may include a RIC module. For example, the AI ​​module can be a near real-time RIC or a non-real-time RIC.

[0113] Optionally, data may also be stored in the processor 301 and / or the memory 303. The processor 301 and the memory 303 may be configured separately or integrated together.

[0114] Optionally, the communication device 30 may also include a transceiver 302 and / or an antenna 304. The processor 301, sometimes referred to as a processing unit, controls the communication device 30. The transceiver 302, sometimes referred to as a transceiver unit, transceiver, transceiver circuit, or transceiver, is used to realize the transmission and reception functions of the communication device 30 through the antenna 304.

[0115] It is understood that the composition shown in Figure 3 does not constitute a limitation on the communication device. In addition to the components shown in Figure 3, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0116] The method provided in this application will now be described with reference to the accompanying drawings. Each network element in the following embodiments may include the components shown in Figure 3, which will not be elaborated upon further.

[0117] It is understood that in this application, the terminal and / or RAN node may perform some or all of the steps in this application. These steps are merely examples, and this application may also perform other steps or variations thereof. Furthermore, the steps may be performed in different orders as presented in this application, and it is possible that not all steps in this application need to be performed.

[0118] It is understood that the methods described below in this application use a terminal and a RAN node as examples to illustrate the interaction, but this application does not limit the execution subject of the interaction. For example, the terminal in the method provided in the following embodiments of this application can also be a chip, chip system, or processor that supports the terminal in implementing the method, or it can be a logical node, logical module, or software that can implement all or part of the terminal's functions; similarly, the RAN node in the method provided below can also be a chip, chip system, or processor that supports the RAN node in implementing the method, or it can be a logical node, logical module, or software that can implement all or part of the RAN node's functions.

[0119] As shown in Figure 4, a communication method provided in this application may include the following steps:

[0120] S401: The RAN node sends a broadcast message. Correspondingly, the terminal receives the broadcast message from the RAN node.

[0121] In this application, the RAN node can be RAN node 101 in the communication system 1000 shown in Figure 1, and the terminal can be any terminal in the communication system 1000 shown in Figure 1, such as terminal 102.

[0122] In this application, a broadcast message can indicate N timing advances (TAs), where N is an integer greater than 1. These N timing advances are completely different. For example, with N equal to 4, a broadcast message can indicate four timing advances: 6 milliseconds (ms), 7 ms, 8 ms, and 9 ms. The four timing advances in this example are arranged in an arithmetic progression, but this is not a limitation in practical applications. For example, the timing advance indicated by the broadcast message could be 5 ms, 7 ms, 8 ms, and 10 ms. Furthermore, different timing advances among the N timing advances can be associated with different regions. Any one of the N timing advances can be used by a terminal within the region associated with that timing advance to determine uplink or downlink timing, thereby compensating for the transmission delay between the terminal and the RAN node and achieving synchronization between the terminal and the RAN node.

[0123] Understandably, to indicate the aforementioned N timing advances, the broadcast message may include an identifier for each of the N timing advances. Alternatively, the broadcast message may include each of the N timing advances. Or, if the N timing advances are arranged in an arithmetic progression, the broadcast message may include any one of the N timing advances and a second difference. This second difference is the difference between any two adjacent timing advances after the N timing advances are arranged in order of magnitude. In this application, the identifier may also be replaced by an index.

[0124] In this application, the timing advance indicated by the broadcast message may not be a numerical value, but a time range. Taking N equal to 3 as an example, the broadcast message indicates [6ms, 7ms), [7ms, 8ms), and [8ms, 9ms]. Here, [6ms, 7ms) represents a timing advance greater than or equal to 6ms and less than 7ms; [7ms, 8ms) represents a timing advance greater than or equal to 7ms and less than 8ms; and [8ms, 9ms] represents a timing advance greater than or equal to 8ms and less than or equal to 9ms. In this case, to indicate the above ranges, the broadcast message may include an identifier for each range; or, the broadcast message may include the maximum and / or minimum value within each range.

[0125] In this application, the coverage area of ​​a RAN node can be divided into multiple regions, and a timing advance can be associated with each region. The timing advance associated with each region can be a single value or a time range, without restriction. The timing advance associated with one region can be used by the terminals within that region for uplink or downlink timing to synchronize with the RAN node. In other words, the timing advance associated with one region is shared by all terminals within that region, so the timing advance associated with each region can also be called the common timing advance of that region.

[0126] The area mentioned in this application can be a geographical area or a communication area. For example, any one of the above-mentioned areas can be an administrative district or street, or any one of the above-mentioned areas can be a neighborhood. Furthermore, the scope of any two areas can be the same or different, without limitation.

[0127] Understandably, the N timing advances indicated by the broadcast message can be associated with N regions among the aforementioned multiple regions. For example, these N regions are the areas within the coverage area of ​​the beam carrying the broadcast message (referred to as the first beam). The first beam can also be understood as the beam used by the RAN node to send the broadcast message.

[0128] For example, if a broadcast message indicates four timing advances of 6ms, 7ms, 8ms, and 9ms, these four timing advances can be associated with four areas within the coverage area of ​​the first beam shown in Figure 5. Specifically, area 501 is associated with a timing advance of 6ms, so terminals within area 501 can determine their uplink timing based on this timing advance, thereby enabling communication with the RAN node. Area 502 is associated with a timing advance of 7ms, so terminals within area 502 can determine their uplink timing based on this timing advance, thereby enabling communication with the RAN node. Area 503 is associated with a timing advance of 8ms, so terminals within area 503 can determine their uplink timing based on this timing advance, thereby enabling communication with the RAN node. Area 504 is associated with a timing advance of 9ms, so terminals within area 504 can determine their uplink timing based on this timing advance, thereby enabling communication with the RAN node.

[0129] Optionally, the broadcast message can also indicate the area associated with each timing advance. For example, if the area is circular, the broadcast message includes the coordinates of the center point of each of the N areas, as well as the radius of each area (if the radii of all N areas are the same, the radius of one area may be included). Alternatively, if the area is rectangular, the broadcast message includes the coordinates of the four vertices of each of the N areas, or the coordinates of the center point of each area, as well as the length and width of each area (if the length and width of all N areas are the same, the length and width of one area may be included). Alternatively, the broadcast message may include an area identifier for each area, such as a cell identifier. In this way, the terminal can determine the area associated with each timing advance based on the above information.

[0130] Optionally, the broadcast message may also include an identifier. When the broadcast message indicates multiple sets of timing advances, and different sets of timing advances are associated with different message identifiers, the terminal can determine the set of timing advances associated with the broadcast message based on the identifier of the broadcast message.

[0131] Optionally, the broadcast message is a synchronization signal block (SSB). Correspondingly, the broadcast message is identified by the SSB index. The first beam is the SSB beam.

[0132] S402: The terminal sends the first information to the RAN node for each of the N timing advances. Correspondingly, the RAN node receives the first information from the terminal within the first time window.

[0133] Understandably, in S401, the terminal obtains N timing advances. If the broadcast message indicates the region associated with each timing advance, and the terminal knows which region it is located in, then the terminal can determine the uplink timing based on the timing advance associated with that region and communicate with the RAN node based on that uplink timing. If the broadcast message does not indicate the region associated with each timing advance, or if the broadcast message indicates the region associated with each timing advance but the terminal does not know which region it is located in, then the terminal does not know which timing advance to communicate with the RAN node based on. In this case, the terminal can determine the uplink timing based on each timing advance and send first information to the RAN node based on each uplink timing. That is, the terminal sends N first information messages to the RAN node. Since these N first information messages correspond to different timing advances, the transmission times of these N first information messages are different, and the arrival times of these N first information messages at the RAN node are also different. Furthermore, any one of the N first information messages can indicate the timing advance corresponding to that first information.

[0134] One possible implementation is that the terminal determines N first moments based on N timing advances, and sends corresponding first information at each of the N first moments. Any two of the N first moments are different. It should be understood that any first moment can refer to a point in time or a time period, without restriction. When a first moment refers to a time period, the fact that any two first moments are different can be understood as the two time periods not overlapping.

[0135] For example, taking the example shown in Figure 5, the broadcast message indicates four timing advances: 6ms, 7ms, 8ms, and 9ms. The terminal's transmission of the first message can then be as shown in Figure 6. Specifically, the terminal can determine time t4 based on 6ms, time t3 based on 7ms, time t2 based on 8ms, and time t1 based on 9ms. Therefore, the terminal sends the first message once at time t1, indicating 9ms; once at time t2, indicating 8ms; once at time t3, indicating 7ms; and once at time t4, indicating 6ms.

[0136] Understandably, among N timing advances, the timing advance associated with the terminal's region (referred to as the first timing advance) is suitable for the terminal (e.g., it is closest to the terminal's actual timing advance), while the other timing advances are unsuitable. Therefore, the first message sent by the terminal based on the first timing advance can arrive at the RAN node at the time expected by the RAN node (e.g., the first time window), while the first message sent by the terminal based on the other timing advances will not arrive at the RAN node at the time expected by the RAN node. In other words, the first message received by the RAN node in the first time window indicates the first timing advance. For example, in Figure 6, if the RAN node expects to receive the first message in time window 601, then the 7ms indicated by the first message sent at time t3 is the timing advance associated with the terminal's region.

[0137] Understandably, the aforementioned N timing advances are common timing advances, so there is a certain error between the first timing advance and the actual timing advance of the terminal. Therefore, it is possible that part of the first information falls within the first time window and part falls outside the first time window. Therefore, to ensure that the first information corresponding to the first timing advance is correctly received by the RAN node within the first time window, the first time period can be greater than or equal to the first threshold. The first time period is determined based on the length of the cyclic prefix of the first information. For example, the first time period is the time domain resource occupied by the cyclic prefix, such as 2 microseconds (µm). Another example is that the first time period is equal to [(N-1)×T], where N is the number of sampling points included in the cyclic prefix, and T is the time interval between two adjacent sampling points. The first threshold can be determined based on the maximum possible error (such as the first difference) between the first timing advance and the actual timing advance of the terminal. For example, the first threshold is equal to the first difference. The first difference is the absolute value of the difference between any two adjacent timing advances after the N timing advances are arranged in order of size.

[0138] Understandably, in order for the terminal to determine the first timing advance, the RAN node, after receiving the first information indicating the first timing advance within the first time window, can feed back the first timing advance to the terminal. For example, the RAN node can execute S403.

[0139] S403: The RAN node sends the second information to the terminal. Correspondingly, the terminal receives the second information from the RAN node.

[0140] In this application, the second information indicates the first timing advance. Therefore, after receiving the second information, the terminal can determine to use the first timing advance to communicate with the RAN node.

[0141] S404: The terminal communicates with the RAN node based on the first timing advance.

[0142] One possible implementation is that the terminal can determine the uplink timing of the RAN node based on a first timing advance, and communicate with the RAN node according to the determined uplink timing.

[0143] Based on the method shown in Figure 4, the terminal can obtain N timing advances and send first information to the RAN node for each of these N timing advances. Since one of the N timing advances (i.e., the first timing advance) is suitable for the terminal, the RAN node can receive the first information indicating the first timing advance within the first time window. Subsequently, the RAN node can indicate the first timing advance to the terminal so that the terminal can perform uplink timing based on the first timing advance. Using the method shown in Figure 4, the terminal can synchronize with the RAN node and access the network without relying on GNSS information. Therefore, the method shown in Figure 4 is applicable to terminals without GNSS capabilities, such as terminals that have not deployed a GNSS module. Of course, the method shown in Figure 4 is also applicable to terminals with GNSS capabilities. For example, when the terminal cannot reliably obtain GNSS information or wants to save power, the terminal can use the method shown in Figure 4 to determine the uplink timing of the RAN node. The inability of the terminal to reliably obtain GNSS information can be understood as the terminal's GNSS module being interfered with and temporarily unable to locate or the location being inaccurate, or as the GNSS signal being weak and the terminal not being able to receive it, or as the terminal being able to receive the GNSS signal but obtaining inaccurate location information based on the GNSS signal.

[0144] Understandably, the method shown in Figure 4 can be applied to various communication scenarios, such as random access procedures. The methods provided in this application will be described below using both two-step and four-step random access procedures.

[0145] As shown in Figure 7, another communication method provided in this application may include the following steps:

[0146] S701: The RAN node sends an SSB. Correspondingly, the terminal receives the SSB from the RAN node.

[0147] In this application, the RAN node can be RAN node 101 in the communication system 1000 shown in Figure 1, and the terminal can be any terminal in the communication system 1000 shown in Figure 1, such as terminal 102. The SSB can indicate N timing advances. The SSB corresponds to the broadcast message in the method shown in Figure 4; for a detailed description, please refer to the description of the broadcast message in the method shown in Figure 4. The description of the N timing advances can also refer to the corresponding description in the method shown in Figure 4, and will not be repeated here.

[0148] S702: The terminal sends message A (MsgA) to the RAN node for each of the N timing advances. Correspondingly, the RAN node receives message A from the terminal in the first time window.

[0149] One possible implementation involves the terminal acquiring at least one preamble and at least one random access opportunity based on the SSB. For any one of the N timing advances, such as a second timing advance, the terminal determines one random access opportunity from the at least one random access opportunity, such as a first random access opportunity, determines one preamble from the at least one preamble, such as the first preamble, and determines the uplink timing of the first random access opportunity based on the second timing advance. Based on the determined uplink timing, the terminal sends message A, which includes the first preamble. Message A also indicates the second timing advance. It should be understood that in the method shown in Figure 7, the first time window is one random access opportunity.

[0150] Understandably, to reduce access latency, N messages A occupy the same random access opportunity. In other words, the terminal determines the uplink timing for the same random access opportunity based on each of the N timing advances. Therefore, the terminal can determine N uplink timings and send message A based on each of these N uplink timings. It should be understood that the RAN node can receive one message A on the same random access opportunity, and the timing advance indicated by message A is the timing advance associated with the area where the terminal is located, i.e., the first timing advance in the method shown in Figure 4.

[0151] Understandably, if message A sent by the terminal based on other timing advances (such as timing advances other than the first timing advance among N timing advances) also falls within a random access opportunity, the RAN node will also indicate that other timing advance to the terminal, thus causing the terminal to determine an incorrect timing advance. Therefore, to avoid this situation, in the time domain, the time interval between any two adjacent random access opportunities can be greater than or equal to a first value. For example, the first value is equal to (M×D), where D is the first difference and M is a positive integer.

[0152] In this application, the random access opportunities occupied by the N messages A can be not exactly the same or completely different, without restriction. Furthermore, the preambles included in the N messages A can be the same or different.

[0153] Understandably, message A can indicate the timing advance either explicitly or implicitly.

[0154] One possible implementation is that message A includes an identifier of the timing advance it indicates.

[0155] Example 1: For the second timing advance, message A includes an identifier for the second timing advance.

[0156] Another possible implementation involves N timing advances, with different timing advances associated with different random access resources. These random access resources include at least one of a random access timing or a preamble.

[0157] Example 2: Taking different timing advances associated with different preambles as an example, for the second timing advance, the terminal can send message A to the RAN node based on the second timing advance. Message A includes the preamble associated with the second timing advance.

[0158] Example 3: Taking different timing advances associated with different random access opportunities as an example, for the second timing advance, the terminal can determine the uplink timing of the random access opportunity associated with the second timing advance based on the second timing advance, and send message A based on the uplink timing.

[0159] Example 4: Taking different timing advances associated with different random access opportunities and different preambles as an example, for the second timing advance, the terminal can determine the uplink timing of the random access opportunity associated with the second timing advance based on the second timing advance, and send message A based on the uplink timing. Message A includes the preamble associated with the second timing advance.

[0160] Optionally, N timing advances are associated with a first type of random access resource. This first type of random access resource is used by terminals unable to obtain location information (such as GNSS information) to initiate random access. The first type of random access resource includes at least one of a random access timing or a preamble. A terminal unable to obtain location information can be understood as a terminal without GNSS capability, a terminal unable to reliably obtain GNSS information, or a terminal that wants to save power by not activating GNSS. In other words, random access resources can be divided into two types: one type of random access resource (such as the first type) is associated with terminals unable to obtain location information, and the other type of random access resource (such as the second type) is associated with terminals capable of obtaining location information. Therefore, the former type of terminal can initiate random access using the first type of random access resource, and the latter type of terminal can initiate random access using the second type of random access resource. The RAN node can determine the type of terminal initiating random access based on the random access resource, and thus determine which communication method to use with the terminal. For example, for the former type of terminal, the RAN node uses the method provided in this application to communicate with the terminal; for the latter type of terminal, the RAN node uses a method from conventional technology to communicate with the terminal. For example, since the former type of terminal cannot obtain location information, the RAN node can shorten the time interval for transmitting timing advance adjustments so that the terminal can adjust its uplink timing in a timely manner. Since the latter type of terminal can obtain location information, it can determine the uplink timing based on that information. Therefore, the RAN node can increase the time interval for transmitting timing advance adjustments to reduce signaling overhead.

[0161] Understandably, either the first type of random access resource or the second type of random access resource can be configured by the RAN node.

[0162] It is understandable that message A corresponds to the first information in the method shown in Figure 4, so other descriptions of S702 can be referred to the introduction in S402 above, and will not be repeated here.

[0163] S703: The RAN node sends message B (MsgB) to the terminal. Correspondingly, the terminal receives message B from the RAN node.

[0164] In this application, message B indicates a first timing advance so that the terminal can determine to use the first timing advance to communicate with the RAN node.

[0165] Understandably, the way message B indicates the first timing advance is related to the way message A indicates the first timing advance. For example, in Example 1 above, message B includes an identifier for the first timing advance. In Example 2 above, message B includes a preamble associated with the first timing advance. In Example 3 above, the RAN node can send message B to the terminal in a second time window, and the terminal receives message B in the second time window. The second time window is associated with the first time window; for example, the first time window is the random access opportunity associated with the first timing advance, and the second time window is the time window for the random access response (RAR) associated with that random access opportunity. Therefore, the terminal can determine the first time window based on the second time window and determine the first timing advance based on the first time window. In Example 4 above, the RAN node can send message B to the terminal in the second time window, and the terminal receives message B in the second time window. The second time window is associated with the first time window. Optionally, message B may also include a preamble associated with the first timing advance.

[0166] Optionally, message B may also include a timing advance adjustment amount, so that the terminal can determine the uplink timing based on the timing advance adjustment amount and the first timing advance amount, thereby synchronizing with the RAN node.

[0167] In this application, the amount of advance adjustment can be positive, negative or 0, without restriction.

[0168] Understandably, since N timing advances are common timing advances, the terminal and RAN node can agree (or the protocol can agree) that the timing advance associated with a region is either the maximum or minimum timing advance for that region. If the agreed-upon timing advance for a region is the maximum timing advance for that region, then the timing advance sent by the RAN node is negative or 0. If the agreed-upon timing advance for a region is the minimum timing advance for that region, then the timing advance sent by the RAN node is positive or 0. In this case, message B does not need to indicate whether the timing advance adjustment is positive or negative.

[0169] Understandably, since terminals capable of acquiring location information can perform uplink timing based on that information, the timing advance adjustment amount indicated by the RAN node could be either positive or negative. In this case, message B could include first indication information indicating whether the timing advance adjustment amount is positive or negative. For example, the first indication information could include 1 bit; when the value of this 1 bit is "0", the timing advance adjustment amount is positive; when the value of this 1 bit is "1", the timing advance adjustment amount is negative, and vice versa.

[0170] In summary, the content of message B may differ depending on the scenario. To ensure the terminal can correctly parse message B, the RAN node can indicate the format of message B, such as whether message B carries first indication information. Alternatively, if a terminal that cannot obtain location information and a terminal that can obtain location information are associated with different random access resources, the terminal and the RAN node can determine the format of message B based on the random access resources. For example, if message A is associated with a first type of random access resource, the terminal and the RAN node determine that message B does not carry first indication information; if message A is associated with a second type of random access resource, the terminal and the RAN node determine that message B carries first indication information. In this way, the RAN node may not indicate the format of message B, thus saving signaling overhead.

[0171] It is understandable that message B corresponds to the second information in the method shown in Figure 4, so other descriptions of S703 can be found in the description of S403 above, and will not be repeated here.

[0172] S704: The terminal communicates with the RAN node based on the first timing advance.

[0173] One possible implementation is that the terminal can determine the uplink timing of the RAN node based on a first timing advance, and send uplink data to the RAN node according to the determined uplink timing.

[0174] Understandably, if message B also includes a timing advance adjustment amount, the terminal can determine the uplink timing of the RAN node based on the timing advance adjustment amount and the first timing advance amount.

[0175] Based on the method shown in Figure 7, the terminal can obtain N timing advances through the SSB, and determine the first timing advance that suits it from the N timing advances through a two-step random access process, thereby achieving synchronization with the RAN node without relying on GNSS information.

[0176] The method provided in this application is described below in conjunction with the four-step random access process.

[0177] As shown in Figure 8, another communication method provided in this application may include the following steps:

[0178] S801: The RAN node sends an SSB. Correspondingly, the terminal receives the SSB from the RAN node.

[0179] In this application, the RAN node can be RAN node 101 in the communication system 1000 shown in Figure 1, and the terminal can be any terminal in the communication system 1000 shown in Figure 1, such as terminal 102. The SSB can indicate N timing advances. The SSB corresponds to the broadcast message in the method shown in Figure 4; for a detailed description, please refer to the description of the broadcast message in the method shown in Figure 4. The description of the N timing advances can also refer to the corresponding description in the method shown in Figure 4, and will not be repeated here.

[0180] S802: The terminal sends message 1 (Msg1) to the RAN node for each of the N timing advances. Correspondingly, the RAN node receives message 1 from the terminal in the first time window.

[0181] One possible implementation involves the terminal acquiring at least one preamble and at least one random access opportunity based on the SSB. For any one of the N timing advances, such as a second timing advance, the terminal determines one random access opportunity from the at least one random access opportunity, such as a first random access opportunity, determines one preamble from the at least one preamble, such as the first preamble, and determines the uplink timing of the first random access opportunity based on the second timing advance. Based on the determined uplink timing, message 1 is sent, which includes the first preamble. Message 1 also indicates the second timing advance. It should be understood that in the method shown in Figure 8, the first time window is one random access opportunity.

[0182] One possible design is that N messages occupy the same random access opportunity.

[0183] One possible design is that, in the time domain, the time interval between any two adjacent random access opportunities can be greater than or equal to a first value. For example, the first value is equal to (M × D), where D is the first difference and M is a positive integer.

[0184] Understandably, the random access opportunities occupied by N messages 1 can be not exactly the same, or even completely different, without restriction. Furthermore, among the N messages 1, the preambles of different messages 1 can be the same or different.

[0185] Understandably, message 1 can indicate timing advance either explicitly or implicitly.

[0186] One possible implementation is that message 1 includes an identifier of the timing advance it indicates.

[0187] Another possible implementation involves N timing advances, with different timing advances associated with different random access resources. These random access resources include at least one of a random access timing or a preamble.

[0188] Optionally, N timing advances are associated with the first type of random access resources. The first type of random access resources are used by terminals unable to obtain positioning information (such as GNSS information) to initiate random access. The first type of random access resources includes at least one of random access timing or a preamble. A terminal unable to obtain positioning information can be understood as a terminal without GNSS capability, or a terminal unable to reliably obtain GNSS information.

[0189] It is understandable that message 1 corresponds to the first information in the method shown in Figure 4, and also to message A in the method shown in Figure 7. Therefore, for a detailed description of S802, please refer to the descriptions in S402 and S702 above, and will not be repeated here.

[0190] S803: The RAN node sends message 2 (Msg2) to the terminal. Correspondingly, the terminal receives message 2 from the RAN node.

[0191] Message 2 indicates a first timing advance so that the terminal can determine to use the first timing advance to communicate with the RAN node.

[0192] Optionally, message 2 may also include a timing advance adjustment amount, so that the terminal can determine the uplink timing based on the timing advance adjustment amount and the first timing advance amount, thereby synchronizing with the RAN node.

[0193] In this application, the amount of advance adjustment can be positive, negative or 0, without restriction.

[0194] Optionally, message 2 may indicate whether the timing advance adjustment amount is positive or negative. For example, message 2 may include first indication information indicating whether the timing advance adjustment amount is positive or negative.

[0195] Optionally, the RAN node can indicate the format of message 2, such as whether message 2 carries the first indication information. Alternatively, the terminal and the RAN node can determine the format of message 2 based on the type of random access resource (such as a first type of random access resource or a second type of random access resource).

[0196] It is understandable that message 2 corresponds to the second information in the method shown in Figure 4, and also to message B in the method shown in Figure 7. Therefore, for a detailed description of S803, please refer to the descriptions in S403 and S703 above, and will not be repeated here.

[0197] S804: The terminal sends message 3 (Msg3) to the RAN node according to the first timing advance. Correspondingly, the RAN node receives message 3 from the terminal.

[0198] One possible implementation is that the terminal can determine the uplink timing of the RAN node based on the first timing advance, and send message 3 to the RAN node according to the determined uplink timing.

[0199] Understandably, if message 2 also includes a timing advance adjustment amount, the terminal can determine the uplink timing of the RAN node based on the timing advance adjustment amount and the first timing advance amount.

[0200] S805: The RAN node sends message 4 (Msg4) to the terminal. Correspondingly, the terminal receives message 4 from the RAN node.

[0201] In this application, message 4 is a conflict resolution message, and the terminal can determine whether the access was successful based on message 4.

[0202] Based on the method shown in Figure 8, the terminal can obtain N timing advances through SSB, and determine the first timing advance that suits it from the N timing advances through messages 1 and 2, thereby achieving synchronization with the RAN node without relying on GNSS information.

[0203] In the method shown in Figure 8, the terminal determines its first timing advance from N timing advances using messages 1 and 2. In practical applications, the terminal can also determine the first timing advance using messages 3 and 4 instead of messages 1 and 2. This will be explained in detail below.

[0204] As shown in Figure 9, another communication method provided in this application may include the following steps:

[0205] S901: The RAN node sends an SSB. Correspondingly, the terminal receives the SSB from the RAN node.

[0206] In this application, the RAN node can be RAN node 101 in the communication system 1000 shown in Figure 1, and the terminal can be any terminal in the communication system 1000 shown in Figure 1, such as terminal 102. The SSB can indicate N timing advances. The SSB corresponds to the broadcast message in the method shown in Figure 4; for a detailed description, please refer to the description of the broadcast message in the method shown in Figure 4. The description of the N timing advances can also refer to the corresponding description in the method shown in Figure 4, and will not be repeated here.

[0207] S902: The terminal sends message 1 to the RAN node for each of the N timing advances. Correspondingly, the RAN node receives message 1 from the terminal in the third time window.

[0208] One possible implementation involves the terminal acquiring at least one preamble and at least one random access opportunity based on the SSB. For any one of the N timing advances, such as the second timing advance, the terminal determines one random access opportunity from the at least one random access opportunity, such as the first random access opportunity, determines one preamble from the at least one preamble, such as the first preamble, and determines the uplink timing of the first random access opportunity based on the second timing advance. Based on the determined uplink timing, message 1 is sent, which includes the first preamble. It should be understood that in the method shown in Figure 9, the third time window is a random access opportunity.

[0209] One possible design is that N messages occupy the same random access opportunity.

[0210] One possible design is that, in the time domain, the time interval between any two adjacent random access opportunities can be greater than or equal to a first value. For example, the first value is equal to (M × D), where D is the first difference and M is a positive integer.

[0211] Understandably, the random access opportunities occupied by N messages 1 can be not exactly the same, or even completely different, without restriction. Furthermore, among the N messages 1, the preambles of different messages 1 can be the same or different.

[0212] S903: The RAN node sends message 2 to the terminal. Correspondingly, the terminal receives message 2 from the RAN node.

[0213] Optionally, message 2 includes a timed advance adjustment amount.

[0214] Understandably, in the method shown in Figure 9, messages 1 and 2 do not indicate timing advance, so the terminal cannot determine the correct timing advance, nor can it determine which of the N timing advance adjustments included in message 2 applies to. Therefore, the terminal can determine the uplink timing based on each of the N timing advances and send message 3 to the RAN node based on each uplink timing. For example, the terminal can execute S904.

[0215] S904: The terminal sends message 3 to the RAN node for each of the N timing advances. Correspondingly, the RAN node receives message 3 from the terminal in the first time window.

[0216] One possible implementation is that the terminal determines N first moments based on N timing advances, and sends a corresponding message 3 at each of the N first moments. Any two of the N first moments are different. Message 3 corresponding to the second timing advance indicates the second timing advance, which is any one of the N timing advances. The first time window is the time window in which the RAN node expects to receive message 3, such as the data transmission resources corresponding to the random access timing. Therefore, the RAN node can receive one message 3 in the first time window, and the timing advance indicated by message 3 is the timing advance associated with the area where the terminal is located, i.e., the first timing advance.

[0217] Understandably, to reduce access latency, the random access timings for N messages 3 are the same; that is, among N messages 3, the random access timings corresponding to the data transmission resources carrying different messages 3 are the same. Of course, the random access timings for N messages 3 can also be not exactly the same, or even completely different, without restriction.

[0218] Understandably, message 3 can indicate a timing advance. For example, message 3 includes an identifier of the timing advance it indicates. Optionally, N timing advances are associated with a first type of random access resource. This first type of random access resource is used by terminals that cannot obtain location information (such as GNSS information) to initiate random access. The first type of random access resource includes at least one of a random access timing or a preamble. A terminal that cannot obtain location information can be understood as a terminal without GNSS capability, a terminal that cannot reliably obtain GNSS information, or a terminal that wants to save power by not activating GNSS. For details, please refer to the corresponding description in S702.

[0219] It is understandable that message 3 corresponds to the first information in the method shown in Figure 4, so the specific description of S904 can be found in the description of S402 above, and will not be repeated here.

[0220] S905: The RAN node sends message 4 to the terminal. Correspondingly, the terminal receives message 4 from the RAN node.

[0221] In this application, message 4 is a conflict resolution message, which the terminal can use to determine whether access was successful. Furthermore, in the method shown in Figure 9, message 4 also indicates a first timing advance. If message 4 includes an identifier for the first timing advance, the terminal can determine to use the first timing advance when communicating with the RAN node. It is understood that if message 2 also includes a timing advance adjustment, the terminal can determine the uplink timing of the RAN node based on the timing advance adjustment and the first timing advance, and communicate with the RAN node based on that uplink timing.

[0222] In this application, the timing advance adjustment amount can be positive, negative, or 0, without restriction. Optionally, message 2 can indicate whether the timing advance adjustment amount is positive or negative. For example, message 2 may include first indication information indicating whether the timing advance adjustment amount is positive or negative. Optionally, the RAN node can indicate the format of message 2, such as indicating whether message 2 carries the first indication information. Alternatively, the terminal and the RAN node determine the format of message 2 based on the type of random access resource (such as a first type of random access resource or a second type of random access resource). For details, please refer to the description in section 703 above.

[0223] It is understandable that message 4 corresponds to the second information in the method shown in Figure 4, so the specific description of S905 can be found in the description of S403 above, and will not be repeated here.

[0224] Based on the method shown in Figure 9, the terminal can obtain N timing advances through SSB, and determine the first timing advance that suits it from the N timing advances through messages 3 and 4, thereby achieving synchronization with the RAN node without relying on GNSS information.

[0225] It is understood that the actions of the RAN node or terminal in the above steps can be executed by the processor 301 in the communication device 30 shown in Figure 3, which calls the application code stored in the memory 303. This application does not impose any restrictions on this.

[0226] The various embodiments mentioned above in this application can be combined without contradiction, and no limitation is imposed.

[0227] The above mainly describes the solution provided in this application from the perspective of interaction between various network elements. Correspondingly, this application also provides a communication device, which can be a terminal in the above method embodiments, or a device containing the above terminal, or a component usable in a terminal; or, the communication device can be a RAN node in the above method embodiments, or a device containing the above RAN node, or a component usable in a RAN node. It is understood that the above-mentioned terminal or RAN node, etc., includes hardware structures and / or software modules corresponding to the execution of each function in order to achieve the above functions. Those skilled in the art should readily recognize that, based on the unit and algorithm operations 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 by 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.

[0228] This application can divide the terminal or RAN node into functional modules based on the above method examples. For example, each function can be divided into its own functional module, 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 is understood that the module division in this application is illustrative and only represents one logical functional division; other division methods may be used in actual implementation.

[0229] For example, when functional modules are integrated, Figure 10 shows a schematic diagram of a communication device 100. The communication device 100 includes an interface module 1001 and a processing module 1002. The interface module 1001, also called an interface unit, is used to perform transmit and receive operations; for example, it can be an interface circuit, transceiver, or communication interface. The processing module 1002, also called a processing unit, is used to perform operations other than transmit and receive operations; for example, it can be a processing circuit or a processor.

[0230] In some embodiments, the communication device 100 may further include a storage module (not shown in FIG10) for storing program instructions and data.

[0231] In some embodiments, the communication device 100 may further include an AI module (not shown in FIG. 10) for implementing AI-related functions. The AI ​​module can implement AI functions through software, hardware, or a combination of software and hardware. For example, the AI ​​module includes an RIC module. Optionally, the AI ​​module and the storage module are integrated into one module, or the AI ​​module and the processing module 1002 are integrated into one module.

[0232] For example, the communication device 100 is used to implement the functions of a terminal. The communication device 100 is, for example, the terminal described in the embodiment shown in FIG4, the embodiment shown in FIG7, the embodiment shown in FIG8, or the embodiment shown in FIG9.

[0233] The interface module 1001 is used to receive broadcast messages. For example, the interface module 1001 can be used to execute S401, S701, S801 or S901.

[0234] Processing module 1002 is used to control interface module 1001 to send first information to the RAN node for each of the N timing advances. For example, processing module 1002 can be used to execute S402, S702, S802 or S904.

[0235] Interface module 1001 is also used to receive second information from the RAN node. For example, interface module 1001 can be used to execute S403, S703, S803 or S905.

[0236] The processing module 1002 is also used to control the interface module 1001 to communicate with the RAN node according to the first timing advance. For example, the processing module 1002 can be used to execute S404, S704 or S804.

[0237] When used to implement the functions of a terminal, other functions that the communication device 100 can implement can be referred to the relevant descriptions of the embodiments shown in FIG4, FIG7, FIG8 or FIG9, which will not be elaborated further.

[0238] Alternatively, by way of example, the communication device 100 is used to implement the functions of a RAN node. The communication device 100 is, for example, the RAN node described in the embodiment shown in FIG4, the embodiment shown in FIG7, the embodiment shown in FIG8, or the embodiment shown in FIG9.

[0239] The processing module 1002 is used to control the interface module 1001 to send broadcast messages. For example, the processing module 1002 can be used to execute S401, S701, S801 or S901.

[0240] The processing module 1002 is also used to control the interface module 1001 to receive first information from the terminal in the first time window. For example, the processing module 1002 can be used to execute S402, S702, S802 or S904.

[0241] The processing module 1002 is also used to control the interface module 1001 to send second information to the terminal. For example, the processing module 1002 can be used to execute S403, S703, S803 or S905.

[0242] When used to implement the functions of a RAN node, other functions that the communication device 100 can implement can be referred to the relevant descriptions of the embodiments shown in FIG4, FIG7, FIG8 or FIG9, which will not be elaborated further.

[0243] In a simplified embodiment, those skilled in the art will recognize that the communication device 100 can take the form shown in FIG3. For example, the processor 301 in FIG3 can invoke computer execution instructions stored in memory 303 to cause the communication device 100 to perform the method described in the above-described method embodiment.

[0244] For example, the functions / implementation processes of the processing module 1002 and interface module 1001 in FIG10 can be implemented by the processor 301 in FIG3 calling computer execution instructions stored in memory 303. Alternatively, the functions / implementation processes of the processing module 1002 in FIG10 can be implemented by the processor 301 in FIG3 calling computer execution instructions stored in memory 303, and the functions / implementation processes of the interface module 1001 in FIG10 can be implemented by the transceiver 302 in FIG3.

[0245] It is understood 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 system-on-a-chip (SoC) or an application-specific integrated circuit (ASIC), or it can be a stand-alone semiconductor chip. In addition to the core that executes 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.

[0246] 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.

[0247] Optionally, this application also provides 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 chip system further includes a memory. Optionally, the chip system may be composed of chips or may include chips and other discrete devices; this application does not specifically limit this.

[0248] Optionally, this application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the aforementioned computer-readable storage medium. When executed, the program can include the processes described in the above method embodiments. The computer-readable storage medium can be an internal storage unit of the communication device in any of the foregoing embodiments, such as the hard disk or memory of the communication device. The aforementioned computer-readable storage medium can also be an external storage device of the communication device, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the communication device. Further, the aforementioned computer-readable storage medium can include both internal storage units and external storage devices of the communication device. The aforementioned computer-readable storage medium is used to store the aforementioned computer program and other programs and data required by the communication device. The aforementioned computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0249] Optionally, this application also provides a computer program product. All or part of the processes in the above method embodiments can be executed by a computer program instructing related hardware. This program can be stored in the above computer program product, and when executed, it can include the processes described in the above method embodiments.

[0250] Optionally, this application also provides computer instructions. All or part of the processes in the above method embodiments can be executed by computer instructions instructing related hardware (such as a computer, processor, terminal, or RAN node). The program can be stored in the aforementioned computer-readable storage medium or the aforementioned computer program product.

[0251] Optionally, this application also provides a communication system, including: the RAN node and terminal in the above embodiments.

[0252] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0253] It is understood that the message names between various network elements or the names of various parameters in the messages in the above embodiments of this application are just examples, and other names may be used in the specific implementation. This application does not make any specific limitations on this.

[0254] It is understood that in this application, " / " can indicate that the objects before and after it are in an "or" relationship. For example, A / B can mean A or B. "And / or" can be used to describe three relationships between the related objects. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. Here, A and B can be singular or plural. Furthermore, expressions like "at least one of A, B, and C" or "at least one of A, B, or C" are generally used to indicate any of the following: A exists alone; B exists alone; C exists alone; A and B exist simultaneously; A and C exist simultaneously; B and C exist simultaneously; A, B, and C exist simultaneously. The above examples using three elements (A, B, and C) illustrate the optional entries for this item. When the expression contains more elements, its meaning can be obtained according to the aforementioned rules.

[0255] To facilitate the description of the technical solutions of this application, the terms "first" and "second" may be used to distinguish technical features with the same or similar functions. The terms "first" and "second" do not limit the number or execution order, nor do they imply that they are necessarily different. In this application, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as "exemplary" or "for example" should not be construed as being more preferred or advantageous than other embodiments or design schemes. The use of "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner for ease of understanding.

[0256] It is understood that the term "embodiment" used throughout the specification means that a specific feature, structure, or characteristic related to an embodiment is included in at least one embodiment of this application. Therefore, various embodiments throughout the specification do not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. It is understood that in the various embodiments of this application, the sequence number of each process does not imply a sequential order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of this application.

[0257] It is understood that in this application, "when," "under the circumstances," "if," and "if" all refer to the corresponding processing that will be carried out under certain objective circumstances, and are not time-limited, nor do they require that there must be a judgment action when implemented, nor do they imply any other limitations.

[0258] In this application, "simultaneously" can be understood as at the same point in time, within a period of time, or within the same cycle.

[0259] In this application, "greater than or equal to" can be replaced with "greater than" or "equal to"; "less than or equal to" can be replaced with "less than" or "equal to". For example, "A is greater than or equal to B" can be replaced with "A is greater than B" or "A is equal to B"; "A is less than or equal to B" can be replaced with "A is less than B" or "A is equal to B".

[0260] It is understood that some optional features in this application can be implemented independently in certain scenarios without relying on other features, such as the current solution upon which they are based, to solve the corresponding technical problems and achieve the corresponding effects. Alternatively, they can be combined with other features as needed in certain scenarios. Correspondingly, the apparatus provided in this application can also implement these features or functions, which will not be elaborated here.

[0261] It is understood that the same step or step with the same function or technical feature in this application can be referenced and learned from each other in different embodiments.

[0262] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0263] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0264] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0265] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any changes or substitutions within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A communication method, characterized in that, The method includes: Receive broadcast messages, which indicate N timing advances, with different timing advances associated with different regions, where N is an integer greater than 1; For each of the N timing advances, a first message is sent to the first communication node, and any one of the N first messages indicates the timing advance corresponding to the first message. The first communication node receives second information from the first communication node, the second information indicating a first timing advance, the first timing advance being included in the N timing advances, and the first information corresponding to the first timing advance being received by the first communication node in a first time window. Communicate with the first communication node according to the first timing advance.

2. The method according to claim 1, characterized in that, Each of the N first pieces of information is a randomly accessed message 1, and the second piece of information is a randomly accessed message 2; or... Each of the N first pieces of information is a randomly accessed message A, and the second piece of information is a randomly accessed message B; or... Each of the N first pieces of information is a randomly accessed message 3, and the second piece of information is a randomly accessed message 4.

3. The method according to claim 2, characterized in that, N randomly accessed messages 1 occupy the same random access opportunity; or, N randomly accessed messages A occupy the same random access opportunity; or... The random access timings corresponding to N random access messages are the same.

4. The method according to any one of claims 1-3, characterized in that, Among the N timing advances, different timing advances are associated with different random access resources, and the random access resources include at least one of random access timing or preamble.

5. The method according to any one of claims 1-4, characterized in that, The N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

6. The method according to any one of claims 1-5, characterized in that, The first time period is greater than or equal to the first threshold. The first time period is determined based on the length of the cyclic prefix of the first information. The first threshold is determined based on the first difference. The first difference is the absolute value of the difference between any two adjacent timing advances after the N timing advances are arranged in order of size.

7. The method according to any one of claims 1-6, characterized in that, In the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to the first value.

8. A communication method, characterized in that, The method includes: Send a broadcast message indicating N timing advances, where different timing advances are associated with different regions, and N is an integer greater than 1; Receive first information from the second communication node in the first time window, the first information indicating a first timing advance, the first timing advance being included in the N timing advances; Send a second message to the second communication node, the second message indicating the first timing advance, the first timing advance being used to determine the uplink timing of the second communication node.

9. The method according to claim 8, characterized in that, The first information is message 1 of random access, and the second information is message 2 of random access; or, The first information is message A of random access, and the second information is message B of random access; or, The first information is message 3 of random access, and the second information is message 4 of random access.

10. The method according to claim 8 or 9, characterized in that, Among the N timing advances, different timing advances are associated with different random access resources, and the random access resources include at least one of random access timing or preamble.

11. The method according to any one of claims 8-10, characterized in that, The N timing advances are associated with a first type of random access resource, which is used by communication nodes that cannot obtain location information to initiate random access. The first type of random access resource includes at least one of random access timing or preamble.

12. The method according to any one of claims 8-11, characterized in that, The first time period is greater than or equal to the first threshold. The first time period is determined based on the length of the cyclic prefix of the first information. The first threshold is determined based on the first difference. The first difference is the absolute value of the difference between any two adjacent timing advances after the N timing advances are arranged in order of size.

13. The method according to any one of claims 8-12, characterized in that, In the time domain, the time interval between any two adjacent random access opportunities is greater than or equal to the first value.

14. A communication device, characterized in that, The apparatus performs the method as described in any one of claims 1 to 7, or the method as described in any one of claims 8 to 13.

15. A chip, characterized in that, include: At least one processor and an interface circuit, the interface circuit being configured to receive a computer program or instructions and transmit them to the at least one processor, the at least one processor being configured to execute the computer program or the instructions, causing the chip to perform the method as described in any one of claims 1 to 7, or the method as described in any one of claims 8 to 13.

16. A computer-readable storage medium having a computer program or instructions stored thereon, characterized in that, When the computer program or instructions are executed, they cause the computer to perform the method as described in any one of claims 1 to 7, or the method as described in any one of claims 8 to 13.

17. A computer program product, said computer program product comprising computer program code, characterized in that, When the computer program code is run on a computer, it causes the computer to implement the method of any one of claims 1 to 7, or the method of any one of claims 8 to 13.

Images