WO2019028753A1

WO2019028753A1 - Random access configuration

Info

Publication number: WO2019028753A1
Application number: PCT/CN2017/096867
Authority: WO
Inventors: Zhongming Chen; Junfeng Zhang; He Huang
Original assignee: Zte Corporation
Priority date: 2017-08-10
Filing date: 2017-08-10
Publication date: 2019-02-14
Also published as: CN110999502B; CN110999502A

Abstract

One or more devices, systems, and/or methods for facilitating performance of a random access process are provided. A command corresponding to the random access process 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 process may be transmitted to the node based upon the resource set.

Description

RANDOM ACCESS CONFIGURATION

BACKGROUND

A communication link between wireless nodes, such as between a user equipment (UE) and a base station (BS) , may be facilitated using one or more uplink carriers. For example, the UE may access the BS by an uplink carrier and use the uplink carrier to transmit data to and/or through the BS. However, the UE may need to achieve uplink synchronization with the BS in order to maintain access to the BS by the uplink carrier. Such uplink synchronization may be achieved by performing a random access process.

SUMMARY

In accordance with the present disclosure, one or more devices and/or methods for facilitating performance of a random access process are provided. In an example, a command corresponding to a random access process may be received from a node. A resource set, comprising a first time and a second time, may be determined based upon the command. A first message corresponding to the random access process may be transmitted to the node at a first time. A second message corresponding to the random access process may be transmitted to the node at a second time.

In an example, a configuration corresponding to a plurality of messages may be transmitted to a node. A command corresponding to a random access process may be transmitted to the node. A first message corresponding to the random access process may be received from the node. A second message corresponding to the random access process 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 transmitted to the node.

DESCRIPTION OF THE DRAWINGS

While the techniques presented herein may be embodied in alternative forms, the particular embodiments illustrated in the drawings are only a few examples that are supplemental of the description provided herein. These embodiments are not to be interpreted in a limiting manner, such as limiting the claims appended hereto.

Fig. 1A is a flow chart illustrating an example method for facilitating performance of a random access process.

Fig. 1 B is a flow chart illustrating an example method for facilitating performance of a random access process.

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

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

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

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

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

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

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

Fig. 9 is an illustration of a scenario involving an 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 an 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 in accordance with one or more of the provisions set forth herein.

DETAILED DESCRIPTION

Subject matter will now 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 as an extensive or detailed discussion of known concepts. Details that are known generally to those of ordinary skill in the relevant art may have been omitted, or may be handled in summary fashion.

The following subject matter may be embodied in a variety of different forms, such as methods, devices, components, and/or systems. Accordingly, this subject matter is not intended to be construed as limited to any example embodiments set forth herein. Rather, example embodiments are provided merely to be illustrative. Such embodiments may, for example, take the form of hardware, software, firmware or any combination thereof.

One or more computing devices and/or techniques for facilitating performance of a random access process are provided. For example, a user equipment (UE) may connect 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 do so, 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.， in association with a time out) . Thus, the UE may need to obtain and/or regain the uplink synchronization with the BS. Systems that are not able to maintain uplink synchronization between the UE and the BS may thus be limited with (e.g.， low) data rates, efficiency, etc. Thus, in accordance with one or more of the techniques presented herein, a plurality of messages and/or receive windows may be used to facilitation performance of a random access process which may result in the establishment and/or maintenance of uplink synchronization, and thus improved success rates and/or speeds of access, data rates, efficiency, etc.

It may be appreciated that propagation characteristics of a high frequency band may be significantly smaller than those of a low frequency band because a propagation loss of the high frequency band may be larger than that of the low frequency band. In order to enhance the coverage of high frequency bands, beamforming techniques are commonly 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 part of the beam at the same time because it may not be able to traverse one or more (e.g.， all) of the beams at a certain time point due to the limitation of a corresponding channel. Therefore, the initial access may need to undergo beam scanning. The process of beam scanning traversal may be a time order. The exemplary system may only have a first number (e.g.， two) of radio frequency channels, but a second number (e.g.， seven) of beams may need to be formed. In order to traverse all the beams, the first number (e.g.， two) of beams may need to be scanned for one group.

