CN1124764C - Dynamic channels distribution method in cellular mobile communication system - Google Patents
Dynamic channels distribution method in cellular mobile communication system Download PDFInfo
- Publication number
- CN1124764C CN1124764C CN 99117052 CN99117052A CN1124764C CN 1124764 C CN1124764 C CN 1124764C CN 99117052 CN99117052 CN 99117052 CN 99117052 A CN99117052 A CN 99117052A CN 1124764 C CN1124764 C CN 1124764C
- Authority
- CN
- China
- Prior art keywords
- channel
- sub
- district
- weights
- tract
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000010295 mobile communication Methods 0.000 title claims abstract description 11
- 230000001413 cellular effect Effects 0.000 title abstract 2
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000000903 blocking effect Effects 0.000 claims description 2
- 238000007635 classification algorithm Methods 0.000 abstract 1
- 238000001228 spectrum Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 201000004569 Blindness Diseases 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 238000007596 consolidation process Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000004064 recycling Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a method for distributing dynamic channels in a cellular mobile communication system, which adopts a compact classification algorithm. A whole service district is divided into subdistricts of different classes and corresponding modules according to the multiplexing mode of channels; the weight values of the channels in different subdistricts are ensured; the channels are orderly lined up according to the sizes of the weight values of the channels; an idle channel which is the first in the order of the weight values of the subdistricts in the modules is selected and responded to; when the call is terminated, a user on the channel which is the last in the order of the weight values used by the subdistricts is switched to the channel which is the first in the order of the weight values. By implementing the method of the present invention, the frequency of redistribution of the channels can be reduced, and the calling resistance rate is effectively lowered.
Description
The present invention relates to moving communicating field, relate in particular to the resource allocation techniques in the cell mobile communication systems.
Along with mobile subscriber's rapid increase, the utilance that how to improve existing frequency spectrum resource has become a key of restriction mobile communication development.Taking good channel allocation technique is one of effective measures that solve crowded frequency spectrum resource to improve spectrum efficiency.
Usually, in order to effectively utilize limited available wireless channels resource, mobile communication system has adopted the geography recycling of radio channel, wherein identical radio channel is used at a distance of the base station of certain distance geographically by more than one, rely on this method, can realize the higher availability of frequency spectrum, thereby increase the capacity of system.What yet this channel repeated use distance can not be unlimited is little, because when channel repetition multiplex distance diminishes, produced interference from identical radio channel, therefore the repeated use of same wireless radio channel need be limited in the base station that spatially fully separates each other, with interference-limited in certain tolerable scope.
Under physical condition, realize the reusable method of this radio channel, comprise fixed channel assignment scheme and dynamic channel allocation schemes.Wherein, fixed channel assignment is according to actual measurement or passes through radiobeam spread state and traffic distribution in the service area that Theoretical Calculation obtains, radio channel is distributed to each sub-district regularly, the channel that the calling of certain sub-district can only use this sub-district to predesignate.Be characterized in: method is simple, be convenient to realize, but fails to proceed from the situation as a whole, thereby higher call waiting rate is arranged.Dynamic channel allocation is not that channel is distributed to certain wireless area regularly, but all channel consolidation systems are shared.When certain calls out interim, control centre just selects a suitable channel for its use from all available channels, and the employed number of channel of each wireless area is unfixed, when certain moment, telephone traffic was big, the employed number of channel will be more, otherwise just lack.Obviously if there is not channel reallocation technology, then only when traffic carrying capacity than lower call waiting rate hour is just arranged.A kind of typical, Utopian channel assignment scheme is MP (Maximum Packing) algorithm, its thought is a kind of thought of utilizing global information to optimize, when there is calling certain sub-district, if there is available channel then to be distributed, if do not have, then channel being implemented in all sub-districts heavily distributes, so that for new the calling provides an available channel, although the MP algorithm can reach good performance index, but because the randomness of algorithm must make channel redistribute frequent generation, the great blindness of tool, and amount of calculation is excessive, does not have effective implementation.
The objective of the invention is to overcome the deficiencies in the prior art part, and a kind of frequency that channel is redistributed that reduces is provided, and effectively reduce dynamic channel assignment method in the cellular communication system of optimization of call waiting rate.
The object of the present invention is achieved like this, and the dynamic channel assignment method in a kind of cell mobile communication systems may further comprise the steps:
(1) in the initial setting up of system, whole service area is divided into different classes of sub-district according to the multiplexing of channel pattern; And with the corresponding respective modules that is divided into different classes of sub-district of whole service area; Determine the weights of channel in different districts, but make any one channel in the equal using system in each sub-district, but each channel all there are different weights, for same channel, in similar sub-district, have consistent weights, but weights are different in the inhomogeneity sub-district; Channel is pressed the size order queuing of weights;
(2) in service in system, select in this module this sub-district the most preceding idle channel of weights order to be responded; During end of calling, the user of the channel that the weights order that this sub-district is being used is last switches on the most preceding channel of this weights order.
Dynamic channel assignment method in the cell mobile communication systems of the present invention is by adopting modularization classified compact algorithm, can guarantee that certain sub-district preferentially uses the channel that is using in other similar sub-districts, and make in the similar sub-district, the same degree that channel uses is big as far as possible, thereby reach optimal channel allocation, can reduce the frequency that channel is redistributed, effectively reduce call waiting rate.
Below in conjunction with drawings and Examples, the present invention is described in further detail.
Fig. 1 is the cell classification schematic diagram of an embodiment of the cell mobile communication systems of application the inventive method;
Fig. 2 (a) and (b), (c) are in the system shown in Figure 1, the pairing module diagram in inhomogeneity sub-district;
Fig. 3 is the channel allocation flow chart of the present invention when response is called out.
As shown in Figure 1, in one embodiment of the invention, use the system of the inventive method to be 3-pattern cell mobile communication systems, can use the sub-district of same channel to be called similar sub-district, whole system can be divided into X, Y, Z three class sub-districts.
Among the present invention, the size of the pairing module in different classes of sub-district is the area that radius was surrounded for being the center with this sub-district with people having a common goal's multiplex distance.Shown in Fig. 2 (a) and (b), (c), in the present embodiment, people having a common goal's multiplex distance is made as D=3R, wherein R is the honeycomb radius, then native system can be divided into three generic modules: X generic module, Y generic module, Z generic module.When response was called out, whether only relevant with the channel operating position of this residing module in sub-district the obstruction of calling is.
Suppose that whole coverage has N sub-district, available total number of channels is M, when carrying out channel configuration, at first must satisfy the restrictive condition of given non-interference, these restrictive conditions specified two channels in frequency domain for satisfy acceptable signal interference ratio S/I condition the minimum range that must separate, these distances are placed among the correlation matrix C, and its size is N*N, and the correlation matrix that we considered among the present invention is:
Following formula represents that the minimum interval of distributing to cell i and sub-district j is 1 when distributing to distance between cell i and the sub-district j less than multiplex distance.
We adopt the method for modularization classified compact that system is carried out channel configuration, but make any one channel in the equal using system in every class sub-district, but each channel all has different weights.For same channel, in similar sub-district, have consistent weights, but weights are different in the inhomogeneity sub-district.Need to prove that the number of channel that is using each sub-district in the similar sub-district is not necessarily identical.
Make the quantity of the different channels that is using in the corresponding generic module (X, Y or Z generic module) at N (A) expression A place, sub-district.At first, all available channels of whole coverage are lined up according to available frequency and time slot, its queuing principle is time-slot sequence queuing behind the first frequency, that is to say the channel bank that the channel frequency value corresponding is more little in front, and bigger respective row in the back, in same frequency the less channel bank of corresponding time slot in front, and bigger the putting behind of time slot, the note queue is: C
1, C
1..., C
j..., C
M, wherein j represents the corresponding numbering in the available channel in whole system of certain channel; Then, all available channels are divided into K sequence by service area multiplexer mode K, the length of each sequence is close as far as possible.The channel number of weights minimum in the inhomogeneity sub-district is defined as the starting point of above-mentioned tract respectively, and after this channel increases progressively with the order of channel number in this tract and corresponding channel weights become big successively in certain class sub-district; After tract channel weights distribute end, the order that the weights of channel distribute in such sub-district is: staggeredly successively choose that the channel weights distribute the maximum channel of pairing tract numbering in other class sub-districts, the big more channel of numbering in the tract of correspondence in other class sub-districts, corresponding weights are relatively more little in such sub-district, until all channels of limit.
When M can be divided exactly by K (M=Kn), the specific embodiment that the weights of channel distribute is as follows:
With all available channels of whole coverage according to first frequency after time-slot sequence queuing, and evenly be divided into K part, forms K the tract that length is identical, remember that queue is: C
1, C
2..., C
nC
N+1, C
N+2..., C
2n C
(K-1) n+1, C
(K-1) n+2..., C
KnThe pairing channel number of minimum value of the channel weights of inhomogeneity sub-district is defined as the starting point of above-mentioned tract, i.e. C respectively
1, C
2..., C
(K-1) n+1After this channel increases progressively with the order of channel number in these sub-sequence sections and corresponding channel weights become big successively in certain class sub-district.After tract channel weights distribute end, the order that the weights of channel distribute in such sub-district is: staggeredly successively choose that the channel weights distribute the maximum channel of pairing tract numbering in other class sub-districts, the big more channel of numbering in the tract of correspondence in other class sub-districts, corresponding weights are relatively more little in such sub-district, until all channels of limit.
The size of channel weights is changed from small to big according to the selecting sequence of above-mentioned all channels in such sub-district in certain class sub-district, 1,2 but the size of weights is chosen not exclusively and is determined, following the example of of a kind of practicality is successively weights to be composed according to the selecting sequence of channel in such sub-district to be: ..., Kn.An example as shown in table 1 when being K=3, that the weights of channel distribute:
| Channel number | 1 | ?2 | … | ?n | ?n+1 | … | ?2n | ?2n+1 | … | ?3n-1 | ?3n | |
| Weights | The X class | 1 | ?2 | … | ?n | ?3n | … | ?n+2 | ?3n-1 | … | ?n+3 | ?n+1 |
| The Y class | 3n-1 | ?3n-3 | … | ?n+1 | ?1 | … | ?n | ?3n | … | ?n+4 | ?n+2 | |
| The Z class | 3n | ?3n-2 | … | ?n+2 | ?3n-1 | … | ?n+1 | ?1 | … | ?n-1 | ?n | |
Table 1
Need to prove, in certain class sub-district, the less channel of weights has higher use chance, that is to say as calling out and arrive certain sub-district, the channel that at first distributes low weights to it, have only channel just to be used, could distribute channel than high weight with other callings of sub-district or by the calling of other sub-districts in its place module when low weights.
As shown in Figure 3, when response was called out, the flow process of channel allocation was as follows:
(1) judges whether certain sub-district A exists calling,, then carry out next step if having; If do not have, then jumped to for the 4th step;
(2) if respective modules at research A place, sub-district is N (A)=M, then call blocking; If N (A)＜M then continues;
(3) weights according to all used channels of inhomogeneity sub-district (as above shown in the table) are this call distribution channel from low to high, have only channel just to be used, could distribute channel than high weight with other callings of sub-district or by the calling of other sub-districts in its place module when low weights;
(4) judge that sub-district A has not end of calling, behind the end of calling on the channel that uses less weights, then switch on the channel of less weights of this free time having calling on the channel of maximum weights in this sub-district.
By analysis to this algorithm, can find: whole system is to be made of interlaced one by one inhomogeneity module, available total number of channels is a constant M in each module, as long as the number of channel that this district is using does not reach this extreme value, and satisfy the restrictive condition of non-interference, just can guarantee to call out and can not be obstructed.When being the call distribution channel of certain sub-district, the less channel of weights has stronger use chance, has only the channel when low weights just to be used by certain calling in this module, could distribute the channel than high weight.
Above-mentioned modularization classified compact algorithm can guarantee that certain sub-district preferentially uses the channel that is using in other similar sub-districts, and makes the same degree that channel uses in the similar sub-district big as far as possible, thereby reaches optimal channel allocation.
Claims (5)
1. the dynamic channel assignment method in the cell mobile communication systems is characterized in that, may further comprise the steps:
1) in the initial setting up of system, whole service area is divided into different classes of sub-district according to the multiplexing of channel pattern; And with the corresponding respective modules that is divided into different classes of sub-district of whole service area;
2) determine the weights of channel in different districts, this step process is as follows:
(1) with all available channels of whole coverage according to first frequency after time-slot sequence queuing, the note queue is: C
1, C
2..., C
j..., C
M, wherein j represents the corresponding numbering in the available channel in whole system of certain channel;
(2) counting K by the service area multiplexer mode and be divided into K tract all available channels; The channel number of weights minimum in the inhomogeneity sub-district is defined as the starting point of above-mentioned tract respectively, and after this channel increases progressively with the order of channel number in this tract and corresponding channel weights become big successively in certain class sub-district; After tract channel weights distribute end, the order that the weights of channel distribute in such sub-district is: staggeredly successively choose that the channel weights distribute the maximum channel of pairing tract numbering in other class sub-districts, the big more channel of numbering in the tract of correspondence in other class sub-districts, corresponding weights are relatively more little in such sub-district, until all channels of limit;
3) but make all any one channels in the using system of each sub-district, but each channel all has different weights, for same channel, have consistent weights in similar sub-district, but weights is different in the inhomogeneity sub-district; Channel is pressed the size order queuing of weights;
4) in service in system, select in this module this sub-district the most preceding idle channel of weights order to be responded; During end of calling, the user of the channel that the weights order that this sub-district is being used is last switches on the most preceding channel of this weights order.
2, dynamic channel assignment method according to claim 1 is characterized in that: the respective modules of different classes of sub-district described in the described step 1) be to be the center with certain sub-district, be the area that radius was surrounded with people having a common goal's multiplex distance.
3, dynamic channel assignment method according to claim 1 is characterized in that: the available channel sum M pattern count K that can be re-used is divided exactly in the whole coverage, determines in the described step (2) that the method for the weights of channel in different districts is as follows:
(1) with all available channels of whole coverage according to first frequency after time-slot sequence queuing, and evenly be divided into K part, form K the tract that length is identical, be designated as: C
1, C
2..., C
nC
N+1, C
N+2..., C
2n C
(K-1) n+1, C
(K-1) n+2..., C
Kn
(2) channel number of inhomogeneity sub-district weights minimum is defined as the starting point of above-mentioned tract respectively, i.e. C
1, C
2..., C
(K-1) n+1After this channel increases progressively with the order of channel number in this equal portions tract and corresponding channel weights become big successively in certain class sub-district, after tract channel weights distribute end, the order that the weights of channel distribute in such sub-district is: staggeredly successively choose that the channel weights distribute the maximum channel of pairing tract numbering in other class sub-districts, the big more channel of numbering in the tract of correspondence in other class sub-districts, corresponding weights are relatively more little in such sub-district, until all channels of limit.
4, dynamic channel assignment method according to claim 1 is characterized in that: in the described step (4), when response is called out, carry out channel allocation by following flow process:
(1) judges whether certain sub-district exists calling,, then carry out next step if having; If do not have, then jumped to for the 4th step;
(2) study the respective modules at this place, sub-district, if N (A)=M, then call blocking; If N (A)＜M then continues;
(3) according to the used channel of inhomogeneity sub-district be this call distribution channel by weights, have only channel just to be used with other callings of sub-district or by the calling of other sub-districts in its place module when low weights, could distribute than the channel of weights greatly;
(4) judge that there is not end of calling this sub-district, behind the end of calling on the channel that uses low weights, have calling on the channel of maximum weights in then will distinguishing and switch on the channel of less weights of this free time;
Wherein N (A) represents the quantity of the different channels that using in the corresponding generic module at this place, sub-district, and M represents the total number of channels that system can use.
5, dynamic channel assignment method according to claim 4 is characterized in that: in the described channel allocation process step (3), whether call congestion to be, and is only relevant with the channel operating position of this module, guaranteed by following column matrix:
Promptly when distributing to distance between cell i and the sub-district j less than multiplex distance, the minimum interval of distributing to cell i and sub-district j is 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 99117052 CN1124764C (en) | 1999-08-28 | 1999-08-28 | Dynamic channels distribution method in cellular mobile communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 99117052 CN1124764C (en) | 1999-08-28 | 1999-08-28 | Dynamic channels distribution method in cellular mobile communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1286584A CN1286584A (en) | 2001-03-07 |
| CN1124764C true CN1124764C (en) | 2003-10-15 |
Family
ID=5279699
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 99117052 Expired - Fee Related CN1124764C (en) | 1999-08-28 | 1999-08-28 | Dynamic channels distribution method in cellular mobile communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1124764C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1984493B (en) * | 2006-06-13 | 2010-05-12 | 华为技术有限公司 | Method and system for realtime adjusting channel in mobile telecommunication network |
| CN101047909A (en) * | 2006-06-15 | 2007-10-03 | 华为技术有限公司 | Channel resource allocation method in trunking service and trunking communication system |
| CN101090528A (en) | 2006-06-16 | 2007-12-19 | 华为技术有限公司 | Channel resource allocating method in trunking service and trunking communication system |
| CN101212813B (en) * | 2007-12-25 | 2013-06-05 | 中兴通讯股份有限公司 | Dynamic radio channel management system and method |
| CN102098678B (en) * | 2010-12-23 | 2014-04-30 | 长江大学 | Dynamic channel assignment (DCA) method for large-scale mobile cellular communications system |
-
1999
- 1999-08-28 CN CN 99117052 patent/CN1124764C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1286584A (en) | 2001-03-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Optimal dynamic mobility management for PCS networks | |
| CN1097989C (en) | Method for allocating walsh codes by group in CDMA cellular system | |
| CN1115198A (en) | Channel selection in a cellular communication system | |
| CN1275478C (en) | A wireless resource distribution method for mobile communication system | |
| CN1805588A (en) | Method of allocating cell resources | |
| CN1126410C (en) | Methods of initiating reconfiguring of cell in mobile radio network | |
| CN1124764C (en) | Dynamic channels distribution method in cellular mobile communication system | |
| CN1738228A (en) | Intergroup orthogonal complementary code production method and application system | |
| CN1087131C (en) | Allocating channels in mobile radio system | |
| CN100596032C (en) | Method for allocating multiple basic intermediate codes | |
| CN1223210C (en) | Method for distributing channel code for synchronous up-link of mobile communicaltion system | |
| CN1106775C (en) | Distributing method for reserved channels in mobile radio communication system | |
| Li et al. | Optimal dynamic location update for PCS networks | |
| CN101035353A (en) | Radio resource multiplexing method and allocation method in the radio mobile communication system | |
| CN1188992C (en) | Migration of downlink traffic in GPRS | |
| CN1241345C (en) | Channelizing code resource dynamic optimization distribution method of wideband CDMA system | |
| CN100407600C (en) | Configuration method of cell code source in time-division synchronous CDMA system group network | |
| CN101374031B (en) | Code path integration method and apparatus | |
| CN1633056A (en) | Method of uplink scrambling code distribution in WCDMA system | |
| CN1253028C (en) | Resource integration method suitable for TDD/CDMA system | |
| CN101212766A (en) | Method for load balancing among frequency points in multi-frequency point TD-SCDMA system | |
| CN1159878C (en) | Macrodiversity-based direct retry method for CDMA system | |
| CN103052163A (en) | Channel borrowing method | |
| CN102752812A (en) | Method and device for distributing frequency scrambles | |
| CN1097990C (en) | Fixed channels distribution technique in cellular mobile communication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent for invention or patent application | ||
| CB02 | Change of applicant information |
Applicant after: Huawei Technologies Co., Ltd. Applicant before: Huawei Technology Co., Ltd., Shenzhen City |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: SHENZHEN HUAWEI TECHNOLOGY CO., LTD TO: HUAWEI TECHNOLOGY CO., LTD. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| DD01 | Delivery of document by public notice |
Addressee: Huawei Technology Co Ltd Document name: Notification to Pay the Fees |
|
| DD01 | Delivery of document by public notice |
Addressee: Huawei Technologies Co., Ltd. Document name: Notification of Termination of Patent Right |
|
| DD01 | Delivery of document by public notice | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20031015 Termination date: 20160828 |