CN110999502B - Random access configuration - Google Patents

Abstract

One or more devices, systems and/or methods for facilitating the execution of a random access procedure are provided. A command corresponding to the random access procedure may be received from a node. The command may be used to determine a resource set. One or more messages corresponding to the random access procedure may be sent to the node based on the resource set.

Description

Random access configuration

Background Art

One or more uplink carriers may be used as a communication link between wireless nodes, such as between a user equipment (UE) and a base station (BS). For example, a UE may access a BS via an uplink carrier and send data to and/or through the BS using the uplink carrier. However, the UE may need to achieve uplink synchronization with the BS to maintain access to the BS via the uplink carrier. Such uplink synchronization may be achieved by performing a random access procedure.

Summary of the invention

According to the present disclosure, one or more devices and/or methods for facilitating the execution of a random access procedure are provided. In one example, a command corresponding to a random access procedure may be received from a node. A resource set including a first time and a second time may be determined based on the command. A first message corresponding to the random access procedure may be sent to the node at a first time. A second message corresponding to the random access procedure may be sent to the node at a second time.

In one example, a configuration corresponding to a plurality of messages may be sent to a node. A command corresponding to a random access procedure may be sent to the node. A first message corresponding to the random access procedure may be received from the node. A second message corresponding to the random access procedure may be received from the node. A response message corresponding to at least one of the first message or the second message may be generated. The response message may be sent to the node.

BRIEF DESCRIPTION OF THE DRAWINGS

Although the technology presented herein can be implemented in alternative forms, the specific embodiments shown in the drawings are merely some examples to supplement the description provided herein. These embodiments should not be interpreted in a limiting manner, such as limiting the appended claims.

1A is a flow chart illustrating one example method for facilitating performance of a random access procedure.

1B is a flow chart illustrating one example method for facilitating performance of a random access procedure.

2 is a diagram illustrating an example system for facilitating performance of a random access procedure.

3 is a diagram illustrating an example system for facilitating performance of a random access procedure.

4 is a diagram illustrating an example system for facilitating performance of a random access procedure.

5 is a diagram illustrating an example system for facilitating performance of a random access procedure.

6 is a diagram illustrating an example system for facilitating performance of a random access procedure.

7 is a diagram illustrating an example system for facilitating performance of a random access procedure.

8 is a diagram illustrating an example system for facilitating performance of a random access procedure.

9 is an illustration of a scenario involving one example configuration of a base station (BS) that may utilize and/or implement at least a portion of the techniques presented herein.

10 is an illustration of a scenario involving an example configuration of a user equipment (UE) that may utilize and/or implement at least a portion of the techniques presented herein.

11 is an illustration of a scenario featuring an example non-transitory computer-readable medium according to one or more of the provisions set forth herein.

DETAILED DESCRIPTION

The subject matter will now be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof and show by way of illustration specific example embodiments. This description is not intended as an extensive or detailed discussion of known concepts. Details commonly known to those of ordinary skill in the relevant art may have been omitted or may be addressed in a summarized manner.

The following subject matter can be implemented in various forms, such as methods, devices, components and/or systems. Therefore, this subject matter is not intended to be interpreted as being limited to any example embodiment set forth herein. On the contrary, example embodiments are provided only for illustration. Such embodiments can, for example, take the form of hardware, software, firmware or any combination thereof.

One or more computing devices and/or technologies for facilitating the execution of a random access process are provided. For example, a user equipment (UE) may be connected to a (e.g., wireless communication) network via a base station (BS) of the network. The UE may use one or more uplink carriers for data transmission to the BS and/or the network. To this end, the UE may (e.g., need to) obtain and/or maintain uplink synchronization with the BS, for example, via a random access process. However, the UE may lose uplink synchronization with the BS (e.g., related to a timeout). Therefore, the UE may need to obtain and/or restore uplink synchronization with the BS. Systems that cannot maintain uplink synchronization between the UE and the BS are subject to (e.g., low) data rate, efficiency, and the like. Therefore, according to one or more techniques proposed herein, multiple messages and/or receiving windows may be used to facilitate the execution of a random access process, and the random access process may establish and/or maintain uplink synchronization, thereby improving the success rate and/or access speed, data rate, efficiency, and the like.

It is understandable that the propagation characteristics of the high frequency band will be significantly weaker than the propagation characteristics of the low frequency band, because the propagation loss of the high frequency band will be greater than the propagation loss of the low frequency band. In order to enhance the coverage of the high frequency band, beamforming technology is generally used to narrow the wireless signal energy and focus on the devices that need to communicate with each other. The exemplary system may not be able to send and/or receive part of the beam at the same time, because it may not be able to traverse one or more (e.g., all) beams at a certain point in time due to the limitations of the corresponding channels. Therefore, initial access may require beam scanning. The process of beam scanning traversal can be in chronological order. The exemplary system may only have a first number of (e.g., two) radio frequency channels, but may need to form a second number of (e.g., seven) beams. In order to traverse all beams, it may be necessary to scan a first number of (e.g., two) beams for a group.

FIG1A illustrates an example 100A of facilitating the execution of a random access procedure between a first wireless node and a second wireless node. The first wireless node may be a network and/or a BS, and the second wireless node may be a UE. The second wireless node may (e.g., need to) send one or more data packets to the first wireless node using an uplink carrier. To this end, the second wireless node may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node via, for example, a random access procedure. Thus, at 105A, the second wireless node may receive a command corresponding to the random access procedure from the first wireless node.

The command may include instructions and/or time domain information. The instructions may include an indication that one or more messages should be sent. Alternatively and/or additionally, if time domain information is included in the command and no indication is included in the command, a (e.g., implicit) determination may be made that more messages should be sent. If the command includes neither instructions nor time domain information, the second wireless node may determine whether one or more messages should be sent based on one or more factors such as the capabilities of the second wireless node. For example, the time domain information may include configuration information that may be used to determine a time to send messages related to a random access procedure (e.g., from the second wireless node and/or to the first wireless node).

The command may include a preamble. For example, one or more messages may be generated together with and/or including a preamble, and the one or more messages may be sent (e.g., from the second wireless node and/or to the first wireless node). In some examples, the command may not include a preamble.

At 110A, a resource set may be determined based on the command. The resource set may include a first time, a second time, and/or one or more other times at which one or more messages related to the random access procedure may be sent. For example, the first time, the second time, and/or one or more other times may be determined based on time domain information in the command. In some examples, the first time may correspond to a first subframe, the second time may correspond to a second subframe, and/or the one or more other times may correspond to one or more other subframes. In some examples, the resource set may include a preamble resource set, which may include one or more preambles.

In some examples, a configuration may be received by the second wireless node and/or from the first wireless node. The configuration may include information related to a setting of the first wireless node (e.g., a base station). A threshold number of messages may be determined based on the configuration. For example, the threshold number of messages may be a (e.g., maximum) number of messages to be sent as part of a first batch of messages associated with a random access procedure.