An example 100A of facilitating performance of a random access process between a first wireless node and a second wireless node is illustrated in Fig. 1A. The first wireless node may be a network and/or BS and the second wireless node may be a UE. The second wireless node may (e.g., be required to) transmit one or more data packets to the first wireless node using an uplink carrier. To do so, the second wireless node may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node, for example, via a random access process. Accordingly, at 105A, the second wireless node may receive a command, corresponding to a random access process, from the first wireless node.

The command may comprise an instruction and/or time domain information. The instruction may comprise an indication that one or more message should be transmitted. Alternatively and/or additionally, if the time domain information is included in the command and the indication is not included in the command, a (e.g.， implicit) determination may be made that more messages should be transmitted. If the command comprises neither the instruction nor the time domain information, the second wireless node may determine whether one or more messages should be transmitted based on one or more factors, such as the capability of the second wireless node. For example, the time domain information may comprise configuration information that may be used to determine times to transmit messages associated with the random access process (e.g.， from the second wireless node and/or to the first wireless node) .

The command may comprise 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 transmitted (e.g.， from the second wireless node and/or to the first wireless node) . In some examples, the command may not comprise a preamble.

At 110A, a resource set may be determined based upon the command. The resource set may comprise a first time, a second time and/or one or more other times at which one or more messages associated with the random access process may be transmitted. For example, the first time, the second time and/or the one or more other times may be determined based upon the 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 comprise a preamble resource set, which may comprise 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 comprise information about settings of the first wireless node (e.g., a base station) . A threshold number of messages may be determined based upon the configuration. For example, the threshold number of messages may be a (e.g.， maximum) number of messages to be transmitted as part of a first batch of messages associated with the random access process.

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

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

In some example, the one or more other messages may each be transmitted 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 upon the command. In some examples, the first messages, the second message and/or the one or more messages may be transmitted in sequence. For example, the messages may be transmitted one after another. In an example of sequential transmission, when the first message is transmitted, and the first receive window is determined and/or running, the second message may not be transmitted until the first receive window has been closed. In some examples, the first messages, the second message and/or the one or more messages may be transmitted in parallel. For example, the messages may be transmitted independent of one another. In an example of parallel transmission, when the first message is transmitted, and the first receive window is determined and/or running, the second message may be transmitted before or after the first receive window has been closed.

In some examples, a first receive window may be determined (e.g., generated) based upon 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 upon the second time and/or the second message. The second receive window may cover a second period of time and/or a second number of subframes. One or more receive windows may each be determined (e.g., generated) based upon the one or more other times and/or the one or more other messages. It may be appreciated that the second wireless node may monitor for receipt 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. 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 comprise determining a start time for the first receive window and/or determining an end time for the first receive window. The start time may be on or after the first time. The end time may be on or after the start time. In some examples, determining the second receive window may comprise determining a second start time for the second receive window and/or determining a second end time for the second receive window. The second start time may be on or after the second time. The second end time may be on or after the second start time.

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 received within the first receive window, the second receive window and/or the one or more receive windows, the random access process may be established and/or determined to be complete. After the random access process is complete, 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, completion of the random access process may correspond to uplink synchronization. It may be appreciated that the response message may be a Random Access Response message.

In some examples, the determination that the random access process is complete is made in response to determining that a first identifier in the response message matches a second identifier in the resource set (e.g., upon comparing a portion of the response message to a portion of the resource set) . The first identifier and/or the second identifier may comprise 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 first receive window, the second receive window and/or the one or more receive windows, a second resource set may be determined based upon the command. For example, the second resource set may be determined in response to determining that one or more responses received (e.g.， from the first wireless node) do not comprise a first identifier (e.g., associated with the first message, the second message and/or the one or more messages) . The second resource set may comprise a third time and/or one or more other times at which one or more messages associated with the random access process may be transmitted. For example, the third time may be determined based upon 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 comprise a second preamble resource set, which may comprise 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 than the second resource set.

In some examples, a third message, corresponding to the random access process, may be generated (e.g.， as part of a second batch of messages) . The third message may be transmitted to the first wireless node and/or from the second wireless node at the third time of the second resource set using second power. The second power may be the same as or different than the first power. The second power may correspond to power ramping based upon the first power.

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 first receive window, the second receive window and/or the one or more receive windows, a transmission attempt may be increased (e.g., incremented) . For example, another attempt to transmit a batch of messages, corresponding the random access process, to the first wireless node and/or from the second wireless node may be made.

