CN110999502B

CN110999502B - Random access configuration

Info

Publication number: CN110999502B
Application number: CN201780093825.4A
Authority: CN
Inventors: 陈中明; 张峻峰; 黄河
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2017-08-10
Filing date: 2017-08-10
Publication date: 2024-09-13
Anticipated expiration: 2037-08-10
Also published as: WO2019028753A1; CN110999502A

Abstract

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

Description

Random access configuration

Background

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, the UE may access the BS through an uplink carrier and transmit 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 through an uplink carrier. Such uplink synchronization may be achieved by performing a random access procedure.

Disclosure of Invention

In accordance with the present disclosure, one or more apparatuses and/or methods are provided for facilitating performance of a random access procedure. In one example, a command corresponding to a random access procedure may be received from a node. A set of resources 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.

Drawings

While the techniques presented herein may be embodied in alternative forms, the specific embodiments shown in the drawings are merely some examples that supplement the description provided herein. These embodiments should not be construed in a limiting manner, such as limiting the appended claims.

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

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

Fig. 2 is a diagram illustrating one example system for facilitating execution of a random access procedure.

Fig. 3 is a diagram illustrating one example system for facilitating execution of a random access procedure.

Fig. 4 is a diagram illustrating one example system for facilitating execution of a random access procedure.

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

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

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

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

Fig. 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.

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

FIG. 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 now will be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific example embodiments. This description is not intended to be a broad or detailed discussion of known concepts. Details generally known to those of ordinary skill in the relevant art may have been omitted or may be handled in a summarized manner.

The following subject matter may be embodied in many different forms, such as methods, apparatus, components, and/or systems. Thus, the present subject matter is not intended to be construed as limited to any of the example embodiments set forth herein. Rather, the example embodiments are provided for illustration only. Such embodiments may take the form of hardware, software, firmware, or any combination thereof, for example.

One or more computing devices and/or techniques are provided for facilitating performance of random access procedures. For example, a User Equipment (UE) may be connected to (e.g., wirelessly communicating with) a 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, e.g., via a random access procedure. However, the UE may lose uplink synchronization with the BS (e.g., associated with a timeout). Thus, the UE may need to acquire and/or recover uplink synchronization with the BS. Systems that cannot maintain uplink synchronization between the UE and BS may be limited by (e.g., low) data rates, efficiency, etc. Thus, according to one or more techniques presented herein, multiple messages and/or receive windows may be used to facilitate performance of a random access procedure that may enable establishment and/or maintenance of uplink synchronization, thus improving success rate and/or access speed, data rate, efficiency, etc.

It will be appreciated that the propagation characteristics of the high frequency band will be significantly weaker than those of the low frequency band, as the propagation loss of the high frequency band will be greater than that of the low frequency band. In order to enhance the coverage of the high frequency band, beamforming techniques are typically used to narrow the wireless signal energy and focus on devices that need to communicate with each other. An exemplary system may not be able to transmit and/or receive portions of the beams simultaneously because it may not be able to traverse one or more (e.g., all) of the beams at a point in time due to the limitations of the corresponding channels. Thus, initial access may require beam scanning. The process of beam scanning traversal may be time-sequential. The exemplary system may have only a first number (e.g., two) of radio frequency channels, but may need to form a second number (e.g., seven) of beams. In order to traverse all beams, a first number (e.g., two) of beams may need to be scanned for one group.

Fig. 1A illustrates an example 100A that facilitates random access procedure execution 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) transmit one or more data packets to the first wireless node using the 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, e.g., a random access procedure. Thus, at 105A, the second wireless node may receive a command from the first wireless node corresponding to the random access procedure.

The commands 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 (e.g., from the second wireless node and/or to the first wireless node) when to send a message related to the random access procedure.

The command may include a preamble. For example, one or more messages may be generated with and/or including the 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 set of resources may be determined based on the command. The set of resources 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 set of resources may include a set of preamble resources, which may include one or more preambles.

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

