Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive, from a base station, a random access channel (RACH) occasion (RO) configuration that includes information related to ordered preamble resources. The UE may generate a preamble resource index according to various parameters selected based on the RO configuration information that relates to the ordered preamble resources. The UE may generate an uplink RACH message that includes a preamble based at least in part on the preamble resource index and a payload associated with a physical uplink shared channel (PUSCH) resource unit (PRU) mapped to the preamble resource index. After decoding the uplink RACH message, the base station may send a response message including scrambled downlink control information (e.g., based on a scrambling identifier or payload information associated with the uplink RACH message). Numerous other aspects are provided.

Abstract: Spurious beamforming in high density environments can be reduced via transmitting a first signal from a first Access Point (AP) to a first endpoint associated with the first AP via a first beamforming arrangement; in response to identifying that the first beamforming arrangement is pollutive to a second endpoint associated with a second AP: deprecating the first beamforming arrangement; and transmitting a second signal from the first AP to the first endpoint via a second beamforming arrangement, different from the first beamforming arrangement.

Abstract: A scheme for beam training include methods, apparatuses, and computer readable media for establishing a communication link with a second user equipment (UE), transmitting first information associated with first beam configurations of the first UE to the second UE, receiving second information associated with second beam configurations of the second UE from the second UE, and performing a beam training process by transmitting a number of reference signals to the second UE, wherein the number is derived from the first information associated with the first beam configurations and the second information associated with the second beam configurations.

Abstract: Methods, systems, and devices for interleaved mapping are described. In some implementations, a transmitting device identifies a set of virtual resource blocks (VRBs) corresponding to at least one code block to be transmitted to a receiving device. The transmitting device may determine that a quantity of VRBs to be transmitted to the receiving device is different than a quantity of entries within a regular interleaving matrix. Thus, the transmitting device may map each of the VRBs to a physical resource block (PRB) according to an irregular interleaving matrix to generate at least one interleaved code block. The transmitting device may transmit the interleaved code block to the receiving device. The receiving device may receive the interleaved code block and identify the PRBs associated with the interleaved code block. The receiving device may map each PRB within the interleaved code block to a VRB according to an irregular deinterleaving matrix.

Abstract: The present disclosure relates to transmitting and receiving a group wake-up signal (WUS) in conjunction with an ungrouped WUS. A base station may group one or more UEs in a UE group, while other UEs may not be assigned to a UE group. The configuration of WUS resources and WUS sequences for grouped UEs and other UEs is a challenge. The base station may transmit, to one or more UEs in the UE group, a resource allocation of a group WUS resource within a set of WUS resources associated with a paging occasion that is assigned to the one or more UEs in the UE group. A UE, after receiving the resource allocation, may determine a location of the group WUS resource within the set of WUS resources. The UE may monitor for a group WUS at the determined location in the resource allocation of the group WUS resource.

Abstract: Systems and methods for Segment Routing (SR) Traffic Engineering (SR-TE) in a network include receiving link utilization measurements at a Label Edge Router (LER) with the link utilization measurements flooded by one or more Label Switch Routers (LSRs); and, responsive to one or more of detecting congestion and underutilization on one or more links associated with an SR tunnel at the LER based on the received link utilization measurements, performing one or more actions at the LER to one or more of alleviate the congestion and re-optimize the underutilization. A state of the SR tunnel is maintained only at the LER through a label stack assigned at the LER, and the label stack includes one or more of a node Segment ID (SID) and an adjacency SID.

Abstract: Disclosed is a base station in a wireless communication system. Each base station in wireless communication comprises: a communication module; and a processor. The processor generates a hybrid automatic repeat request (HARQ)-ACK codebook comprising one or more bits and indicating whether or not reception of a channel or signal is successful, and transmits the HARQ-ACK codebook to the base station.

Abstract: System and methods include obtaining Wi-Fi network data, over the Internet, associated with a plurality of Wi-Fi networks each Wi-Fi network having one or more access points and each Wi-Fi network being associated with a customer of one or more service providers and obtaining customer data for each customer associated with the plurality of Wi-Fi networks, the customer data including call-ins made by customers; aggregating and filtering the data; analyzing the aggregated and filtered data including correlating the call-ins made by customers to the Wi-Fi network data; predicting customer call-ins based on correlations made between the call-ins made by customers and the Wi-Fi network data; and initiating a customer outreach workflow prior to a predicted customer call-in.