A first message corresponding to a random access procedure may be generated (e.g., as part of a first batch of messages). A second message corresponding to a random access procedure may also be generated (e.g., as part of a first batch of messages). Depending on a threshold number of messages, one or more other messages may also be generated (e.g., as part of a first batch of messages). The first message, the second message, and/or the one or more messages may be generated using a preamble and/or include a preamble.

At 115A, a first message may be sent to a first wireless node and/or from a second wireless node using a first power at a first time (e.g., and/or a first subframe). At 120A, a second message may be sent to a first wireless node and/or from a second wireless node using a first power (e.g., the power used for 115A) at a second time (e.g., and/or a second subframe).

In some examples, each of the one or more other messages may be sent to the first wireless node and/or from the second wireless node at a time (e.g., and/or subframe) determined in the command-based resource set. In some examples, the first message, the second message, and/or the one or more messages may be sent sequentially. For example, the messages may be sent one after another. In an example of sequential transmission, when the first message is sent and the first receive window is determined and/or run, the second message may not be sent until the first receive window is closed. In some examples, the first message, the second message, and/or the one or more messages may be sent in parallel. For example, messages may be sent independently of each other. In an example of parallel transmission, when the first message is sent and the first receive window is determined and/or run, the second message may be sent before or after the first receive window is closed.

In some examples, a first receiving window may be determined (e.g., generated) based on a first time and/or a first message. The first receiving window may cover a first time period and/or a first number of subframes. A second receiving window may be determined (e.g., generated) based on a second time and/or a second message. The second receiving window may cover a second time period and/or a second number of subframes. Each of one or more receiving windows may be determined (e.g., generated) based on the one or more other times and/or the one or more other messages. It is understood that the second wireless node may monitor the reception of a response to the first message, the second message, and/or the one or more other messages during the first receiving window, the second receiving window, and/or the one or more receiving windows. In some examples, the first receiving window, the second receiving window, and/or the one or more receiving windows may be a random access response (RAR) window.

In some examples, determining the first receive window may include determining a start time of the first receive window and/or determining an end time of the first receive window. The start time may be at or after the first time. The end time may be at or after the start time. In some examples, determining the second receive window may include determining a second start time of the second receive window and/or determining a second end time of the second receive window. The second start time may be at or after the second time. The second end time may be at or after the second start time.

In some examples, in response to determining that a response message corresponding to the first message, the second message, and/or the one or more messages is received within the first receiving window, the second receiving window, and/or the one or more receiving windows (e.g., determined to be a response to these messages), a random access procedure can be established and/or determined to be completed. After the random access procedure is completed, the first receiving window, the second receiving window, and/or the one or more receiving windows can be closed (e.g., terminated). In some examples, the completion of the random access procedure can correspond to uplink synchronization. It can be understood that the response message can be a random access response message.

In some examples, in response to determining that a first identifier in the response message matches a second identifier in the resource set (e.g., when comparing a portion of the response message to a portion of the resource set), it is determined that the random access procedure is complete. The first identifier and/or the second identifier may include a random access preamble identifier.

In some examples, in response to determining that a response message corresponding to the first message, the second message, and/or the one or more messages is not received within the first receiving window, the second receiving window, and/or the one or more receiving windows (e.g., determined to be a response to these messages), the second resource set can be determined based on the command. For example, the second resource set can be determined in response to determining that one or more responses received (e.g., from the first wireless node) do not include a first identifier (e.g., related to the first message, the second message, and/or the one or more messages). The second resource set may include a third time and/or one or more other times at which one or more messages related to the random access process may be sent. For example, the third time may be determined based on the time domain information in the command. In some examples, the third time may correspond to a third subframe. In some examples, the second resource set may include a second preamble resource set, which may include one or more second preambles. In some examples, the first resource set may be the same as the second resource set. In some examples, the first resource set may be different from the second resource set.

In some examples, a third message corresponding to a random access procedure may be generated (e.g., as part of a second batch of messages). The third message may be sent to the first wireless node and/or from the second wireless node using a second power at a third time in the second set of resources. The second power may be the same as or different from the first power. The second power may correspond to a power ramped based on the first power.

In some examples, in response to determining that a response message corresponding to the first message, the second message, and/or the one or more messages is not received within the first receive window, the second receive window, and/or the one or more receive windows (e.g., determined to be responsive to these messages), transmission attempts can be increased (e.g., incremented). For example, additional attempts can be made to send a batch of messages corresponding to the random access procedure to the first wireless node and/or from the second wireless node.

In some examples, a second threshold number of messages may be determined based on the configuration. For example, the second threshold number of messages may be a (e.g., maximum) number of messages to be sent as part of a second batch of messages associated with a random access procedure. The threshold number of messages may be the same as the second threshold number of messages. Alternatively and/or additionally, the threshold number of messages may be different from the second threshold number of messages.

The third receiving window may be determined (eg, generated) based on the third time and/or the third message. The third receiving window may cover a third time period and/or a third number of subframes.

In some examples, determining the third receiving window may include determining a third start time of the third receiving window and/or determining a third end time of the third receiving window. The third start time may be at or after the end time of the first receiving window and/or the second end time of the second receiving window. The third end time may be at or after the third start time.

In some examples, in response to determining that a response message corresponding to (eg, determined to be a response to) a third message is received within a third reception window, a random access procedure may be established and/or determined to be completed.

In some examples, in response to determining that a third identifier in the response message matches a fourth identifier in the second resource set (e.g., when comparing a portion of the response message to a portion of the resource set), the random access procedure is determined to be complete. The third identifier and/or the fourth identifier may include a random access preamble identifier.

In some examples, a first receiving window may be determined (e.g., generated) based on a first time and/or a first message. The first receiving window may cover a first time period and/or a first number of subframes. The first receiving window may be modified (e.g., regenerated) based on a second time and/or a second message to generate a modified first receiving window. The modified first receiving window may cover a second time period (e.g., greater than the first time period) and/or a second number of subframes (e.g., greater than the first number of subframes).

In some examples, determining the first receive window may include determining a start time of the first receive window and/or determining an end time of the first receive window. The start time may be at or after the first time. The end time may be at or after the start time. In some examples, modifying the first receive window may include determining a modified end time that may define the modified first receive window. For example, the modified end time may be after the end time, and/or the modified first receive window may have the start time of the first receive window and the modified end time. For example, modifying the first receive window may include increasing (e.g., or decreasing) a window length of the first receive window to generate the modified first receive window.

In some examples, in response to determining that a response message corresponding to (eg, determined to be a response to) the first message and/or the second message is received within the modified first receiving window, a random access procedure may be established and/or determined to be completed.