A first message corresponding to the random access procedure may be generated (e.g., as part of a first batch of messages). A second message corresponding to the random access procedure may also be generated (e.g., as part of the first batch of messages). One or more other messages may also be generated (e.g., as part of the first batch of messages) depending on the threshold number 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 115A, a first message may be sent to and/or from a first 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 and/or from the first wireless node using the first power (e.g., the power 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 based on the set of command-based resources. 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 the other. In the example of sequential transmission, when the first message is transmitted and the first receive window is determined and/or run, the second message may not be transmitted until the first receive window has been 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 has been closed.

In some examples, the first receive window may be determined (e.g., generated) based on the first time and/or the first message. The first receive window may cover a first period of time and/or a first number of subframes. A second receive window may be determined (e.g., generated) based on the second time and/or the second message. The second receive window may cover a second time period and/or a second number of subframes. Each of the one or more receive 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 to be appreciated that the second wireless node can monitor for receipt of the response 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. In some examples, the first receive window, the second receive window, and/or the one or more receive windows may be Random Access Response (RAR) windows.

In some examples, determining the first receive window may include: a start time of the first receive window is determined and/or an end time of the first receive window is determined. 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: a second start time of the second receive window is determined and/or a second end time of the second receive window is determined. 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 receive window, the second receive window, and/or the one or more receive windows (e.g., determined to be a response to the messages), a random access procedure may be established and/or determined to be completed. After the random access procedure is completed, the first receive window, the second receive window, and/or the one or more receive windows may be closed (e.g., terminated). In some examples, the completion of the random access procedure may correspond to uplink synchronization. It is to be appreciated that the response message can be a random access response message.

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

In some examples, in response to determining that no response messages corresponding to the first message, the second message, and/or the one or more messages are 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 the messages), the second set of resources may be determined based on the command. For example, the second set of resources may be determined in response to determining that the one or more responses received (e.g., from the first wireless node) do not include the first identifier (e.g., associated with the first message, the second message, and/or the one or more messages). The second set of resources may include a third 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 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 set of resources may include a second set of preamble resources, which may include one or more second preambles. In some examples, the first set of resources may be the same as the second set of resources. In some examples, the first set of resources may be different from the second set of resources.

In some examples, a third message corresponding to the random access procedure may be generated (e.g., as part of the second batch of messages). A third message may be sent to and/or from the first wireless node using the second power at a third time of 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 based on the first power ramp.

In some examples, in response to determining that no response messages corresponding to the first message, the second message, and/or the one or more messages are 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 the messages), the transmission attempt may be increased (e.g., incremented). For example, an additional attempt may 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 related to the 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.

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

In some examples, determining the third receive window may include determining a third start time of the third receive window and/or determining a third end time of the third receive window. The third start time may be at or after the end time of the first receive window and/or the second end time of the second receive 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 (e.g., determined to be a response to) the third message is received within the third receive window, a random access procedure may be established and/or determined to be complete.

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

In some examples, the first receive window may be determined (e.g., generated) based on the first time and/or the first message. The first receive window may cover a first period of time and/or a first number of subframes. The first receive window may be modified (e.g., regenerated) based on the second time and/or the second message to generate a modified first receive window. The modified first receive 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 at which the modified first receive window may be defined. For example, the modified end time may be after the end time, and/or the modified first receive window may have a start time of the first receive window and a 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 a modified first receive window.

In some examples, responsive to determining that a response message corresponding to (e.g., determined as a response to) the first message and/or the second message is received within the modified first receive 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 the third identifier in the response message matches the second identifier in the set of resources and/or the fourth identifier in the second set of resources (e.g., when comparing a portion of the response message to a portion of the set of resources). The third identifier and/or the fourth identifier may comprise a random access preamble identifier.

