Systems and methods for making channel assignments to reduce interference and increase capacity of wireless networks

WO 2007/005192

PCT/US2006/022296

SYSTEMS AND METHODS FOR MAKING CHANNEL ASSIGNMENTS TO REDUCE INTERFERENCE AND INCREASE CAPACITY OF WIRELESS NETWORKS

TECHNICAL FIELD

[0001] 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.

WO 2007/005192

PCT/US2006/022296

SYSTEMS AND METHODS FOR MAKING CHANNEL ASSIGNMENTS TO

REDUCE INTERFERENCE AND INCREASE CAPACITY OF WIRELESS

NETWORKS

BACKGROUND OF THE INVENTION

[0002] 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. Tn 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).

[0003] 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.

[0004] 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.

In a first aspect, there is provided a method for assigning channels in a wireless system, said method comprising:

determining at a given point in time in interfering cells which mobile stations (MSs) in each said cell are communicating with the highest signal strength; and assigning channels to said MSs based on said determined signal strength;

wherein said assigning comprises: in one of said cells making the channel assignment such that a MS with a highest signal strength is assigned a particular channel and in the interfering cell the assignment is that a MS with a lowest signal strength is assigned said particular channel.

In a second aspect, there is provided a method for assigning channels in a wireless system, said method comprising:

determining at a given point in time in interfering cells which mobile stations (MSs) in each said cell are communicating with the highest signal strength; and assigning channels to said MSs based on said determined signal strength;

in one of said cells making the channel assignment such that preferred MSs are assigned to certain channels and in the interfering cell said certain channels are reserved.

A third aspect provides a method of assigning channels to MSs, said method comprising:

in a pair of potentially interfering cells, establishing an assignment order of channels such that with respect to an ordered series of channels in each cell a first cell will assign MSs to channels according to a particular assignment pattern while in the second of said cells the assignment will be in the mirror image of the assignment in said first cell, wherein said particular pattern is in the order of strongest to weakest signal strength with respect to said first cell and said channel assignment is in the order of weakest to strongest with respect to the same ordered series of channels in said second cell.

A fourth aspect provides a wireless system comprising:

at least two BSs each defining a cell, said BSs using an N=1 repeat pattern;

means for determining relative signal strength among MSs communicating with each said BS; and means for assigning MSs according to a pattern designed to minimize interference between MSs in each of said cells using the same channels

3A and means for assigning an order to said channels in each said cell such that in one cell the weakest signal strength MSs are assigned from one end of said channel order and the strongest signal strength MSs are assigned from the other end of said channel order.

Any discussion of documents, acts, materials, devices, articles or the like which has been included in the present specification is solely for the purpose of providing a context for the present invention. It is not to be taken as an admission that any or all of 10 these matters form part of the prior art base or were common general knowledge in the field relevant to the present invention as it existed before the priority date of each claim of this application.

Throughout this specification the word comprise, or variations such as comprises or comprising, will be understood to imply the inclusion of a stated 15 element, integer or step, or group of elements, integers or steps, but not the exclusion of any other element, integer or step, or group of elements, integers or steps.

WO 2007/005192

PCT/US2006/022296

BRIEF DESCRIPTION OF THE DRAWINGS

[0008] 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:

[0009] FIGURE 1 shows one embodiment of wireless cells ordered according to a pattern;

[0010] FIGURE 2 shows one assignment pattern;

[0011] FIGURE 3 shows a simulation of theoretical capacity distributions for random and intelligent channel assignment; and

[0012] FIGURE 4 shows one embodiment of an algorithm for assigning channels.

WO 2007/005192

PCT/US2006/022296

DETAILED DESCRIPTION OF THE INVENTION

[0013] FIGURE 1 shows one embodiment 10 in which BS1 makes channel assignments for MSs from the nearest (strongest power levels) to the farthest (weakest power levels), while BS2 makes channel assignments to MSs from the farthest (weakest power levels) to the nearest (strongest power levels). This assignment pattern is shown in FIGURE 2.

[0014] Using this channel assignment, pattern MS 1-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.

[0015] 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.

[0016] 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 FIGURE 1.

[0017] 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.

[0018] 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.

[0019] 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

WO 2007/005192

PCT/US2006/022296 maximize the capacity of the entire network, hi 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.

[0020] FIGURE 3 shows simulation 30 of high to low ordering paired with the low to high (graph 303) at the interfering BS as shown in FIGURE 2. Graphs 301, 302 and 303 represent the capacity distributions of the three strategies. For example, at the 25% point, this means 75% of all users enjoy capacities exceeding 4, 3 and 2.5 BPH respectively. Or looking the other way 25% of all users have capacity less than 4, 3 and 2.5 BPH. The results using 16 sub-carriers show increased bandwidth (theoretical capacity), i.e., a significant reduction in high interference events for a greater number of users over either the preference channel assignment method (graph 301) or random assignment (graph 302), all using 100% of the channels in both of the interfering cells. Note that using preference pairing (which can be a premium service available to select number of MSs) a higher capacity (graph 301) can be achieved, but for a lower number ofMSs.

[0021] 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 subchannel 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.

[0022] 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.

[0023] Using the preference assignment cell 1 would leave, say the first 510% of channels open for assignment to preferred customers, and would leave the last 510% of channels vacant. Cell 2 would do the reverse, i.e., leave its first 5-10% of

WO 2007/005192

PCT/US2006/022296 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).

[0024] FIGURE 4 shows one embodiment 40 of a process for assigning channels in a wireless system. Process 401 controls requests for service from a MS (user) and process 402 optionally determines if the requesting user is a preferred user. If it is then process 403 assigns a channel according to a class of service or other identifying characteristic of the MS depending upon contractual arrangements with the user.

[0025] 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 FIGURE 2, assigns a proper channel in conjunction with processes 406, 407, 408 and 409 which check to be sure there is no prohibition on the use of certain channels (such as, for example, would occur if certain channels were to be maintained vacant).

[0026] Process 410 controls the reassignment from time to time of the channel assignments to insure that the pattern established by FIGURE 2 is maintained, at least on the average.

[0027] 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 there of.

[0028] 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 = log2 (1 + S/N +1). Reduces to % S and the new C = ¹Λ the old C.

Increase S to 4 S and the new C is doubled.

WO 2007/005192

PCT/US2006/022296

[0029] 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.

[0030] 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.