Abstract: Methods, systems, and devices for radio link management are described. In a first example, a user equipment (UE) and a base station may employ a procedure for configuring radio link monitoring reference signals (RLM-RS) for multiple bandwidth parts. In a second example, a UE and a base station may employ a beam failure recovery procedure. In a third example, a UE and a base station may employ one or more radio link failure detection procedures. In a fourth example, a UE and a base station may employ a procedure for establishing a new connection after radio link failure. In a fifth example, a UE and a base station may employ a monitoring procedure that involves a single RLM-RS across multiple bandwidth parts.

Abstract: Disclosed is a base station in a wireless communication system. Each base station in wireless communication comprises: a communication module; and a processor. The processor generates a hybrid automatic repeat request (HARQ)-ACK codebook comprising one or more bits and indicating whether or not reception of a channel or signal is successful, and transmits the HARQ-ACK codebook to the base station.

Abstract: A user equipment (UE) detects a beam switching event and switches, in response to the beam switching event, a beam for communications on a first active component carrier. The UE applies a beam switch interruption time across one or more second active component carriers if a beam switching delay associated with the beam switch exceeds a threshold value.

Abstract: Techniques described provide dependent procedure operation configured for avoiding or mitigating one or more aspect of the impact on the dependent procedure of cancelling an uplink transmission. One or more attributes (e.g., a transmission indication attribute) associated with a cancelled uplink transmission may be designated for dependent procedure operation, such as for indicating whether the cancelled uplink transmission is considered either as having been transmitted or not having been transmitted. The one or more attributes associated with a cancelled uplink transmission designated for dependent procedure operation may be based upon whether the cancelling the first uplink transmission is a fast cancellation or is a slow cancellation. The designation of a transmission indication attribute for dependent procedure operation may correspond to the dependent procedure and/or its operation. Other aspects and features are also claimed and described.

Abstract: Disclosed is a base station in a wireless communication system. Each base station in wireless communication comprises: a communication module; and a processor. The processor generates a hybrid automatic repeat request (HARQ)-ACK codebook comprising one or more bits and indicating whether or not reception of a channel or signal is successful, and transmits the HARQ-ACK codebook to the base station.

Abstract: A method for wireless communication by a first wireless device is provided. The method includes receiving one or more instances of channel state information reference signals (CSI-RS), generating CSI based on one or more of the CSI-RS instances, determining timing for transmitting the CSI based, at least in part, on at least one condition involving the CSI-RS instances, and transmitting the CSI in accordance with the determined timing.

Abstract: A child node in a wireless multi-hop network may receive a configuration for transmission of an uplink reference signal for a handover procedure; transmit the uplink reference signal according to the configuration; and receive a handover command or monitor for a downlink reference signal for the handover procedure based at least in part on transmitting the uplink reference signal.

Abstract: System and methods include obtaining data, over the Internet, associated with a plurality of Wi-Fi networks each Wi-Fi network having one or more access points and each Wi-Fi network being associated with a customer of one or more service providers; aggregating and filtering the data; analyzing the aggregated and filtered data based on one or more use cases; determining any of predictions and alerts for the one or more use cases based on the analyzing; and performing one or more actions based on the any of predictions and alerts.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network includes automatically discovering neighbor nodes associated with a first node in a peer-to-peer computer network by automatically sending bursts of first pulse messages from a first node to neighbor nodes and candidate nodes associated with the first node, and automatically updating neighbor nodes connected to the first node in the peer-to-peer computer network by sending second pulse messages from the first node to neighbor nodes and candidate nodes associated with the first node. The second pulse messages are longer than the first pulse messages, and have longer intervals in between than intervals between the first pulse messages in one of the bursts.

Abstract: A base station (BS) or a user equipment (UE) performs a channel access procedure for a plurality of beams to determine an availability of the plurality of beams. In some implementations, the BS or the UE determines that a channel access procedure is successful for a subset of the plurality of beams. In such implementations, the BS or the UE performs the transmission on the subset of the plurality of beams.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network is disclosed. The method includes identifying multiple paths from a source node to a destination node, wherein each of the multiple paths includes two or more routing segments each comprising a sending node and a receiving node. The receiving node is selected among a plurality of nodes in the peer-to-peer computer network based on round-trip times measured between the sending node and the plurality of nodes. Path packages are sent along the multiple paths from the source node to the destination node. Total one-way latencies (OWLs) associated with the multiple paths are measured using path packages from the source node to the destination node. A relayed data path is selected from the multiple paths at least in part based on the total OWLs respectively associated with the multiple paths from the source node to the destination node.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network, includes automatically updating a peer-to-peer computer network comprising a plurality of nodes and automatically relaying data from the first node to a second node by one of the neighbor nodes associated with the first node. The method further includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, dynamically adjusting time intervals between the pulse messages, receiving return pulses by the first node from some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes, sorting the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins, and automatically selecting and assigning a node from the orbital bins to update neighbor nodes associated with the first node.