In some examples, in response to determining that no response message corresponding to (e.g., determined as a response to) the first message, the second message, and/or the one or more messages is received within the modified first receive window, the second set of resources may be determined based on the command. For example, the second set of resources may be determined in response to determining that the one or more responses received (e.g., from the first wireless node) do not include the first identifier (e.g., associated with the first message, the second message, and/or the one or more messages). The second set of resources may include a third 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 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 set of resources may include a second set of preamble resources, which may include one or more second preambles. In some examples, the set of resources may be the same as the second set of resources. In some examples, the set of resources may be different from the second set of resources.

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

In some examples, in response to determining that no response message corresponding to (e.g., determined as a response to) the first message, the second message, and/or the one or more messages is received within the modified first receive window, the transmission attempt may be increased (e.g., incremented). For example, an additional attempt may 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, the modified first receive window may be modified (e.g., regenerated) based on the third time and/or the third message to generate a regenerated first receive window. The re-modified first receive window may 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 at which the re-modified first receive window may be defined. For example, the re-modified end time may be after the modified end time, and/or the re-modified first receive window may have a modified first receive window start time and a 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 a re-modified first receive window.

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

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

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

An example 100B that facilitates performance 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 BS and the second wireless node may be a UE. The second wireless node may (e.g., need to) transmit one or more data packets to the first wireless node using the 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, e.g., a random access procedure. Thus, at 105B, the first wireless node may send a configuration corresponding to the plurality of messages to the second wireless node.

The configuration may include information regarding the settings of the first wireless node (e.g., 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 related to a random access procedure.

At 110B, the first wireless node may send a command corresponding to the 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 may be used to determine (e.g., from the second wireless node and/or to the first wireless node) when to send a message related to the random access procedure. In some examples, the command may include a preamble.

In some examples, the second wireless node may determine the set of resources based on the command. The set of resources 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 (e.g., as part of a first batch of messages) corresponding to the random access procedure. The second wireless node may also generate a second message (e.g., as part of a second batch of messages) corresponding to the random access procedure. One or more other messages may also be generated (e.g., as part of the first batch of messages) depending on the threshold number 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 a first wireless node and/or from a 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 based on the set of command-based resources. 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 (e.g., determined as a response to) the first message, the second message, and/or the one or more messages may be generated. It is to be appreciated that the response message can 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, the 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, the 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 set of resources based on the command. For example, the second set of resources 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 the first identifier (associated with the first message, the second message, and/or the one or more messages). The second set of resources may include a third time and/or one or more other times at which one or more messages related to the random access procedure may be received (e.g., by the first wireless node and/or from the second wireless node). The third time may be determined, for example, 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 set of resources may include a second set of preamble resources, which may include one or more second preambles. In some examples, the first set of resources may be the same as the second set of resources. In some examples, the first set of resources may be different from the second set of resources.

In some examples, the second wireless node may generate a third message (e.g., as part of a second batch of messages) corresponding to the random access procedure 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 third message may be received by the first wireless node and/or from the second wireless node at a third time of the second set of resources.

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

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

In some examples, the completion of the random access procedure may be established and/or determined 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.). In some examples, the completion of the random access procedure may correspond to uplink synchronization.

Fig. 2 illustrates an example of a system 200 for facilitating performance of a random access procedure between a first wireless node 210 and a second wireless node 205, such as in a Long Term Evolution (LTE) system. The first wireless node 210 may be a network and/or BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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 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 instructions to initiate a random access procedure and may correspond to Physical Downlink Control Channel (PDCCH) signaling, medium Access Control (MAC) layer, radio Resource Control (RRC) signaling, system Information (SI), and/or paging of the second wireless node 205.

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

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

Fig. 3 illustrates an example of a system 300 for facilitating performance of a random access procedure between a first wireless node 210 and a second wireless node 205. In some examples, system 300 may be implemented in place of system 200 and/or in addition to improvements to system 200. The first wireless node 210 may be a network and/or BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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. Accordingly, 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 the random access procedure to the second wireless node 205.

