Abstract: There are disclosed systems, devices, and methods for distributing pre-fetch data. A parent node obtains pre-fetch data comprising at least one of: i) data expected to be of interest to a particular user, pre-fetched by the parent node from at least one data source; and (ii) at least one identifier identifying data expected to be of interest to the particular user, for pre-fetching the identified data at a child node. The parent node selects first and second subsets of the pre-fetch data for transmission, respectively, to first and second child nodes, the selecting based on at least a predicted future location of the particular user and a respective geographic location of the first and second child nodes; and transmits the first and second subsets of the pre-fetch data, respectively, to the first and second child nodes.

Abstract: Visual information from camera sensors can be used to assign scheduling and/or transmission parameters in a wireless network. For example, the visual information can be used to visually discover a user equipment (UE) prior to initiating link discovery. This may be accomplished by analyzing the visual information to identify an absolute or relative position of the UE. The positioned may then be used to select antenna configuration parameters for transmitting a discovery signal, e.g., direction of departure (DoD), angle of departure (AoD), precoder. As another example, the visual information is used to predict a link obstruction over a radio interface between a UE and an AP. In yet other examples, the visual information may be used for traffic engineering purposes, such as to predict a traffic density or pair UEs with APs.

Abstract: A hierarchical link scheduling system and method is provided. A central controller gathers network information, including global parameters and long term demands, and determines an initial schedule for link activation based on these variables. A scheduler receives the initial schedule and modifies the initial schedule based on local parameters, inter-schedule negotiation, or other short term or localized requests. The scheduler activates the links according to the modified schedule. Accordingly, the scheduler can be responsible for modifying the initial schedule provided by central controller with localized or short term requests or demands, and providing the necessary parameters to enable link activation between nodes according to the modified schedule.

Abstract: Interference costs on virtual radio interfaces can be modeled as a function of loading in a wireless network to estimate changes in spectral efficiency and/or resource availability that would result from a provisioning decision. In one example, this modeling is achieved through cost functions that are developed from historical and/or simulated resource cost data corresponding to the wireless network. The cost data may include interference data, spectral efficiency data, and/or loading data for various links over a common period of time (e.g., a month, a year, etc.), and may be analyzed and/or consolidated to obtain correlations between interference costs and loading on the various links in the network. As an example, a cost function may specify an interference cost on one virtual link as a function of loading on one or more neighboring virtual links.

Abstract: There are disclosed systems, devices, and methods for distributing pre-fetch data. A parent node obtains pre-fetch data comprising at least one of: i) data expected to be of interest to a particular user, pre-fetched by the parent node from at least one data source; and (ii) at least one identifier identifying data expected to be of interest to the particular user, for pre-fetching the identified data at a child node. The parent node selects first and second subsets of the pre-fetch data for transmission, respectively, to first and second child nodes, the selecting based on at least a predicted future location of the particular user and a respective geographic location of the first and second child nodes; and transmits the first and second subsets of the pre-fetch data, respectively, to the first and second child nodes.

Abstract: Dynamic point selection (DPS) can be implemented using access points having partial or no DPS synchronization. Specifically, a mobile device may broadcast a bounce back message to access points participating in DPS transmissions to signal that a data segment has been successfully received and/or decoded by the mobile device. The bounce back message may cause the access points to drop remaining packets corresponding to the data segment from their buffers without sending those remaining packets over their respective radio interfaces. The bounce back message may be broadcast over any wireless signaling channel, such as via radio link control (RLC) signaling. Moreover, different priorities may be assigned to encoded packets intended for DPS transmission based on whether the encoded packets are communicated over a primary or secondary backhaul path.

Abstract: Predicting mobile station migration between geographical locations of a wireless network can be achieved using a migration probability database. The database can be generated based on statistical information relating to the wireless network, such as historical migration patterns and associated mobility information (e.g., velocities, bin location, etc.). The migration probability database consolidates the statistical information into mobility prediction functions for estimating migration probabilities/trajectories based on dynamically reported mobility parameters. By example, mobility prediction functions can compute a likelihood that a mobile station will migrate between geographic regions based on a velocity of the mobile station. Accurate mobility prediction may improve resource provisioning efficiency during admission control and path selection, and can also be used to dynamically adjust handover margins.

Abstract: It is possible to achieve fast high-frequency link discovery by communicating location parameters identifying a spatial location of a mobile device over a low-frequency interface to a low-frequency access point (AP). The location parameters are then used to identify antenna configuration parameters (e.g., precoders, etc.) for communicating discovery signals between the mobile device and a high-frequency access point. In one embodiment, the low-frequency AP relays the location parameters to the high-frequency AP, which uses the spatial location of the mobile device to perform link discovery. In another embodiment, the low-frequency AP communicates high-frequency antenna configuration parameters to the mobile device over the low-frequency interface.

Abstract: Base stations (BSs) can remove inter-BS interference components from received uplink signals using downlink information communicated over a backhaul network. The downlink information is associated with downlink transmissions of neighboring base stations, and is used to remove the inter-BS interference in accordance with interference cancellation techniques, e.g., signal interference cancellation (SIC), etc. The downlink information includes information associated with downlink transmission of the interfering BSs, such as information bits (e.g., data), parity information, control information, modulation and coding scheme (MCS) parameters, forward error correction (FEC) parameters, and other information. Additionally, inter-BS interference can be suppressed using channel information of interference channels using interference suppression techniques, e.g., interference rejection combining (IRC), etc.

Abstract: A method for sending data packets to mobile devices includes generating time-location information for a first mobile device in accordance with mobility information for the first mobile device and other mobility-related information, wherein the time-location information comprises predictions of when coverage areas of a plurality of transceiver devices operatively coupled to the communications device cover the first mobile device, wherein the communication device serves the first mobile device, selecting a first transceiver device from the plurality of transceiver devices in accordance with the time-location information and a first delivery time associated with a first data packet, and sending the first data packet to the first transceiver device in accordance with the first delivery time, wherein the first data packet is configured to prompt the first transceiver device to transmit the first data packet to the first mobile device.

