Restrictive reuse set management

• US 20060019701A1
• Filed: 12/22/2004
• Published: 01/26/2006
• Est. Priority Date: 07/23/2004
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Ji, Tingfang
• Granted Patent: US 7,257,406 B2
• Time in Patent Office: Days
• US Class Current: 455/553.100
• CPC Class Codes: H04W 16/02 Resource partitioning among network components, e.g. reuse partitioning
• CPC Class Codes: H04W 16/04 Traffic adaptive resource partitioning
• CPC Class Codes: H04W 16/12 Fixed resource partitioning
• CPC Class Codes: H04W 28/24 Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
• CPC Class Codes: H04W 72/0453 Resources in frequency domain, e.g. a carrier in FDMA

Abstract

A restrictive reuse set management algorithm for equal grade of service on a forward link (FL) transmission is described. While a restrictive reuse algorithm is known to improve the SINR of weak users in interference limited networks, the fairness issue associated with restrictive reuse has not been explored. The bandwidth allocated to each reuse set, the reuse set loading and the harmonic mean of the spectral efficiencies of all users sharing the reuse set are used to estimate the equal-grade-of-service (EGoS) user throughput over the reuse set. An iterative algorithm is then designed to maximize the sector throughput under the constraint of equal user throughput over all reuse sets.

Claims

1. A method of allocating system resources in a wireless communication system, comprising:

determining dimension of each reuse set;

determining loading of each reuse set;

determining spectral efficiencies of all users sharing each reuse set;

estimating an equal-grade-of-service (EGoS) user throughput over each reuse set based on the dimension of each reuse set, loading of each reuse set, and spectral efficiencies of all users sharing each reuse set; and

equalizing user throughputs in all reuse sets.

2. The method of claim 1, wherein user throughputs in all reuse sets are equalized by iteratively moving users from low throughput reuse sets to high throughput reuse sets.

3. The method of claim 2, wherein two reuse sets swap users if the throughputs in both reuse sets are increased.

4. The method of claim 1, wherein the EGoS user throughput, η

, over reuse set m (S_m) is estimated by

${\mathrm{\eta <br><br>}}_m<br><br>\frac{B_m}{\underset{i\in <br><br>S_m}{\sum <br><br>}<br><br>1/{\mathrm{\mu <br><br>}}_{i,m}},$

where

B_m denote the dimension of reuse set m and μ

_i,m denotes the spectral efficiency of user i over reuse set m.

5. The method of claim 1, further comprising maximizing sector throughput under the constraint of EGoS user throughput over each reuse set.

6. The method of claim 5, wherein sector throughput is maximized by maximizing

$B_m$



S m 

∑

i ∈

S m ⁢

1 / μ

i , m ,

where B_m denote the dimension of reuse set m and μ

_i,m denotes the spectral efficiency of user i over reuse set m (Sm).

7. The method of claim 5, further comprising scheduling a user from each reuse set.

8. The method of claim 1, wherein the dimension is a subcarrier in an OFDMA system.

9. The method of claim 1, wherein the dimension is a timeslot-subcarrier in an OFDMA system.

10. The method of claim 1, wherein the dimension is a timeslot in a TDMA system.

11. The method of claim 1, wherein the dimension is a carrier in an MC-CDMA system.

12. An apparatus operable to allocate system resources in a wireless communication system, comprising:

a controller operative to

determining dimension of each reuse set;

determining loading of each reuse set;

determining spectral efficiencies of all users sharing each reuse set;

estimating an equal-grade-of-service (EGoS) user throughput over each reuse set based on the dimension of each reuse set, loading of each reuse set, and spectral efficiencies of all users sharing each reuse set; and

equalizing user throughputs in all reuse sets.

13. A controller programmed to execute a method of estimating interference in a wireless communication system, the method comprising:

determining dimension of each reuse set;

determining loading of each reuse set;

determining spectral efficiencies of all users sharing each reuse set;

estimating an equal-grade-of-service (EGoS) user throughput over each reuse set based on the dimension of each reuse set, loading of each reuse set, and spectral efficiencies of all users sharing each reuse set; and

equalizing user throughputs in all reuse sets.

14. An apparatus operable to allocate system resources in a wireless communication system, comprising:

means for determining dimension of each reuse set;

means for determining loading of each reuse set;

means for determining spectral efficiencies of all users sharing each reuse set;

means for estimating an equal-grade-of-service (EGoS) user throughput over each reuse set based on the dimension of each reuse set, loading of each reuse set, and spectral efficiencies of all users sharing each reuse set; and

means for equalizing user throughputs in all reuse sets.

15. The apparatus of claim 14, further comprising means for maximizing sector throughput under the constraint of EGoS user throughput over each reuse set.

16. A computer readable media embodying a method for allocating system resources in a wireless communication system, comprising:

determining dimension of each reuse set;

determining loading of each reuse set;

determining spectral efficiencies of all users sharing each reuse set;

estimating an equal-grade-of-service (EGoS) user throughput over each reuse set based on the dimension of each reuse set, loading of each reuse set, and spectral efficiencies of all users sharing each reuse set; and

equalizing user throughputs in all reuse sets.