The second wireless node 205 may determine (e.g., generate) a set of resources based on the command. The set of resources 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.

The second wireless node 205 may determine (e.g., generate) a first message 325 corresponding to the random access procedure and/or a second message 330 corresponding to the random access procedure (e.g., as part of the first batch of messages). One or more other messages may also be generated (e.g., as part of the first batch of messages) depending on the threshold number 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 based on the set of resources of 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) the 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 to be appreciated that the second wireless node 205 can monitor for receipt of the first message, the second message, and/or the response of 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 a 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 receiving window, the second receiving window, and/or the one or more receiving windows, a random access procedure may be established and/or determined to be completed. In some examples, the completion of the random access procedure may correspond to uplink synchronization.

Fig. 4 illustrates an example of a system 400 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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) the first message 405.

The second wireless node 205 may send the 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 (e.g., time 4) at or after the first time and/or an end time (e.g., time 13) after the start time.

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 (e.g., generate) a response message 425 based on the first message 405 and/or the second message 415. The first wireless node 210 may send a response message 425 to the second wireless node 205.

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

It is to be appreciated that "time" as used herein can relate to, correspond to, and/or be represented by one or more subframes, one or more slots, and/or one or more symbols.

Fig. 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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) the first message 505 (e.g., as part of a first batch of messages related to the random access procedure).

The second wireless node 205 may send the 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) the second message 515 (e.g., as part of a first batch of messages related to the 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) a third message 525 (e.g., as part of a first batch of messages related to the 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 related to the random access procedure) in response to determining that a response message corresponding to (e.g., determined as 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 a start time of the first receiving window 510 and/or a second end time of the second receiving window 520). The second wireless node 205 may send a 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 an end time of the first receive window 510 and/or before a second end time of the second receive 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 (e.g., 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 a 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 receiving window 510, the second receiving window 520, and/or the third receiving window 530 (e.g., between a start time of the first receiving window 510, and/or a third end time of the third receiving window 530), the random access procedure 540 may be established and/or determined to be completed. In some examples, completion of the random access procedure 540 may correspond to uplink synchronization.

Fig. 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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) the first message 605 (e.g., as part of a first batch of messages related to the 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 related to the random access procedure). The second wireless node 205 may send a 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 the first response time. The second wireless node 205 may determine that the first response message 625 was not received within the first receive window 610 and/or the second receive window 620. Thus, the second wireless node 205 may determine (e.g., generate) the 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 was not received and/or was received outside of (e.g., after the end of) the first receive window 610 and/or the second window 620.

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 (e.g., generate) a response message 640 based on the third message 630. The first wireless node 210 may send a response message 640 to the second wireless node 205.