In some examples, the random access procedure is determined to be complete in response to determining that a third identifier in the response message matches a second identifier in the resource set and/or a fourth identifier in the second resource set (e.g., when comparing a portion of the response message to a portion of the resource set). The third identifier and/or the fourth identifier may include a random access preamble identifier.

In some examples, in response to determining that a response message corresponding to (e.g., determined to be a response to) the first message, the second message, and/or the one or more messages is not received within the modified first receive window, the second resource set can be determined based on the command. For example, the second resource set can be determined in response to determining that one or more responses received (e.g., from the first wireless node) do not include a first identifier (e.g., related to the first message, the second message, and/or the one or more messages). The second resource set may include a third time and/or one or more other times at which one or more messages related to the random access process may be sent. For example, the third time can be determined based on time domain information in the command. In some examples, the third time may correspond to a third subframe. In some examples, the second resource set may include a second preamble resource set, which may include one or more second preambles. In some examples, the resource set may be the same as the second resource set. In some examples, the resource set may be different from the second resource set.

In some examples, a third message corresponding to a random access procedure may be generated (eg, as part of a second batch of messages). The third message may be sent to the first wireless node and/or from the second wireless node at a third time in the second set of resources.

In some examples, in response to determining that a response message corresponding to (e.g., determined to be a response to) the first message, the second message, and/or the one or more messages is not received within the modified first receive window, transmission attempts can be added (e.g., incremented). For example, additional attempts can be made to send a batch of messages corresponding to a random access procedure to the first wireless node and/or from the second wireless node.

In some examples, the modified first receiving window can be modified (e.g., regenerated) based on the third time and/or the third message to generate a re-modified first receiving window. The re-modified first receiving window can cover a third time period (e.g., greater than the second time period) and/or a third number of subframes (e.g., greater than the third number of subframes).

In some examples, modifying the modified first receive window may include determining a re-modified end time that may define the re-modified first receive window. For example, the re-modified end time may be after the modified end time, and/or the re-modified first receive window may have the start time of the modified first receive window and the re-modified end time. For example, modifying the modified first receive window may include increasing (e.g., or decreasing) a modified window length of the modified first receive window to generate the re-modified first receive window.

In some examples, the re-modified first receiving window can be generated based on the third time and/or the third message. The re-modified first receiving window can be independent of the modified first receiving window. For example, the re-modified first receiving window can be generated after the modified first receiving window has been closed. Alternatively and/or additionally, the re-modified first receiving window can be generated when the modified first receiving window is still open.

In some examples, in response to determining that a response message corresponding to (eg, determined to be a response to) a third message is received within the re-modified first reception window, a random access procedure may be established and/or determined to be completed.

In some examples, in response to determining that a third identifier in the response message matches a second identifier in the resource set and/or a fourth identifier in the second resource set (e.g., when comparing a portion of the response message to a portion of the resource set), the random access procedure is determined to be complete. The third identifier and/or the fourth identifier may include a random access preamble identifier.

An example 100B of facilitating the execution of a random access procedure between a first wireless node and a second wireless node is shown in FIG. 1B. The first wireless node may be a network node and/or a BS, and the second wireless node may be a UE. The second wireless node may (e.g., need to) send one or more data packets to the first wireless node using an uplink carrier. To this end, the second wireless node may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node via, for example, a random access procedure. Therefore, at 105B, the first wireless node may send a configuration corresponding to a plurality of messages to the second wireless node.

The configuration may include information related to the settings of the first wireless node (e.g., a base station). The configuration may define a threshold number of messages. For example, the threshold number of messages may be a (e.g., maximum) number of messages to be sent as part of a first batch of messages associated with a random access procedure.

At 110B, the first wireless node may send a command corresponding to a random access procedure to the second wireless node.

In some examples, the command may include time domain information. For example, the time domain information may include configuration information that can be used to determine a time to send a message related to a random access procedure (e.g., from the second wireless node and/or to the first wireless node). In some examples, the command may include a preamble.

In some examples, the second wireless node may determine a resource set based on the command. The resource set may include a first time, a second time, and/or one or more other times at which one or more messages related to the random access procedure may be sent. For example, the second wireless node may determine the first time, the second time, and/or the one or more other times based on time domain information in the command.

In some examples, the second wireless node may generate a first message corresponding to a random access procedure (e.g., as part of a first batch of messages). The second wireless node may also generate a second message corresponding to the random access procedure (e.g., as part of a second batch of messages). Depending on a threshold number of messages, one or more other messages may also be generated (e.g., as part of a first batch of messages). The first message, the second message, and/or the one or more messages may be generated using and/or include a preamble.

At 115B, a first message may be received by the first wireless node and/or from the second wireless node at a first time (e.g., and/or a first subframe). At 120B, a second message may be received by the first wireless node and/or from the second wireless node at a second time (e.g., and/or a second subframe).

In some examples, each of the one or more other messages may be received by the first wireless node and/or from the second wireless node at a time (e.g., and/or subframe) determined in the commanded resource set. In some examples, the first message, the second message, and/or the one or more messages may be received sequentially. In some examples, the first message, the second message, and/or the one or more messages may be received in parallel.

At 125B, a response message corresponding to (eg, determined as a response to) the first message, the second message, and/or the one or more messages may be generated. It is understood that the response message may be a random access response message.

At 130B, a response message may be sent to the second wireless node and/or from the first wireless node.

In some examples, completion of the random access procedure may be established and/or determined based on the response message (e.g., sent to the second wireless node within one or more receive windows associated with the first message, the second message, etc.). In some examples, completion of the random access procedure may correspond to uplink synchronization.

In some examples, based on the response message (e.g., not sent to the second wireless node within one or more receive windows associated with the first message, the second message, etc.), the second wireless node may determine the second resource set based on the command. For example, the second resource set may be determined in response to determining that one or more responses sent (e.g., from the first wireless node and/or to the second wireless node) do not include a first identifier (associated with the first message, the second message, and/or the one or more messages). The second resource set may include a third time and/or one or more other times at which one or more messages related to the random access process may be received (e.g., by the first wireless node and/or from the second wireless node). For example, the third time may be determined based on time domain information in the command. In some examples, the third time may correspond to a third subframe. In some examples, the second resource set may include a second preamble resource set, and the second preamble resource set may include one or more second preambles. In some examples, the first resource set may be the same as the second resource set. In some examples, the first resource set may be different from the second resource set.

In some examples, based on the response message (e.g., not being sent to the second wireless node within one or more receive windows associated with the first message, the second message, etc.), the second wireless node may generate a third message corresponding to the random access procedure (e.g., as part of a second batch of messages). The third message may be received by the first wireless node and/or from the second wireless node at a third time in the second set of resources.

In some examples, a second response message may be generated that corresponds to (eg, is determined to be a response to) the third message. It is understood that the second response message may be a random access response message.

