Method for resource allocation in a radio system

• US 5,442,804 A
• Filed: 10/25/1991
• Issued: 08/15/1995
• Est. Priority Date: 03/03/1989
• Status: Expired due to Fees

• Current Assignee: Televerket
• Original Assignee: Televerket
• Inventors: Tegth, Ulf, Gunmar, Krister
• Primary Examiner(s): Eisenzopf, Reinhard J.
• Assistant Examiner(s): FAILE, ANDREW I
• Application Number:
  US07/752,511
• Time in Patent Office: 1,390 Days
• Field of Search: 455/33.1, 455/33.2, 455/33.3, 455/33.4, 455/54.1, 455/54.2, 455/56.1, 455/62, 455/63, 455/67.3, 455/67.6
• US Class Current: 455/446
• CPC Class Codes: H04W 16/18 Network planning tools
• CPC Class Codes: H04W 24/10 Scheduling measurement reports ; Arrangements for measurement reports
• CPC Class Codes: H04W 72/541 using the level of interference
• CPC Class Codes: H04W 72/542 using measured or perceived quality

Abstract

The present invention relates to a method for resource allocation in a radio system comprising base stations with respective coverage areas and mobile units. The interaction between the stations in the system is defined with the aid of measured and/or calculated field strengths from all base stations on relevant traffic routes in the geographic area of the radio system, preferably in the form of an exclusion matrix. An allocating matrix is formed by compressing the exclusion matrix by means of an allocating algorithm. The algorithm utilizes figures of merit which are on the one hand calculated by mathematical/logical means to form possible combinations of stations and utilizes on the other hand a random technique for selecting one of these combinations. The algorithm is iterated a number of times and different allocations are obtained thanks to the random technique. The best one of the allocations from any point of view is selected.

Claims

1. A method for allocating resources in a radio system comprising the steps of:

providing a plurality of base stations;

associating a coverage area for each of said base stations;

providing a plurality of mobile stations that can move between or within the coverage areas;

determining the area of interaction between base stations and their coverage areas by measurements;

calculating a merit figure for each of said base stations and placing the merit figures in rows of a matrix;

randomly selecting a row of said matrix as a starting row;

determining, from the remaining rows, which rows are compatible with the starting row in order to determine the best rows, randomly selecting a row from the subset of the best rows to be added to the starting row, and;

repeating said calculating, selecting and determining steps until there are no longer any compatible rows;

choosing a row from the remaining rows; and

assigning transmitting and receiving frequencies for each base station based upon the choosing step.

2. A method as in claim 1 wherein the step of determining from the remaining rows further comprising the steps of:

compressing of said matrix; and

repeating said compressing step of said matrix until no further compression is possible.

3. A method as in claim 2 wherein said selecting step comprises:

a plurality of random selection techniques.

4. A method as in claims 1, 2, or 3 wherein said step of calculating further comprising the step of:

producing a scalar product between vectors in said matrix.

5. A method as in claim 4 wherein said step of determining further comprises:

representing the interaction by a cross-interference matrix with elements in the form of numerical values.

6. A method as in claim 4 wherein said step of determining further comprises:

representing the interaction by an exclusion matrix with elements in symbol form.

7. A method as in claim 4 wherein said step of determining further comprises:

representing the interaction by a cross-interference matrix with elements in the form of numerical values; and

representing the interaction by an exclusion matrix with elements in symbol form.