Abstract: Cell switch-off (CSO) methods for base stations (BSs) in a wireless network are provided. The CSO methods utilize quality of service (QoS) requirement information of user equipments (UEs) to determine which BS to switch off according to a pre-defined criteria. The criteria is defined so that impact of switching off a BS on the UEs may be reduced, and/or QoS requirements of at least some of the UEs may be satisfied if a BS was switched off.

Abstract: 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.

Abstract: 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.

Abstract: In one embodiment, a method of wireless load balancing includes receiving, by a communications controller from a device, a plurality of messages including a plurality of demands of a plurality of UEs and a plurality of locations of the plurality of UEs, where the plurality of demands includes a demand of a UE of the plurality of UEs, where the plurality of locations includes a location of the first UE, and where the location of the UE is in a cell and determining a utility map in accordance with the plurality of demands and the plurality of locations. The method also includes determining a recommendation of user behavior of a user of the first UE in accordance with the utility map, the location of the first UE, and the demand of the UE and transmitting, by the communications controller to the UE, the recommendation of user behavior.

Abstract: An embodiment communication system and method for using multiple-input multiple-output use. Kronecker model to determine a symbol coding formulation that achieves ergodic capacity for high signal-to-noise ratios (SNRs). The lower bound on this capacity is achieved by input signals in the form of the product of an isotropically distributed random Grassmannian component and a deterministic component comprising the eigenvectors and the inverse of the eigenvalues of the transmitter covariance matrix.

Abstract: An embodiment method includes determining, by a first network device, an equivalent coherence time of a narrowband network corresponding to the broadband network in accordance with a channel coherence time and a coherence bandwidth of the broadband network. The method further includes structuring, by the first network device, a Grassmannian symbol in accordance with the equivalent coherence time, generating, by the first network device, Grassmannian symbol sections by partitioning the Grassmannian symbol in accordance with the coherence bandwidth, and transmitting, by the first network device to a second network device, the Grassmannian symbol sections on subchannels within the coherence bandwidth.

Abstract: A method for operating a user device adapted to transmit data in a communications system in which available resources are divided into contention resources and non-contention resources includes selecting a first non-contention resource from the non-contention resources in accordance with selection information, the user device configured to transmit data on the first non-contention resource, determining a contention resource from a first plurality of contention resources associated with the first non-contention resource, in accordance with an association between the first plurality of contention resources and the first non-contention resource is known by the user device and a network node in the communications system, and transmitting a message on the contention resource, wherein the message initiates a random access procedure to obtain access to the selected first non-contention resource.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments are provided for network resource allocation considering user experience, satisfaction, and operator interest. An embodiment method by a network component for allocating network resources includes evaluating, for a user, a QoE for each flow of a plurality of flows in network traffic in according with a QoE model, and further evaluating, for an operator, a revenue associated with the flows in accordance with a revenue model. A plurality of priorities that correspond to the flows are calculated in accordance with the QoE for the user and the revenue for the operator. The method further includes identifying a flow of the flows with a highest value of the priorities, and allocating a network resource for the flow. In an embodiment, the QoE model is a satisfaction model that provides a measure of user satisfaction for each flow in accordance with a subscription or behavior class of the user.

Abstract: Embodiments are provided for enabling dynamic pricing of services to users. The amount of usage all or different services are quantized into quanta of minimum usage units, such as to an amount of effective bits (eBits) in communications services. The amount of usage of the different services is weighted differently, such as according to service cost or demand, to obtain corresponding amount of quanta of usage or eBits for each service. The amount of quanta of usage or eBits for the different services is summed up to provide a total amount of quanta of usage or eBits. The total amount of quanta of usage or eBits is converted into a total charge, as a product of the total amount of quanta of usage or eBits, or a monotonic function of the total amount, and a fixed charge rate per quanta of usage or eBit.

Abstract: 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.

Abstract: Disclosed are a scheduling method and apparatus for a relay-based network. The scheduling apparatus may assign a plurality of sub channels to links, with respect to each of a first sub frame and a second sub frame included in s downlink sub frame. The scheduling apparatus may perform scheduling in cases where nodes operated as transmitters and as receivers in the first sub frame and the second sub frame may diversely exist.

Abstract: A method and system for capacity and coverage enhancement in wireless networks is provided. Each cell has a base station and in-cell relay stations. The base station includes interference avoidance/averaging mechanism, dynamic resource partitioning mechanism or a combination thereof. The interference avoidance/averaging mechanism dynamically creating a FH pattern based on interference information obtained from its serving cell. The base station may include a scheduler for dynamic resource partitioning mechanism for managing scheduling in the cell.

Abstract: The present invention provides a resource allocation method and device for an amplify-and-forward relay network. The method includes: obtaining channel information, where the channel information includes channel information between a base station BS and a relay station RS and channel information between the RS and each user equipment UE; calculating, according to the channel information, resource use information of each UE on each sub-channel pairing; and obtaining, according to the resource use information, the number of REs allocated to each UE on each sub-channel pairing, where the obtained number of the REs enables a preset first function to obtain a maximum value. In the embodiments of the present invention, the use efficiency of the resources may be improved.

Abstract: 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.

Abstract: Provided is an apparatus for controlling interference. The apparatus may receive interference information about at least one subchannel which is allocated to at least one node in an OFDMA system. The apparatus may create an interference list using the interference information. The apparatus may report the interference list to a radio network controller (RNC).

Abstract: Disclosed are a scheduling method and apparatus for a relay-based network. The scheduling apparatus may assign a plurality of sub channels to links, with respect to each of a first sub frame and a second sub frame included in s downlink sub frame. The scheduling apparatus may perform scheduling in cases where nodes operated as transmitters and as receivers in the first sub frame and the second sub frame may diversely exist.