In some examples, a second threshold number of messages may be determined based upon the configuration. For example, the second threshold number of messages may be a (e.g.， maximum) number of messages to be transmitted as part of a second batch of messages associated with the random access process. 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 than the second threshold number of messages.

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

In some examples, determining the third receive window may comprise determining a third start time for the third receive window and/or determining a third end time for the third receive window. The third start time may be on 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 on 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, the random access process may be established and/or determined to be complete.

In some examples, the determination that the random access process is complete is made in response to determining that a third identifier in the response message matches a fourth identifier in the second resource set (e.g.， upon comparing a portion of the response message to a portion of the resource set) . 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 upon 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 upon the second time and/or the second message to generate a modified first receive window. The modified first receive window may cover a second period of time (e.g.， greater than the first period of time) 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 comprise determining the start time for the first receive window and/or determining the end time for the first receive window. The start time may be on or after the first time. The end time may be on or after the start time. In some examples, modifying the first receive window may comprise 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 comprise 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 (e.g.， determined to be a response to) the first message and/or the second message is received within the modified first receive window, the random access process may be established and/or determined to be complete.

In some examples, the determination that the random access process is complete is made in response to determining that a third identifier in the response message matches the second identifier in the resource set and/or a fourth identifier in the second resource set (e.g.， upon comparing a portion of the response message to a portion of the resource set) . The third identifier and/or the fourth identifier may comprise 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, a second resource set may be determined based upon the command. For example, the second resource set may be determined in response to determining that one or more responses received (e.g.， from the first wireless node) do not comprise a first identifier (e.g.， associated with the first message, the second message and/or the one or more messages) . The second resource set may comprise a third time and/or one or more other times at which one or more messages associated with the random access process may be transmitted. For example, the third time may be determined based upon 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 comprise a second preamble resource set, which may comprise 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 than the second resource set.

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

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, a transmission attempt may be increased (e.g.， incremented) . For example, another attempt to transmit a batch of messages, corresponding the random access process, to the first wireless node and/or from the second wireless node may be made.

In some examples, the modified first receive window may be modified (e.g.， regenerated) based upon the third time and/or the third message to generate a remodified first receive window. The remodified first receive window may cover a third period of time (e.g.， greater than the second period of time) 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 comprise determining a remodified end time that may define the remodified first receive window. For example, the remodified end time may be after the modified end time and/or the remodified first receive window may have the start time of the modified first receive window and the remodified end time. For example, modifying the modified first receive window may comprise increasing (e.g.， or decreasing) the modified window length of the modified first receive window to generate the remodified first receive window.

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

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 remodified first receive window, the random access process may be established and/or determined to be complete.

An example 100B of facilitating performance of a random access process between a first wireless node and a second wireless node is illustrated in Fig. 1 B. The first wireless node may be a network and/or BS and the second wireless node may be a UE. The second wireless node may (e.g., be required to) transmit one or more data packets to the first wireless node using an uplink carrier. To do so, the second wireless node may (e.g., need to) obtain and/or maintain uplink synchronization with the first wireless node, for example, via a random access process. Accordingly, at 105B, the first wireless node may transmit a configuration, corresponding to a plurality of messages, to the second wireless node.

The configuration may comprise information about 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 transmitted as part of a first batch of messages associated with the random access process.

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

In some examples, the command may comprise time domain information. For example, the time domain information may comprise configuration information that may be used to determine times to transmit messages associated with the random access process (e.g.， from the second wireless node and/or to the first wireless node) . In some examples, the command may comprise a preamble.

In some examples, the second wireless node may determine a resource set based upon the command. The resource set may comprise a first time, a second time and/or one or more other times at which one or more messages associated with the random access process may be transmitted. For example, the second wireless node may determine the first time, the second time and/or the one or more other times based upon the time domain information in the command.

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

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

In some example, the one or more other messages may each 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 resource set based upon the command. In some examples, the first messages, the second message and/or the one or more messages may be received in sequence. In some examples, the first messages, 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 to be a response to) the first message, the second message and/or the one or more messages may be generated. It may be appreciated that the response message may be a Random Access Response message.

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

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

