Patent application number | Description | Published |
20130095872 | INTER-CELL INTERFERENCE COORDINATION FOR WIRELESS COMMUNICATION SYSTEMS - For each base station, transmit power level variables (I values) for each resource block allocated by the base station are initialized. The I values are used in a model to find sub-gradients for each base station. Neighboring base stations exchange the sub-gradients. For each base station, the base station's sub-gradient and the base station's neighbors' sub-gradients are used in the model to update the I values. Neighboring base stations then exchange the updated I values. For each base station, the base station's updated I value and the base station's neighbors' updated I values are used in the model to update the initial sub-gradients. The updated sub-gradients are then exchanged and used for another update of the I values. After a number of iterations, the I values are used to establish a transmit power level per resource block. | 04-18-2013 |
20130130707 | Method and System for Dynamic, Joint Assignment of Power and Scheduling of Users for Wireless Systems - A method for dynamically determining power and scheduling assignments in a communications network includes selecting, by a controller, a mobile station in each cell to define a mobile station set, determining, by the controller, a power allocation for each of the mobile stations in the mobile station set, calculating, by the controller, a global utility function by evaluating a contribution from each of the mobile stations in the mobile station set in accordance with the power allocation, repeating, by the controller, the selecting, the determining, and the calculating steps a predetermined number of times to generate additional ones of the global utility function, and choosing, by the controller, the mobile station set corresponding to the global utility function having a particular value for a resource block of a frame. The method may also include repeatedly dividing a user set into clusters to obtain a best power allocation. | 05-23-2013 |
20130188576 | Systems and Methods for Uplink Resource Allocation - A method embodiment for transmission scheduling includes implementing, by a first base station (BS), a soft-persistent scheduling scheme. The soft-persistent scheduling scheme includes allocating a first resource block to a first UE and other resource blocks to other UEs for a first transmission time interval (TTI), calculating a first priority of the first UE for the first resource block for a second TTI, wherein calculating the first priority involves including a first bonus in the first priority, and wherein the second TTI is later than the first TTI, calculating other priorities for the other UEs and the other resource blocks for the second TTI, and allocating the first and the other resource blocks to the first and other UEs for the second TTI in accordance with the first priority of the first UE as modified by the first bonus and the other priorities of the other UEs. | 07-25-2013 |
20130203398 | System and Method for Selecting Operating Parameters in a Communications System - A method for configuring a first base station within a cluster in a communications system having a plurality of cluster includes optimizing an operating parameter of the first base station in accordance with first utility function results from a first utility function associated with the first base station and second utility function results from a second utility function associated with a second base station within the cluster, the first utility function results and the second utility function results according to multiple settings for the operating parameter of the first base station, a first initialized setting of the operating parameter for the second base station, and a second initialized setting of the operating parameter for an external base station outside the cluster. The method also includes sharing the optimized operating parameter with the external base station. | 08-08-2013 |
20140019619 | SYSTEMS AND METHODS FOR CLUSTERING OPTIMIZATION TO HELP RESOLVE BOUNDARY PROBLEMS IN COMMUNICATION SYSTEMS - Various devices and methods are disclosed to support clustering optimization in a communication system. For example, multiple nodes of the communication system can be segmented into multiple clustering plans. Each clustering plan can include multiple clusters that do not overlap with one another within that clustering plan. At least one of the clusters of one clustering plan can overlap at least one of the clusters of at least one other clustering plan. Each node could be a non-boundary node in at least one cluster of at least one clustering plan. Multiple nodes of the communication system can alternatively be segmented into clusters having expanding and contracting borders. | 01-16-2014 |
20140073369 | Systems and Methods for Downlink Power Control and Scheduling in a Wireless Network - Methods and systems for providing joint power control (PC) and scheduling in a wireless network are provided. In one example, a method includes generating a near-optimal power pattern for PC and scheduling in accordance with long term channel statistics. The near-optimal PC solution may be generated by first generating a set of possible power patterns in accordance with likely scheduling scenarios, then statistically narrowing the set of possible power patterns to identify the most commonly used power patterns, and finally selecting one of the most commonly used power patterns as the near-optimal power pattern. In another example, a table of optimal PC solutions are provided for performing distributed PC and scheduling in an adaptive and/or dynamic manner. | 03-13-2014 |
20140105118 | Systems and Methods for Uplink Power Control and Scheduling in a Wireless Network - Methods and systems for facilitating uplink power control (PC) and scheduling in a wireless network are provided. In one example, common interference patterns are obtained from long term channel statistics, and used to perform local PC and scheduling by distributed base stations (eNBs). In some implementations, the common interference patterns are obtained through statistical narrowing techniques that identify common ones out of a plurality of potential interference patterns. The common interference patterns may specify maximum interference thresholds and/or individual eNB-to-eNB interference thresholds which may govern the local PC and scheduling decisions of the distributed eNBs. | 04-17-2014 |
20140120974 | System and Methods to Achieve Optimum Efficiency-Jain Fairness in Wireless Systems - Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach. | 05-01-2014 |
20140141789 | System and Method for Device-to-Device Operation in a Cellular Communications System - A method for operating a first device-to-device (D2D) device in a cellular communications system includes receiving geo-location information from a first entity in the cellular communications system, the geo-location information including location information for cellular users of the cellular communications system and resources of the cellular communications system available to the cellular users, selecting one of the resources to avoid causing interference to a cellular transmission, the resource being selected in accordance with the geo-location information, and transmitting to a second D2D device over the selected resource. | 05-22-2014 |
20140146748 | System and Method for Pilot Sequence Design in a Communications System - A method for pilot sequence design in a communications system includes selecting an initial cell in the communications system, and grouping other cells in the communications system relative to the initial cell into one of a neighbor group and a non-neighbor group in accordance with a neighborness measure of each of the other cells to the initial cell. The method also includes designing pilot sequences that are substantially orthogonal to one another for the initial cell and the other cells in the neighbor group, and providing information about the pilot sequences to the initial cell and the other cells in the communications system. | 05-29-2014 |
20140162627 | System and Method for Channel Estimation in a Wireless Communications System - A method for estimating communications channels includes determining, by a first device, channel significance information from a transmitting device, the channel significance information including information about communications channels carrying signals that are potentially significant interferers to the first device operating within range of the transmitting device, and estimating, by the first device, channel parameters of the communications channels identified as potentially significant interferers in accordance with the channel significance information. The method also includes transmitting, by the first device, the estimated channel parameters to one of the transmitting device and a controlling device. | 06-12-2014 |
20140185581 | Methods and Systems for Admission Control and Resource Availability Prediction Considering User Equipment (UE) Mobility - 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. | 07-03-2014 |
20140219104 | Service Provisioning Using Abstracted Network Resource Requirements - 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. | 08-07-2014 |
20140269332 | Method and System to Represent the Impact of Load Variation on Service Outage over Multiple Links - Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load characteristics (e.g., current load, load variation, etc.) of links in the candidate paths. Path costs can represent any quantifiable cost or liability associated with transporting a service flow over the corresponding path. For example, path costs can correspond to a probability that at least one link in the path will experience an outage when transporting the service flow, a price charged by a network operator (NTO) for transporting the traffic flow over the candidate path, or a total network cost for transporting the flow over a candidate path. The candidate path having the lowest path cost is selected to transport a service flow. | 09-18-2014 |
20140355535 | System and Method for Controlling Multiple Wireless Access Nodes - In one embodiment, method for controlling multiple wireless access nodes includes receiving, by a central controller from a base station (BS), a message indicating a channel state information (CSI) and determining a state transition function in accordance with the message. The method also includes determining a belief state in accordance with the state transition function and determining cooperation for a plurality of BSs including the BS in accordance with the belief state to produce a cooperation decision. Additionally, the method includes transmitting, by the central controller to the BS, the cooperation decision. | 12-04-2014 |
20140362688 | System and Method for an Agile Wireless Access Network - A system and method for agile wireless access network is provided. A method embodiment for agile radio access network management includes determining, by a network controller, capabilities and neighborhood relations of radio nodes in the radio access network. The network controller then configures a backhaul network infrastructure for the radio access network in accordance with the capabilities and the neighborhood relations of the radio nodes. | 12-11-2014 |
20140362730 | System and Method for Mapping a Service-Level Topology to a Service-Specific Data Plane Logical Topology - An embodiment method includes receiving service parameters for a service and locating logical network nodes for a service-specific data plane logical topology at respective physical network nodes among a plurality of physical network nodes according to the service parameters, a service-level topology, and a physical infrastructure of the plurality of physical network nodes. The method also includes defining connections among the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure, and defining respective connections for a plurality of UEs to at least one of the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure. The method further includes defining respective functionalities for the logical network nodes. | 12-11-2014 |
20150023163 | System and Methods for Multi-Objective Cell Switch-Off in Wireless Networks - Embodiments are provided for a multi-objective scheme for solving a cell switch-off problem. The multi-objective solution seeks to minimize or reduce network energy consumption by switching off some of the cells in the network while allowing enough capacity according to traffic needs and quality of service requirement. An embodiment method includes determining, for each one of a plurality of established traffic profiles, a set of solutions with respect to a number of active cells from a plurality of cells in the network and an aggregate network capacity. The method further includes matching a given traffic profile to one of the established traffic profiles, and evaluating performances of the solutions corresponding to that traffic profile. A solution from the solutions is then selected in accordance with the evaluation. The selected solution indicates which of the cells in the wireless network to be switched off. | 01-22-2015 |
20150024802 | System and Method for Selecting Operating Parameters in a Communications System - A method for configuring a first base station within a cluster in a communications system having a plurality of cluster includes optimizing an operating parameter of the first base station in accordance with first utility function results from a first utility function associated with the first base station and second utility function results from a second utility function associated with a second base station within the cluster, the first utility function results and the second utility function results according to multiple settings for the operating parameter of the first base station, a first initialized setting of the operating parameter for the second base station, and a second initialized setting of the operating parameter for an external base station outside the cluster. The method also includes sharing the optimized operating parameter with the external base station. | 01-22-2015 |
20150031406 | System and Method for Greedy-Based Autonomous Resource Block Assignment Scheme for Cellular Networks with Self-Organizing Relaying Terminals - Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation. | 01-29-2015 |
20150032495 | System and Method for User Controlled Cost Based Network and Path Selection across Multiple Networks - Embodiments are provided to enable a user controlled path selection for servicing content requests from users. In an embodiment, a user device sends a cost request for a service to a network, and in return receives cost information for the service from the network. The user device then determines, according to the cost information, cost for one or more paths across the network. Upon determining acceptable cost for a path from the paths, the user device selects the path for receiving the service. In another embodiment, a network node coupled to links receives loading information from neighbor nodes coupled to neighbor links, and evaluates cost using loading information for the links and the received loading information for the neighbor links. When the network node receives a cost request from a user for a service, the node returns cost information for the service. | 01-29-2015 |