In some examples, a second response message can be sent to the second wireless node and/or from the first wireless node.

In some examples, based on the second response message (e.g., sent to the second wireless node within one or more receive windows associated with the third message, etc.), completion of the random access procedure can be established and/or determined. In some examples, completion of the random access procedure can correspond to uplink synchronization.

FIG. 2 shows an example of a system 200 for facilitating the execution of a random access procedure between a first wireless node 210 and a second wireless node 205, for example, in a long term evolution (LTE) system. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) send one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210, for example, via a random access procedure. Therefore, the first wireless node 210 may send a command 215 corresponding to the random access procedure to the second wireless node 205. The command 215 may include an instruction to initiate a random access procedure, and may correspond to physical downlink control channel (PDCCH) signaling, a medium access control (MAC) layer, a radio resource control (RRC) signaling, system information (SI), and/or paging of the second wireless node 205.

The second wireless node 205 may select a random access preamble 220 in response to and/or based on the command 215 and/or send the random access preamble 220 to the first wireless node 210. The first wireless node 210 may generate a random access response 225 in response to and/or based on the random access preamble 220 and/or send the random access response 225 to the second wireless node 205. The second wireless node 205 may generate a scheduled transmission 230 in response to and/or based on the random access response 225 and/or send the scheduled transmission 230 to the first wireless node 210.

The scheduled transmission 230 may be based on, for example, a determination of a conflict. The first wireless node 210 may generate a conflict resolution 235 in response to and/or based on the scheduled transmission 230 and/or send the conflict resolution 235 to the second wireless node 205. For example, the conflict resolution 235 may be generated to resolve a conflict determined in connection with the scheduled transmission 230. In some examples, in response to the second wireless node 205 not receiving the random access response 225 and/or receiving a second random access response whose preamble does not match the random access preamble 220, the random access preamble 220 may be retransmitted and/or a counter corresponding to the transmission of the preamble may be incremented.

3 shows an example of a system 300 for facilitating the execution of a random access procedure between a first wireless node 210 and a second wireless node 205. In some examples, the system 300 may be implemented in place of the system 200 and/or as an improvement to the system 200. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) use an uplink carrier to send one or more data packets to the first wireless node 210. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210, for example, via a random access procedure. Therefore, the first wireless node 210 may send a configuration 315 corresponding to the random access procedure to the second wireless node 205.

The second wireless node 205 may determine a threshold number of messages based on the configuration.For example, the threshold number of messages may be the (maximum) number of messages to be sent as part of the first batch of messages related to the random access procedure.

The first wireless node 210 may alternatively and/or additionally send a command 320 corresponding to a random access procedure to the second wireless node 205 .

The second wireless node 205 may determine (eg, generate) a resource set based on the command. The resource set may include a first time, a second time, and/or one or more other times at which one or more messages related to a random access procedure may be sent.

The second wireless node 205 may determine (e.g., generate) a first message 325 corresponding to a random access procedure and/or a second message 330 corresponding to a random access procedure (e.g., as part of a first batch of messages). Depending on the threshold number of messages, one or more other messages may also be generated (e.g., as part of a first batch of messages).

The second wireless node 205 may send a first message 325 to the first wireless node 210 at a first time. The second wireless node 205 may send a second message 330 to the first wireless node 210 at a second time. In some examples, each of the one or more other messages may be sent to the first wireless node and/or from the second wireless node at a time (e.g., and/or subframe) determined in the resource set based on the command. In some examples, the first message, the second message, and/or the one or more messages may be sent sequentially. In some examples, the first message, the second message, and/or the one or more messages may be sent in parallel.

In some examples, the second wireless node 205 may determine (e.g., generate) a first receive window based on the first time and/or the first message. The second wireless node 205 may determine (e.g., generate) a second receive window based on the second time and/or the second message. The second wireless node 205 may determine (e.g., generate) one or more receive windows based on the one or more other times and/or the one or more other messages. It is understood that the second wireless node 205 may monitor the reception of responses to the first message, the second message, and/or the one or more other messages during the first receive window, the second receive window, and/or the one or more receive windows.

The first wireless node 210 may generate a response message 335 based on the first message and/or the second message. The first wireless node 210 may send the response message 335 to the second wireless node 205.

In some examples, in response to determining that a response message 335 corresponding to (e.g., determined as a response to) the first message, the second message, and/or the one or more messages was sent by the first wireless node 210 and/or received by the second wireless node 205 within the first receive window, the second receive window, and/or the one or more receive windows, the random access procedure can be established and/or determined to be completed. In some examples, the completion of the random access procedure can correspond to uplink synchronization.

4 illustrates an example of a system 400 for facilitating execution of a random access procedure between a first wireless node 210 and a second wireless node 205. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) send one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210, e.g., via a random access procedure. Therefore, the second wireless node 205 may determine (e.g., generate) a first message 405.

The second wireless node 205 may send a first message 405 to the first wireless node 210 at a first time (e.g., time 3). The second wireless node 205 may determine (e.g., generate) a first receive window 410 based on the first time and/or the first message 405. The first receive window 410 may have a start time at or after the first time (e.g., time 4) and/or an end time after the start time (e.g., time 13).

The second wireless node 205 may determine (e.g., generate) a second message 415. The second wireless node 205 may send the second message 415 to the first wireless node 210 at a second time (e.g., time 5). The second wireless node 205 may determine (e.g., generate) a second receive window 420 based on the second time and/or the second message 415. The second receive window 420 may have a second start time (e.g., time 6) at or after the second time and/or a second end time (e.g., time 15) after the second start time.

The first wireless node 210 may determine (eg, generate) a response message 425 based on the first message 405 and/or the second message 415. The first wireless node 210 may send the response message 425 to the second wireless node 205.

In response to determining that a response message 425 corresponding to (e.g., determined to be a response to) the first message 405 and/or the second message 415 is received by the second wireless node 205 within the first reception window 410 and/or the second reception window 420 (e.g., between the start time of the first reception window 410 and/or the second end time of the second reception window 420), the random access procedure 430 may be established and/or determined to be completed. In some examples, the completion of the random access procedure 430 may correspond to uplink synchronization.

It will be appreciated that "time" as used herein may be associated with, correspond to, and/or represented by one or more subframes, one or more time slots, and/or one or more symbols.

5 illustrates an example of a system 500 for facilitating performance of a random access procedure between a first wireless node 210 and a second wireless node 205. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) send one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210, e.g., via a random access procedure. Thus, the second wireless node 205 may determine (e.g., generate) a first message 505 (e.g., as part of a first batch of messages associated with a random access procedure).

The second wireless node 205 may send a first message 505 to the first wireless node 210 at a first time (e.g., time 1). The second wireless node 205 may determine (e.g., generate) a first receive window 510 based on the first time and/or the first message 505. The first receive window 510 may have a start time (e.g., time 2) at or after the first time and/or an end time (e.g., time 11) after the start time.