In some examples, based upon the response message (e.g., not being transmitted 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 a second resource set based upon the command. For example, the second resource set may be determined in response to determining that one or more responses transmitted (e.g., from the first wireless node and/or to the second wireless node) do not comprise a first identifier (e.g.， associated with the first message, the second message and/or the one or more messages) . The second resource set may comprise a third time and/or one or more other times at which one or more messages associated with 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 upon 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 comprise a second preamble resource set, which may comprise 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 than the second resource set.

In some examples, based upon the response message (e.g., not being transmitted 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 process (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 the third time of the second resource set.

In some examples, a second response message corresponding to (e.g.， determined to be a response to) the third message may be generated. It may be appreciated that the second response message may be a Random Access Response message.

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

In some examples, based upon the second response message (e.g., being transmitted to the second wireless node within one or more receive windows associated with the third message, etc. ) , the random access process may be established and/or determined to be complete. In some examples, completion of the random access process may correspond to uplink synchronization.

Fig. 2 illustrates an example of a system 200 for facilitating performance of a random access process 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 BS and the second wireless node 205 may be a UE. The second wireless node 205 may (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, the first wireless node 210 may transmit a command 215, corresponding to a random access process, to the second wireless node 205. The command 215 may comprise instructions to initiate the random access process, and may correspond to a physical downlink control channel (PDCCH) signaling, a media 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 and/or transmit the random access preamble 220 to the first wireless node 210, in response to and/or based upon 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 upon the random access preamble 220. The second wireless node 205 may generate a schedule transfer 230 and/or transmit the schedule transfer 230 to the first wireless node 210, in response to and/or based upon the random access response 225.

The schedule transfer 230 may, for example, be based upon a determination of a conflict. The first wireless node 210 may generate a conflict resolution 235 and/or transmit the conflict resolution 235 to the second wireless node 205 in response to and/or based upon the schedule transfer 230. The conflict resolution 235 may, for example, be generated to resolve the conflict determined in association with the schedule transfer 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 with a preamble that does not match the random access preamble 220, the random access preamble 220 may be resent and/or a counter corresponding to transmissions of the preamble may be incremented.

Fig. 3 illustrates an example of a system 300 for facilitating performance of a random access process between a first wireless node 210 and a second wireless node 205. In some examples, the system 300 may be implemented in place of and/or as an improvement over the 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 (e.g., be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, the first wireless node 210 may transmit a configuration 315, corresponding to a random access process, to the second wireless node 205.

The second wireless node 205 may determine a threshold number of messages based upon the configuration. For example, the threshold number of messages may be a (e.g.， maximum) number of messages to be transmitted as part of a first batch of messages associated with the random access process.

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

The second wireless node 205 may determine (e.g.， generate) a resource set based upon the command. The resource set may comprise a first time, a second time and/or one or more other times at which one or more messages associated with the random access process may be transmitted.

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

The second wireless node 205 may transmit the first message 325 to the first wireless node 210 at the first time. The second wireless node 205 may transmit the second message 330 to the first wireless node 210 at the second time. In some example, the one or more other messages may each be transmitted 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 upon the command. In some examples, the first messages, the second message and/or the one or more messages may be transmitted in sequence. In some examples, the first messages, the second message and/or the one or more messages may be transmitted in parallel.

In some examples, the second wireless node 205 may determine (e.g.， generate) a first receive window based upon the first time and/or the first message. The second wireless node 205 may determine (e.g.， generate) a second receive window based upon the second time and/or the second message. The second wireless node 205 may determine (e.g.， generate) one or more receive windows based upon the one or more other times and/or the one or more other messages. It may be appreciated that the second wireless node 205 may monitor for receipt 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 upon the first message and/or the second message. The first wireless node 210 may transmit the response message 335 to the second wireless node 205.

In some examples, in response to determining the response message 335 corresponding to (e.g.， determined to be a response to) the first message, the second message and/or the one or more messages is transmitted 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 process may be established and/or determined to be complete. In some examples, completion of the random access process may correspond to uplink synchronization.

Fig. 4 illustrates an example of a system 400 for facilitating performance of a random access process 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 (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, the second wireless node 205 may determine (e.g.， generate) a first message 405.

The second wireless node 205 may transmit 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 upon the first time and/or the first message 405. The first receive window 410 may have a start time (e.g.， time 4) on 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 transmit 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 upon the second time and/or the second message 415. The second receive window 420 may have a second start time (e.g.， time 6) on 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 upon the first message 405 and/or the second message 415. The first wireless node 210 may transmit the response message 425 to the second wireless node 205.

In response to determining the 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 receive window 410 and/or the second receive window 420 (e.g.， between the start time of the first receive window 410 and/or the second end time of the second receive window 420) , the random access process 430 may be established and/or determined to be complete. In some examples, completion of the random access process 430 may correspond to uplink synchronization.

It may be appreciated that “time, ” as used herein, may be associated with, 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 process 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 (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, 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 the random access process) .

The second wireless node 205 may transmit 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 upon the first time and/or the first message 505. The first receive window 510 may have a start time (e.g.， time 2) on 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 the first batch of messages associated with the random access process) . The second wireless node 205 may transmit 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 upon the second time and/or the second message 515. The second receive window 520 may have a second start time (e.g.， time 4) on 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 the first batch of messages associated with the random access process) . 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 the random access process) 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 receive window 510 and/or the second receive window 520 (e.g.， between the start time of the first receive window 510 and/or the second end time of the second receive window 520) . The second wireless node 205 may transmit the third message 525 to the first wireless node 210 at a third time (e.g.， time 7) . In some examples (e.g.， not illustrated) , the third time may be time 12 and/or after the end time of the first receive window 510 and/or before the 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 upon the third time and/or the third message 525. The third receive window 530 may have a third start time (e.g.， time 8) on 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 receive window 510 may have the same length as the second receive window 520 and/or the third receive window 530. In some examples, the first receive window 510 may have a different length than the second receive window 520 and/or the third receive window 530. In some examples, second receive window 520 may have the same length as the third receive window 530. In some examples, second receive window 520 may have a different length than the third receive window 530.

The first wireless node 210 may determine (e.g.， generate) a response message 535 based upon the first message 505, the second message 515 and/or the third message 525. The first wireless node 210 may transmit the response message 535 to the second wireless node 205.

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

Fig. 6 illustrates an example of a system 600 for facilitating performance of a random access process 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 (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, 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 the random access process) .

The second wireless node 205 may transmit the 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 upon the first time and/or the first message 605. The first receive window 610 may have a start time (e.g.， time 2) on 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 the first batch of messages associated with the random access process) . The second wireless node 205 may transmit 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 upon the second time and/or the second message 615. The second receive window 620 may have a second start time (e.g.， time 4) on 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 transmit 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 was not received within the first receive window 610 and/or the second receive window 620. Accordingly, the second wireless node 205 may determine (e.g., generate) a third message 630 (e.g.， as part of a second batch of messages associated with the random access process) in response to determining that the first response 625 was not received and/or was received outside of (e.g., after an end of) the first receive window 610 and/or the second receive window 620.

The second wireless node 205 may transmit the 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 upon the third time and/or the third message 630. The third receive window 635 may have a third start time (e.g.， time 14) on 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 receive window 610 may have the same length as the second receive window 620 and/or the third receive window 635. In some examples, the first receive window 610 may have a different length than the second receive window 620 and/or the third receive window 635. In some examples, second receive window 620 may have the same length as the third receive window 635. In some examples, second receive window 620 may have a different length than the third receive window 635.

The first wireless node 210 may determine (e.g.， generate) a response message 640 based upon the third message 630. The first wireless node 210 may transmit the response message 640 to the second wireless node 205.

In response to determining the 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 receive window 635 (e.g.， between the third start time of the third receive window 635 and/or the third end time of the third receive window 635) , the random access process 645 may be established and/or determined to be complete. In some examples, completion of the random access process 645 may correspond to uplink synchronization.

Fig. 7 illustrates an example of a system 700 for facilitating performance of a random access process 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 (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, 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 the random access process) .

The second wireless node 205 may transmit the 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 upon the first time and/or the first message 705. The first receive window 710 may have a start time (e.g.， time 4) on 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 the first batch of messages associated with the random access process) . The second wireless node 205 may transmit 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 comprising a combination of the first receive window 710 and a first extension 720, where the first extension 720 is based upon the second time and/or the second message 715. The modified first receive window may have the 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 associated with the random access process) . 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 the random access process) 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 receive window 710 and/or the modified first receive window (e.g.， between the start time of the first receive window 710 and/or the second end time of the first extension 720) . The second wireless node 205 may transmit 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 remodified first receive window comprising the first receive window 710, the first extension 720 and a second extension 730 based upon the third time and/or the third message 725. The remodified first receive window may have the 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 upon the first message 705, the second message 715 and/or the third message 725. The first wireless node 210 may transmit the response message 735 to the second wireless node 205.

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