In response to determining that a response message 640 corresponding to (e.g., determined as a response to) the third message 630 is received by the second wireless node 205 within the third receive window 635 (e.g., between a third start time of the third receive window 635 and/or a third end time of the third receive 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.

Fig. 7 illustrates an example of a system 700 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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) the first message 705 (e.g., as part of a first batch of messages related to the 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 (e.g., time 4) at or after the first time and/or an end time (e.g., time 13) after the start time.

The second wireless node 205 may determine (e.g., generate) a second message 715 (e.g., as part of a first batch of messages related to the random access procedure). The second wireless node 205 may send a 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 comprising 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 (e.g., time 4) of the first receive window 710 and/or a second end time (e.g., time 15) of the first extension 720.

The second wireless node 205 may determine (e.g., generate) a third message 725 (e.g., as part of the first batch of messages related to the 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 related to the random access procedure) in response to determining that a response message corresponding to (e.g., determined as 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 a start time of the first receiving window 710 and/or a second end time of the first extension 720). The second wireless node 205 may send a 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 receive window comprising the first receive 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 receive window may have a start time (e.g., time 4) of the first receive window and/or a third end time (e.g., time 17) of the second extension 730.

The first wireless node 210 may determine (e.g., 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 a response message 735 to the second wireless node 205.

Responsive to determining that a response message 735 corresponding to (e.g., determined as 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 receive window (e.g., between a start time of the first receive window 710 and/or a third end time of the second extension 730), a random access procedure 740 may be established and/or determined to be completed. In some examples, completion of the random access procedure 740 may correspond to uplink synchronization.

Fig. 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may send one or more data packets to the first wireless node 210 using, for example, 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) the first message 805 (e.g., as part of a first batch of messages related to the 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 the first batch of messages related to the random access procedure). The second wireless node 205 may send a 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 comprising 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 (e.g., time 2) of the first receive window 810 and/or a second end time (e.g., time 8) of the first extension 820.

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 was not received within the modified first receive window comprising the first receive window 810 and/or the first extension 820. Thus, the second wireless node 205 may determine (e.g., generate) the 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 was not received and/or was 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 (e.g., generate) a response message 840 based on the third message 830. The first wireless node 210 may send a response message 840 to the second wireless node 205.

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

Fig. 9 presents a schematic architecture diagram 900 of a base station 950 (e.g., node) that may utilize at least a portion of the techniques provided herein. Such base stations 950 may vary widely in configuration and/or capabilities, alone or in combination with other base stations, nodes, chain end units, and/or servers, etc., to provide services such as at least some of the one or more other disclosed techniques, scenarios, etc. For example, base station 950 can connect one or more User Equipment (UEs) to a (e.g., wireless) network (e.g., which can connect 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, and so forth. The network may implement radio technologies 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. Base station 950 and/or the network may communicate using standards such as Long Term Evolution (LTE).

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: a plurality of cores; one or more coprocessors, such as math coprocessors or integrated Graphics Processing Units (GPUs); and/or one or more levels of local cache memory. 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 database 908 and/or file system, etc. Base station 950 may include: various peripheral components, such as wired and/or wireless network adapters 914, which may be connected to local and/or wide area networks; one or more storage components 916, such as a hard disk drive, a solid State Storage Device (SSD), a flash memory device, and/or a magnetic and/or optical disk reader; and/or other peripheral components.

Base station 950 may include: a motherboard, featuring one or more communication buses 912, the communication buses 912 interconnect the processor 910, memory 902, and/or various peripherals using various bus technologies, such as a variation of the serial or parallel AT attachment (ATA) bus protocol, a Universal Serial Bus (USB) protocol, and/or a small computer system interface (SCI) bus protocol. In a multi-bus scenario, communication bus 912 may interconnect base station 950 with at least one other server. Other components that may optionally be included in base station 950 (although not shown in schematic 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 basic input/output system (BIOS) routines that facilitate starting up the base station 950 to a ready state, etc.

Base station 950 may operate in a variety of physical housings, such as a desktop or tower server, and/or may be integrated with a display as an "all-in-one" device. The base station 950 may be mounted horizontally and/or in a cabinet or rack, and/or may simply include a set of interconnecting components. The base station 950 may include a dedicated and/or shared power supply 918 that provides and/or regulates power for other components. Base station 950 may provide power to and/or receive power from another base station and/or server and/or other devices. The base station 950 may include shared and/or dedicated climate control units 920 that regulate 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 techniques presented herein.

Fig. 10 presents a schematic architecture diagram 1000 of a User Equipment (UE) 1050 (e.g., node) on which at least a portion of the techniques presented herein may be implemented. Such UEs 1050 may vary widely in configuration and/or capabilities in order to provide various functions to a user. The UE 1050 may be provided in various form factors, such as: mobile phones (e.g., smart phones); a desktop or tower workstation; an "all-in-one" device integrated with the display 1008; laptop, tablet, convertible tablet or palmtop devices; such as wearable devices that may be mounted in headphones, eyeglasses, an earpiece, and/or a wristwatch, and/or integrated with an article of clothing; and/or a piece of furniture (such as a table top) and/or other device (such as a vehicle or home). The UE 1050 may serve users in various roles, such as telephones, workstations, kiosks, media players, gaming devices, and/or appliances.

The UE 1050 may include one or more (e.g., hardware) processors 1010 that process instructions. The one or more processors 1010 may optionally include: a plurality of cores; one or more coprocessors, such as math coprocessors or integrated Graphics Processing Units (GPUs); and/or one or more levels of local cache memory. The 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 a document application, a media application, a file and/or data access application, a communication application, such as a web browser and/or email client, a utility, and/or a game; and/or drivers for various peripherals. The UE 1050 may include various peripheral components such as a wired and/or wireless network adapter 1006 that may be connected to a local area network and/or a wide area network; one or more output components, such as a display 1008 (optionally including a Graphics Processing Unit (GPU)) coupled to a display adapter, a sound adapter coupled to speakers, and/or a printer; input devices for receiving input from a user, such as a keyboard 1011, mouse, microphone, camera and/or touch sensitive components of the display 1008; and/or environmental sensors, such as a GPS receiver 1019 that detects the location, speed, and/or acceleration of the UE 1050, a compass, an accelerometer, and/or a gyroscope that detect the physical orientation of the UE 1050. Other components that may optionally be included in the UE 1050 (although not shown in the schematic architecture 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 and/or optical disk reader; a flash memory device that may store a basic input/output system (BIOS) routine that facilitates starting UE 1050 into a ready state; and/or a climate control unit that adjusts climate characteristics such as temperature, humidity, and airflow.

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

Fig. 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, which when executed by the processor 1116, cause (e.g., by the processor 1116) execution of at least some of the provisions 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 disk drive, a flash memory device, or a magnetic or optical disk (such as a Compact Disk (CD), digital Versatile Disk (DVD), and/or floppy disk). The example non-transitory computer readable medium 1102 stores computer readable data 1104, which when read 1106 by a reader 1110 of a device 1108 (e.g., a read head of a hard disk 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 performance 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 a system and/or scenario, such as 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, for example.

As used in this disclosure, "component," "module," "system," "interface," and the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a controller and the controller can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers (e.g., node (s)).

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

Furthermore, "example" is used herein to mean serving as an example, illustration, etc., and not necessarily advantageous. As used herein, "or" is intended to mean an inclusive "or" rather than an exclusive "or". In addition, the use of "a" and "an" in this disclosure is generally interpreted to mean "one or more" unless specified otherwise or clear from context to be directed to a singular form. Also, at least one of A and B, etc. generally means A or B or both A and B. Furthermore, to the extent that the terms "includes," having, "" has, "" with, "and/or variants thereof are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term" comprising.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to 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.

Furthermore, the claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer (e.g., node) to implement the disclosed subject matter. The term "article of manufacture" as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. Of course, many modifications may be made to the 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 of the operations are described herein should not be construed as to imply that these operations are necessarily order dependent. Those skilled in the art who have the benefit of this description will realize alternative sequences. Moreover, it will be understood that not all operations need be present in every embodiment and/or example provided herein. Moreover, it will be appreciated that not all operations are required in some embodiments and/or examples.

Moreover, although the disclosure has been shown and described with respect to one or more implementations, equivalent alterations and modifications will occur to others skilled in the art based upon a reading and understanding of this specification and the annexed drawings. The present disclosure includes all such modifications and alterations and is limited only by the scope of the following claims. In particular regard to the various functions performed by the above described components (e.g., elements, resources, etc.), the terms used to describe such components are intended to correspond, unless otherwise indicated, to any component which performs the specified function of the described component (e.g., that is functionally equivalent), even though not structurally equivalent to the disclosed structure. In addition, while a particular feature of the disclosure may have been disclosed with respect to only one of several implementations, such feature may be combined with one or more other features of the other implementations as may be desired and advantageous for any given or particular application.

Claims

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

22. The method of claim 21, comprising:

receiving a configuration from the node;

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,

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.