The second wireless node 205 may determine (e.g., generate) a second message 515 (e.g., as part of a first batch of messages associated with a random access procedure). The second wireless node 205 may send the second message 515 to the first wireless node 210 at a second time (e.g., time 3). The second wireless node 205 may determine (e.g., generate) a second receive window 520 based on the second time and/or the second message 515. The second receive window 520 may have a second start time (e.g., time 4) at or after the second time and/or a second end time (e.g., time 13) after the second start time.

The second wireless node 205 may determine (e.g., generate) the third message 525 (e.g., as part of a first batch of messages associated with a random access procedure). Alternatively and/or additionally, the second wireless node 205 may determine (e.g., generate) the third message 525 (e.g., as part of a second batch of messages associated with a random access procedure) in response to determining that a response message corresponding to (e.g., determined to be a response to) the first message 505 and/or the second message 515 has not been received by the second wireless node 205 within the first receiving window 510 and/or the second receiving window 520 (e.g., between the start time of the first receiving window 510 and/or the second end time of the second receiving window 520). The second wireless node 205 may send the third message 525 to the first wireless node 210 at a third time (e.g., time 7). In some examples (e.g., not shown), the third time may be time 12 and/or after the end time of the first receiving window 510 and/or before the second end time of the second receiving window 520. The second wireless node 205 may determine (e.g., generate) a third receive window 530 based on the third time and/or the third message 525. The third receive window 530 may have a third start time (e.g., time 8) at or after the third time and/or a third end time (e.g., time 17) after the third start time.

In some examples, the first receiving window 510 may have the same length as the second receiving window 520 and/or the third receiving window 530. In some examples, the first receiving window 510 may have a different length than the second receiving window 520 and/or the third receiving window 530. In some examples, the second receiving window 520 may have the same length as the third receiving window 530. In some examples, the second receiving window 520 may have a different length than the third receiving window 530.

The first wireless node 210 may determine (eg, generate) a response message 535 based on the first message 505, the second message 515, and/or the third message 525. The first wireless node 210 may send the response message 535 to the second wireless node 205.

In response to determining that a response message 535 corresponding to (e.g., determined as a response to) the first message 505, the second message 515, and/or the third message 525 is received by the second wireless node 205 within the first reception window 510, the second reception window 520, and/or the third reception window 530 (e.g., between the start time of the first reception window 510 and/or the third end time of the third reception window 530), the random access procedure 540 may be established and/or determined to be completed. In some examples, the completion of the random access procedure 540 may correspond to uplink synchronization.

6 illustrates an example of a system 600 for facilitating performance of a random access procedure between a first wireless node 210 and a second wireless node 205. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) send one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210, e.g., via a random access procedure. Thus, the second wireless node 205 may determine (e.g., generate) a first message 605 (e.g., as part of a first batch of messages associated with a random access procedure).

The second wireless node 205 may send a first message 605 to the first wireless node 210 at a first time (e.g., time 1). The second wireless node 205 may determine (e.g., generate) a first receive window 610 based on the first time and/or the first message 605. The first receive window 610 may have a start time (e.g., time 2) at or after the first time and/or an end time (e.g., time 6) after the start time.

The second wireless node 205 may determine (e.g., generate) a second message 615 (e.g., as part of a first batch of messages associated with a random access procedure). The second wireless node 205 may send the second message 615 to the first wireless node 210 at a second time (e.g., time 3). The second wireless node 205 may determine (e.g., generate) a second receive window 620 based on the second time and/or the second message 615. The second receive window 620 may have a second start time (e.g., time 4) at or after the second time and/or a second end time (e.g., time 8) after the second start time.

The first wireless node 210 may send a first response message 625 corresponding to the first message 605 and/or the second message 615 to the second wireless node 205 at a first response time. The second wireless node 205 may determine that the first response message 625 is not received within the first reception window 610 and/or the second reception window 620. Therefore, the second wireless node 205 may determine (e.g., generate) a third message 630 (e.g., as part of a second batch of messages related to the random access procedure) in response to determining that the first response 625 is not received and/or is received outside of the first reception window 610 and/or the second window 620 (e.g., after the end thereof).

The second wireless node 205 may send a third message 630 to the first wireless node 210 at a third time (e.g., time 13). The second wireless node 205 may determine (e.g., generate) a third receive window 635 based on the third time and/or the third message 630. The third receive window 635 may have a third start time (e.g., time 14) at or after the third time and/or a third end time (e.g., time 18) after the third start time.

In some examples, the first receiving window 610 may have the same length as the second receiving window 620 and/or the third receiving window 635. In some examples, the first receiving window 610 may have a different length than the second receiving window 620 and/or the third receiving window 635. In some examples, the second receiving window 620 may have the same length as the third receiving window 635. In some examples, the second receiving window 620 may have a different length than the third receiving window 635.

The first wireless node 210 may determine (eg, generate) a response message 640 based on the third message 630. The first wireless node 210 may send the response message 640 to the second wireless node 205.

In response to determining that a response message 640 corresponding to (e.g., determined to be a response to) the third message 630 is received by the second wireless node 205 within the third reception window 635 (e.g., between a third start time of the third reception window 635 and/or a third end time of the third reception window 635), a random access procedure 645 may be established and/or determined to be completed. In some examples, the completion of the random access procedure 645 may correspond to uplink synchronization.

7 illustrates an example of a system 700 for facilitating execution of a random access procedure between a first wireless node 210 and a second wireless node 205. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210 via, for example, a random access procedure. Thus, the second wireless node 205 may determine (e.g., generate) a first message 705 (e.g., as part of a first batch of messages associated with a random access procedure).

The second wireless node 205 may send a first message 705 to the first wireless node 210 at a first time (e.g., time 3). The second wireless node 205 may determine (e.g., generate) a first receive window 710 based on the first time and/or the first message 705. The first receive window 710 may have a start time at or after the first time (e.g., time 4) and/or an end time after the start time (e.g., time 13).

The second wireless node 205 may determine (e.g., generate) a second message 715 (e.g., as part of a first batch of messages associated with a random access procedure). The second wireless node 205 may send the second message 715 to the first wireless node 210 at a second time (e.g., time 5). The second wireless node 205 may determine (e.g., generate) a modified first receive window including a combination of the first receive window 710 and the first extension 720, wherein the first extension 720 is based on the second time and/or the second message 715. The modified first receive window may have a start time of the first receive window 710 (e.g., time 4) and/or a second end time of the first extension 720 (e.g., time 15).