Fig. 8 illustrates an example of a system 800 for facilitating performance of a random access process 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 (e.g.， be required to) transmit one or more data packets to the first wireless node 210 using an uplink carrier. To do so, 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 process. Accordingly, 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 the random access process) .

The second wireless node 205 may transmit the 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 upon the first time and/or the first message 805. The first receive window 810 may have a start time (e.g.， time 2) on 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 associated with the random access process) . The second wireless node 205 may transmit 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 comprising a combination of the first receive window 810 and a first extension 820, where the first extension 820 is based upon the second time and/or the second message 815. The modified first receive window may have the 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 transmit a first response message 825, corresponding to the first message 805 and/or the second message 815, to the second wireless node 205 at a 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. Accordingly, the second wireless node 205 may determine (e.g.， generate) a third message 830 (e.g., as part of a second batch of messages associated with the random access process) in response to determining that the first response 825 was not received and/or was received outside of (e.g.， after an end of) the modified first receive window.

The second wireless node 205 may transmit the 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 upon the third time and/or the third message 830. The third receive window 635 may have a third start time (e.g.， time 14) on 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 upon the third message 830. The first wireless node 210 may transmit the response message 840 to the second wireless node 205.

In response to determining the 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 receive window 835 (e.g.， between the third start time of the third receive window 835 and/or the third end time of the third receive window 835) , the random access process 845 may be established and/or determined to be complete. In some examples, completion of the random access process 845 may correspond to uplink synchronization.

