This invention relates to wireless network channel assignments and more particularly to systems and methods for making such assignments in a manner to reduce interference and increase capacity in wireless networks.
In wireless systems it is often desired to use all channels (or all of the allocated spectrums) in every cell. These systems are called N=1 reuse systems. In such systems it is possible for a mobile station (MS) to receive signals of equal power on the same channel from two base stations (BS).
Current methods of solving this problem include CDMA where different codes are transmitted by different BSs and, depending on the spreading factors, a signal can be extracted from the interference with greater reliability. Unfortunately, in such systems spreading reduces the overall through-put in direct proportion.
Another solution involves frequency hopping. In this case the BSs randomly select channels to send to the MS and if only a few mobiles are in use the chances of collisions can be made small because each channel is used only a small fraction of the time. However, as loading (increased MSs) increases, collision possibility increases until with 100% of possible users on at each BS collisions occur in every instance. The damage due to interference done at each instant depends upon the instantaneous transmitter power of the interfering BSs and the relative distances the MSs are from their respective BSs.
There is disclosed a system and method for improving wireless system capacity by reducing collisions where the Signal to Interference Ratio (SIR) is high in systems having a channel reuse of 1. By intelligently assigning (ordering) the channel assignment in each of the interfering cells according to a pattern, for example, according to the distance from a BS, the MSs will become paired on the same channel in a manner to reduce interference between them. A second step is to optionally control the power of the BS and MS transmitter to further optimize user capacity or reduce interference.
In one embodiment, this intelligent assignment is accomplished by assigning MSs in one cell such that the MS having the strongest signal is assigned channel A while in the interfering cell, the MS with the weakest signal, is assigned to channel A. In another embodiment, certain preferred MSs are assigned either interference-free channels or channels paired with weak interference MSs.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.
For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
Using this channel assignment, pattern MS1-A(1) having a strong signal, is assigned channel A in cell 1. MS7 which is at the edge of cell 2, and has a relatively weak signal from BS2 is assigned the channel A in cell 2. This assignment avoids the situation where MS3 and MS7 are paired on the same channel. Were that to occur, S≈I for transmission in each direction from BS to MS and from MS to BS yielding high interference.
Each BS can make new channel assignments from time to time so that for the most part the MSs remain assigned according to their relative strength even though they are moving.
Intelligent assignments can be done in other ways to achieve different objectives. For example, some MSs can be designated as preferred users so that the preferred user will always be paired with the weakest interferer in every instance. For example, if MS4 was a preferred user it would be paired with MS7 in the example of
Another objective may be to provide maximum capacity to a particular user. In such a case a clear channel could be guaranteed to the user or the user could be paired with the weakest user in the other cell.
Another objective may be to reduce interference in a cell by having a BS and/or selected MS transmit at a slower rate at reduced power.
The strategies discussed herein can be implemented at each BS without prior knowledge of the signals and interferences at the interfering BS. An alternative would be a centralized controller that has access to the signal levels and the interference levels of all MSs, and which then implements a centralized strategy, say to maximize the capacity of the entire network. In principle, a computer could evaluate every possible pairing combination and select from that a desired result such as maximum network capacity or minimizing high interference conditions.
Graph 302 shows, for example, a typical OFDMA system where individual MS are assigned a subset of all the available sub-carriers. In a typical transmission slot the BS may have available 16, 32 or more sub-channels. A sub-channel usually has several sub-carriers, each carrying independent information. Normally, the sub-channels are assigned on a first come first serve basis to the mobile users who normally are randomly distributed within their respective cells.
Pairing using graph 303 can be changed, for example, as discussed above, every 5 MS, to be sure that in cell 1 the strongest station remains on channel A, while the weakest station is on channel D, while in cell 2 the weakest station is on channel A, while the strongest is on channel D. Strongest can be defined using any convenient metric so long as the potentially interfering cells agree on the metric. One example would be using high signal to interference ratios (SIR) as a measure of strength.
Using the preference assignment cell 1 would leave, say the first 5-10% of channels open for assignment to preferred customers, and would leave the last 5-10% of channels vacant. Cell 2 would do the reverse, i.e., leave its first 5-10% of channels vacant and assign its preferred customers to the last 5-10% of channels. Also, it could be established that preferred users would always get the weakest interferences from the other cell, as discussed above. Graph 301 was simulated for the case of the preferred user being paired with the weakest interferer (weakest one out of 16 at random locations).
If the requesting user is not a preferred user then process 404 determines relative signal strength, as discussed above, and process 405, following an assignment pattern as shown in
Process 410 controls the reassignment from time to time of the channel assignments to insure that the pattern established by
In one embodiment the allocated spectrum is divided into channels. A channel is defined as a portion (may be all) of the allocated spectrum being used for a specified period of time. The inventive concepts apply to FDMA, TDMA, TD-CDMA, OFDMA or combinations thereof.
Note that the capacity of a BS or the capacities of certain MSs can be raised or lowered by trading power for throughput (capacity). A simple example: If a user needs less capacity, then lower the power and change the modulation rate.
C=log 2(1+S/N+I). Reduce S to ¼S and the new C=½ the old C.
Increase S to 4 S and the new C is doubled.
This is a tradeoff. Every time the BS lowers power it helps the neighbor cell, but if it increases power to certain MS it causes more interference. However, if the channels that are increased in power are part of the reserved set, then it may not matter.
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. 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 is a continuation of, and claims priority to, pending U.S. patent application Ser. No. 13/197,151, filed Aug. 3, 2011, which is a continuation of U.S. Pat. No. 8,010,118, filed Jul. 13, 2007, which is a continuation of U.S. Pat. No. 7,257,376, filed Jun. 30, 2005, the entire disclosures of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5293641 | Kallin et al. | Mar 1994 | A |
5787352 | Benveniste | Jul 1998 | A |
5794157 | Haartsen | Aug 1998 | A |
5884145 | Haartsen | Mar 1999 | A |
5915221 | Sawyer et al. | Jun 1999 | A |
6075991 | Raleigh et al. | Jun 2000 | A |
6175734 | Desgagne et al. | Jan 2001 | B1 |
6388999 | Gorsuch et al. | May 2002 | B1 |
6411817 | Cheng et al. | Jun 2002 | B1 |
6711415 | McCarthy | Mar 2004 | B1 |
6983150 | Dixon | Jan 2006 | B2 |
7106713 | Pankaj | Sep 2006 | B2 |
7257376 | Reudink | Aug 2007 | B2 |
7474895 | Jiang et al. | Jan 2009 | B1 |
7920870 | Bhatia et al. | Apr 2011 | B1 |
8010118 | Reudink | Aug 2011 | B2 |
8897796 | Reudink | Nov 2014 | B2 |
20010041574 | Bergenlid et al. | Nov 2001 | A1 |
20020027957 | Paulraj et al. | Mar 2002 | A1 |
20020072373 | Muramoto et al. | Jun 2002 | A1 |
20020154705 | Walton et al. | Oct 2002 | A1 |
20040127223 | Li et al. | Jul 2004 | A1 |
20050096061 | Ji et al. | May 2005 | A1 |
20050249322 | Gerlach | Nov 2005 | A1 |
20060056360 | Parkvall et al. | Mar 2006 | A1 |
20060135169 | Sampath et al. | Jun 2006 | A1 |
20060153283 | Scharf et al. | Jul 2006 | A1 |
20130170370 | Reudink | Jul 2013 | A1 |
Number | Date | Country |
---|---|---|
1138480 | Feb 2013 | CN |
1119113 | Jul 2001 | EP |
187577 | Mar 2013 | IL |
7245776 | Sep 1995 | JP |
9037337 | Feb 1997 | JP |
10308972 | Nov 1998 | JP |
2001036463 | Feb 2001 | JP |
2001339342 | Dec 2001 | JP |
101258824 | Apr 2013 | KR |
I393456 | Apr 2013 | TW |
WO-9631075 | Oct 1996 | WO |
WO-9733377 | Sep 1997 | WO |
WO-9809465 | Mar 1998 | WO |
WO-2006107656 | Oct 2006 | WO |
Entry |
---|
“Non-Final Office Action”, U.S. Appl. No. 13/197,151, Nov. 21, 2013, 29 pages. |
“Foreign Office Action”, CA Application No. 2,609,120, Feb. 3, 2014, 4 pages. |
“Foreign Office Action”, Canadian Application No. 2609120, (Mar. 28, 2013), 3 pages. |
“Final Office Action”, U.S. Appl. No. 13/197,151, (May 29, 2013), 26 pages. |
“Extended European Search Report”, EP Application No. 06772558.0, Mar. 31, 2011, 9 pages. |
“Final Office Action”, U.S. Appl. No. 13/197,151, Sep. 12, 2012, 19 pages. |
“Final Office Action”, U.S. Appl. No. 11/777,801, Oct. 1, 2010, 31 pages. |
“Foreign Notice of Allowance”, Israel Application No. 187577, Aug. 8, 2012, 2 pages. |
“Foreign Notice of Allowance”, Korean Application No. 10-2008-7002361, Jan. 25, 2013, 3 pages. |
“Foreign Notice of Allowance”, Chinese Application No. 200680023343.3, Nov. 6, 2012, 4 pages. |
“Foreign Notice of Allowance”, Taiwan Application No. 095122305, Dec. 12, 2012, 4 pages. |
“Foreign Notice of Allowance”, Japanese Application No. 2008-519329, Mar. 15, 2012, 6 pages. |
“Foreign Office Action”, Taiwan Application No. 095122305, Aug. 29, 2012, 10 pages. |
“Foreign Office Action”, Israel Application No. 187577, Nov. 23, 2011, 4 pages. |
“Foreign Office Action”, Korean Application No. 10-2008-7002361, Aug. 16, 2012, 6 pages. |
“Foreign Office Action”, JP Application No. 2008-519329, Nov. 2, 2011, 7 pages. |
“Foreign Office Action”, Chinese Application No. 200680023343.3, Jul. 20, 2012, 7 pages. |
“Foreign Office Action”, Chinese Application No. 200680023343.3, Mar. 26, 2012, 8 pages. |
“IEEE 802.11a-1999”, From Wikipedia, the free encyclopedia, downloaded from <http://en.wikepedia.org/wiki/IEEE—802.11a-1999> on Mar. 12, 2013, 5 pages. |
“Initial OFDMA/OFDMA PHY proposal for the 802.16.3 BWA”, Oct. 30, 2000, 21 pages. |
“International Search Report & Written Opinion”, Application No. PCT/US2006/022296, Apr. 10, 2008, 8 pages. |
Wong, et al.,“Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation”, IEEE Journal on Selected Areas in Communications, vol. 17, No. 10, Oct. 1999, pp. 1747-1758. |
“Non-Final Office Action”, U.S. Appl. No. 11/172,604, Oct. 6, 2006, 11 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/197,151, Jan. 9, 2012, 13 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/197,151, Jan. 2, 2013, 22 pages. |
“Non-Final Office Action”, U.S. Appl. No. 11/777,801, Feb. 17, 2010, 24 pages. |
“Notice of Allowance”, U.S. Appl. No. 11/777,801, May 23, 2011, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 11/172,604, Apr. 6, 2007, 8 pages. |
“Notice of Allowance”, U.S. Appl. No. 11/777,801, Apr. 20, 2011, 9 pages. |
“Foreign Office Action”, CA Application No. 2,609,120, Nov. 3, 2014, 5 Pages. |
“Notice of Allowance”, U.S. Appl. No. 13/197,151, Jul. 14, 2014, 11 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/714,183, Jul. 31, 2014, 21 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/714,183, Jan. 16, 2015, 10 pages. |
Number | Date | Country | |
---|---|---|---|
20130170371 A1 | Jul 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13197151 | Aug 2011 | US |
Child | 13714206 | US | |
Parent | 11777801 | Jul 2007 | US |
Child | 13197151 | US | |
Parent | 11172604 | Jun 2005 | US |
Child | 11777801 | US |