The second wireless node 205 may determine (e.g., generate) the third message 725 (e.g., as part of a first batch of messages associated with a random access procedure). Alternatively and/or additionally, the second wireless node 205 may determine (e.g., generate) the third message 725 (e.g., as part of a second batch of messages associated with a random access procedure) in response to determining that a response message corresponding to (e.g., determined to be a response to) the first message 705 and/or the second message 715 has not been received by the second wireless node 205 within the first receiving window 710 and/or the modified first receiving window (e.g., between the start time of the first receiving window 710 and/or the second end time of the first extension 720). The second wireless node 205 may send the third message 725 to the first wireless node 210 at a third time (e.g., time 7). The second wireless node 205 may determine (e.g., generate) a re-modified first receiving window including the first receiving window 710, the first extension 720, and the second extension 730 based on the third time and/or the third message 725. The re-modified first receiving window may have the start time of the first receiving window (eg, time 4) and/or the third end time of the second extension 730 (eg, time 17).

The first wireless node 210 may determine (eg, generate) a response message 735 based on the first message 705, the second message 715, and/or the third message 725. The first wireless node 210 may send the response message 735 to the second wireless node 205.

In response to determining that a response message 735 corresponding to (e.g., determined to be a response to) the first message 705, the second message 715, and/or the third message 725 is received by the second wireless node 205 within the re-modified first reception window (e.g., between the start time of the first reception window 710 and/or the third end time of the second extension 730), the random access procedure 740 may be established and/or determined to be completed. In some examples, the completion of the random access procedure 740 may correspond to uplink synchronization.

8 illustrates an example of a system 800 for facilitating performance of a random access procedure between a first wireless node 210 and a second wireless node 205. The first wireless node 210 may be a network and/or a BS, and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g., need to) send one or more data packets to the first wireless node 210 using an uplink carrier. To this end, the second wireless node 205 may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node 210 via, for example, a random access procedure. Thus, the second wireless node 205 may determine (e.g., generate) a first message 805 (e.g., as part of a first batch of messages associated with a random access procedure).

The second wireless node 205 may send a first message 805 to the first wireless node 210 at a first time (e.g., time 1). The second wireless node 205 may determine (e.g., generate) a first receive window 810 based on the first time and/or the first message 805. The first receive window 810 may have a start time (e.g., time 2) at or after the first time and/or an end time (e.g., time 6) after the start time.

The second wireless node 205 may determine (e.g., generate) a second message 815 (e.g., as part of a first batch of messages associated with a random access procedure). The second wireless node 205 may send the second message 815 to the first wireless node 210 at a second time (e.g., time 3). The second wireless node 205 may determine (e.g., generate) a modified first receive window including a combination of the first receive window 810 and the first extension 820, wherein the first extension 820 is based on the second time and/or the second message 815. The modified first receive window may have a start time of the first receive window 810 (e.g., time 2) and/or a second end time of the first extension 820 (e.g., time 8).

The first wireless node 210 may send a first response message 825 corresponding to the first message 805 and/or the second message 815 to the second wireless node 205 at the first response time. The second wireless node 205 may determine that the first response message 825 is not received within the modified first receive window including the first receive window 810 and/or the first extension 820. Therefore, the second wireless node 205 may determine (e.g., generate) a third message 830 (e.g., as part of a second batch of messages related to the random access procedure) in response to determining that the first response 825 is not received and/or is received outside (e.g., at the end of) the modified first receive window.

The second wireless node 205 may send a third message 830 to the first wireless node 210 at a third time (e.g., time 13). The second wireless node 205 may determine (e.g., generate) a third receive window 835 based on the third time and/or the third message 830. The third receive window 635 may have a third start time (e.g., time 14) at or after the third time and/or a third end time (e.g., time 18) after the third start time.

The first wireless node 210 may determine (eg, generate) a response message 840 based on the third message 830. The first wireless node 210 may send the response message 840 to the second wireless node 205.

In response to determining that a response message 840 corresponding to (e.g., determined to be a response to) the third message 830 is received by the second wireless node 205 within the third reception window 835 (e.g., between a third start time of the third reception window 835 and/or a third end time of the third reception window 835), a random access procedure 845 may be established and/or determined to be completed. In some examples, completion of the random access procedure 845 may correspond to uplink synchronization.

9 presents a schematic architectural diagram 900 of a base station 950 (e.g., a node) that can utilize at least a portion of the techniques provided herein. Such a base station 950 can vary widely in configuration and/or capabilities, alone or in combination with other base stations, nodes, link end units, and/or servers, etc., to provide services such as at least some of one or more other disclosed techniques, scenarios, etc. For example, the base station 950 can connect one or more user equipment (UE) to a (e.g., wireless) network (e.g., which can be connected to and/or include one or more other base stations), such as a code division multiple access (CDMA) network, a time division multiple access (TDMA) network, a frequency division multiple access (FDMA) network, an orthogonal FDMA (OFDMA) network, a single carrier FDMA (SC-FDMA) network, etc. The network may implement a radio technology such as Universal Terrestrial Radio Access (UTRA), CDMA13000, Global System for Mobile Communications (GSM), Evolved UTRA (E-UTRA), IEEE 802.11, IEEE 802.16, IEEE 802.20, Flash OFDM, etc. The base station 950 and/or the network may communicate using a standard such as Long Term Evolution (LTE).

The base station 950 may include one or more (e.g., hardware) processors 910 that process instructions. The one or more processors 910 may optionally include: multiple cores; one or more coprocessors, such as a math coprocessor or an integrated graphics processing unit (GPU); and/or one or more layers of local cache memory. The base station 950 may include: a memory 902 that stores various forms of applications such as an operating system 904; one or more base station applications 906; and/or various forms of data, such as a database 908 and/or a file system, etc. The base station 950 may include: various peripheral components, such as a wired and/or wireless network adapter 914 that can be connected to a local area network and/or a wide area network; one or more storage components 916, such as a hard drive, a solid state storage device (SSD), a flash memory device, and/or a magnetic disk and/or optical disk reader; and/or other peripheral components.

The base station 950 may include a motherboard featuring one or more communication buses 912 that interconnect the processor 910, memory 902, and/or various peripherals using various bus technologies (such as a variation of a serial or parallel AT attachment (ATA) bus protocol; a unified serial bus (USB) protocol; and/or a small computer system interface (SCI) bus protocol). In a multi-bus scenario, the communication bus 912 may interconnect the base station 950 with at least one other server. Other components that may optionally be included in the base station 950 (although not shown in the schematic diagram 900 of FIG. 9) include a display; a display adapter, such as a graphics processing unit (GPU); input peripherals, such as a keyboard and/or a mouse; and/or a flash memory device that may store a basic input/output system (BIOS) routine that helps boot the base station 950 to a ready state, etc.