Fig. 9 presents a schematic architecture diagram 900 of a base station 950 (e.g.， a node) that may utilize at least a portion of the techniques provided herein. Such a base station 950 may vary widely in configuration and/or capabilities, alone or in conjunction with other base stations, nodes, end units and/or servers, etc. in order to provide a service, such as at least some of one or more of the other disclosed techniques, scenarios, etc. For example, the base station 950 may connect one or more user equipment (UE) to a (e.g.， wireless) network (e.g.， which may be connected and/or include one or more other base stations) , such as Code Division Multiple Access (CDMA) networks, Time Division Multiple Access (TDMA) networks, Frequency Division Multiple Access (FDMA) networks, Orthogonal FDMA (OFDMA) networks, Single-Carrier FDMA (SC-FDMA) networks, 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 comprise 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 a mathematics coprocessor or an integrated graphical processing unit (GPU) ； and/or one or more layers of local cache memory. The base station 950 may comprise memory 902 storing 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 comprise a variety of peripheral components, such as a wired and/or wireless network adapter 914 connectible to a local area network and/or wide area network； 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.

The base station 950 may comprise a mainboard featuring one or more communication buses 912 that interconnect the processor 910, the memory 902, and/or various peripherals, using a variety of bus technologies, such as a variant of a serial or parallel AT Attachment (ATA) bus protocol； a Uniform Serial Bus (USB) protocol； and/or Small Computer System Interface (SCI) bus protocol. In a multibus scenario, a communication bus 912 may interconnect the base station 950 with at least one other server. Other components that may optionally be included with the base station 950 (though not shown in the schematic diagram 900 of Fig. 9) include a display； a display adapter, such as a graphical processing unit (GPU) ； input peripherals, such as a keyboard and/or mouse； and/or a flash memory device that may store a basic input/output system (BIOS) routine that facilitates booting the base station 950 to a state of readiness, etc.

The base station 950 may operate in various physical enclosures, such as a desktop or tower, 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 comprise an interconnected set of components. The base station 950 may comprise a dedicated and/or shared power supply 918 that supplies and/or regulates power for the other components. The 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 comprise a shared and/or dedicated climate control unit 920 that regulates climate properties, such as temperature, humidity, and/or airflow. Many such base stations 950 may 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.， a node) whereupon 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 functionality to a user. The UE 1050 may be provided in a variety of form factors, such as a mobile phone (e.g.， a smartphone) ； a desktop or tower workstation； an “all-in-one” device integrated with a display 1008； a laptop, tablet, convertible tablet, or palmtop device； a wearable device, such as mountable in a headset, eyeglass, earpiece, and/or wristwatch, and/or integrated with an article of clothing； and/or a component of a piece of furniture, such as a tabletop, and/or of another device, such as a vehicle or residence. The UE 1050 may serve the user in a variety of roles, such as a telephone, a workstation, kiosk, media player, gaming device, and/or appliance.

