EP0731622A2 - Apparatus and method for adaptive dynamic channel assignment in wireless communication networks - Google Patents
Apparatus and method for adaptive dynamic channel assignment in wireless communication networks Download PDFInfo
- Publication number
- EP0731622A2 EP0731622A2 EP96301299A EP96301299A EP0731622A2 EP 0731622 A2 EP0731622 A2 EP 0731622A2 EP 96301299 A EP96301299 A EP 96301299A EP 96301299 A EP96301299 A EP 96301299A EP 0731622 A2 EP0731622 A2 EP 0731622A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- cells
- channel
- channels
- determining
- cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/04—Traffic adaptive resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/06—Hybrid resource partitioning, e.g. channel borrowing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/26—Resource reservation
Definitions
- This invention relates to wireless/cellular radiotelephone systems and an apparatus and method for the assignment of radio frequency (RF) spectrum channels to the different cells within a wireless communication system for optimizing utilization of the available overall radio spectrum.
- RF radio frequency
- the service area of a wireless communications system is partitioned into connected service domains known as cells, where radio telephone users communicate, via radio links, with the base station serving the cell.
- the base station (BS) is coupled to the land network.
- Efficient use of the available radio frequency spectrum is achieved through the reuse of the same radio frequencies in designated co-user cells that are sufficiently separated by distance so that the combined interference generated by all cells is below tolerable levels.
- the assignment of radio frequencies to cells has been based on regularity assumptions (i.e., equal-sized regularly-spaced cells with uniformly distributed traffic loads), which enable the adoption of simple rules for identifying co-user cells, and for partitioning the RF spectrum into channel sets.
- a channel assignment system assigns channels to a group of cells of arbitrary shape, size, and/or location, by the optimal partitioning of the available radio frequencies into nonoverlapping sets, the optimal grouping of co-user cells, and the best assignment of the former to the latter.
- the objective is the maximization of traffic handling capacity. Given the multitude of cells, the objective may be expressed as the maximization of the bottleneck capacity ratio that can be sustained at a satisfactory blocking rate, interference level, and other system constraints, which is the lowest capacity ratio across all cells.
- the bottleneck capacity ratio is known as the capacity factor.
- a capacity ratio for a cell is defined as the ratio of the number of radio frequencies assigned to the cell over the number of radio frequencies needed to meet blocking probability requirements. The latter is fixed once the traffic loads and desired blocking are specified.
- the maximization of the capacity factor is used in the discussion below as an example. Other measures of utilization efficiency of the RF spectrum may also be employed.
- a channel assignment can adapt to traffic distribution changes over time by recomputation of the optimal channel assignment based on traffic estimates derived from the observed traffic loads. satistical differences may be determined from real time measurements of traffic load and used for rearranging channel assignments.
- An assignment of channels to cells based on an expected traffic distribution does not imply an exclusive relationship between them, as shown in detailed description below. Available channels not assigned to a particular cell can be borrowed by that cell if it has a present need for added channel capacity and provided that the interference and other system constraints are satisfied.
- the solution of the optimal non-regular channel assignment is decomposed, according to the invention, into two mathematical programs designated as a Master Program and a Subprogram. These are solved iteratively.
- a channel set augmentation technique may be implemented between solutions of the Master and Subprogram in order to speed up the solution procedure.
- a cell having exhausted its available assigned channels may borrow a channel that is not assigned to the cell to satisfy capacity.
- FIG. 1 A conventional regular hexagonal cell layout, of a cellular radiotelephone system, is shown in schematic form in FIG. 1. Depicting the geographical service area in terms of a hexagonal grid sets a geometric pattern that allows frequencies to be assigned in a patterned disposition that allows the reuse of these frequencies in a controlled repeatable regular assignment model. The cell areas each have specific channel sets assigned to them. Each channel set comprises a plurality of individual transmit and receive radio channels for use within the cell area.
- cells marked "A" are co-user cells and all use the same channel set. The same is true for co-user cells marked "B", "C", etc., each of which have their own assigned channel set.
- Each cell is radiated by an antenna system associated with a base station (BS), that includes the radio transceivers and which are in turn connected to the public switched telephone network (PSTN) via trunk lines or suitable equivalent.
- Antennas 101 are either omni-directional or directional.
- Directional antennas 102 are used to sectorize cells into smaller angular wedge type serving areas.
- a typical cellular system is shown in the block diagram of FIG. 2.
- a plurality of mobile switching centers (MSC), 202 and 203, are shown connecting the mobile radiotelephone system to the public switched telephone network 201 (PSTN).
- PSTN public switched telephone network
- the switching of the MSCs interconnects a plurality of base stations (BS) 210 each providing service to a cell coverage area.
- BS base stations
- Each coverage area is shown as having irregular boundaries typical of an actual system.
- Each BS has radio transmit/receive equipment and radiating antennas to serve mobile radiotelephones 250 within its cell coverage area.
- An operations and management center (OMC) 220 is coupled to the MSCs 202 and 203 to control their system operation and their associated BSs 210.
- OMC 220 is a central control station which includes data processing equipment and input for accepting data input from data storage and real time control. This data processing arrangement may be utilized in implementing channel assignments in combination with remotely tunable radio transceivers located at the BSs.
- a general purpose computer 310 has a stored program included in its memory 311. This program includes instructions for performing the non-regular assignment of radio channels to a cellular system as disclosed in further detail below.
- Initial input data is supplied through the input circuit 312 to the computer 310.
- Inputs include the available cells. The available radio frequencies, the channel bandwidth, and filter characteristics are also input into the computer 310.
- Further inputs include parameters describing the statistical behavior of interference between users and base stations in different cells, and the statistical distribution of the serving signal in each cell. These parameters may be estimated from signal strength measurements.
- the inputs may also include system constraints necessary for the desired channel assignment. Traffic usage patterns are supplied as an input. Traffic may be measured in real time.
- the assignment process is performed in the computer 310 according to the instructions contained in memory 311.
- the resulting non-regular assignment is output via the output 313 to the MSC 315 and is in turn forwarded to the BSs 321.
- the individual tunable radios 322 included in the BSs are tuned to the proper frequencies in accord with the assignment of radio channels determined by the assignment process. Added output leads permit graphical and data printouts at the OMC.
- each cell During borrowing, each cell will exhaust its allotted channels first before requesting an additional borrowed channel. If, however, it needs additional channels, it may borrow unused additional channels not assigned to itself, provided that system and interference constraints are not violated. Because of borrowing, an idle channel may not be usable in its assigned cell if it has been borrowed by a nearby cell. Therefore, the interference and other system constraints must be checked even when a cell uses its allotted channels. If imposed, an additional constraint that would need to be checked during borrowing is the requirement that a portion of the channels allotted to a cell must be reserved for use by that cell. This portion of reserved channels, which may change in real time, may depend on the number of busy channels plus the number of channel requests denied in the cell, or various other system performance measures.
- a borrowed channel is released by the using cell as soon as one of the cell's allotted channels becomes available (due to a call termination or a hand-off). If channel rearrangement is not desirable at this point, the borrowed channel is released upon termination or hand-off of the call it serves.
- the channel assignment can be expressed as a mathematical programming problem of the form: Maximize g
- constraints in (1) allocate channels to logical cells in proportion to the cells' requirements.
- constraint (2) the total number of assigned channels is limited to the number of channels available.
- Constraint (3) ensures that the ratio of signal strength to interference is above the desired threshold value with confidence level 1 - ⁇ .
- Constraint (3) may be written to include neighbor-channel interference. This constraint may be repeated for different confidence levels 1 - ⁇ and the corresponding threshold values T.
- the above formulation of the channel assignment problem can accommodate additional constraints that would reflect a user's special needs. Examples of such constraints are discussed herein below in a discussion of the solution procedure for the basic formulation.
- the above problem is a large scale nonlinear mixed-integer stochastic mathematical program. If, for example, a cellular grid has 210 logical cells (70 cell sites, with 3 logical faces per cell site), and 200 channel sets are considered, there would be 42,211 constraints and 42,200 integer variables (excluding slack variables), of which 42,000 would be binary.
- This problem is decomposed into two computationally tractable parts using generalized linear programming.
- the original problem is decomposed into two smaller problems which are solved one after the other in an iterative sequence, exchanging their respective solutions, until the optimal solution is reached.
- the two problems are called the Master Program and the Subprogram.
- the Master Program consists of all but the stochastic constraints in (3), which make up the Subprogram constraints.
- the Subprogram contains the constraints assuring that the ratio of signal strength to interference is above a desired threshold value. Its objective coefficients are the simplex multipliers corresponding to constraints (4) of the Master Program.
- the collection of channel sets included in the Master Program is comprised of all the solutions of the Subprogram.
- the k th solution of the Subprogram provides values for the binary variables x kj .
- a channel set is defined in terms of the co-user cells it serves.
- the collection of channel sets grows with every new solution of the Subprogram, and this growth helps improve the Master Program solution. Growth in the collection of channel sets stops when the optimal solution is reached.
- the overall structure of the assignment process comprising the Master Program and Subprogram is shown in the FIG. 4.
- the solution procedure involves four major functions. These are: Channel Assignment Initialization (block 410), a Master Program Solution (block 420), Channel Set Augmentation, and Subprogram Solution (closely related blocks 430 and 440).
- block 410 which is the initialization of the channel assignment, a feasible channel assignment is obtained before we proceed with the optimization. If the model is applied to an existing grid, the present channel assignment can serve as the initial channel assignment, provided it satisfies all system constraints. If it violates any of the constraints, it is modified by the Initial Channel Assignment algorithm, as described below, to meet all constraints.
- the Channel Group Augmentation algorithm is an optional heuristic process that enhances solution of the problem. It revises the values of N k and ⁇ j , which are used in the next solution of the Subprogram.
- the Subprogram solution furnishes the values of ⁇ and x kj .
- the solution procedure described herein is finite as the number of different channel sets is finite, and each solution of the Subprogram contributes a new channel set to the Master Program. That the channel set entering the Master Program at each cycle is new is based on the following observation.
- the simplex multipliers of the relaxed Master Program at cycle K- 1 satisfy the conditions: (5) If the new Subprogram solution x Kj is added to the Master Program, it cannot meet the condition in (7), for that would lead to the termination of the process. Since it violates the requirement in (7) it cannot be identical to any of the K - 1 solutions encountered previously, by condition (8). Hence, x Kj represents a new channel set. Given that the number of cells in a grid is finite, the number of distinct cell groupings that represent different channel sets is also finite. Hence, the solution procedure is finite.
- the solution procedure must start with a feasible channel assignment, that is a channel assignment that covers all cells and meets the channel availability constraint and co-channel interference constraints.
- a feasible channel assignment that is a channel assignment that covers all cells and meets the channel availability constraint and co-channel interference constraints.
- the channel assignment in place may serve as the initial channel assignment, provided it is feasible. If the existing channel assignment is not feasible (infeasibility would arise typically from the violation of the interference constraints), or if there is no existing channel assignment, it is necessary to generate an initial feasible channel assignment.
- Channel Assignment Initialization consists of two phases.
- Phase I we modify (Block 507) the channel sets in the existing channel assignment, one at a time by changing values for N k and ⁇ j . If a channel set violates the interference constraint (decision Block 502), cells are removed (Block 504) until it satisfies the interference constraint. If the interference constraint is met by an existing channel set, the algorithm will assign as many additional cells as possible (Block 505), provided that the interference constraint is satisfied. If the resulting channel sets cannot cover all cells, the second phase is implemented. In Phase II additional channel sets are generated until all cells are covered (Block 506).
- Phase I ⁇ j equals 1 for all cells j covered by the existing channel set, and zero for the remaining cells.
- ⁇ j is computed by the equation (10) disclosed herein below.
- the Master Program is a linear program involving the integer variables N k , which assume values ranging from 0 to N -- the number of available frequencies, a number which is normally between 300 and 400.
- N k the number of available frequencies, a number which is normally between 300 and 400.
- Various techniques may be used to obtain an integer solution. Given the magnitude of the integer variables, one can obtain near-optimal solutions to this mixed-integer linear program by solving the relaxed linear program without the integer requirements as per Block 601 in FIG. 6. For the purposes of channel assignment, integer solutions must be provided.
- the algorithm yielding an integer solution to the Master Program shown in FIG. 6 uses the fact that the optimal channel assignment will use all of the N available channels. Given an optimal solution to the relaxed problem (the linear program without the integer requirements), the algorithm starts by making the channel set sizes equal to the integers closest to the relaxed solution (Block 601). It terminates if the integer set sizes add up to N (Blocks 605,607,609). If not, it increases (or decreases) by 1 the sizes of the channel sets with the greatest positive (or negative) deviation from the optimal non-integer value (Blocks 611, 615). The steps of the algorithm are shown in the FIG. 6 and are described below in detail.
- N k denotes the channel set sizes in the optimal solution, and by N k their closest integers.
- the solution of the Master Program becomes straightforward.
- Standard linear programming software can be used.
- the relaxed Master Program is a relatively small linear program, having a number of constraints equal to one plus the number of logical cells in the grid, and number of variables equal to one plus the number of channel groups. It is expected that a large grid would have no more than 500 logical cells. Seven hundred and fifty channel sets would more than exceed the number needed to yield an optimal solution.
- the number of cycles of the Master Program may be reduced by generating lists of channel sets with the channel group augmentation heuristic.
- One of the factors contributing to the computational effort in mathematical programming decomposition is the repeated solution of the Master Program. Since the optimal channel assignment is derived from the last Master Program solution, and all previous Master Programs serve only to generate a list of desirable candidate channel sets, generating a larger number of candidates at each cycle would tend to reduce the number of Master Program solutions while still yielding an optimal solution. Therefore, between any two consecutive solutions of the Master Program, the method used generates several new channel sets. The number to be generated is specified by the user.
- the criterion used in generating new channel sets is that they must have the potential to improve the Master Program objective value.
- the first channel set generated after the solution of the K th Master Program has this potential since it has a negative reduced cost by condition (7).
- the simplex multiplier ⁇ j is needed.
- ⁇ j is supplied by the solution of the Master Program. Since our aim is to generate more than one channel set between consecutive solutions of the Master Program, it is necessary to revise the ⁇ j values before each Subprogram solution without re-solving the Master Program.
- Equation (9) The condition of equation (9) is employed to update the ⁇ j values of binding cells as follows.
- a new channel set K derived from the last Subprogram solution, will receive in the next iteration a portion of the available channels. This implies that if set K covers cell j, cell j will typically not be binding in the next iteration.
- equation (9) the corresponding simplex multiplier ⁇ j would become zero.
- This revision causes channel sets generated by subsequent solutions of the Subprogram to favor binding cells that were not covered by the last channel set, as they will have positive ⁇ j values.
- the algorithm for generating F new channel sets is shown in flow form in FIG. 7.
- the algorithm logic can be described as follows.
- the cells are partitioned into three subsets.
- U contains all the cells, and C and C ⁇ are empty.
- a member of U is placed in C. Its inclusion in the solution may pre-empt other members of U from inclusion.
- the pre-empted members of U are moved to C ⁇ .
- the algorithm terminates when U becomes empty.
- the cell to be moved from U to C is chosen based on its potential to block other members of U from entering C.
- the pre-emptive potential function p j as the inverse of the "slack" a j in the interference constraint in equation (6), which measures the margin for additional contributions to the interference experienced in cell j.
- P j 1 a j
- the solution of the Subprogram may be expanded to include cells with zero ⁇ j . This is necessary in order to deal with the non-binding cells that become binding as more channel sets are generated. In some instances, the inclusion of the largest possible number of cells in the solution of the Subprogram may be desirable for the increased system planning flexibility it affords. Hence, cells may be chosen in order of descending value of the following criterion function f j : where K is the last channel set generated, and ⁇ is a very small positive number.
- the cells with positive ⁇ j values will be given priority. The remaining cells will be considered only when all cells with positively ⁇ j have been considered.
- the choice of a cell to be included in set C is based on the pre-emptive potential p j since, according to condition (9), the capacity ratio in the second term of (14) is the same for all such cells -- it equals the grid capacity factor. For cells with zero ⁇ j values, the capacity ratio dominates the choice of a cell to be included into C.
- the slack will vary with the composition of C, the collection of cells covered by the channel set.
- Equation (15) can be written as follows: where z is a normal random variable.
- ⁇ Y and ⁇ Y depend on the composition of set C. They are computed using the assumption that the signals of all antenna faces, when expressed in decibels, are independent normally distributed random variables and that the cumulative interference experienced in cell j is also normally distributed, when expressed in decibels [9].
- ⁇ L and ⁇ L 2 which vary with the composition of the set C, are computed in each step of the Subprogram Solution algorithm by a power-summing procedure.
- the statistical parameters employed in the power-summing computation may be calculated from analytical models, or estimated based on empirical data that may accumulate during the operation of the system.
- the process in which unused channels of one cell are borrowed by a cell needing added capacity is illustrated by the flowchart of FIG. 9.
- the process begins at terminal 901 and in block 903 the instructions call for a periodic measurement of traffic distribution.
- the instructions of the block 905 replicate the above described computation for computing channel assignment or any other method for computing channel assignments.
- the occurrence of a channel request on one of the cells as shown in block 907 may find that cell fully subscribed.
- the decision block 909 determines if there is an available channel from those already assigned to the cell. If there is one, it is assigned to the channel request provided the interference and other system constraints are satisfied. Then, the flow proceeds to block 911 whose instructions assign the call to the free channel and the assignment process ends in terminal 919.
- the flow proceeds to block 913, which determines if there is a free channel, not assigned to the cell, that would meet a all interference, system, and reservation requirements if assigned to the channel request. If there is one, the flow proceeds to block 915, whose instructions assign the call to the free channel and the assignment process ends in terminal 919.
- a process illustrated in FIG. 10, controls the disposal of the borrowed channel.
- the process begins in start terminal 951 and in block 953 which recognizes the termination or handoff of a call.
- the instructions of decision block 955 inquire if the released channel is a borrowed channel. If it is, the flow terminates in the end terminal 961. If it is not, the decision block 957 inquires if there is another call in the cell using a borrowed channel. The flow ends in the absence of such a call. If a borrowed channel is being used, the call on that channel is transferred to the released channel as shown in block 959. The flow process terminates in the end terminal 961.
- the interference constraint checked in channel use and reservation decisions is similar to the interference constraint in equation (6), and its equivalent constraints (15) and (18), but with the following differences.
- the set C is the replaced by the set C' consisting of the cells actually using the channel when compliance is checked.
- the confidence level 1 - ⁇ is replaced by 1 - ⁇ ', which would be typically higher. For example, ⁇ could be 0.50 while ⁇ ' would be 0.10.
- the probability distribution may be conditional on the observed signal strengths of the interfering and serving signals if their values are available.
- a channel assignment is recomputed when the observed offered loads are significantly higher in some cells so as to cause blocking rates in excess of the target values, based on which the channel assignment was computed.
- a record of the number of blocked and successful calls (or channel requests) is retained for a time interval, thus obtaining an estimate of the load offered to the cell. If the observed offered load is outside a statistically significant range of the offered load used to compute the channel assignments, the channel assignment optimization is invoked to compute a new channel assignment. Otherwise, the present assignment is maintained
- Channel reservation helps the system approach the optimal channel assignment.
- a simple example of determining the number of reserved channels in real time would be to make this number reflect the deviation between anticipated and realized offered loads. If there is no change in anticipated offered loads since the last channel assignment calculation, the number of reserved channels plus the number of busy channels owned by a cell would be less than the number of channels assigned to the cell.
Abstract
Description
- This invention relates to wireless/cellular radiotelephone systems and an apparatus and method for the assignment of radio frequency (RF) spectrum channels to the different cells within a wireless communication system for optimizing utilization of the available overall radio spectrum.
- The service area of a wireless communications system is partitioned into connected service domains known as cells, where radio telephone users communicate, via radio links, with the base station serving the cell. The base station (BS) is coupled to the land network. Efficient use of the available radio frequency spectrum is achieved through the reuse of the same radio frequencies in designated co-user cells that are sufficiently separated by distance so that the combined interference generated by all cells is below tolerable levels. The assignment of radio frequencies to cells has been based on regularity assumptions (i.e., equal-sized regularly-spaced cells with uniformly distributed traffic loads), which enable the adoption of simple rules for identifying co-user cells, and for partitioning the RF spectrum into channel sets. When the regularity assumptions do not hold -- as is frequently the case in real world situations -- the rules of regular channel assignment do not lead necessarily to the efficient utilization of the RF spectrum, if they can be applied at all. To optimally utilize the RF spectrum one must solve the non-regular channel assignment problem.
- Therefore a channel assignment system, embodying the principles of the invention, assigns channels to a group of cells of arbitrary shape, size, and/or location, by the optimal partitioning of the available radio frequencies into nonoverlapping sets, the optimal grouping of co-user cells, and the best assignment of the former to the latter. The objective is the maximization of traffic handling capacity. Given the multitude of cells, the objective may be expressed as the maximization of the bottleneck capacity ratio that can be sustained at a satisfactory blocking rate, interference level, and other system constraints, which is the lowest capacity ratio across all cells. The bottleneck capacity ratio is known as the capacity factor. A capacity ratio for a cell is defined as the ratio of the number of radio frequencies assigned to the cell over the number of radio frequencies needed to meet blocking probability requirements. The latter is fixed once the traffic loads and desired blocking are specified. The maximization of the capacity factor is used in the discussion below as an example. Other measures of utilization efficiency of the RF spectrum may also be employed.
- A channel assignment can adapt to traffic distribution changes over time by recomputation of the optimal channel assignment based on traffic estimates derived from the observed traffic loads. satistical differences may be determined from real time measurements of traffic load and used for rearranging channel assignments. An assignment of channels to cells based on an expected traffic distribution does not imply an exclusive relationship between them, as shown in detailed description below. Available channels not assigned to a particular cell can be borrowed by that cell if it has a present need for added channel capacity and provided that the interference and other system constraints are satisfied.
- The solution of the optimal non-regular channel assignment is decomposed, according to the invention, into two mathematical programs designated as a Master Program and a Subprogram. These are solved iteratively. A channel set augmentation technique may be implemented between solutions of the Master and Subprogram in order to speed up the solution procedure.
- In an illustrative embodiment, a cell having exhausted its available assigned channels may borrow a channel that is not assigned to the cell to satisfy capacity.
- While the illustrative embodiment herein is characterized in terms of frequency assignments, it is to be understood that the same techniques may be applied to code assignments in a CDMA system and time slot assignments in TDMA systems. It is not believed necessary to describe these alternative arrangements herein.
- In the Drawing:
- FIG. 1 is a schematic of a regular cell area layout of a wireless/cellular radiotelephone system;
- FIG. 2 is a block schematic of a wireless/cellular radiotelephone system;
- FIG. 3 is a block schematic of a data processing system for assigning radio channels to various cells of a wireless/cellular radiotelephone system;
- FIG. 4 is a flow process diagram of a method for assigning channels to various cells of a wireless/cellular radiotelephone system;
- FIG. 5 is a flow process diagram of a method for making initial feasible channel assignments;
- FIG. 6 is a flow process diagram of a method for providing an integer solution for the Master Program;
- FIG. 7 is a flow process diagram of a method for channel set augmentation; and
- FIG. 8 is a flow process diagram of a method for solution of the Subprogram; and
- FIGS. 9 and 10 are flow charts disclosing a process for a borrowing a channel from another cell channels to meet random changes in traffic demands.
- A conventional regular hexagonal cell layout, of a cellular radiotelephone system, is shown in schematic form in FIG. 1. Depicting the geographical service area in terms of a hexagonal grid sets a geometric pattern that allows frequencies to be assigned in a patterned disposition that allows the reuse of these frequencies in a controlled repeatable regular assignment model. The cell areas each have specific channel sets assigned to them. Each channel set comprises a plurality of individual transmit and receive radio channels for use within the cell area. In this model, shown in FIG. 1, cells marked "A" are co-user cells and all use the same channel set. The same is true for co-user cells marked "B", "C", etc., each of which have their own assigned channel set.
- Each cell is radiated by an antenna system associated with a base station (BS), that includes the radio transceivers and which are in turn connected to the public switched telephone network (PSTN) via trunk lines or suitable equivalent. Antennas 101 are either omni-directional or directional.
Directional antennas 102 are used to sectorize cells into smaller angular wedge type serving areas. - A typical cellular system is shown in the block diagram of FIG. 2. A plurality of mobile switching centers (MSC), 202 and 203, are shown connecting the mobile radiotelephone system to the public switched telephone network 201 (PSTN). The switching of the MSCs interconnects a plurality of base stations (BS) 210 each providing service to a cell coverage area. Each coverage area is shown as having irregular boundaries typical of an actual system. Each BS has radio transmit/receive equipment and radiating antennas to serve mobile radiotelephones 250 within its cell coverage area.
- An operations and management center (OMC) 220 is coupled to the
MSCs BSs 210. OMC 220 is a central control station which includes data processing equipment and input for accepting data input from data storage and real time control. This data processing arrangement may be utilized in implementing channel assignments in combination with remotely tunable radio transceivers located at the BSs. - An illustrative embodiment of data processing equipment included in the OMC for controlling the assignment and tuning of radio transceivers at the BSs is shown in block schematic form in the FIG. 3. A
general purpose computer 310 has a stored program included in itsmemory 311. This program includes instructions for performing the non-regular assignment of radio channels to a cellular system as disclosed in further detail below. Initial input data is supplied through theinput circuit 312 to thecomputer 310. Inputs include the available cells. The available radio frequencies, the channel bandwidth, and filter characteristics are also input into thecomputer 310. Further inputs include parameters describing the statistical behavior of interference between users and base stations in different cells, and the statistical distribution of the serving signal in each cell. These parameters may be estimated from signal strength measurements. The inputs may also include system constraints necessary for the desired channel assignment. Traffic usage patterns are supplied as an input. Traffic may be measured in real time. - In this illustrative embodiment of the invention, the assignment process is performed in the
computer 310 according to the instructions contained inmemory 311. The resulting non-regular assignment is output via theoutput 313 to theMSC 315 and is in turn forwarded to the BSs 321. The individualtunable radios 322 included in the BSs are tuned to the proper frequencies in accord with the assignment of radio channels determined by the assignment process. Added output leads permit graphical and data printouts at the OMC. - During borrowing, each cell will exhaust its allotted channels first before requesting an additional borrowed channel. If, however, it needs additional channels, it may borrow unused additional channels not assigned to itself, provided that system and interference constraints are not violated. Because of borrowing, an idle channel may not be usable in its assigned cell if it has been borrowed by a nearby cell. Therefore, the interference and other system constraints must be checked even when a cell uses its allotted channels. If imposed, an additional constraint that would need to be checked during borrowing is the requirement that a portion of the channels allotted to a cell must be reserved for use by that cell. This portion of reserved channels, which may change in real time, may depend on the number of busy channels plus the number of channel requests denied in the cell, or various other system performance measures. When a cell reserves a channel, the cell must be treated as a current user of the channel when checking compliance with interference and other system constraints before using this channel elsewhere. A borrowed channel is released by the using cell as soon as one of the cell's allotted channels becomes available (due to a call termination or a hand-off). If channel rearrangement is not desirable at this point, the borrowed channel is released upon termination or hand-off of the call it serves.
- To state a simple example of the above general assignment problem algebraically, the following notation is utilized. Let
- j = 1, ..., J
- index of different logical cells
- i = 1, ..., J
- same as j (the combination (i, j) designates a pair of logical cells)
- yj
- number of channels needed in logical cell j to meet blocking requirements
- N
- number of available channels
- Iij
- interference contribution by logical face i to logical cell j
- Sj
- signal strength of logical face j
- T
- threshold level of the signal-to-interference ratio
- The unknown quantities of the problem are:
- g
- capacity factor (bottleneck capacity ratio)
- K
- number of channel sets
- Nk
- size of channel set k
- The channel assignment can be expressed as a mathematical programming problem of the form: Maximize g
-
- The constraints in (1) allocate channels to logical cells in proportion to the cells' requirements. In constraint (2) the total number of assigned channels is limited to the number of channels available. Constraint (3) ensures that the ratio of signal strength to interference is above the desired threshold value with confidence level 1 - α. Constraint (3) may be written to include neighbor-channel interference. This constraint may be repeated for different confidence levels 1 - α and the corresponding threshold values T. The above formulation of the channel assignment problem can accommodate additional constraints that would reflect a user's special needs. Examples of such constraints are discussed herein below in a discussion of the solution procedure for the basic formulation.
- The above problem is a large scale nonlinear mixed-integer stochastic mathematical program. If, for example, a cellular grid has 210 logical cells (70 cell sites, with 3 logical faces per cell site), and 200 channel sets are considered, there would be 42,211 constraints and 42,200 integer variables (excluding slack variables), of which 42,000 would be binary.
- This problem is decomposed into two computationally tractable parts using generalized linear programming. The original problem is decomposed into two smaller problems which are solved one after the other in an iterative sequence, exchanging their respective solutions, until the optimal solution is reached. Following established convention, the two problems are called the Master Program and the Subprogram. The Master Program consists of all but the stochastic constraints in (3), which make up the Subprogram constraints.
- The algebraic formulation of the Master Program and Subprogram are expressed as follows. The following expressions define the Master Program of
block 420 subsequently discussed with respect to FIG. 4:
Maximize g
Subject to:
where xkj are constants satisfying the interference conditions. These values are supplied by the Subprogram described below. - The Subprogram contains the constraints assuring that the ratio of signal strength to interference is above a desired threshold value. Its objective coefficients are the simplex multipliers corresponding to constraints (4) of the Master Program.
The Subprogram has the following form:
Maximize - The collection of channel sets included in the Master Program is comprised of all the solutions of the Subprogram. The kth solution of the Subprogram provides values for the binary variables xkj. A channel set is defined in terms of the co-user cells it serves. The collection of channel sets grows with every new solution of the Subprogram, and this growth helps improve the Master Program solution. Growth in the collection of channel sets stops when the optimal solution is reached.
- The overall structure of the assignment process comprising the Master Program and Subprogram is shown in the FIG. 4. The solution procedure, as shown in the flow process in FIG. 4, involves four major functions. These are: Channel Assignment Initialization (block 410), a Master Program Solution (block 420), Channel Set Augmentation, and Subprogram Solution (closely
related blocks 430 and 440). In the first function, block 410, which is the initialization of the channel assignment, a feasible channel assignment is obtained before we proceed with the optimization. If the model is applied to an existing grid, the present channel assignment can serve as the initial channel assignment, provided it satisfies all system constraints. If it violates any of the constraints, it is modified by the Initial Channel Assignment algorithm, as described below, to meet all constraints. - Once an initial feasible channel assignment has been obtained, the remaining three functions are executed in an iterative sequence. First comes the solution of the Master Program in
block 420, whose solution furnishes the system values of g, Nk, τ, and λj. τ is a simplex multiplier corresponding to constraint (5) and λj is a simplex multiplier corresponding to the jth constraint in (4). This information is used by the Channel Set Augmentation algorithm inblock 430 which invokes the Subprogram Solution algorithm inblock 440 several times in order to generate new channel sets. - The Channel Group Augmentation algorithm is an optional heuristic process that enhances solution of the problem. It revises the values of Nk and λj, which are used in the next solution of the Subprogram. The Subprogram solution furnishes the values of ν and xkj.
- Once a specified number of channel sets has been generated, optimality is checked as prescribed in
decision block 450. If the solution is optimal as determined indecision block 450, the algorithm terminates and the assignments are provided inblock 460. Otherwise, the cycle repeats again with the solution of the restricted Master Program inblock 420. - The following condition indicates optimality: Let K - 1 be the current cycle, and let xKj be the optimal solution of the new Subprogram. Let τ be the simplex multiplier corresponding to constraint (5) of the relaxed Master Program. If
- The solution procedure described herein is finite as the number of different channel sets is finite, and each solution of the Subprogram contributes a new channel set to the Master Program. That the channel set entering the Master Program at each cycle is new is based on the following observation. The simplex multipliers of the relaxed Master Program at cycle K- 1 satisfy the conditions: (5)
- The solution procedure must start with a feasible channel assignment, that is a channel assignment that covers all cells and meets the channel availability constraint and co-channel interference constraints. For an existing cellular grid, the channel assignment in place may serve as the initial channel assignment, provided it is feasible. If the existing channel assignment is not feasible (infeasibility would arise typically from the violation of the interference constraints), or if there is no existing channel assignment, it is necessary to generate an initial feasible channel assignment.
- The method for deriving an initial channel assignment is based on a variation of the Channel Group Augmentation algorithm. In the most general case, as shown in FIG. 5, the existing channel assignment violates the interference constraints. In this case, Channel Assignment Initialization consists of two phases. In Phase I we modify (Block 507) the channel sets in the existing channel assignment, one at a time by changing values for Nk and λj. If a channel set violates the interference constraint (decision Block 502), cells are removed (Block 504) until it satisfies the interference constraint. If the interference constraint is met by an existing channel set, the algorithm will assign as many additional cells as possible (Block 505), provided that the interference constraint is satisfied. If the resulting channel sets cannot cover all cells, the second phase is implemented. In Phase II additional channel sets are generated until all cells are covered (Block 506).
- Both phases employ the Channel Set Augmentation algorithm. They differ in terms of the initial values used for λj. In Phase I, λj equals 1 for all cells j covered by the existing channel set, and zero for the remaining cells. In Phase II, λj is computed by the equation (10) disclosed herein below.
- The Master Program is a linear program involving the integer variables Nk, which assume values ranging from 0 to N -- the number of available frequencies, a number which is normally between 300 and 400. Various techniques may be used to obtain an integer solution. Given the magnitude of the integer variables, one can obtain near-optimal solutions to this mixed-integer linear program by solving the relaxed linear program without the integer requirements as per
Block 601 in FIG. 6. For the purposes of channel assignment, integer solutions must be provided. - The algorithm yielding an integer solution to the Master Program shown in FIG. 6 uses the fact that the optimal channel assignment will use all of the N available channels. Given an optimal solution to the relaxed problem (the linear program without the integer requirements), the algorithm starts by making the channel set sizes equal to the integers closest to the relaxed solution (Block 601). It terminates if the integer set sizes add up to N (Blocks 605,607,609). If not, it increases (or decreases) by 1 the sizes of the channel sets with the greatest positive (or negative) deviation from the optimal non-integer value (
Blocks 611, 615). The steps of the algorithm are shown in the FIG. 6 and are described below in detail. - The term N k denotes the channel set sizes in the optimal solution, and by N k their closest integers. The procedure for obtaining an integer solution to the Master Program is outlined in FIG. 5 as follows:
-
Step 1 - Set N k equal to the integer closest to Nk. (Block 603)
- Step 2
- Compute the difference
If D = 0, terminate (Block 607). Otherwise go to Step 3. - Step 3
- If D < 0, go to Step 5. Otherwise go to Step 4. (Block 607)
- Step 4
- Find D channel sets with the largest difference δk = N k - Nk
Decrease the size of each of the D channel sets by 1.
Terminate. (Blocks 611, 613) - Step 5
- Find |D| channel sets with the largest difference
Increase the size of each of the |D| channel sets by 1.
Terminate. (Blocks 615, 617) - It is easy to verify that, given a non-negative solution to the relaxed linear program, the resulting integer solution will also be non-negative.
- Once the complexity caused by the integer constraints has been removed, the solution of the Master Program becomes straightforward. Standard linear programming software can be used. By linear programming standards, the relaxed Master Program is a relatively small linear program, having a number of constraints equal to one plus the number of logical cells in the grid, and number of variables equal to one plus the number of channel groups. It is expected that a large grid would have no more than 500 logical cells. Seven hundred and fifty channel sets would more than exceed the number needed to yield an optimal solution.
- The number of cycles of the Master Program may be reduced by generating lists of channel sets with the channel group augmentation heuristic. One of the factors contributing to the computational effort in mathematical programming decomposition is the repeated solution of the Master Program. Since the optimal channel assignment is derived from the last Master Program solution, and all previous Master Programs serve only to generate a list of desirable candidate channel sets, generating a larger number of candidates at each cycle would tend to reduce the number of Master Program solutions while still yielding an optimal solution. Therefore, between any two consecutive solutions of the Master Program, the method used generates several new channel sets. The number to be generated is specified by the user.
- The criterion used in generating new channel sets is that they must have the potential to improve the Master Program objective value. The first channel set generated after the solution of the Kth Master Program has this potential since it has a negative reduced cost by condition (7). In order to obtain heuristically additional channel sets with a negative reduced cost, the simplex multiplier λj is needed. Typically, λj is supplied by the solution of the Master Program. Since our aim is to generate more than one channel set between consecutive solutions of the Master Program, it is necessary to revise the λj values before each Subprogram solution without re-solving the Master Program.
- The revision of λj is based on properties that would hold if the Master Program were solved. They are derived from the following Complementary Slackness conditions defined by equation (9):
- The condition of equation (9) is employed to update the λj values of binding cells as follows. A new channel set K, derived from the last Subprogram solution, will receive in the next iteration a portion of the available channels. This implies that if set K covers cell j, cell j will typically not be binding in the next iteration. By equation (9), the corresponding simplex multiplier λj would become zero. Hence, the following revision rule is used:
- The above revision rules deal with the binding cells as they become non-binding. Rules are needed also for the cells that are not binding in the Master Program solution but, as new channel sets are added, may become binding. Such cells should be covered by subsequent channel sets. With λj assigned zero value by equation (9), however, they do not have a chance, unless λj is updated. An alternative way is to communicate to the Subprogram the binding status of a cell by handing over the new channel set sizes Nk . The Subprogram considers the binding status of a cell together with simplex multiplier λj values in deriving a new channel set.
- There are several ways to revise Nk. In this implementation of the algorithm we assume that the new channel set K will receive one Kth of the available channels, while the size of the existing K - 1 channel sets will be adjusted accordingly. That is,
- The algorithm for generating F new channel sets is shown in flow form in FIG. 7.
-
Step 1 - Set λj and Nk equal to the values obtained by solving the Master Program. (Block 701)
- Step 2
- Repeat Steps 3 through 6, F times. (Blocks 702, 713)
- Step 3
- Solve the Subprogram to obtain xkj. (Block 704)
- Step 4
- Revise λj by equation (10). (Block 705)
- Step 5
- Compute NK by equation (11) (Block 709), and revise Nk
for k = 1, ···, K - 1 by equation (12). (Block 711) - Step 6
- Increment K. (Block 711)
- Given the difficulty of pursuing a globally optimal solution method, we have devised an efficient heuristic algorithm for the solution of the Subprogram. It constructs a solution by selecting among the cells in the grid those that will maximize the Subprogram objective value without violating the interference constraints of equation (6). Such a set is constructed by adding one cell at a time, giving priority to the cells with the greatest λj value. A cell can be added to the set if it does not interfere with the cells already in the set. For cells with equal λj values the order in which cells are considered is important because the inclusion of one cell might preempt, through the interference it generates, more cells than another. Preference is given to cells with low pre-emptive potential. The pre-emptive potential would change at each step, as new cells are added to the set. Therefore, the criterion function used for including a cell in the solution is updated after the addition of each cell.
- The algorithm logic can be described as follows. At each step, the cells are partitioned into three subsets. The set C, which consists of the cells included in the solution (i.e., xj = 1); the set
- Among cells with equal λj values, the cell to be moved from U to C is chosen based on its potential to block other members of U from entering C. There are several ways to measure this potential. In the implementation described in this paper we define the pre-emptive potential function pj as the inverse of the "slack" aj in the interference constraint in equation (6), which measures the margin for additional contributions to the interference experienced in cell j.
- The solution of the Subprogram may be expanded to include cells with zero λj. This is necessary in order to deal with the non-binding cells that become binding as more channel sets are generated. In some instances, the inclusion of the largest possible number of cells in the solution of the Subprogram may be desirable for the increased system planning flexibility it affords. Hence, cells may be chosen in order of descending value of the following criterion function fj:
- Given a sufficiently small value for ε, the cells with positive λj values will be given priority. The remaining cells will be considered only when all cells with positively λj have been considered. Among cells with positive and equal λj values, the choice of a cell to be included in set C is based on the pre-emptive potential pj since, according to condition (9), the capacity ratio in the second term of (14) is the same for all such cells -- it equals the grid capacity factor. For cells with zero λj values, the capacity ratio dominates the choice of a cell to be included into C.
- The algorithm for the solution of the Subprogram is shown in flow process form in FIG. 8.
-
Step 1 - Place all cells in set U, and make sets C and
- Step 2
- For each member j of U, compute fj by equation (14). (block 803)
- Step 3
- Select j* to be the member of U with the greatest fj value. (block 805)
Remove j* from U. (block 806) - Step 4
- Compute aj for each member j of C assuming that j* (block 807) is also in C.
- Step 5
- If aj < 0 for any j in C, place j* in
Otherwise, place j* in C (block 811) and go to Step 6. - Step 6
- For each member j of U compute aj. (block 813)
- Step 7
- Remove from U any of its members j with aj < 0 and place them in
- Step 8
- If U is empty, terminate. (block 817) Otherwise, go to Step 2.
- The calculation of the pre-emptive potential pj in the solution of the Subprogram, discussed above, involves the interference constraint slack aj, which measures the margin for additional contributions to the interference experienced in cell j. The slack will vary with the composition of C, the collection of cells covered by the channel set.
- To compute the slack aj we convert the probability statement of equation (6) into an equivalent deterministic constraint for each cell j in U, the collection of undetermined cells. The constraint in equation (6) can be written as follows:
- The values of µY and σY depend on the composition of set C. They are computed using the assumption that the signals of all antenna faces, when expressed in decibels, are independent normally distributed random variables and that the cumulative interference experienced in cell j is also normally distributed, when expressed in decibels [9]. Let
- The process in which unused channels of one cell are borrowed by a cell needing added capacity is illustrated by the flowchart of FIG. 9. The process begins at
terminal 901 and inblock 903 the instructions call for a periodic measurement of traffic distribution. The instructions of theblock 905 replicate the above described computation for computing channel assignment or any other method for computing channel assignments. The occurrence of a channel request on one of the cells as shown inblock 907 may find that cell fully subscribed. Thedecision block 909 determines if there is an available channel from those already assigned to the cell. If there is one, it is assigned to the channel request provided the interference and other system constraints are satisfied. Then, the flow proceeds to block 911 whose instructions assign the call to the free channel and the assignment process ends interminal 919. - If all channels assigned to the cell are busy within the cell, or borrowed by other cells, the flow proceeds to block 913, which determines if there is a free channel, not assigned to the cell, that would meet a all interference, system, and reservation requirements if assigned to the channel request. If there is one, the flow proceeds to block 915, whose instructions assign the call to the free channel and the assignment process ends in
terminal 919. - When a channel becomes available a process, illustrated in FIG. 10, controls the disposal of the borrowed channel. The process begins in
start terminal 951 and inblock 953 which recognizes the termination or handoff of a call. The instructions ofdecision block 955 inquire if the released channel is a borrowed channel. If it is, the flow terminates in theend terminal 961. If it is not, the decision block 957 inquires if there is another call in the cell using a borrowed channel. The flow ends in the absence of such a call. If a borrowed channel is being used, the call on that channel is transferred to the released channel as shown inblock 959. The flow process terminates in theend terminal 961. - The interference constraint checked in channel use and reservation decisions is similar to the interference constraint in equation (6), and its equivalent constraints (15) and (18), but with the following differences. The set C is the replaced by the set C' consisting of the cells actually using the channel when compliance is checked. The confidence level 1 - α is replaced by 1 - α', which would be typically higher. For example, α could be 0.50 while α' would be 0.10. Finally the probability distribution may be conditional on the observed signal strengths of the interfering and serving signals if their values are available. That is, if the observed serving signal strength of a call requesting a channel in cell j is Sj', and the interfering signal strengths are Iij' for i ε C', then the following interference constraint is checked before using the channel in cell j:
- A channel assignment is recomputed when the observed offered loads are significantly higher in some cells so as to cause blocking rates in excess of the target values, based on which the channel assignment was computed. A record of the number of blocked and successful calls (or channel requests) is retained for a time interval, thus obtaining an estimate of the load offered to the cell. If the observed offered load is outside a statistically significant range of the offered load used to compute the channel assignments, the channel assignment optimization is invoked to compute a new channel assignment. Otherwise, the present assignment is maintained
- Channel reservation helps the system approach the optimal channel assignment. A simple example of determining the number of reserved channels in real time would be to make this number reflect the deviation between anticipated and realized offered loads. If there is no change in anticipated offered loads since the last channel assignment calculation, the number of reserved channels plus the number of busy channels owned by a cell would be less than the number of channels assigned to the cell.
Claims (7)
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells:comprising the steps of:determining the available cells and channels;determining serving signal and interference statistics;determining interference and system constraints for the cells;determining existing traffic patterns for the cells;inputting the cells, channels, serving signal and interference statistics, interference and system constraints; existing traffic patterns and blocking requirements for the cells into a computing device;executing a program on the computing device to partition the available radio channels into disjoint sets and to assign such channel sets to the cellsCHARACTERIZED BY:determining if, upon arrival of a new channel request, a cell has exhausted the channels assigned to the cell;determining if there is a free channel, among channels assigned to the cell, that would meet interference and system constraints if assigned to the new channel request given the set of current users of the channel;determining if there is a free channel, among channels not assigned to the cell, that meets interference and system constraints if assigned to the new channel request given the set of current users of the channel;assigning the request to this free channel that meets interference and system constraints;tuning a cell radio to the free channel.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells as claimed in claim 1:comprising the further steps of:employing a higher confidence level (or different parameters in the corresponding deterministic equivalent constraints) when determining compliance with the interference and other system constraints in the channel assignment procedure and upon arrival of a new channel request.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells as claimed in claim 1:comprising the further steps of:determining the portion of assigned channels to be reserved for a cell's own use;inputting the portion of assigned channels to be reserved for a cell's own use into a computing device;determining at the time of a channel request whether the cell to which a channel has been assigned has available the portion of assigned channels reserved for its own use before allowing that channel to be borrowed by other cells.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells as claimed in claim 1:comprising the further steps of:determining in real time the portion of assigned channels to be reserved for a cell's own use as a function of system performance.determining at the time of a channel request whether the cell to which a channel has been assigned has available the portion of assigned channels reserved for its own use before allowing that channel to be borrowed by other cells.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells as claimed in claim 1:comprising the further steps of:determining if a released channel at the termination of a call is other than a borrowed channel; andtransferring an existing call on a borrowed channel to a non-borrowed released channel.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells:comprising the steps of:determining the available cells and channels;determining serving signal and interference statistics;determining interference and system constraints for the cells;determining existing traffic patterns for the cells;inputting the cells, channels, serving signal and interference statistics, interference and system constraints; existing traffic patterns and blocking requirements for the cells into a computing device;executing a program on the computing device to partition the available radio channels into disjoint sets and to assign such channel sets to the cellsCHARACTERIZED BY:estimating from real-time measurements the load offered to the cells, re-computing channel assignments if statistically significant differences are observed, and tuning radios to the new channels.
- In a wireless communications system having service areas partitioned into a plurality of substantially contiguous cells, a method of assigning radio channels to the cells:comprising the steps of:determining the available cells and channels;determining serving signal and interference statistics;determining interference and system constraints for the cells;determining existing traffic patterns for the cells;inputting the cells, channels, serving signal and interference statistics, interference and system constraints; existing traffic patterns and blocking requirements for the cells into a computing device;executing a program on the computing device to partition the available radio channels into disjoint sets and to assign such channel sets to the cellsCHARACTERIZED BY:improving estimates of serving signal and interference statistics through measurements made during the operation of the system.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/401,387 US5956643A (en) | 1994-01-13 | 1995-03-09 | Apparatus and method for adaptive dynamic channel assignment in wireless communication networks |
US401387 | 1995-03-09 |
Publications (2)
Publication Number | Publication Date |
---|---|
EP0731622A2 true EP0731622A2 (en) | 1996-09-11 |
EP0731622A3 EP0731622A3 (en) | 2000-01-19 |
Family
ID=23587548
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP96301299A Withdrawn EP0731622A3 (en) | 1995-03-09 | 1996-02-27 | Apparatus and method for adaptive dynamic channel assignment in wireless communication networks |
Country Status (6)
Country | Link |
---|---|
US (3) | US5956643A (en) |
EP (1) | EP0731622A3 (en) |
JP (1) | JPH08340571A (en) |
AU (1) | AU712252B2 (en) |
CA (1) | CA2166924C (en) |
SG (1) | SG38938A1 (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2318483A (en) * | 1996-10-18 | 1998-04-22 | Motorola Ltd | Dynamic Control of Cellular Radio Communication System Resources |
EP0838964A2 (en) * | 1996-10-25 | 1998-04-29 | AT&T Corp. | Method for self-calibration of a wireless communication system |
WO1998029988A1 (en) * | 1996-12-30 | 1998-07-09 | At & T Corp. | Method and apparatus for providing high speed services using a wireless communications system |
EP0883317A2 (en) * | 1997-06-03 | 1998-12-09 | AT&T Corp. | Analog-to-digital transition selecting the optimal cellular radio mix |
EP0924897A2 (en) * | 1997-12-02 | 1999-06-23 | AT&T Corp. | Dynamic resource allocation for broadband services in a wireless communications system |
WO2000025548A1 (en) * | 1998-10-28 | 2000-05-04 | Qualcomm Incorporated | Method and apparatus for reverse link overload detection |
AU727035B2 (en) * | 1998-03-04 | 2000-11-30 | Samsung Electronics Co., Ltd. | A method for determining the number of effective channels and the effective channel rate in a CDMA network, a method for designing a CDMA network and a CDMA network so designed |
CN100536593C (en) * | 2006-06-23 | 2009-09-02 | 华为技术有限公司 | Optimizing method for distributing small area resource in mobile communication network and its system |
EP2207375A1 (en) * | 2009-01-09 | 2010-07-14 | Alcatel, Lucent | A method for distribution of resources from a pool of resources to cells or sectors of a communication network, a central device and a communication network therefor |
Families Citing this family (119)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5542115A (en) | 1994-06-24 | 1996-07-30 | Pioneer Tech Development Limited | Paging method and apparatus |
US6023459A (en) * | 1996-12-04 | 2000-02-08 | Northern Telecom Limited | Frequency assignment in wireless networks |
FI105867B (en) * | 1997-01-30 | 2000-10-13 | Nokia Networks Oy | Channel assignment in a mobile communication system |
FI107688B (en) * | 1997-02-27 | 2001-09-14 | Nokia Networks Oy | Method for realizing dynamic channel assignment in a cellular radio system |
US6192243B1 (en) * | 1997-05-14 | 2001-02-20 | Nortel Networks Corporation | Method and apparatus for dynamically adjusting number of guard channels in a mobile communication system |
US6055432A (en) * | 1997-08-15 | 2000-04-25 | Lucent Technologies Inc. | Dynamic channel allocation in macrocells with random exclusion for allowing underlaying autonomous microcells |
US6047190A (en) * | 1997-08-15 | 2000-04-04 | Lucent Technologies Inc | Dynamic channel allocation in macrocells with deterministic exclusion for allowing underlaying autonomous microcells |
FI973837A (en) * | 1997-09-29 | 1999-03-30 | Nokia Telecommunications Oy | Allocation of communication resources |
US6061339A (en) * | 1997-12-10 | 2000-05-09 | L-3 Communications Corporation | Fixed wireless loop system having adaptive system capacity based on estimated signal to noise ratio |
US6119011A (en) * | 1998-03-05 | 2000-09-12 | Lucent Technologies Inc. | Cost-function-based dynamic channel assignment for a cellular system |
US6154655A (en) * | 1998-03-05 | 2000-11-28 | Lucent Technologies Inc. | Flexible channel allocation for a cellular system based on a hybrid measurement-based dynamic channel assignment and a reuse-distance criterion algorithm |
US6134442A (en) * | 1998-03-05 | 2000-10-17 | Lucent Technologies Inc. | Controlling operations in a cellular system using neighbor association-based cost values |
US6125280A (en) * | 1998-03-19 | 2000-09-26 | Lucent Technologies Inc. | Automatic neighbor identification in a cellular system |
US6131039A (en) * | 1998-03-20 | 2000-10-10 | Alcatel Usa | Method and system for wireless telecommunications |
US6243584B1 (en) * | 1998-03-30 | 2001-06-05 | Verizon Laboratories Inc. | System and method for increasing CDMA capacity by frequency assignment |
FR2777407B1 (en) * | 1998-04-10 | 2000-06-30 | Wavecom Sa | CELLULAR DOWNLINK CELLULAR RADIOTELEPHONY SIGNAL, METHOD, SYSTEM, MOBILE, AND BASE STATION THEREFOR |
US6539228B1 (en) * | 1998-04-24 | 2003-03-25 | British Telecommunications Public Limited Company | Channel allocation in cellular telephony |
US6381458B1 (en) * | 1998-05-15 | 2002-04-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and system for soft handoff control based on access network capacity |
US6842746B1 (en) * | 1998-05-15 | 2005-01-11 | Nutech Solutions, Inc. | Method and system for operations management |
US6396817B2 (en) * | 1998-08-31 | 2002-05-28 | Qualcomm Incorporated | Signal splitting method for limiting peak power in a CDMA system |
US6253087B1 (en) * | 1998-09-30 | 2001-06-26 | Telefonaktiebolaget Lm Ericsson | Method and system for improved traffic management in wireless telecommunication systems |
US6970709B1 (en) * | 1998-10-15 | 2005-11-29 | Airnet Communications Corporation | Method for dynamic allocation of wireless base station DSP resources |
US6311068B1 (en) | 1998-10-19 | 2001-10-30 | At&T Corp. | Method and apparatus for a high-capacity cellular network by improved sectorization and interleaved channel assignment |
US6546253B1 (en) | 1998-12-30 | 2003-04-08 | At&T Corp. | Neighborhood cordless service call handoff |
US7257404B1 (en) | 1998-12-30 | 2007-08-14 | At&T Corp. | Neighborhood cordless service call handoff |
US7181207B1 (en) | 1998-12-30 | 2007-02-20 | At&T Corp. | Method and apparatus for over-the-air activation of neighborhood cordless-type services |
US6470179B1 (en) | 1998-12-30 | 2002-10-22 | At&T Corp. | Automatic service selection feature for neighborhood residential cordless service |
US6445911B1 (en) | 1998-12-30 | 2002-09-03 | At&T Corp | Method and apparatus for providing neighborhood cordless services |
US6594488B1 (en) | 1998-12-30 | 2003-07-15 | At&T Corp. | Method and apparatus for over-the-air activation of neighborhood cordless-type services |
US6243572B1 (en) | 1998-12-30 | 2001-06-05 | At&T Corp. | Method and apparatus for billing a neighborhood cordless service |
US6654615B1 (en) | 1998-12-31 | 2003-11-25 | Albert Chow | Wireless centrex services |
US6587683B1 (en) | 1998-12-31 | 2003-07-01 | At&T Corp. | Unconditional call forwarding in a wireless centrex services system |
US6738615B1 (en) | 1998-12-31 | 2004-05-18 | At&T Corp. | Wireless centrex caller ID |
US6606493B1 (en) | 1998-12-31 | 2003-08-12 | At&T Corp. | Wireless centrex conference call deleting a party |
US6819945B1 (en) | 1998-12-31 | 2004-11-16 | At&T Corp. | Wireless centrex feature activation/deactivation |
US6535730B1 (en) | 1998-12-31 | 2003-03-18 | At&T Corp. | Wireless centrex conference call adding a party |
US6631258B1 (en) | 1998-12-31 | 2003-10-07 | At&T Corp. | Busy call forwarding in a wireless centrex services system |
US6643507B1 (en) | 1998-12-31 | 2003-11-04 | At&T Corp. | Wireless centrex automatic callback |
US6374102B1 (en) | 1998-12-31 | 2002-04-16 | At+T Corp. | User proactive call handling |
US6574470B1 (en) | 1998-12-31 | 2003-06-03 | At&T Corp. | Programmable ring-call forwarding in a wireless centrex services system |
US6606505B1 (en) | 1998-12-31 | 2003-08-12 | At&T Corp. | Wireless centrex call screen |
US6745025B1 (en) | 1998-12-31 | 2004-06-01 | At&T Corp. | Time-of-day call forwarding in a wireless centrex services system |
US6618600B1 (en) | 1998-12-31 | 2003-09-09 | At&T Corp. | Distinctive ringing in a wireless centrex system |
US6711401B1 (en) | 1998-12-31 | 2004-03-23 | At&T Corp. | Wireless centrex call return |
US6771953B1 (en) | 1998-12-31 | 2004-08-03 | At&T Corp. | Wireless centrex call transfer |
US6654603B1 (en) | 1998-12-31 | 2003-11-25 | At&T Corp. | Call waiting in a wireless centrex system |
US6961559B1 (en) | 1998-12-31 | 2005-11-01 | At&T Corp. | Distributed network voice messaging for wireless centrex telephony |
US6591115B1 (en) | 1998-12-31 | 2003-07-08 | At&T Corp. | Wireless centrex call hold |
JP3212031B2 (en) * | 1999-01-04 | 2001-09-25 | 日本電気株式会社 | Packet transmission control method |
US6615040B1 (en) | 1999-01-22 | 2003-09-02 | At&T Corp. | Self-configurable wireless systems: spectrum monitoring in a layered configuration |
JP3642211B2 (en) * | 1999-02-15 | 2005-04-27 | 日本電気株式会社 | Wireless communication system |
US6374111B1 (en) * | 1999-03-12 | 2002-04-16 | Telefonaktiebolaget Lm Ericsson (Publ) | System and method for robust automatic cell retune |
EP1037484B1 (en) * | 1999-03-15 | 2009-01-14 | Motorola, Inc. | Time sharing of communications resources in cellular communications systems |
US6898431B1 (en) * | 1999-05-24 | 2005-05-24 | Ericsson Inc. | Dynamic channel allocation in a sectored cell of a cellular communication system |
US7373151B1 (en) * | 1999-08-24 | 2008-05-13 | Lucent Technologies Inc. | Distributed dynamic channel allocation technique for multi-carrier CDMA cellular systems with mobile base stations |
SE9902984L (en) * | 1999-08-24 | 2001-02-25 | Ericsson Telefon Ab L M | Method and apparatus relating to a radio communication network |
US6539203B1 (en) * | 1999-11-02 | 2003-03-25 | Lucent Technologies Inc. | Method for determining cellular radio channel assignments to minimize interference due to intermodulation products |
US6470183B1 (en) * | 1999-11-02 | 2002-10-22 | Lucent Technologies Inc. | Apparatus and method for reducing the effects of intermodulation interference in a cellular radio system |
US6603753B1 (en) * | 1999-12-03 | 2003-08-05 | Lucent Technologies Inc. | Down-link transmission inter-cell scheduling in CDMA data networks |
US6639904B1 (en) * | 1999-12-15 | 2003-10-28 | Verizon Laboratories Inc. | Method and system for adapting a channel assignment plan to include shared frequency channels |
US6549781B1 (en) | 1999-12-15 | 2003-04-15 | Verizon Laboratories Inc. | System and methods for rapidly determining CDMA network performance |
US6728544B1 (en) * | 1999-12-15 | 2004-04-27 | Verizon Laboratories Inc. | Methods and techniques in channel assignment in a cellular network |
US6456848B1 (en) * | 1999-12-15 | 2002-09-24 | Verizon Laboratories Inc. | Assigning cellular channels to locked and unlocked cells |
KR100417824B1 (en) * | 1999-12-23 | 2004-02-05 | 엘지전자 주식회사 | A method of dynamic channel allocating for cdma packet data system |
CA2392871C (en) * | 1999-12-30 | 2008-08-26 | British Telecommunications Public Limited Company | Allocation of channels to radio transceivers |
EP1514400B1 (en) | 2000-01-07 | 2018-02-21 | Mitel Communications Inc. | Customer communication service system |
US6940845B2 (en) * | 2000-03-23 | 2005-09-06 | At & T, Corp. | Asymmetric measurement-based dynamic packet assignment system and method for wireless data services |
EP1146760A3 (en) * | 2000-04-11 | 2002-05-08 | ScoreBoard, Inc. | Apparatus and method for adaptive channel allocation in a cellular telephone system |
EP1150441B1 (en) * | 2000-04-25 | 2014-03-26 | Alcatel Lucent | Method and receiver for combining at least two received signals of a telecommunication system |
WO2001084865A1 (en) * | 2000-04-27 | 2001-11-08 | Lgc Wireless, Inc. | Adaptive capacity management in a centralized basestation architecture |
JP3583355B2 (en) * | 2000-07-28 | 2004-11-04 | 松下電器産業株式会社 | Base station apparatus and channel allocation method |
US6925070B2 (en) * | 2000-07-31 | 2005-08-02 | Ipr Licensing, Inc. | Time-slotted data packets with a preamble |
US6795709B2 (en) * | 2001-04-23 | 2004-09-21 | Telcordia Technologies, Inc. | Method and apparatus for dynamic IP address allocation for wireless cells |
US20020177446A1 (en) * | 2001-05-23 | 2002-11-28 | Alex Bugeja | System and method for providing variable transmission bandwidth over communications channels |
US6609238B1 (en) * | 2001-06-15 | 2003-08-19 | Lsi Logic Corporation | Method of control cell placement to minimize connection length and cell delay |
US6792268B1 (en) | 2001-09-07 | 2004-09-14 | At&T Corporation | Method for uplink spectrum monitoring for sparse overlay TDMA systems |
US6965774B1 (en) * | 2001-09-28 | 2005-11-15 | Arraycomm, Inc. | Channel assignments in a wireless communication system having spatial channels including enhancements in anticipation of new subscriber requests |
US6999771B1 (en) * | 2001-09-28 | 2006-02-14 | Arraycomm Llc | Channel assignments in a wireless communication system having spatial channels including grouping existing subscribers in anticipation of a new subscriber |
SE524688C2 (en) * | 2001-12-06 | 2004-09-14 | Ericsson Telefon Ab L M | Method and devices for allocating channel to a mobile station in a radio communication system |
DE60225238T2 (en) * | 2002-01-15 | 2009-05-07 | Koninklijke Kpn N.V. | Method and system for planning and / or estimating cell capacity in CDMA radio networks |
KR100438430B1 (en) * | 2002-01-24 | 2004-07-03 | 삼성전자주식회사 | Apparatus for reordering traffic flow template and method thereof |
US8170197B2 (en) * | 2002-03-15 | 2012-05-01 | Intellisist, Inc. | System and method for providing automated call center post-call processing |
US7292689B2 (en) | 2002-03-15 | 2007-11-06 | Intellisist, Inc. | System and method for providing a message-based communications infrastructure for automated call center operation |
US8068595B2 (en) | 2002-03-15 | 2011-11-29 | Intellisist, Inc. | System and method for providing a multi-modal communications infrastructure for automated call center operation |
US20030188029A1 (en) * | 2002-04-01 | 2003-10-02 | Schema Ltd. | Determining cell service areas in a wireless network |
AU2003215882A1 (en) * | 2002-04-01 | 2003-10-13 | Schema Ltd. | Hybrid channel allocation in a cellular network |
US7236779B2 (en) * | 2002-04-01 | 2007-06-26 | Schema Ltd. | Classification of cellular network drive test results |
US20040203828A1 (en) * | 2002-12-06 | 2004-10-14 | Vinod Mirchandani | Selective channel assignment in a wireless data communications network |
US7693117B2 (en) * | 2002-12-16 | 2010-04-06 | Avaya Inc. | Power-saving mechanism for periodic traffic streams in wireless local-area networks |
US7302278B2 (en) * | 2003-07-03 | 2007-11-27 | Rotani, Inc. | Method and apparatus for high throughput multiple radio sectorized wireless cell |
ES2291601T3 (en) * | 2003-08-11 | 2008-03-01 | Alcatel Lucent | A METHOD FOR THE DYNAMIC ASSIGNMENT OF CODES TO A BASE STATION. |
US8014781B2 (en) * | 2004-06-08 | 2011-09-06 | Qualcomm Incorporated | Intra-cell common reuse for a wireless communications system |
EP1806942A1 (en) * | 2006-01-05 | 2007-07-11 | Alcatel Lucent | Method of semidynamic centralized interference coordination for cellular systems |
EP2475106A1 (en) | 2006-02-28 | 2012-07-11 | Rotani Inc. | Methods and apparatus for overlapping mimo antenna physical sectors |
US8095099B2 (en) * | 2007-03-09 | 2012-01-10 | Bhaskar Patel | Multiple radio receive chain wireless communication devices |
US8948046B2 (en) * | 2007-04-27 | 2015-02-03 | Aerohive Networks, Inc. | Routing method and system for a wireless network |
US8036658B2 (en) * | 2007-05-17 | 2011-10-11 | Arumugam Govindswamy | Method and apparatus to improve network acquisition |
US8243612B2 (en) * | 2007-08-01 | 2012-08-14 | Microsoft Corporation | Dynamic channel-width allocation in wireless networks |
US8218502B1 (en) | 2008-05-14 | 2012-07-10 | Aerohive Networks | Predictive and nomadic roaming of wireless clients across different network subnets |
US8280387B2 (en) * | 2008-05-22 | 2012-10-02 | Ntt Docomo, Inc. | Femtocell channel assignment and power control for improved femtocell coverage and efficient cell search |
US8130708B2 (en) | 2008-08-22 | 2012-03-06 | Telcom Ventures, Llc | Method and system enabling use of white space radio spectrum using an out of band control channel |
US8170577B2 (en) * | 2008-08-22 | 2012-05-01 | Telcom Ventures, Llc | Method and system enabling use of white space radio spectrum using digital broadcast signals |
US9674892B1 (en) | 2008-11-04 | 2017-06-06 | Aerohive Networks, Inc. | Exclusive preshared key authentication |
ATE537670T1 (en) * | 2008-12-23 | 2011-12-15 | Abb Research Ltd | MULTI-NETWORK MANAGER, METHOD AND SYSTEM |
US8483194B1 (en) | 2009-01-21 | 2013-07-09 | Aerohive Networks, Inc. | Airtime-based scheduling |
CN101835166B (en) * | 2009-03-09 | 2012-12-12 | 上海贝尔股份有限公司 | Channel allocation optimization method and channel allocation optimization equipment |
US11115857B2 (en) | 2009-07-10 | 2021-09-07 | Extreme Networks, Inc. | Bandwidth sentinel |
US9900251B1 (en) | 2009-07-10 | 2018-02-20 | Aerohive Networks, Inc. | Bandwidth sentinel |
US8671187B1 (en) | 2010-07-27 | 2014-03-11 | Aerohive Networks, Inc. | Client-independent network supervision application |
US9002277B2 (en) * | 2010-09-07 | 2015-04-07 | Aerohive Networks, Inc. | Distributed channel selection for wireless networks |
CN102098678B (en) * | 2010-12-23 | 2014-04-30 | 长江大学 | Dynamic channel assignment (DCA) method for large-scale mobile cellular communications system |
US10091065B1 (en) | 2011-10-31 | 2018-10-02 | Aerohive Networks, Inc. | Zero configuration networking on a subnetted network |
EP2862301B1 (en) | 2012-06-14 | 2020-12-02 | Extreme Networks, Inc. | Multicast to unicast conversion technique |
US10389650B2 (en) | 2013-03-15 | 2019-08-20 | Aerohive Networks, Inc. | Building and maintaining a network |
US9413772B2 (en) | 2013-03-15 | 2016-08-09 | Aerohive Networks, Inc. | Managing rogue devices through a network backhaul |
US9621313B2 (en) * | 2014-01-23 | 2017-04-11 | Futurewei Technologies, Inc. | Hardware and software methodologies for dynamic resource allocation in virtualized flexible-grid optical networks |
US11611405B2 (en) | 2020-08-11 | 2023-03-21 | Microsoft Technology Licensing, Llc | Efficient spectrum allocation in a multi-node optical network |
CN114584986B (en) * | 2020-12-01 | 2024-04-09 | 中国联合网络通信集团有限公司 | Resource scheduling method and device |
CN112911450B (en) * | 2021-03-08 | 2023-07-25 | 广州安凯微电子股份有限公司 | Channel selection method, device and system of Bluetooth wireless earphone |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4670899A (en) * | 1985-05-31 | 1987-06-02 | Northern Telecom Limited | Load balancing for cellular radiotelephone system |
EP0571133A2 (en) * | 1992-05-22 | 1993-11-24 | AT&T Corp. | Apparatus and method for non-regular channel assignment in wireless communication networks |
US5280630A (en) * | 1992-01-21 | 1994-01-18 | Motorola, Inc. | Method and apparatus for dynamic channel allocation |
WO1994018804A1 (en) * | 1993-02-05 | 1994-08-18 | The Research Foundation Of State University Of New York | Method and apparatus of assigning and sharing channels in a cellular communication system |
WO1994027384A1 (en) * | 1993-05-17 | 1994-11-24 | Telefonaktiebolaget Lm Ericsson | A method and a device for the utilization of channels in a radio communications system |
EP0637895A2 (en) * | 1993-08-02 | 1995-02-08 | Motorola, Inc. | Dynamic reallocation of spectral capacity in cellular communication systems |
EP0684744A2 (en) * | 1994-05-04 | 1995-11-29 | AT&T Corp. | Apparatus and method for dynamic resource allocation in wireless communication networks utilizing ordered borrowing |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3764915A (en) * | 1971-06-25 | 1973-10-09 | Bell Telephone Labor Inc | Dynamic program control for channel assignment in mobile communication systems |
US4965850A (en) * | 1989-01-23 | 1990-10-23 | Schloemer Jerry R | System for and method of assigning frequencies in a communications system with no central control of frequency allocation |
US5127100A (en) * | 1989-04-27 | 1992-06-30 | Motorola, Inc. | Digital radio communication system and two way radio |
JPH02312492A (en) * | 1989-05-29 | 1990-12-27 | Nec Corp | Channel assignment method in mobile communication system and learning system for base station arrangement information |
JP2854346B2 (en) * | 1989-09-19 | 1999-02-03 | 日本電信電話株式会社 | Channel assignment method |
US5023900A (en) * | 1989-12-07 | 1991-06-11 | Tayloe Daniel R | Cellular radiotelephone diagnostic system |
US5134709A (en) * | 1990-12-14 | 1992-07-28 | At&T Bell Laboratories | Process and apparatus for flexible channel assignment in cellular radiotelephone systems |
US5448750A (en) * | 1992-04-22 | 1995-09-05 | Telefonaktiebolaget Lm Ericsson | Segregation method of dynamic channel allocation in a mobile radio system |
AU670955B2 (en) * | 1992-08-04 | 1996-08-08 | Koninklijke Philips Electronics N.V. | Mobile radio system |
CA2113750C (en) * | 1993-04-30 | 1999-08-24 | Hamid Ahmadi | A multiaccess scheme for mobile integrated local area networks |
US5448754A (en) * | 1993-05-07 | 1995-09-05 | Corporate Technology Partners | Radio frequency sharing personal communications system |
-
1995
- 1995-03-09 US US08/401,387 patent/US5956643A/en not_active Expired - Lifetime
-
1996
- 1996-01-10 CA CA002166924A patent/CA2166924C/en not_active Expired - Fee Related
- 1996-02-27 EP EP96301299A patent/EP0731622A3/en not_active Withdrawn
- 1996-03-01 AU AU45865/96A patent/AU712252B2/en not_active Ceased
- 1996-03-08 JP JP8050692A patent/JPH08340571A/en active Pending
- 1996-03-08 SG SG1996006380A patent/SG38938A1/en unknown
- 1996-04-18 US US08/634,320 patent/US5809423A/en not_active Expired - Lifetime
-
1999
- 1999-09-09 US US09/392,602 patent/US6230016B1/en not_active Expired - Fee Related
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4670899A (en) * | 1985-05-31 | 1987-06-02 | Northern Telecom Limited | Load balancing for cellular radiotelephone system |
US5280630A (en) * | 1992-01-21 | 1994-01-18 | Motorola, Inc. | Method and apparatus for dynamic channel allocation |
EP0571133A2 (en) * | 1992-05-22 | 1993-11-24 | AT&T Corp. | Apparatus and method for non-regular channel assignment in wireless communication networks |
WO1994018804A1 (en) * | 1993-02-05 | 1994-08-18 | The Research Foundation Of State University Of New York | Method and apparatus of assigning and sharing channels in a cellular communication system |
WO1994027384A1 (en) * | 1993-05-17 | 1994-11-24 | Telefonaktiebolaget Lm Ericsson | A method and a device for the utilization of channels in a radio communications system |
EP0637895A2 (en) * | 1993-08-02 | 1995-02-08 | Motorola, Inc. | Dynamic reallocation of spectral capacity in cellular communication systems |
EP0684744A2 (en) * | 1994-05-04 | 1995-11-29 | AT&T Corp. | Apparatus and method for dynamic resource allocation in wireless communication networks utilizing ordered borrowing |
Cited By (26)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6496699B2 (en) | 1996-04-18 | 2002-12-17 | At&T Wireless Services, Inc. | Method for self-calibration of a wireless communication system |
US6775549B2 (en) | 1996-04-18 | 2004-08-10 | At&T Wireless Services, Inc. | Method for self-calibration of a wireless communication system |
US6473623B1 (en) | 1996-04-18 | 2002-10-29 | At&T Wireless Services, Inc. | Method for self-calibration of a wireless communication system |
US6442397B1 (en) | 1996-04-18 | 2002-08-27 | At&T Corp. | Method for self-calibration of a wireless communication system |
US6314294B1 (en) | 1996-04-18 | 2001-11-06 | At&T Corp. | Method for self-calibration of a wireless communication system |
GB2318483A (en) * | 1996-10-18 | 1998-04-22 | Motorola Ltd | Dynamic Control of Cellular Radio Communication System Resources |
GB2318483B (en) * | 1996-10-18 | 2001-05-09 | Motorola Ltd | Dynamic control of cellular radio communication system resources |
WO1998018278A1 (en) * | 1996-10-18 | 1998-04-30 | Motorola Limited | Dynamic control of cellular radio communication system resources |
EP0838964A3 (en) * | 1996-10-25 | 1999-07-21 | AT&T Corp. | Method for self-calibration of a wireless communication system |
EP0838964A2 (en) * | 1996-10-25 | 1998-04-29 | AT&T Corp. | Method for self-calibration of a wireless communication system |
EP1152626A2 (en) * | 1996-10-25 | 2001-11-07 | AT&T Corp. | Wireless communication system with adaptive channel allocation |
EP1152551A1 (en) * | 1996-10-25 | 2001-11-07 | AT&T Corp. | Wireless communication system with adaptive channel allocation |
EP1152626A3 (en) * | 1996-10-25 | 2001-11-14 | AT&T Corp. | Wireless communication system with adaptive channel allocation |
US6657982B1 (en) | 1996-12-30 | 2003-12-02 | At&T Corp. | Method and apparatus for providing high speed services using a wireless communications system |
US6069885A (en) * | 1996-12-30 | 2000-05-30 | At&T Corp | Method and apparatus for providing high speed services using a wireless communications system |
WO1998029988A1 (en) * | 1996-12-30 | 1998-07-09 | At & T Corp. | Method and apparatus for providing high speed services using a wireless communications system |
EP0883317A3 (en) * | 1997-06-03 | 2000-02-09 | AT&T Corp. | Analog-to-digital transition selecting the optimal cellular radio mix |
EP0883317A2 (en) * | 1997-06-03 | 1998-12-09 | AT&T Corp. | Analog-to-digital transition selecting the optimal cellular radio mix |
EP0924897A3 (en) * | 1997-12-02 | 2003-10-29 | AT&T Corp. | Dynamic resource allocation for broadband services in a wireless communications system |
EP0924897A2 (en) * | 1997-12-02 | 1999-06-23 | AT&T Corp. | Dynamic resource allocation for broadband services in a wireless communications system |
AU727035B2 (en) * | 1998-03-04 | 2000-11-30 | Samsung Electronics Co., Ltd. | A method for determining the number of effective channels and the effective channel rate in a CDMA network, a method for designing a CDMA network and a CDMA network so designed |
US6603745B1 (en) | 1998-10-28 | 2003-08-05 | Qualcomm Incorporated | Method and apparatus for reverse link overload detection |
WO2000025548A1 (en) * | 1998-10-28 | 2000-05-04 | Qualcomm Incorporated | Method and apparatus for reverse link overload detection |
US7440426B2 (en) | 1998-10-28 | 2008-10-21 | Qualcomm, Incorporated | Method and apparatus for reverse link overload detection |
CN100536593C (en) * | 2006-06-23 | 2009-09-02 | 华为技术有限公司 | Optimizing method for distributing small area resource in mobile communication network and its system |
EP2207375A1 (en) * | 2009-01-09 | 2010-07-14 | Alcatel, Lucent | A method for distribution of resources from a pool of resources to cells or sectors of a communication network, a central device and a communication network therefor |
Also Published As
Publication number | Publication date |
---|---|
US5956643A (en) | 1999-09-21 |
CA2166924A1 (en) | 1996-09-10 |
AU712252B2 (en) | 1999-11-04 |
CA2166924C (en) | 2000-10-24 |
AU4586596A (en) | 1996-09-19 |
US5809423A (en) | 1998-09-15 |
US6230016B1 (en) | 2001-05-08 |
SG38938A1 (en) | 1997-04-17 |
JPH08340571A (en) | 1996-12-24 |
EP0731622A3 (en) | 2000-01-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6230016B1 (en) | Apparatus and method for adaptive-dynamic channel assignment in wireless communication networks | |
EP0571133B1 (en) | Apparatus and method for non-regular channel assignment in wireless communication networks | |
EP1152551B1 (en) | Wireless communications system with adaptive channel allocation | |
KR100331006B1 (en) | Channel dynamic allocation method and wireless communication network | |
JP3283781B2 (en) | System for self-configurable allocation of radio frequency spectrum channels to separate cells | |
Sarkar et al. | Hypergraph models for cellular mobile communication systems | |
US7142523B1 (en) | Methods and apparatus for design, adjustment or operation of wireless networks using pre-frequency-assignment optimization | |
Papavassiliou et al. | Meeting QOS requirements in a cellular network with reuse partitioning | |
US6094584A (en) | Method for operating a wireless telecommunications system | |
Das et al. | A distributed load balancing algorithm for the hot cell problem in cellular mobile networks | |
US6925066B1 (en) | Methods and apparatus for design, adjustment or operation of wireless networks using multi-stage optimization | |
US6859486B1 (en) | Method for predicting interference in a frequency hopping cellular communications system | |
Giortzis et al. | Application of mathematical programming to the fixed channel assignment problem in mobile radio networks | |
CN116232923A (en) | Model training method and device and network traffic prediction method and device | |
Chang et al. | Optimal frame pattern design for a TDMA mobile communication system using a simulated annealing algorithm | |
Wu et al. | Optimized hybrid resource allocation in wireless cellular networks with and without channel reassignment | |
CA2093975C (en) | Apparatus and method for non-regular channel assignment in wireless communication networks | |
Kishi et al. | A unified approach for frequency assignment of cellular mobile networks | |
Cong et al. | Performance analysis of dynamic channel assignment algorithms in cellular mobile systems with hand‐off | |
Kim et al. | A traffic and interference adaptive DCA algorithm with rearrangement in microcellular systems | |
Hortos | Self-organizing feature maps for dynamic control of radio resources in CDMA PCS networks | |
Hortos | Comparison of neural network applications for channel assignment in cellular TDMA networks and dynamically sectored PCS networks | |
Del Re et al. | Hopfield neural networks for dynamic channel allocation in mobile communication systems | |
Shimada et al. | An Approach to Dynamic Channel Assignment in a Cellular Mobile Communication System Using a Neural Network | |
Weng et al. | Performance analysis of dynamic channel assignment in cellular mobile systems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE ES GB IT NL |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Kind code of ref document: A3 Designated state(s): DE ES GB IT NL |
|
17P | Request for examination filed |
Effective date: 20000706 |
|
17Q | First examination report despatched |
Effective date: 20040712 |
|
REG | Reference to a national code |
Ref country code: HK Ref legal event code: WD Ref document number: 1005303 Country of ref document: HK |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20061205 |