The base station 950 can operate in a variety of physical enclosures such as a desktop or tower server, and/or can be integrated with a display as an "all-in-one" device. The base station 950 can be mounted horizontally and/or mounted in a cabinet or rack, and/or can simply include a set of interconnected components. The base station 950 can include a dedicated and/or shared power supply 918 that provides and/or regulates power for other components. The base station 950 can provide power to and/or receive power from another base station and/or server and/or other device. The base station 950 may include a shared and/or dedicated climate control unit 920 that regulates climate characteristics such as temperature, humidity and/or airflow. Many such base stations 950 can be configured and/or adapted to utilize at least a portion of the technology presented herein.

FIG. 10 presents a schematic architectural diagram 1000 of a user equipment (UE) 1050 (e.g., a node) on which at least a portion of the techniques presented herein may be implemented. Such a UE 1050 may vary widely in configuration and/or capabilities in order to provide a variety of functions to a user. The UE 1050 may be provided in various form factors, such as: a mobile phone (e.g., a smart phone); a desktop or tower workstation; an "all-in-one" device integrated with a display 1008; a laptop, tablet, convertible tablet, or PDA device; a wearable device such as one that may be mounted in headphones, glasses, earpieces, and/or watches, and/or integrated with a piece of clothing; and/or a component of a piece of furniture (e.g., a desktop) and/or a component of other devices (e.g., a vehicle or a residence). The UE 1050 may serve a user in a variety of roles (e.g., a phone, a workstation, a kiosk, a media player, a gaming device, and/or an appliance).

UE 1050 may include one or more (e.g., hardware) processors 1010 that process instructions. The one or more processors 1010 may optionally include: multiple cores; one or more coprocessors, such as a math coprocessor or an integrated graphics processing unit (GPU); and/or one or more layers of local cache memory. UE 1050 may include: a memory 1001 that stores various forms of applications such as an operating system 1003; one or more user applications 1002, such as document applications, media applications, file and/or data access applications, communication applications, such as a web browser and/or email client, utilities and/or games; and/or drivers for various peripherals. UE 1050 may include various peripheral components, such as a wired and/or wireless network adapter 1006 that can be connected to a local area network and/or a wide area network; one or more output components, such as a display 1008 coupled to a display adapter (optionally including a graphics processing unit (GPU)), a sound adapter coupled to a speaker, and/or a printer; input devices for receiving input from a user, such as a keyboard 1011, a mouse, a microphone, a camera and/or a touch-sensitive component of the display 1008; and/or environmental sensors, such as a GPS receiver 1019 that detects the position, speed and/or acceleration of UE 1050, a compass, an accelerometer and/or a gyroscope that detects the physical orientation of UE 1050. Other components that may optionally be included in the UE 1050 (although not shown in the schematic architectural diagram 1000 of FIG. 10 ) include: one or more storage components, such as a hard disk drive, a solid-state storage device (SSD), a flash memory device, and/or a magnetic disk and/or optical disk reader; a flash memory device that may store a basic input/output system (BIOS) routine that helps boot the UE 1050 to a ready state; and/or a climate control unit that regulates climate characteristics such as temperature, humidity, and airflow.

UE 1050 may include: a mainboard featuring one or more communication buses 1012, which interconnect processor 1010, memory 1001, and/or various peripherals using various bus technologies (such as variations of serial or parallel AT attachment (ATA) bus protocols; unified serial bus (USB) protocols; and/or small computer system interface (SCI) bus protocols). UE 1050 may include: dedicated and/or shared power supply 1018 to provide and/or regulate power for other components, and/or a battery 1004 that stores power for use when UE 1050 is not connected to a power source via power supply 1018. UE 1050 may provide power to other client devices and/or receive power from other client devices.

11 is an illustration of a scenario 1100 involving an example non-transitory computer-readable medium 1102. The non-transitory computer-readable medium 1102 may include processor-executable instructions 1112 that, when executed by a processor 1116, cause (e.g., by the processor 1116) execution of at least some of the materials provided herein. The non-transitory computer-readable medium 1102 may include a memory semiconductor (e.g., a semiconductor utilizing static random access memory (SRAM), dynamic random access memory (DRAM), and/or synchronous dynamic random access memory (SDRAM) technology), a platter of a hard drive, a flash memory device, or a magnetic or optical disk (e.g., a compact disk (CD), a digital versatile disk (DVD), and/or a floppy disk). The example non-transitory computer-readable medium 1102 stores computer-readable data 1104 that, when read 1106 by a reader 1110 of a device 1108 (e.g., a read head of a hard drive, or a read operation invoked on a solid-state storage device), expresses processor-executable instructions 1112. In some embodiments, the processor-executable instructions 1112, when executed, cause the execution of operations such as, for example, at least some of the example method 100A of FIG. 1A and/or the example method 100B of FIG. 1B. In some embodiments, the processor-executable instructions 1112 are configured to cause implementation of systems and/or scenarios such as, for example, at least some of the example system 200 of FIG. 2, the example system 300 of FIG. 3, the example system 400 of FIG. 4, the example system 500 of FIG. 5, the example system 600 of FIG. 6, the example system 700 of FIG. 7, and/or the example system 800 of FIG. 8.

As used in this application, "component", "module", "system", "interface", etc. are generally intended to refer to an entity related to a computer, either hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, and/or a computer. As an example, both an application running on a controller and a controller can be a component. One or more components can reside within a process and/or execution thread, and a component can be located on one computer and/or distributed between two or more computers (e.g., (multiple) nodes).

Unless otherwise stated, "first", "second", etc. are not intended to imply a temporal aspect, a spatial aspect, a sequence, etc. Instead, such terms are merely used as identifiers, names, etc. for features, elements, items, etc. For example, a first object and a second object generally correspond to object A and object B or two different or two identical objects or the same object.

In addition, "example" is used herein to mean serving as an example, illustration, etc., and is not necessarily advantageous. As used herein, "or" is intended to mean an inclusive "or" rather than an exclusive "or". In addition, "one" and "a" used in this application are generally interpreted to mean "one or more" unless otherwise specified or clearly pointed to the singular form from the context. Moreover, at least one of A and B, etc. generally refers to A or B or both A and B. In addition, as for "including", "having", "having", "with" and/or variations thereof used in the detailed description or claims, these terms are intended to be included in a manner similar to the term "including".

Although the subject matter has been described in language specific to structural features and/or methodological acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing at least some of the claims.

In addition, standard programming and/or engineering techniques can be used to implement the claimed subject matter as a method, device, or article to produce software, firmware, hardware, or any combination thereof to control a computer (e.g., a node) to implement the disclosed subject matter. The term "article" as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or medium. Of course, many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.

Various operations of embodiments and/or examples are provided herein. The order in which some or all operations are described herein should not be interpreted as implying that these operations are necessarily related to the order. Those skilled in the art who benefit from this description will recognize the order of substitution. In addition, it will be understood that not all operations must be present in each embodiment and/or example provided herein. Moreover, it will be understood that in some embodiments and/or examples, not all operations are required.