The UE 1050 may comprise 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 a mathematics coprocessor or an integrated graphical processing unit (GPU) ； and/or one or more layers of local cache memory. The UE 1050 may comprise memory 1001 storing 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 web browsers and/or email clients, utilities, and/or games； and/or drivers for various peripherals. The UE 1050 may comprise a variety of peripheral components, such as a wired and/or wireless network adapter 1006 connectible to a local area network and/or wide area network； one or more output components, such as a display 1008 coupled with a display adapter (optionally including a graphical processing unit (GPU) ) , a sound adapter coupled with a speaker, and/or a printer； input devices for receiving input from the 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 location, velocity, and/or acceleration of the UE 1050, a compass, accelerometer, and/or gyroscope that detects a physical orientation of the UE 1050. Other components that may optionally be included with the UE 1050 (though 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 booting the UE 1050 to a state of readiness； and/or a climate control unit that regulates climate properties, such as temperature, humidity, and airflow, etc.

The UE 1050 may comprise a mainboard featuring one or more communication buses 1012 that interconnect the processor 1010, the memory 1001, and/or various peripherals, using a variety of bus technologies, such as a variant of a serial or parallel AT Attachment (ATA) bus protocol； the Uniform Serial Bus (USB) protocol； and/or the Small Computer System Interface (SCI) bus protocol. The UE 1050 may comprise a dedicated and/or shared power supply 1018 that supplies and/or regulates power for other components, and/or a battery 1004 that stores power for use while the UE 1050 is not connected to a power source via the power supply 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 comprise processor-executable instructions 1112 that when executed by a processor 1116 cause performance (e.g., by the processor 1116) of at least some of the provisions herein. The non-transitory computer readable medium 1102 may comprise 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) technologies) , a platter of a hard disk drives, a flash memory device, or a magnetic or optical disc (such as a compact disc (CD) , digital versatile disc (DVD) , and/or floppy disk) . The example non-transitory computer readable medium 1102 stores computer-readable data 1104 that, when subjected to reading 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) , express the processor-executable instructions 1112. In some embodiments, the processor-executable instructions 1112, when executed, cause performance of operations, such as at least some of the example method 100A of Fig. 1A and/or the example method 100B of Fig. 1 B, for example. 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 application, "component, " "module, " "system" , "interface" , and/or the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, 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.， nodes (s) ) .

Unless specified otherwise, “first, ” “second, ” and/or the like are not intended to imply a temporal aspect, a spatial aspect, an ordering, etc. Rather, 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.

Moreover, "example" is used herein to mean serving as an instance, illustration, etc.， and not necessarily as advantageous. As used herein, "or" is intended to mean an inclusive "or" rather than an exclusive "or" . In addition, "a" and "an" as used in this application are generally be construed 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 and/or the like generally means A or B or both A and B. Furthermore, to the extent that "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 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 of the operations are described herein should not be construed as to imply that these operations are necessarily order dependent. Alternative ordering will be appreciated by one skilled in the art having the benefit of this description. Further, it will be understood that not all operations are necessarily present in each embodiment and/or example provided herein. Also, it will be understood that not all operations are necessary in some embodiments and/or examples.

Also, 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 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

A method comprising：

receiving a command， corresponding to a random access process， from a node；

determining a resource set， comprising a first time and a second time， based upon the command；

transmitting a first message， corresponding to the random access process， to the node at the first time； and

transmitting a second message， corresponding to the random access process， to the node at the second time.
The method of claim 1， comprising：

receiving a configuration from the node； and

determining a threshold number of messages based upon the configuration， the first message and the second message corresponding to the threshold number of messages.
The method of claim 1， comprising：

determining a first receive window based upon the first time； and

determining a second receive window based upon the second time.
The method of claim 1，

the first message and the second message transmitted in sequence.
The method of claim 1，

the first message and the second message transmitted in parallel.
The method of claim 3， comprising：

