US 9,813,922 B2
System and method for resource management in heterogeneous wireless networks
Narayan Prasad, Willow Grove, PA (US); Vaibhav Singh, Austin, TX (US); and Sampath Rangarajan, Bridgewater, NJ (US)
Assigned to NEC Corporation, Tokyo (JP)
Filed by NEC Laboratories America, Inc., Princeton, NJ (US)
Filed on Jul. 29, 2015, as Appl. No. 14/812,580.
Claims priority of provisional application 62/030,368, filed on Jul. 29, 2014.
Claims priority of provisional application 62/101,183, filed on Jan. 8, 2015.
Prior Publication US 2016/0037387 A1, Feb. 4, 2016
Int. Cl. H04W 24/02 (2009.01); H04W 28/02 (2009.01); H04L 12/891 (2013.01); H04W 72/04 (2009.01)
CPC H04W 24/02 (2013.01) [H04L 47/41 (2013.01); H04W 28/02 (2013.01); H04W 72/0446 (2013.01)] 18 Claims
OG exemplary drawing
1. A method implemented in a mobile communications system having a plurality of transmission points (TPs) and at least one user, the method comprising:
managing the resources of the mobile communications system on two time-scales including a coarse time-scale and a fine time-scale, wherein the coarse time-scale management comprises a first stage of determining a user association for each of the plurality of TPs followed by a second stage of determining activation fractions for all TPs, said first and second stages being performed at a start of a frame;
utilizing a procedure having a greedy stage and a local search stage to determine the user association, wherein said greedy stage comprising the following steps:
inputting average single-user rates and a fairness factor;
analyzing gains of system utility from different user, TP pairs, said gains of system utility being responsive to the average single-user rates and the fairness factor;
selecting a user, TP pair based on the user having not been previously selected and the TP pair providing a most favorable incremental change for system utility among all user, TP pairs;
determining if all users have been assigned a TP;
performing the greedy stage again beginning from the step of selecting the user, TP pair if some users have not been assigned the TP; and
outputting a set of selected user, TP pairs if all users have been selected; and
said local search stage comprises the following steps:
inputting the fairness factor, average single-user rates, an improvement threshold and the set of selected user, TP pairs output from the greedy stage;
analyzing each user and determining a change in system utility obtained by a potential swap of a currently assigned TP for each user with every other TP;
analyzing the potential swaps for all users and determining a most favorable swap which provides a greatest improvement in the system utility;
determining whether the improvement in the system utility for the most favorable swap is greater than the improvement threshold;
updating the selected set of user, TP pairs to include the most favorable swap if the improvement from the swap are greater than the improvement threshold and performing the local search stage again beginning with the step of analyzing each user and determining the change in system utility obtained by the potential swap; and
outputting a current set of selected user, TP pairs if the improvement from the most favorable swap is less than the improvement threshold.