Moreover, although the present disclosure has been shown and described with respect to one or more embodiments, other technical personnel in the art will think of equivalent changes and modifications based on reading and understanding of this specification and the drawings. The present disclosure includes all such modifications and changes and is limited only by the scope of the appended claims. In particular, with respect to the various functions performed by the above-mentioned components (e.g., elements, resources, etc.), unless otherwise specified, the terms used to describe such components are intended to correspond to any component that performs the specified function of the component (e.g., functionally equivalent), even if the structure is not identical to the disclosed structure. In addition, although specific features of the present disclosure may have been disclosed for only one embodiment among several embodiments, such features may be combined with one or more other features of other embodiments as desired and advantageous for any given or particular application.

Claims (33)

1. A method of wireless communication, comprising:

receiving a command corresponding to a random access procedure from a node;

determining a first set of resources including a first time and a second time based on the command;

Transmitting a first message corresponding to the random access procedure to the node at the first time; and

Transmitting a second message corresponding to the random access procedure to the node at the second time;

Determining a first receive window based on the first time, and determining a second receive window based on the second time,

Determining that the random access procedure is completed in response to determining that a response message corresponding to at least one of the first message or the second message is received within at least one of the first receiving window or the second receiving window; or alternatively

Determining a first receive window based on the first time, and modifying the first receive window based on the second time to generate a modified first receive window,

Determining that the random access procedure is completed in response to receiving a response message corresponding to at least one of the first message or the second message within the modified first reception window;

the determining that the random access procedure is complete is performed in response to determining that a first identifier in the response message matches a second identifier in the first set of resources.

2. The method according to claim 1, comprising:

Receiving a configuration from the node; and

A threshold number of messages is determined based on the configuration, the first message and the second message corresponding to the threshold number of messages.

3. The method according to claim 1,

The first message and the second message are sent in sequence.

4. The method according to claim 1,

The first message and the second message are sent in parallel.

5. The method according to claim 1,

The first identifier and the second identifier comprise random access preamble identifiers.

6. The method according to claim 1, comprising:

responsive to determining that a response message corresponding to at least one of the first message or the second message is not received within at least one of the first receiving window or the second receiving window, determining a second set of resources including a third time based on the command; and

And transmitting a third message corresponding to the random access procedure to the node at the third time.

7. The method according to claim 1, comprising:

In response to determining that no response message corresponding to at least one of the first message or the second message is received within at least one of the first receiving window or the second receiving window, the transmission attempt is increased by 1.

8. The method according to claim 6, wherein the method comprises,

The first set of resources is the same as the second set of resources.

9. The method according to claim 6, wherein the method comprises,

The first set of resources is different from the second set of resources.

10. The method of claim 6, comprising:

receiving a configuration from the node;

Determining a threshold number of messages based on the configuration, the first message and the second message corresponding to the threshold number of messages; and

A second threshold number of messages is determined based on the configuration, the third message corresponding to the second threshold number of messages.

11. The method of claim 6, comprising:

a third receive window is determined based on the third time.

12. The method of claim 6, the determining the second set of resources is performed in response to determining that the received one or more responses do not include a first identifier.

13. The method of claim 11, comprising:

In response to determining that a second response message corresponding to the third message is received within the third receive window, determining that the random access procedure is complete.

14. The method according to claim 13,

The determining that the random access procedure is complete is performed in response to determining that a third identifier in the second response message matches a fourth identifier in the second set of resources.

15. The method of claim 1, the command comprising time domain information.

16. The method of claim 15, the determining the first set of resources comprising:

Determining the first time based on the time domain information; and

The second time is determined based on the time domain information.

17. The method of claim 1, the command comprising a preamble.

18. The method of claim 17, comprising:

generating the first message based on the preamble; and

The second message is generated based on the preamble.

19. The method of claim 1, the determining the first receive window comprising:

Determining a start time for the first receive window after the first time; and

An end time for the first receive window after the start time is determined.

20. The method of claim 19, the determining the second receive window comprising:

determining a second start time for the second receive window after the second time; and

A second end time for the second receive window is determined after the second start time.

21. The method according to claim 1, comprising:

responsive to determining that a response message corresponding to at least one of the first message or the second message is not received within the modified first receive window, determining a second set of resources including a third time based on the command; and

And transmitting a third message corresponding to the random access procedure to the node at the third time.

22. The method of claim 21, comprising:

receiving a configuration from the node;

Determining a threshold number of messages based on the configuration, the first message and the second message corresponding to the threshold number of messages; and

A second threshold number of messages is determined based on the configuration, the third message corresponding to the second threshold number of messages.

23. The method of claim 21, comprising:

a third receive window is determined based on the third time.

24. The method of claim 21, the determining the second set of resources is performed in response to the received one or more responses not including a first identifier.

25. The method of claim 23, comprising:

In response to receiving a second response message corresponding to the third message within the third receive window, determining that the random access procedure is complete.

26. The method according to claim 25,

The determining that the random access procedure is complete is performed in response to determining that a third identifier in the second response message matches a fourth identifier in the second set of resources.

27. The method of claim 1, the determining the first receive window comprising:

Determining a start time for the first receive window after the first time; and

An end time for the first receive window after the start time is determined.

28. The method of claim 27, the modifying comprising:

a modified end time after the end time is determined, the modified first receive window having the start time and the modified end time.

29. The method of claim 1, the modifying comprising:

and increasing the window length of the first receiving window to generate the modified first receiving window.

30. A method of wireless communication, comprising:

Transmitting configurations corresponding to the plurality of messages to the node;

Transmitting a command corresponding to a random access procedure to the node, enabling the node to determine a first set of resources comprising a first time and a second time based on the command;

Receiving a first message corresponding to the random access procedure from the node;

Receiving a second message corresponding to the random access procedure from the node;

Generating a response message corresponding to at least one of the first message or the second message; and

Transmitting the response message to the node such that the node is capable of determining that the random access procedure is complete in response to determining that a response message corresponding to at least one of a first message or a second message is received within at least one of a first receive window determined based on the first time or a second receive window determined based on the second time; or enabling the node to determine that the random access procedure is complete in response to receiving a response message corresponding to at least one of the first message or the second message within a modified first receive window, wherein the first receive window is determined based on the first time, the modified first receive window is generated by modifying the first receive window based on a second time, and wherein determining that the random access procedure is complete is determined in response to a first identifier in the response message matching a second identifier in the first set of resources.

31. The method of claim 30, comprising:

Receiving a third message corresponding to the random access procedure from the node;

generating a second response message corresponding to the third message; and

And sending the second response message to the node.

32. A communication apparatus, comprising:

a processor; and

A memory comprising processor-executable instructions that when executed by the processor cause performance of the method recited in any one of claims 1 to 31.

33. A non-transitory computer readable medium having stored thereon processor-executable instructions that when executed cause the method recited in any one of claims 1 to 31 to be performed.