CN104869647A - Mobile communication network frequency assignment method based on improved graph coloring - Google Patents

Abstract

The invention discloses a mobile communication network frequency assignment method based on improved graph coloring. The method comprises the following steps: step 1, assignment requirements analysis; step 2, frequency resource acquisition; step 3, compatible matrix calculation; step 4, frequency assignment. By the mobile communication network frequency assignment method, based on characteristics of a fast operation speed and high accuracy of a graph coloring algorithm, an algorithm main body structure adopts the graph coloring algorithm, a tabu search algorithm idea is used and a tabu table is set to avoid a problem of unanswered questions caused by exhaustive search in the graph coloring algorithm, a purpose of increasing algorithm flexibility is achieved.

Description

A kind of mobile radio communication frequency assignment method based on modified model graph coloring

Technical field

The present invention relates to frequency management research field, particularly relate to a kind of mobile radio communication frequency assignment method based on modified model graph coloring.

Background technology

Along with the develop rapidly of wireless communication technology, the demand of various radio traffic to frequency spectrum resource increases rapidly, ten hundreds of communities is had in mobile communication wireless network, each community all comprises some channels that number does not wait, for command transmitting, speech and data, these channels all need assigned frequency.On the one hand due to the open nature in radio propagation space, the radio wave that each transmitting antenna sends can propagate into quite wide spatial dimension; On the other hand, the numerous sending and receiving letter machine in each community operationally between, place with all may be identical or close in frequency, if so improper to the frequency of cell transmitter assignment, just will inevitably produce with frequently, adjacent frequency disturbs, communication quality is degenerated, and power system capacity reduces.

Summary of the invention

Technical problem to be solved by this invention is just to provide a kind of mobile radio communication frequency assignment method based on modified model graph coloring.

The present invention adopts following technical scheme:

Based on a mobile radio communication frequency assignment method for modified model graph coloring, its improvements are, comprise the steps:

Step 1: assignment demand analysis;

Step 2: frequency resource obtains;

Step 3: compatibility matrix calculates;

Step 4: frequency assignment.

Further, described step 1 specifically comprises:

Step 11: extract the community sum in mobile communication system wireless network, suppose that the community in mobile communication system wireless network adds up to N;

Step 12: extract the number of channels needed for each community, the channel number needed for each community: M ₁, M ₂, Λ Λ, M _n, arrange channel requirement vector, it can be expressed as:

FD＝[M ₁,M ₂,L,M _i,L M _N]

Wherein m _ibe represent the channel number needed for the i-th community, i=1,2, Λ Λ, the volume of business that N, Ke Yougai community will be born and required blocking rate are determined.

Step 13: channel state matrix is set;

Define the state that a channel state matrix F SM carrys out each channel in each community of quantificational expression:

$\mathrm{FSM}=\left[\begin{array}{cccc}{\mathrm{FS}}_{11}& {\mathrm{FS}}_{12}& \mathrm{\Λ}& {\mathrm{FS}}_{1M_m}\\ {\mathrm{FS}}_{21}& {\mathrm{FS}}_{22}& \mathrm{\Λ}& {\mathrm{FS}}_{2M_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{I1}& {\mathrm{FS}}_{I2}& \mathrm{\Λ}& {\mathrm{FS}}_{I{M}_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{N1}& {\mathrm{FS}}_{N2}& \mathrm{\Λ}& {\mathrm{FS}}_{N{M}_m}\end{array}\right]$

Wherein, FS _iJrepresent the state of J channel of I community, get the state status that three kinds of dissimilar values represent different channel:

Channel number needed for the respective cell that the number of the I capable zero of FSMatrix matrix should equal this row, all the other are-1, except there is the community of highest channel number, some virtual channels all must be set up in other communities, and could set up a complete channel state matrix, the value of virtual channel state is all-1, in the process of frequency assignment, after a channel has assigned to frequency, the value of this channel should change into the positive integer of non-zero, the sequence number of the frequency of namely having got.

Further, described step 2 specifically comprises:

Step 21, will protect the removal such as frequency, forbidding frequency according to frequency protection plan, frequency control plan etc. in mandate frequency range;

Step 22, removes the frequency that the restriction of each community uses, obtains the basic usable frequency collection in each community;

Step 23, gets common factor by the basic usable frequency collection of each community and the working frequency range of equipment;

Step 24, based on spectrum monitoring data, the high frequency of frequency spectrum occupancy rate and frequency range are removed by region in each community;

Step 25, by each community available frequency band by channel spacing discretization, and numbers frequency with positive integer, and assignment process and assignment result process with frequency sequence number, and restriction relation calculates with concrete frequency, determines each community usable frequency collection.

Further, described step 3 specifically comprises:

Step 31, considers each presence of intercell interference, determines each minizone restriction relation, calculates and generates assignment binding occurrence;

Step 32, considers each community feature, judges that certain waits to assign the noiseless frequency interval of Intra-cell, determines restriction relation in community, generate assignment binding occurrence;

Step 33, intelligent district is interior, minizone binding occurrence, and generate compatibility matrix, compatibility matrix is N*N;

Channel compatibility matrix FCM form is as follows:

$\mathrm{FCM}=\left[\begin{array}{ccccc}{\mathrm{FC}}_{11}& {\mathrm{FC}}_{12}& L& {\mathrm{FC}}_{1J}L& {\mathrm{FC}}_{1N}\\ {\mathrm{FC}}_{21}& {\mathrm{FC}}_{22}& L& {\mathrm{FC}}_{2J}L& {\mathrm{FC}}_{2N}\\ L& L& & ...& L\\ {\mathrm{FC}}_{I1}& {\mathrm{FC}}_{I2}& L& {\mathrm{FC}}_{\mathrm{IJ}}L& {\mathrm{FC}}_{\mathrm{IN}}\\ L& L& & L& L\\ {\mathrm{FC}}_{N1}& {\mathrm{FC}}_{N2}& L& {\mathrm{FC}}_{\mathrm{NJ}}L& {\mathrm{FC}}_{\mathrm{NN}}\end{array}\right]$

Wherein, FC _iJrepresent the channel binding occurrence m of I community and J community _iJ; m _iJvalue determine by calculating the compatible interval of each community channel, be specially:

$\mathrm{FC}\_\mathrm{DD}=\left[\begin{array}{cccccc}|d_1\left(f\right)-d_1\left(q\right)|>m_{11}& |d_1\left(f\right)-d_2\left(q\right)|=0& ...& |d_1\left(f\right)-d_J\left(q\right)|>m_{1J}& ...& |d_1\left(f\right)-d_N\left(q\right)|>m_{1N}\\ |d_2\left(f\right)-d_1\left(q\right)|=0& |d_2\left(f\right)-d_2\left(q\right)|>m_{22}& ...& |d_2\left(f\right)-d_J\left(q\right)|>m_{2J}& ...& |d_2\left(f\right)-d_N\left(q\right)|>m_{2N}\\ ...& ...& ...& ...& & ...\\ |d_I\left(f\right)-d_1\left(q\right)|>m_{I1}& |d_I\left(f\right)-d_2\left(q\right)|>m_{I2}& ...& |d_I\left(f\right)-d_J\left(q\right)|>m_{\mathrm{IJ}}& ...& |d_I\left(f\right)-d_N\left(q\right)|>m_{\mathrm{IN}}\\ ...& ...& & ...& & ...\\ |d_N\left(f\right)-d_1\left(q\right)|>m_{N1}& |d_N\left(f\right)-d_2\left(q\right)|>m_{N2}& ...& |d_N\left(f\right)-d_J\left(q\right)|>m_{\mathrm{NJ}}& ...& |d_N\left(f\right)-d_N\left(q\right)|>m_{\mathrm{NN}}\end{array}\right]$

Wherein, between each channel | d ₁(f)-d ₁(q) | > m ₁₁represent that each channel spacing of inside, community 1 should be greater than m ₁₁, | d ₁(f)-d _j(q) | > m _1Jrepresent and ensure that community 1 and the glitch-free minimum frequency space of community J should be greater than m _1J, | d ₁(f)-d ₂(q) |=0 represents that community 1 and community 2 can use the optional frequency of its usable frequency collection respectively and not produce interference.

Further, described step 31 specifically comprises:

Step 311, judges that certain two are treated whether assignment minizone exists with frequently, adjacent frequency interference; If so, then jump procedure 312, otherwise jump procedure 313;

Step 312, calculates each minizone without the minimum frequency space with frequency, adjacent frequency interference, this interval is set to the binding occurrence of these two inter-cell frequency assignments;

Step 313, is set to 0 by the assignment binding occurrence of these two minizones;

Step 314, repeats the assignment binding occurrence that said process calculates any two minizones.

Further, described step 4 specifically comprises:

To each community, step 41, treats that allocated channel carries out difficulty sequence;

The summation of the element that definition FCM matrix I is capable

${\mathrm{DD}}_I=\underset{J=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{FC}}_{\mathrm{IJ}},I=\mathrm{1,2},\mathrm{\Λ\Λ},M$

As the parallel compensate degree-of-difficulty factor of I community channel;

Step 42, successively decreases order to each channel allocation frequency by difficulty, and the frequency-selecting strategy of each channel is for selecting maximum channelized frequencies or selecting lowest usable frequency;

Step 43, judges whether current assignment channel blocks, and value record of if so, then breaking a contract, at taboo list, if not, then jumps to step 44;

Step 44, judges whether each channel completes assignment, if so, then jumps to step 45, if not, then jumps to 42;

Step 45, judges whether to exist and blocks channel, if so, then jump to step 46, if not, then complete assignment process;

Step 46, blocks channel allocation.

Further, described step 46 specifically comprises:

Step 461, carries out difficulty sequence to the channel correlation blocking channel;

Step 462, successively decreases by difficulty and sequentially carries out frequency adjustment to the channel correlation that difficulty is maximum, and the strategy of adjustment, for concentrate all backup frequencies to calculate successively usable frequency, is selected promise breaking to be worth minimum frequency and adjusted;

Step 463, judges institute adjusts whether meet restriction relation; If so, jumping to 466 by meeting the frequency assignment of restriction relation to blocking channel, completing and blocking channel frequency assignment; If not, jump to 464 and will break a contract value record at taboo list;

Step 464, by the promise breaking value record of this frequency range assigned frequency at taboo list;

Step 465, judges whether channel correlation quantity is 0, if not, then jumps to step 462 and carries out next channel correlation and carry out frequency adjustment; If not, then frequency assignment corresponding for minimum promise breaking value given this channel and block channel;

Step 466, will meet the frequency assignment of restriction relation to blocking channel;

Step 467, gives frequency assignment corresponding for minimum promise breaking value and blocks channel, complete frequency assignment.

Beneficial effect of the present invention is:

Mobile radio communication frequency assignment method disclosed in this invention, fast based on the graph coloring algorithm speed of service, the feature that accuracy rate is high, algorithm agent structure adopts graph coloring algorithm, and with regard to the exhaustive search that graph coloring algorithm may run into cause without solution problem, utilize the thought of tabu search algorithm, this defect is evaded by arranging taboo list, reach the object of boosting algorithm flexibility, empirical tests, this modified model graph coloring frequency assignment algorithm efficiently can complete mobile radio communication frequency assignment fast, clear up conflicting with frequency in each minizone of mobile communication wireless network and community, ensure that each community is used frequently in order, the frequency planning that can be mobile communication wireless network provides good technical support.By assigning appropriate frequency to each community in whole wireless network, make numerous sending and receiving letter machines compatible each other, various mutual interference reduces to permissible scope, various communication equipments in thousands upon thousands user and network are linked together, forms orderly, an effective mobile radio communication.

Accompanying drawing explanation

Fig. 1 is the flow chart of mobile radio communication frequency assignment method disclosed in this invention;

Fig. 2 is the flow chart of mobile radio communication frequency assignment method step 1 disclosed in this invention;

Fig. 3 is the flow chart of mobile radio communication frequency assignment method step 2 disclosed in this invention;

Fig. 4 is the flow chart of mobile radio communication frequency assignment method step 3 disclosed in this invention;

Fig. 5 is the flow chart of mobile radio communication frequency assignment method step 31 disclosed in this invention;

Fig. 6 is the flow chart of mobile radio communication frequency assignment method step 4 disclosed in this invention;

Fig. 7 is the flow chart of mobile radio communication frequency assignment method step 46 disclosed in this invention.

Embodiment

In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with embodiment, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.

Embodiment 1, suppose somewhere mobile communication wireless Cellular Networks cell capacity and channel plan data as follows:

Suppose that the community in mobile communication system wireless network adds up to: N=36;

Channel requirement vector FD is:

FD＝[3,6,4,5,2,1,4,3,1,6,3,4,5,3,3,1,5,1,2,6,4,5,2,1,4,2,1,6,3,4,5,3,3,1,6,1]；

As shown in Figure 1, the mobile radio communication frequency assignment method based on modified model graph coloring disclosed in the present embodiment, comprises the steps:

Step 1: assignment demand analysis;

Step 2: frequency resource obtains;

Step 3: compatibility matrix calculates;

Step 4: frequency assignment.

As shown in Figure 2, step 1 specifically comprises:

Step 11: extract the community sum in mobile communication system wireless network;

Suppose that the community in mobile communication system wireless network adds up to N;

Step 12: extract the number of channels needed for each community, arranges channel requirement vector;

Channel number needed for each community: M ₁, M ₂, Λ Λ, M _n, wherein M _ifor the channel number needed for i-th community; If the sum of channel needed for all communities of whole wireless network, namely in wireless network, channel number is L, then we are known, so above data should be the volume of business forecaste and plans deriving from mobile communication system.Geographical environment residing for cellular cell is different, and the telephone traffic required by each community is different.So the channel number required by each community is unequal.Definition channel requirement vector FD expresses the channel number needed for each community, and it can be expressed as:

FD＝[M ₁,M ₂,L,M _i,L M _N]

Wherein M _ibe represent the channel number needed for the i-th community, i=1,2, Λ Λ, the volume of business that N, Ke Yougai community will be born and required blocking rate are determined.

Step 13: channel state matrix is set;

Define the state that a channel state matrix F SM carrys out each channel in each community of quantificational expression.In the assignment process based on graph coloring algorithm, for the frequency resource of assignment in minimizing, can obtain the channel of frequency in increase.Channel state matrix can express this dynamic process in mathematical terms.

Definition channel state matrix F SM is:

$\mathrm{FSM}=\left[\begin{array}{cccc}{\mathrm{FS}}_{11}& {\mathrm{FS}}_{12}& \mathrm{\Λ}& {\mathrm{FS}}_{1M_m}\\ {\mathrm{FS}}_{21}& {\mathrm{FS}}_{22}& \mathrm{\Λ}& {\mathrm{FS}}_{2M_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{I1}& {\mathrm{FS}}_{I2}& \mathrm{\Λ}& {\mathrm{FS}}_{I{M}_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{N1}& {\mathrm{FS}}_{N2}& \mathrm{\Λ}& {\mathrm{FS}}_{N{M}_m}\end{array}\right]$

Wherein, FSM entry of a matrix element FS _iJrepresent the state of J channel of I community, the state of channel can be got three kinds of dissimilar values and be represented different situations:

Channel number needed for the respective cell that the number of the I capable zero of FSM matrix should equal this row, all the other are-1.Except having the community of highest channel number, some virtual channels all must be set up in other communities, and could set up a complete channel state matrix, the value of virtual channel state is all-1.In the process of frequency assignment, after a channel has assigned to frequency, the value of this channel should change into the positive integer of non-zero, the sequence number of the frequency of namely having got.

As shown in Figure 3, described step 2 specifically comprises:

It is in the frequency range of authorizing that frequency resource obtains, and considers spectrum management policy, frequency protection information, frequency control information, Monitoring Data etc. and anticipates frequency spectrum resource, reject disabled frequency spectrum resource, improve frequency spectrum resource utilization ratio.The source of information comprises: frequency, frequency spectrum policy information, spectrum monitoring information, equipment working frequency range etc. are authorized by higher level department.Analytic process is as follows:

Step 21, will protect the removal such as frequency, forbidding frequency according to frequency protection plan, frequency control plan etc. in mandate frequency range;

Step 22, removes the frequency that the restriction of each community uses, obtains the basic usable frequency collection in each community;

Step 23, gets common factor by the basic usable frequency collection of each community and the working frequency range of equipment;

Step 24, based on spectrum monitoring data, the high frequency of frequency spectrum occupancy rate and frequency range are removed by region in each community;

Step 25, by each community available frequency band by channel spacing discretization, and numbers frequency with positive integer, and assignment process and assignment result process with frequency sequence number, and restriction relation calculates with concrete frequency, determines each community usable frequency collection.

As shown in Figure 4, to each element of step 3 compatibility matrix, whether whether same community, adjacent cell, non-adjacent community by, can provide with multiplexing and other restrictive condition frequently, also can be determined by the result of interference calculation.Be specifically described as follows:

Step 31, considers each presence of intercell interference, determines each minizone restriction relation, calculates and generates assignment binding occurrence;

Step 32, considers each community feature, judges that certain waits to assign the noiseless frequency interval of Intra-cell, determines restriction relation in community, generate assignment binding occurrence;

Step 33, intelligent district is interior, minizone binding occurrence, generates compatibility matrix, N × N;

Channel compatibility matrix FCM form is as follows:

$\mathrm{FCM}=\left[\begin{array}{ccccc}{\mathrm{FC}}_{11}& {\mathrm{FC}}_{12}& L& {\mathrm{FC}}_{1J}L& {\mathrm{FC}}_{1N}\\ {\mathrm{FC}}_{21}& {\mathrm{FC}}_{22}& L& {\mathrm{FC}}_{2J}L& {\mathrm{FC}}_{2N}\\ L& L& & ...& L\\ {\mathrm{FC}}_{I1}& {\mathrm{FC}}_{I2}& L& {\mathrm{FC}}_{\mathrm{IJ}}L& {\mathrm{FC}}_{\mathrm{IN}}\\ L& L& & L& L\\ {\mathrm{FC}}_{N1}& {\mathrm{FC}}_{N2}& L& {\mathrm{FC}}_{\mathrm{NJ}}L& {\mathrm{FC}}_{\mathrm{NN}}\end{array}\right]$

Wherein, FC _iJrepresent the channel binding occurrence m of I community and J community _iJ;

M _iJvalue determine by calculating the compatible interval of each community channel, be specifically expressed as follows;

$\mathrm{FC}\_\mathrm{DD}=\left[\begin{array}{cccccc}|d_1\left(f\right)-d_1\left(q\right)|>m_{11}& |d_1\left(f\right)-d_2\left(q\right)|=0& ...& |d_1\left(f\right)-d_J\left(q\right)|>m_{1J}& ...& |d_1\left(f\right)-d_N\left(q\right)|>m_{1N}\\ |d_2\left(f\right)-d_1\left(q\right)|=0& |d_2\left(f\right)-d_2\left(q\right)|>m_{22}& ...& |d_2\left(f\right)-d_J\left(q\right)|>m_{2J}& ...& |d_2\left(f\right)-d_N\left(q\right)|>m_{2N}\\ ...& ...& ...& ...& & ...\\ |d_I\left(f\right)-d_1\left(q\right)|>m_{I1}& |d_I\left(f\right)-d_2\left(q\right)|>m_{I2}& ...& |d_I\left(f\right)-d_J\left(q\right)|>m_{\mathrm{IJ}}& ...& |d_I\left(f\right)-d_N\left(q\right)|>m_{\mathrm{IN}}\\ ...& ...& & ...& & ...\\ |d_N\left(f\right)-d_1\left(q\right)|>m_{N1}& |d_N\left(f\right)-d_2\left(q\right)|>m_{N2}& ...& |d_N\left(f\right)-d_J\left(q\right)|>m_{\mathrm{NJ}}& ...& |d_N\left(f\right)-d_N\left(q\right)|>m_{\mathrm{NN}}\end{array}\right]$

Wherein, between each channel | d ₁(f)-d ₁(q) | > m ₁₁represent that each channel spacing of inside, community 1 should be greater than m ₁₁, | d ₁(f)-d _j(q) | > m _1Jrepresent and ensure that community 1 and the glitch-free minimum frequency space of community J should be greater than m _1J, | d ₁(f)-d ₂(q) |=0 represents that community 1 and community 2 can use the optional frequency of its usable frequency collection respectively and not produce interference, and all the other are similar, describe no longer one by one.

As shown in Figure 5, step 31 is specifically described as follows:

Step 311, judges that certain two are treated whether assignment minizone exists with frequently, adjacent frequency interference; If so, then jump procedure 312, otherwise jump procedure 313;

Step 312, calculates each minizone without the minimum frequency space with frequency, adjacent frequency interference, this interval is set to the binding occurrence of these two inter-cell frequency assignments;

Step 313, is set to 0 by the assignment binding occurrence of these two minizones;

Step 314, repeats the assignment binding occurrence that said process calculates any two minizones;

As shown in Figure 6, described step 4 is specifically described as follows:

Juche idea based on the frequency assignment algorithm of graph coloring sorts being assigned object by difficulty, then carries out frequency assignment from high to low by difficulty.But may occur in assignment process because can not find and allocated channel or the glitch-free usable frequency of original frequency, algorithm will be caused without solution, and this situation is referred to as this channel and blocks.In order to the adaptability of boosting algorithm, by the taboo list introducing tabu search algorithm, algorithm is improved, find and the channel correlation blocking channel Constrained relation, the channel of obstruction and corresponding each correlated frequency binding occurrence thereof are put into taboo list, and channel correlation is sorted from high to low by difficulty, restriction relation more component difficulty is larger.Then first frequency adjustment is carried out to the channel correlation that difficulty is maximum, again to obstruction channel allocation frequency after adjustment, and judge whether it meets constraints, if not interference, result is exported and namely completes assignment process, otherwise record the promise breaking value of this frequency, next channel relevant to taboo list mid band again carries out frequency adjustment, by that analogy until find glitch-free frequency.If all channel correlations have all carried out adjusting also not finding suitable frequency, just promise breaking is worth minimum frequency assignment to blocking channel.

To each community, step 41, treats that allocated channel carries out difficulty sequence;

Difficulty sequence refers to and utilizes the restriction relation value of channel compatibility matrix the frequency assignment difficulty of each channel to be expressed quantitatively, channel compatibility matrix element FC _iJvalue, when it gets higher value, the frequency resource can selected for this channel (I channel) is just fewer; When it gets smaller value, the frequency resource can selected for it will be more.So define the summation of the capable element of FCM matrix I

${\mathrm{DD}}_I=\underset{J=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{FC}}_{\mathrm{IJ}},I=\mathrm{1,2},\mathrm{\Λ\Λ},M$

As the parallel compensate degree-of-difficulty factor of I community channel, obviously, DD _ilarger, more difficult to I community channel allocation frequency, vice versa.

Step 42, successively decreases order to each channel allocation frequency by difficulty;

In assignment process, successively decrease according to channel sequencing difficulty, difficult at first and quite easy afterwards, channel bank large for frequency assignment difficulty at first assigned frequency above; Otherwise, come back, rear assigned frequency.

The frequency-selecting strategy of each channel is: one selects maximum channelized frequencies, and another kind selects lowest usable frequency.The basic goal of these two criterions is exactly farthest retain residual frequency, and uses high-quality frequency (lowest usable frequency).

Step 43, judges whether current assignment channel blocks, and value record of if so, then breaking a contract, at taboo list, if not, then jumps to step 44;

Step 44, judges whether each channel completes assignment, if so, then jumps to step 45, if not, then jumps to 42;

Step 45, judges whether to exist and blocks channel, if so, then jump to step 46, if not, then complete assignment process;

Step 46, blocks channel allocation.

As shown in Figure 7, described step 46 specifically comprises:

Step 461, carries out difficulty sequence to the channel correlation blocking channel;

Step 462, successively decreases by difficulty and sequentially carries out frequency adjustment to the channel correlation that difficulty is maximum;

The strategy of adjustment, for concentrate all backup frequencies to calculate successively usable frequency, is selected promise breaking to be worth minimum frequency and is adjusted.

Step 463, judges institute adjusts whether meet restriction relation; If so, jumping to D66 by meeting the frequency assignment of restriction relation to blocking channel, completing and blocking channel frequency assignment; If not, jump to D64 and will break a contract value record at taboo list;

Step 464, by the promise breaking value record of this frequency range assigned frequency at taboo list;

Step 465, judges whether channel correlation quantity is 0, if not, then jumps to step D62 and carries out next channel correlation and carry out frequency adjustment; If not, then frequency assignment corresponding for minimum promise breaking value given this channel and block channel;

Step 466, will meet the frequency assignment of restriction relation to blocking channel;

Step 467, gives frequency assignment corresponding for minimum promise breaking value and blocks channel, complete frequency assignment.

Table 1 gives the result of algorithm described in this patent to each community assigned frequency in a Cellular Networks, the result of assignment is expressed as respectively with the frequency assignment chart that community sequence number and demand number/channel number are sequence, in this table, station number is the numbering representing base station in wireless network, and frequency refers to the sequence number of the frequency of having got.This net is made up of 43 base stations, 120 channels, and some communities require assignment frequency, and what have then requires three frequencies or six frequencies etc.Altogether only used 17 known frequency assignments just achieving the whole network for assigned frequency, channeling efficiency is very high.The result assigned by table medium frequency, we can find out, at least there are between frequency in same community 3 channel spacings, at least there are between the frequency of neighbor cell 2 channel spacings, within frequency reuse distance non-equal community and non-adjacent community frequency between at least there is 1 channel spacing, ensure that the interference between wireless network internal wireless channel is effectively controlled.

Table 1 Wireless network frequency assignment result

Station number	Demand number/frequency	Station number	Demand number/frequency	Station number	Demand number/frequency
						1	3/89；111；79	21	5/85；79；111；104；89	31	4/104；85；97；111
2	6/91；102；87；76；97；84	22	3/107；102；91	32	2/82；104
						3	4/111；94；102；109	23	3/94；82；76	33	1/76
4	5/104；85；91；100；107	24	1/87	34	6/99；91；87；79；94；102
						5	2/79；87	25	5/102；79；107；99；84	35	3/94；82；76
6	1/89	26	1/82	36	4/97；85；104；107
						7	4/85；99；109；76	27	2/91；76	37	5/79；89；111；84；76
8	3/82；102；94	28	6/102；111；99；85；94；79	38	3/99；109；87
						9	1/87	29	4/89；109；79；107	39	3/91；82；102

10	6/87；91；111；102；94；99	30	5/102；99；84；111；104	40	1/97
						11	3/109；91；85	31	2/82；76	41	6/82；87；94；107；79；104
12	4/76；102；82；107	32	1/87	42	1/111

Claims (7)

1., based on a mobile radio communication frequency assignment method for modified model graph coloring, it is characterized in that, comprise the steps:

Step 1: assignment demand analysis;

Step 2: frequency resource obtains;

Step 3: compatibility matrix calculates;

Step 4: frequency assignment.

2. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 1, it is characterized in that, described step 1 specifically comprises:

Step 11: extract the community sum in mobile communication system wireless network, suppose that the community in mobile communication system wireless network adds up to N;

Step 12: extract the number of channels needed for each community, the channel number needed for each community: M ₁, M ₂, Λ Λ, M _n, arrange channel requirement vector, it can be expressed as:

FD＝[M ₁,M ₂,L,M _i,L M _N]

Wherein m _ibe represent the channel number needed for the i-th community, i=1,2, Λ Λ, the volume of business that N, Ke Yougai community will be born and required blocking rate are determined.

Step 13: channel state matrix is set;

Define the state that a channel state matrix F SM carrys out each channel in each community of quantificational expression:

$\mathrm{FSM}=\left[\begin{array}{cccc}{\mathrm{FS}}_{11}& {\mathrm{FS}}_{12}& \mathrm{\Λ}& {\mathrm{FS}}_{{1M}_m}\\ {\mathrm{FS}}_{21}& {\mathrm{FS}}_{22}& \mathrm{\Λ}& {\mathrm{FS}}_{{2M}_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{I1}& {\mathrm{FS}}_{I2}& \mathrm{\Λ}& S_{{\mathrm{IM}}_m}\\ \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}& \mathrm{\Λ}\\ {\mathrm{FS}}_{N1}& {\mathrm{FS}}_{N2}& \mathrm{\Λ}& {\mathrm{FS}}_{{\mathrm{NM}}_m}\end{array}\right]$

Wherein, FS _iJrepresent the state of J channel of I community, get the state status that three kinds of dissimilar values represent different channel:

Channel number needed for the respective cell that the number of the I capable zero of FSM matrix should equal this row, all the other are-1, except there is the community of highest channel number, some virtual channels all must be set up in other communities, and could set up a complete channel state matrix, the value of virtual channel state is all-1, in the process of frequency assignment, after a channel has assigned to frequency, the value of this channel should change into the positive integer of non-zero, the sequence number of the frequency of namely having got.

3. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 1, it is characterized in that, described step 2 specifically comprises:

Step 21, will protect the removal such as frequency, forbidding frequency according to frequency protection plan, frequency control plan etc. in mandate frequency range;

Step 22, removes the frequency that the restriction of each community uses, obtains the basic usable frequency collection in each community;

Step 23, gets common factor by the basic usable frequency collection of each community and the working frequency range of equipment;

Step 24, based on spectrum monitoring data, the high frequency of frequency spectrum occupancy rate and frequency range are removed by region in each community;

Step 25, by each community available frequency band by channel spacing discretization, and numbers frequency with positive integer, and assignment process and assignment result process with frequency sequence number, and restriction relation calculates with concrete frequency, determines each community usable frequency collection.

4. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 1, it is characterized in that, described step 3 specifically comprises:

Step 31, considers each presence of intercell interference, determines each minizone restriction relation, calculates and generates assignment binding occurrence;

Step 32, considers each community feature, judges that certain waits to assign the noiseless frequency interval of Intra-cell, determines restriction relation in community, generate assignment binding occurrence;

Step 33, intelligent district is interior, minizone binding occurrence, and generate compatibility matrix, compatibility matrix is N × N;

Channel compatibility matrix FCM form is as follows:

$\mathrm{FCM}=\left[\begin{array}{ccccc}{\mathrm{FC}}_{11}& {\mathrm{FC}}_{12}& L& {\mathrm{FC}}_{1,J}L& {\mathrm{FC}}_{1N}\\ {\mathrm{FC}}_{21}& {\mathrm{FC}}_{22}& L& {\mathrm{FC}}_{2,J}L& {\mathrm{FC}}_{2N}\\ L& L& & ...& L\\ {\mathrm{FC}}_{I1}& {\mathrm{FC}}_{I2}& L& {\mathrm{FC}}_{\mathrm{IJ}}L& {\mathrm{FC}}_{\mathrm{IN}}\\ L& L& L& L& L\\ {\mathrm{FC}}_{N1}& {\mathrm{FC}}_{N2}& L& {\mathrm{FC}}_{\mathrm{NJ}}L& {\mathrm{FC}}_{\mathrm{NN}}\end{array}\right]$

Wherein, FC _iJrepresent the channel binding occurrence m of I community and J community _iJ; m _iJvalue determine by calculating the compatible interval of each community channel, be specially:

$\mathrm{FC}\_\mathrm{DD}=\left[\begin{array}{cccccc}|d_1\left(f\right)-d_1\left(q\right)|>m_{11}& |d_1\left(f\right)-d_2\left(q\right)|=0& ...& |d_1\left(f\right)-d_J\left(q\right)|>m_{1J}& ...& |d_1\left(f\right)-d_N\left(q\right)|>m_{1N}\\ |d_2\left(f\right)-d_1\left(q\right)|=0& |d_2\left(f\right)-d_2\left(q\right)|>m_{22}& ...& |d_2\left(f\right)-d_J\left(q\right)|>m_{2J}& ...& |d_2\left(f\right)-d_N\left(q\right)|>m_{2N}\\ ...& ...& ...& ...& ...& ...\\ |d_I\left(f\right)-d_1\left(q\right)|m_{I1}& |d_I\left(f\right)-d_2\left(q\right)|>m_{I2}& ...& |d_I\left(f\right)-d_J\left(q\right)|>m_{\mathrm{IJ}}& ...& |d_I\left(f\right)-d_N\left(q\right)|>m_{\mathrm{IN}}\\ ...& ...& & ...& ...& ...\\ |d_N\left(f\right)-d_1\left(q\right)|>m_{N1}& |d_N\left(f\right)-d_2\left(q\right)|>m_{N2}& ...& |d_N\left(f\right)-d_J\left(q\right)|>m_{\mathrm{NJ}}& ...& |d_N\left(f\right)-d_N\left(q\right)|>m_{\mathrm{NN}}\end{array}\right]$

Wherein, between each channel | d ₁(f)-d ₁(q) | > m ₁₁represent that each channel spacing of inside, community 1 should be greater than m ₁₁, | d ₁(f)-d _j(q) | > m _1Jrepresent and ensure that community 1 and the glitch-free minimum frequency space of community J should be greater than m _1J, | d ₁(f)-d ₂(q) |=0 represents that community 1 and community 2 can use the optional frequency of its usable frequency collection respectively and not produce interference.

5. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 4, it is characterized in that, described step 31 specifically comprises:

Step 311, judges that certain two are treated whether assignment minizone exists with frequently, adjacent frequency interference; If so, then jump procedure 312, otherwise jump procedure 313;

Step 312, calculates each minizone without the minimum frequency space with frequency, adjacent frequency interference, this interval is set to the binding occurrence of these two inter-cell frequency assignments;

Step 313, is set to 0 by the assignment binding occurrence of these two minizones;

Step 314, repeats the assignment binding occurrence that said process calculates any two minizones.

6. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 1, it is characterized in that, described step 4 specifically comprises:

To each community, step 41, treats that allocated channel carries out difficulty sequence;

The summation of the element that definition FCM matrix I is capable

${\mathrm{DD}}_I=\underset{J=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{FC}}_{\mathrm{IJ}},I=\mathrm{1,2},\mathrm{\Λ\Λ},M$

As the parallel compensate degree-of-difficulty factor of I community channel;

Step 42, successively decreases order to each channel allocation frequency by difficulty, and the frequency-selecting strategy of each channel is for selecting maximum channelized frequencies or selecting lowest usable frequency;

Step 43, judges whether current assignment channel blocks, and value record of if so, then breaking a contract, at taboo list, if not, then jumps to step 44;

Step 44, judges whether each channel completes assignment, if so, then jumps to step 45, if not, then jumps to 42;

Step 45, judges whether to exist and blocks channel, if so, then jump to step 46, if not, then complete assignment process;

Step 46, blocks channel allocation.

7. the mobile radio communication frequency assignment method based on modified model graph coloring according to claim 6, it is characterized in that, described step 46 specifically comprises:

Step 461, carries out difficulty sequence to the channel correlation blocking channel;

Step 462, successively decreases by difficulty and sequentially carries out frequency adjustment to the channel correlation that difficulty is maximum, and the strategy of adjustment, for concentrate all backup frequencies to calculate successively usable frequency, is selected promise breaking to be worth minimum frequency and adjusted;

Step 463, judges institute adjusts whether meet restriction relation; If so, jumping to 466 by meeting the frequency assignment of restriction relation to blocking channel, completing and blocking channel frequency assignment; If not, jump to 464 and will break a contract value record at taboo list;

Step 464, by the promise breaking value record of this frequency range assigned frequency at taboo list;

Step 465, judges whether channel correlation quantity is 0, if not, then jumps to step 462 and carries out next channel correlation and carry out frequency adjustment; If not, then frequency assignment corresponding for minimum promise breaking value given this channel and block channel;

Step 466, will meet the frequency assignment of restriction relation to blocking channel;

Step 467, gives frequency assignment corresponding for minimum promise breaking value and blocks channel, complete frequency assignment.