The present invention relates, in general, to orthogonal frequency division multiple access (OFDMA) networks, and, more particularly, to integration of scheduling and power control for the uplink of OFDMA networks.
The next generation of wireless networks, such as fourth generation (4G) networks, will likely use OFDMA (Orthogonal Frequency Division Multiple Access) in the reverse link or uplink from the mobile device to the base station. In OFDMA, the reverse link resources assigned to a user are called tiles. Each tile generally consists of a subset of subcarriers, which may either be consecutive or spread out over an entire bandwidth. Because OFDMA sectors assign, at most, one user to each of tile, reverse link transmissions within any given sector are typically orthogonal. However, these reverse link transmissions may be affected by intercell interference. This interference typically results from users in adjacent sectors that may have also been assigned to the same tile. If those users in the adjacent sectors transmit using high power then the intercell interference may severely limit the signal-to-interference-plus-noise ratio (SINR) achieved by the user. Therefore, user transmission powers are typically managed carefully, in order to avoid excessive intercell interference.
In the reverse link of an OFDMA network, the transmission power of access terminals (ATs) is generally selected large enough to provide the desired transmission rate but not too high to significantly degrade transmissions in neighboring sectors because of the intercell interference caused to those transmissions. For example, there is a specific user (referred to as the “concerned user”) in a specific sector (referred to as the “concerned sector”) transmitting over a specific tile. The paradox of intercell interference occurs along the following sequence of events:
The above sequence of events may repeat until the concerned user reaches its maximum transmission power. Because the concerned user reaches its maximum power, maximum interference on neighboring sectors may also be achieved, which then causes neighboring users to reach their maximum transmission power; thus, maximizing interference in the system.
Solutions have been addressed for down or forward link transmissions in code division multiple access (CDMA) networks. However, the OFDMA case has some significant differences to the CDMA, (a) there is no intracell interference (interference between subcarriers is negligible); (b) soft combining is not possible (because each sector independently schedules its reverse link users) and, therefore, there are no macrodiversity gains; and (c) the power spectral density for an AT transmission can be high if few tiles are allocated to it (and, thus, the intercell interference it causes may significantly degrade transmissions in adjacent sectors).
Each of the current solutions suggested to solve the intercell interference problem in downlink transmissions uses global knowledge of the entire system. It would be logical to assume that these downlink solutions could also be analogized to solve the uplink problem as well. However, such algorithms use global knowledge, which means that either all information is collected at some central entity that computes the solution and informs each sector of this solution or global information is collected by each sector which then determines the optimal solution. Regardless of which method is used to manage global, system-wide information, there would need to be a significant amount of information exchanged across the entire network. Furthermore, the delay in collecting this information may mean that the computed solution is no longer optimal for a constantly changing communication environment.
These and other problems are generally solved or circumvented, and technical advantages are generally achieved, by representative embodiments directed to managing radio resources and power for OFDMA uplinks. A threshold transmission rate for the reverse link is used by base stations to compare against the achievable reverse link transmission rate of a particular AT within the sector serviced by the base station. When the calculated rate is higher than the threshold rate, the base station allocates maximum power to the AT. Otherwise, when the calculated rate is lower than the threshold rate, zero power is allocated to the AT.
In accordance with a preferred embodiment of the present invention, a method for managing radio resources in an OFDMA network includes periodically determining an optimal power allocation for an AT within each sector of a plurality of sectors and changing the optimal power allocation when doing so would increase the total reverse link transmission rate of that sector. The start time of the determination for the each sector is independent. Therefore, each sector can begin determining when it needs to. However, the period of the determination is the same. Thus, each sector will complete the determination at least once during a single period.
In accordance with a preferred embodiment of the present invention, a method for managing radio resources in a sector of an OFDMA network includes calculating a reverse link transmission rate for an AT in the sector, comparing the calculated reverse link transmission rate to a threshold transmission rate, where the threshold transmission rate is predetermined, and setting an optimal power allocation for the AT to maximum power when the calculated reverse link transmission rate is greater than the threshold transmission rate.
In accordance with a preferred embodiment of the present invention, a base station for an OFDMA network is made up from a processor, memory, accessible by the processor, and a power control module stored in the memory and executable by the processor. The power control module includes a transmission rate calculator configured to calculate a reverse link transmission rate for an AT in a sector served by the base station, a rate comparator configured to compare the calculated reverse link transmission rate to a threshold transmission rate, where the threshold transmission rate is predetermined for the OFDMA network, and a power allocation component configured to allocate power to the AT based on results from the rate comparator.
In accordance with a preferred embodiment of the present invention, a computer program product having a computer readable medium with computer program logic recorded thereon includes code for calculating a reverse link transmission rate for an AT in a sector of an OFDMA network, code for comparing the calculated reverse link transmission rate to a threshold transmission rate, where the threshold transmission rate is predetermined and code for setting an optimal power allocation for the AT to maximum power when the calculated reverse link transmission rate is greater than the threshold transmission rate.
For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
a)-7(d) illustrate plots, for each of the four central cells, of the function Δi versus ri;
a)-9(d) illustrates normalized total transmission rale versus rate threshold.
The making and using of the presently preferred embodiments are discussed in detail below. It should be appreciated, however, that the present invention provides many applicable inventive concepts that can be embodied in a wide variety of specific contexts. The specific embodiments discussed are merely illustrative of specific ways to make and use the invention, and do not limit the scope of the invention.
On a periodic basis, each sector determines the optimal power allocation for the mobile device or AT in its sector, given the prevailing power allocations of all other sectors. The time at which each sector performs this computation is independent of all other sectors, but the period between computations is the same for all sectors so that within this period all sectors perform the computation exactly once.
This process converges after a finite number of iterations. Let n denote the index of the most recent computation iteration. Let
If no changes are made to any sector assignments in an iteration, then the algorithm has converged, since no changes will be made from then onwards. Each time a change is made, the system-wide reverse link throughput rate strictly increases. This implies that a power allocation vector will never be repeated. Because there are a finite number of power allocation combinations, this means that the power allocation vector converges after a finite number of iterations.
It should be noted that the process described in
Next, the decision process is considered for each sector. For purposes of this example, consider the case for which pi(n)=0. It should be noted that the process described herein for pi(n)=0 would be similar for pi(n)=pmax. Thus, the following description also applies in the pmax case, except with pi(n)=pmax.
When determine how to allocate power, the pi(n)=0 allocation should be changed if doing so results in a strict increase in the total reverse link transmission rate. If power is increased to pmax, the change in total, system-wide reverse link transmission rate is given by:
Based on formula (1), a relationship can be seen between Δi and gii. The first term of formula (1) increases as gii increases. The second term, while not directly related to gii, will also change when gii changes. On average, the value of gij will decrease as gii increases (although one can design rare cases where this is not necessarily true). If the average holds true for the system design, then the second term will also increase as gii increases. In this example, the third term is independent of gii because pi(n)=0 and, thus, user i does not contribute to the interference Xj for any neighboring sector, j. A conclusion may, therefore, be made that Δi increases as gii also increases. Moreover, let ri denote the potential reverse link transmission rate that user i can achieve if allowed to transmit. It can be noted that ri also increases as gii increases. This means that Δi will also increase monotonically with ri.
For each of the four central cells, sectors (2,2), (2,3), (3,3), and (3,2), the location of one AT is randomly changed in the chosen cell while the ATs in the other 15 cells remain fixed. For each of these four cases, the corresponding values of Δi and the achievable user rate r are computed.
Therefore, based on this correlation, an assumption is made, in general, that a threshold, ti, exists for each sector i, such that, if ri>ti, it is optimal to allocate maximum power to the AT, otherwise, the AT should be allocated zero power and not transmit. This threshold (which may change over time) can be computed by setting Δi=0 in equation (1) and solving for gii. The resulting threshold, ti, is then the achievable rate corresponding to this value of gii. In operation, however, even if all of the information used to calculate ti was available, the determination of the gain, gii, when Δi=0 is difficult to compute.
One solution around this computational complexity lies in the characteristics of the system. In homogeneous systems, where all sectors have identical characteristics, the time average of ti converges to some value,
In various embodiments of the present invention,
It should be noted that as the threshold approaches zero, at some point all ATs or mobile devices are allowed to transmit with full power. These threshold values provide a certain degree of fairness (i.e., equal transmit power fairness). In contrast, as the threshold values are increased, fewer ATs are allowed to transmit. Eventually, the threshold value reaches a level where only a single AT is allowed to transmit on the reverse link of the specific tile. This AT will be the one with the highest channel gain (i.e., the best radio conditions).
In order to demonstrate the variation of the total rate, Δi, with the threshold, {circumflex over (t)}, the layout in
In
Using a value of {circumflex over (t)}=1, which is one of the thresholds that achieves the largest total rate (
Each array element is set to ‘1’ if the AT in the corresponding sector is allowed to transmit with maximum power, otherwise, it is set to zero. Below each array in Tables 1 and 2 are the corresponding total rates. For this particular example, the optimal allocation is given in Table 2 by:
Using this distributed algorithm, therefore, provides a solution that is optimal for all but one sector.
Next, this determination process is repeated to calculate the total, system-wide transmission rate, normalized by the optimal total rate, against the transmission rate threshold for different random layouts and with different maximum transmission powers. These additional iterations are used to determine the sensitivity of the threshold to the particular layout. In
The calculated reverse link transmission rate is compared to a threshold transmission rate, in step 305, where the threshold transmission rate is predetermined. An optimal power allocation for the AT is set to maximum power, in step 306, when the calculated reverse link transmission rate is greater than the threshold transmission rate. The AT is then scheduled for reverse link transmission in step 307. In step 308, the AT is assigned to a tile of the sector when the power allocation of the AT is set to maximum power and withheld from assignment to the tile when the power allocation of the AT is set to zero power.
It should be noted that the specific embodiments and layout of the sectors illustrated in
Power control module 502 also includes rate comparator 504, which compares the reverse link transmission rate, calculated by transmission rate calculator 503, to the predetermined threshold transmission rate. When rate comparator 504 detects that the calculated reverse link transmission rate is greater than the threshold rate, it signals power allocation component 505 to set the power allocation of the subject AT to the maximum power. In contrast, when rate comparator 504 detects that the reverse link transmission rate is less than the threshold rate, it signals power allocation component 505 to set the subject AT's power allocation to zero power. Thus, base station 404 is able to efficiently manage network power using data from its own serviced sector.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiment disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein.
The program or code segments making up the various embodiments of the present invention may be stored in a computer readable medium or transmitted by a computer data signal embodied in a carrier wave, or a signal modulated by a carrier, over a transmission medium. The “computer readable medium” may include any medium that can store or transfer information. Examples of the computer readable medium include an electronic circuit, a semiconductor memory device, a ROM, a flash memory, an erasable ROM (EROM), a floppy diskette, a compact disk CD-ROM, an optical disk, a hard disk, a fiber optic medium, a radio frequency (RF) link, and the like. The computer data signal may include any signal that can propagate over a transmission medium such as electronic network channels, optical fibers, air, electromagnetic, RF links, and the like. The code segments may be downloaded via computer networks such as the Internet, Intranet, and the like.
Bus 602 is also coupled to input/output (I/O) controller card 605, communications adapter card 611, user interface card 608, and display card 609. The I/O adapter card 605 connects storage devices 606, such as one or more of a hard drive, a CD drive, a floppy disk drive, a tape drive, to computer system 600. The I/O adapter 605 is also connected to a printer (not shown), which would allow the system to print paper copies of information such as documents, photographs, articles, and the like. Note that the printer may be a printer (e.g., dot matrix, laser, and the like), a fax machine, scanner, or a copier machine.
Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. For example, many of the features and functions discussed above can be implemented in software, hardware, or firmware, or a combination thereof. As another example, it will be readily understood by those skilled in the art that the disclosed components and hardware may be varied while remaining within the scope of the present invention.
Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed, that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
This application claims the benefit of U.S. Provisional Application No. 60/882,265, filed on Dec. 28, 2006, entitled, “Method and System for Integrated Scheduling and Power Control for the Uplink of an OFDMA Network,” and is related to U.S. patent application Ser. No. 11/773,395, filed on Jul. 3, 2007, entitled, “Method and System for Optimal Allocation of Uplink Transmission Power in Communication Networks,” which applications are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5844983 | Lilja | Dec 1998 | A |
6085107 | Persson et al. | Jul 2000 | A |
6580920 | Kalliojärvi | Jun 2003 | B2 |
6591110 | Kim et al. | Jul 2003 | B1 |
6603985 | Ichihashi | Aug 2003 | B1 |
6628956 | Bark et al. | Sep 2003 | B2 |
6735420 | Baldwin | May 2004 | B2 |
6760567 | Jeong et al. | Jul 2004 | B1 |
6882860 | Kim | Apr 2005 | B1 |
7089041 | Huang | Aug 2006 | B2 |
7099384 | Jalali et al. | Aug 2006 | B1 |
7162267 | Kim | Jan 2007 | B2 |
7218948 | Laroia et al. | May 2007 | B2 |
7313124 | Lim et al. | Dec 2007 | B2 |
7333604 | Zernovizky et al. | Feb 2008 | B2 |
7519036 | Zhang | Apr 2009 | B2 |
7529550 | Li | May 2009 | B2 |
7676198 | Mahany | Mar 2010 | B2 |
7689203 | Zhang et al. | Mar 2010 | B2 |
7689240 | Anderson | Mar 2010 | B2 |
7701911 | Soliman | Apr 2010 | B2 |
7702342 | Duan | Apr 2010 | B2 |
7706389 | Liu | Apr 2010 | B2 |
7738907 | Xiao et al. | Jun 2010 | B2 |
7742444 | Mese et al. | Jun 2010 | B2 |
7752128 | Shan | Jul 2010 | B2 |
20020077138 | Bark et al. | Jun 2002 | A1 |
20020082017 | Hattori | Jun 2002 | A1 |
20020159422 | Li et al. | Oct 2002 | A1 |
20020172186 | Larsson | Nov 2002 | A1 |
20030017837 | Kalliojarvi | Jan 2003 | A1 |
20030114127 | Baldwin | Jun 2003 | A1 |
20040062192 | Liu et al. | Apr 2004 | A1 |
20040102205 | Zhang et al. | May 2004 | A1 |
20040127223 | Li et al. | Jul 2004 | A1 |
20040166886 | Laroia et al. | Aug 2004 | A1 |
20040166887 | Laroia et al. | Aug 2004 | A1 |
20050135324 | Kim et al. | Jun 2005 | A1 |
20050186933 | Trans | Aug 2005 | A1 |
20050272440 | Li | Dec 2005 | A1 |
20060018276 | Kim et al. | Jan 2006 | A1 |
20060083161 | Laroia et al. | Apr 2006 | A1 |
20060089154 | Laroia et al. | Apr 2006 | A1 |
20060092881 | Laroia et al. | May 2006 | A1 |
20060094363 | Kang et al. | May 2006 | A1 |
20060109826 | Zhang | May 2006 | A1 |
20060183495 | Soliman | Aug 2006 | A1 |
20060209721 | Mese et al. | Sep 2006 | A1 |
20060286995 | Onggosanusi et al. | Dec 2006 | A1 |
20070018786 | Shan | Jan 2007 | A1 |
20070070908 | Ghosh et al. | Mar 2007 | A1 |
20070104164 | Laroia et al. | May 2007 | A1 |
20070111746 | Anderson | May 2007 | A1 |
20070115800 | Fonseka et al. | May 2007 | A1 |
20070115861 | Zhang et al. | May 2007 | A1 |
20070116139 | Subramanian et al. | May 2007 | A1 |
20070123213 | Wu | May 2007 | A1 |
20070149129 | Das et al. | Jun 2007 | A1 |
20070178906 | Gao et al. | Aug 2007 | A1 |
20070189215 | Wu et al. | Aug 2007 | A1 |
20070195755 | Li et al. | Aug 2007 | A1 |
20070213087 | Laroia et al. | Sep 2007 | A1 |
20070225029 | Abusch-Magder | Sep 2007 | A1 |
20070243876 | Duan | Oct 2007 | A1 |
20070287454 | Zhu et al. | Dec 2007 | A1 |
20070293260 | Xiao et al. | Dec 2007 | A1 |
20080032732 | Hosein | Feb 2008 | A1 |
20080039104 | Gu et al. | Feb 2008 | A1 |
20080049705 | Huang et al. | Feb 2008 | A1 |
20080070498 | Tan et al. | Mar 2008 | A1 |
20080076466 | Larsson | Mar 2008 | A1 |
20080102844 | Zhu et al. | May 2008 | A1 |
20080112383 | Li | May 2008 | A1 |
20080112395 | Zhu et al. | May 2008 | A1 |
20080112407 | Liu | May 2008 | A1 |
20080175186 | Liu et al. | Jul 2008 | A1 |
20080219183 | Yin | Sep 2008 | A1 |
20080242339 | Anderson | Oct 2008 | A1 |
20080248817 | Gao et al. | Oct 2008 | A1 |
20080274739 | Wu | Nov 2008 | A1 |
20090052327 | Larsson et al. | Feb 2009 | A1 |
20090158442 | Zhang | Jun 2009 | A1 |
20090170548 | Soliman | Jul 2009 | A1 |
20090311968 | Wigren | Dec 2009 | A1 |
Number | Date | Country |
---|---|---|
1829131 | Sep 2006 | CN |
Number | Date | Country | |
---|---|---|---|
20080159215 A1 | Jul 2008 | US |
Number | Date | Country | |
---|---|---|---|
60882265 | Dec 2006 | US |