responsive 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 receive window or the second receive window， determining that the random access process is complete.
The method of claim 6，

the determining that the random access process is complete performed responsive to determining that a first identifier in the response message matches a second identifier in the resource set.
The method of claim 7，

the first identifier and the second identifier comprising a Random Access Preamble identifier.
The method of claim 3， 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 receive window or the second receive window， determining a second resource set， comprising a third time， based upon the command； and

transmitting a third message， corresponding to the random access process， to the node at the third time.
The method of claim 3， 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 receive window or the second receive window， increasing a transmission attempt by 1.
The method of claim 9，

the first resource set the same as the second resource set.
The method of claim 9，

the first resource set different than the second resource set.
The method of claim 9， comprising：

receiving a configuration from the node；

determining a threshold number of messages based upon the configuration， the first message and the second message corresponding to the threshold number of messages； and

determining a second threshold number of messages based upon the configuration， the third message corresponding to the second threshold number of messages.
The method of claim 9， comprising：

determining a third receive window based upon the third time.
The method of claim 9， the determining the second resource set performed responsive to determining that one or more responses received do not comprise a first identifier.
The method of claim 14， comprising：

responsive to determining that a response message corresponding to the third message is received within the third receive window， determining that the random access process is complete.
The method of claim 16，

the determining that the random access process is complete performed responsive to determining that a first identifier in the response message matches a second identifier in the second resource set.
The method of claim 1， the command comprising time domain information.
The method of claim 18， the determining the resource set comprising：

determining the first time based upon the time domain information； and

determining the second time based upon the time domain information.
The method of claim 1， the command comprising a preamble.
The method of claim 20， comprising：

generating the first message based upon the preamble； and

generating the second message based upon the preamble.
The method of claim 3， the determining the first receive window comprising：

determining a start time， after the first time， for the first receive window； and

determining an end time， after the start time， for the first receive window.
The method of claim 22， the determining the second receive window comprising：

determining a second start time， after the second time， for the second receive window； and

determining a second end time， after the second start time， for the second receive window.
The method of claim 1， comprising：

determining a first receive window based upon the first time； and

modifying the first receive window based upon the second time to generate a modified first receive window.
The method of claim 24， comprising：

responsive to determining that a response message corresponding to at least one of the first message or the second message is received within the modified first receive window， determining that the random access process is complete.
The method of claim 25，

the determining that the random access process is complete performed responsive to determining that a first identifier in the response message matches a second identifier in the resource set.
The method of claim 24， 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 resource set， comprising a third time， based upon the command； and

transmitting a third message， corresponding to the random access process， to the node at the third time.
The method of claim 27， comprising：

receiving a configuration from the node；

determining a threshold number of messages based upon the configuration， the first message and the second message corresponding to the threshold number of messages； and

determining a second threshold number of messages based upon the configuration， the third message corresponding to the second threshold number of messages.
The method of claim 27， comprising：

determining a third receive window based upon the third time.
The method of claim 27， the determining the second resource set performed responsive to determining that one or more responses received do not comprise a first identifier.
The method of claim 29， comprising：

responsive to determining that a response message corresponding to the third message is received within the third receive window， determining that the random access process is complete.
The method of claim 31，

the determining that the random access process is complete performed responsive to determining that a first identifier in the response message matches a second identifier in the resource set.
The method of claim 24， the determining the first receive window comprising：

determining a start time， after the first time， for the first receive window； and

determining an end time， after the start time， for the first receive window.
The method of claim 33， the modifying comprising：

determining a modified end time after the end time， the modified first receive window having the start time and the modified end time.
The method of claim 24， the modifying comprising：

increasing a window length of the first receive window to generate the modified first receive window.
A method comprising：

transmitting a configuration， corresponding to a plurality of messages， to a node；

transmitting a command， corresponding to a random access process， to the node；

receiving a first message， corresponding to the random access process， from the node；

receiving a second message， corresponding to the random access process， 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.
The method of claim 36， comprising：

receiving a third message， corresponding to the random access process， from the node；

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

transmitting the second response message to the node.
A communication device comprising：

a processor； and

memory comprising processor-executable instructions that when executed by the processor cause performance of a method recited in any of claims 1 to 37.
A non-transitory computer readable medium having stored thereon processor-executable instructions that when executed cause performance of a method recited in any of claims 1 to 37.