Abstract: Interference costs on virtual radio interfaces can be modeled as a function of loading in a wireless network to estimate changes in spectral efficiency and/or resource availability that would result from a provisioning decision. In one example, this modeling is achieved through cost functions that are developed from historical and/or simulated resource cost data corresponding to the wireless network. The cost data may include interference data, spectral efficiency data, and/or loading data for various links over a common period of time (e.g., a month, a year, etc.), and may be analyzed and/or consolidated to obtain correlations between interference costs and loading on the various links in the network. As an example, a cost function may specify an interference cost on one virtual link as a function of loading on one or more neighboring virtual links.

Abstract: There are disclosed systems, devices, and methods for distributing pre-fetch data. A parent node obtains pre-fetch data comprising at least one of: i) data expected to be of interest to a particular user, pre-fetched by the parent node from at least one data source; and (ii) at least one identifier identifying data expected to be of interest to the particular user, for pre-fetching the identified data at a child node. The parent node selects first and second subsets of the pre-fetch data for transmission, respectively, to first and second child nodes, the selecting based on at least a predicted future location of the particular user and a respective geographic location of the first and second child nodes; and transmits the first and second subsets of the pre-fetch data, respectively, to the first and second child nodes.

Abstract: There is disclosed a system for transmitting data to users. The system includes nodes interconnected by at least one data network. The nodes are organized hierarchically to comprise a root node and at least two child nodes. The data transmission characteristics of communication with each of the child nodes are different. The root node is configured to: receive data transmission preferences of a particular user; receive data to be transmitted to the particular user; and transmit a selected subset of the data to at least one of the child nodes. The subset selected based on at least the received data transmission preferences and the data transmission characteristics, to permit the particular user to obtain data from the child nodes according to the data transmission preferences. The at least one of the child nodes being configured to: receive data from the root node; and transmit at least part of the received data to the user.

Abstract: Systems, apparatus and methods for validating whether an interfering communications signal has been encountered by a node in a wireless communications network due to signals transmitted by a node operating in another wireless communications network. The wireless communications networks may operate as directional wireless communications networks. Signals transmitted by a node may include an indicator which is associated with a particular node or wireless link. The indicator or information used to generate the indicator may be provided to a third party such as a network operator or regulator. If a received signal includes an interfering signal transmitted by another node, a report of the interfering signal is validated by sending the indicator included in the signal to the third party to check against indicators of transmitting nodes.

Abstract: Systems, devices and methods for link level communication between a user equipment and plurality of network devices are described. A user equipment can include at least one processor configured to: after broadcasting a first data message to the plurality of base stations, receive one or more acknowledgements, corresponding to the first data message, from at least one of the plurality of base stations; and upon receipt of at least one acknowledgement, broadcast an indicator to the plurality of base stations, the indicator providing an indication of at least one of the at least one received acknowledgement.

Abstract: There is provided a system and method for data retransmission. A receiving node determines that retransmission of a previously acknowledged data unit is required and sends a revocation of a previous receipt acknowledgement associated with the data unit to a transmitting node requesting the transmitting node to retransmit the data unit. The transmitting node receives the revocation of the previously acknowledged data unit and retransmits the data unit associated with the revoked transmission acknowledgement.

Abstract: Methods, devices and systems are provided for incorporating a consideration of the quality of service (QoS) of different end-to-end paths in a network, or portions thereof, into the scheduling of uplink data and the selection of data by a user device for transmission to one or more target reception points in a network. The target reception points may be determined from a number of possible reception points by a scheduling entity or by a network access node, gateway or other entity in the network and provided to a user device along with one or more indications of QoS for an uplink scheduling grant.

Abstract: There is disclosed a system for maintaining content lists. The system includes nodes interconnected by at least one data network. The nodes are organized hierarchically to comprise a root node and at least two child nodes. The root node stores a list of content items expected to be of interest to a particular user; transmits data reflective of an update for a subset of the list to at least one of the child nodes, the subset selected based on at least a predicted future location of the particular user and a geographic location of that child node; and receives data reflective of an update for the subset of the list from at least one of the child nodes. The at least one of the child nodes stores the subset of the list; determines an update for the subset of the list; and transmits data reflective of the update to the root node.

Abstract: Predicting mobile station migration between geographical locations of a wireless network can be achieved using a migration probability database. The database can be generated based on statistical information relating to the wireless network, such as historical migration patterns and associated mobility information (e.g., velocities, bin location, etc.). The migration probability database consolidates the statistical information into mobility prediction functions for estimating migration probabilities/trajectories based on dynamically reported mobility parameters. By example, mobility prediction functions can compute a likelihood that a mobile station will migrate between geographic regions based on a velocity of the mobile station. Accurate mobility prediction may improve resource provisioning efficiency during admission control and path selection, and can also be used to dynamically adjust handover margins.

Abstract: Embodiments are provided for traffic scheduling based on user equipment (UE) in wireless networks. A location prediction-based network scheduler (NS) interfaces with a traffic engineering (TE) function to enable location-prediction-based routing for UE traffic. The NS obtains location prediction information for a UE for a next time window comprising a plurality of next time slots, and obtains available network resource prediction for the next time slots. The NS then determines, for each of the next time slots, a weight value as a priority parameter for forwarding data to the UE, in accordance with the location prediction information and the available network resource prediction. The result for the first time slot is then forwarded from the NS to the TE function, which optimizes, for the first time slot, the weight value with a route and data for forwarding the data to the UE.