Abstract:
Embodiments are provided for header compression with online network codes. A header formulation is used in accordance with the network codes to reduce the header overhead. An agent node between a source of packets and a user equipment (UE) adds to a header in the packets block labels corresponding to blocks of data in the packets. The agent node further adds, to a payload portion of the packets, start and end times for transmitting the blocks. The blocks of data are encoded using an online network coding scheme and the packets are sent to an access node serving the UE, The access node receives the packets, compresses the header by compressing bits of the block labels based on a pre-defined finite number of paths between the agent node and a plurality of access nodes components serving the UE, and sends the compressed header in the packets to the UE.
Abstract:
Backhaul resource utilization efficiency can be improved by performing lower-layer decoding of uplink transmissions at access points to obtain transport blocks carried by the uplink transmissions, and then strategically scheduling the transport blocks over backhaul links extending between the access points and network nodes. Upon reception, the network nodes may perform radio link control (RLC) decoding of the transport blocks to obtain the uplink data. Transport blocks may be scheduled a manner that prioritizes time-sensitive data (e.g., voice traffic), or in a manner that strategically routes transport blocks over backhaul paths to increase the overall utilization of backhaul resources.
Abstract:
A controller having access to channel information associated with a neighboring access point (AP) may communicate a mask to a served user equipment (UE). The mask may specify transmission parameters for an uplink transmission between the served UE and a serving AP such that a successful decoding probability of the uplink transmission at the neighboring AP exceeds a threshold. The mask may specify a maximum MCS level for the uplink transmission, a minimum transmit power level for the uplink transmission, and/or a precoder constraint for the uplink transmission that produces constructive interference at a spatial location of the neighboring AP. This may enable the neighboring AP to isolate the uplink transmission from uplink wireless signals using an interference cancellation technique, e.g., successive interference cancellation (SIC) techniques.
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:
It is possible to improve backhaul resource utilization efficiency during dynamic point selection (DPS) transmissions by unicasting different portions of a traffic flow to different access points participating in the DPS transmission. Specifically, a traffic flow may be encoded to obtain forward error correction (FEC) packets, and different subsets of the FEC packets may be unicast to different access points participating in the DPS transmission. The subsets of FEC packets may have partial (or no) redundancy such that the amount of duplicative data communicated over the backhaul network is reduced when compared to multicasting the entire traffic flow to each access point participating in the DPS transmission. There may be different degrees of redundancy between subsets of FEC packets to achieve different traffic engineering (TE) objectives.
Abstract:
A method for effective flow rate estimation for a plurality of video flows includes determining a first flow rate of each of the plurality of video flows in a first transmission window and receiving quality of experience (QoE) feedback for playing portions of the plurality of video flows in the first transmission window. The QoE feedback is received from a plurality of user equipments (UEs) receiving the plurality of video flows. A dynamic effective flow rate is estimated for each flow in the plurality of video flows in a second transmission window in accordance with at least the first flow rates of the plurality of video flows and the QoE feedback.
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:
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:
An embodiment method for performing joint scheduling in a cluster of base stations (BSs) of a wireless network includes receiving coarse scheduling information pertaining to external BSs and performing joint scheduling for the instant cluster of BSs such that a sum utility is maximized. The sum utility includes an out-of-cluster utility component representing interference observed by the external BSs as a result of the joint scheduling. The out-of-cluster utility component is computed in accordance with the coarse scheduling information.
Abstract:
Embodiments are provided for header compression with online network codes. A header formulation is used in accordance with the network codes to reduce the header overhead. An agent node between a source of packets and a user equipment (UE) adds to a header in the packets block labels corresponding to blocks of data in the packets. The agent node further adds, to a payload portion of the packets, start and end times for transmitting the blocks. The blocks of data are encoded using an online network coding scheme and the packets are sent to an access node serving the UE. The access node receives the packets, compresses the header by compressing bits of the block labels based on a pre-defined finite number of paths between the agent node and a plurality of access nodes components serving the UE, and sends the compressed header in the packets to the UE.