CN1741667A - Dynamic channel switching-in method based on useable channel searching - Google Patents
Dynamic channel switching-in method based on useable channel searching Download PDFInfo
- Publication number
- CN1741667A CN1741667A CN 200510086293 CN200510086293A CN1741667A CN 1741667 A CN1741667 A CN 1741667A CN 200510086293 CN200510086293 CN 200510086293 CN 200510086293 A CN200510086293 A CN 200510086293A CN 1741667 A CN1741667 A CN 1741667A
- Authority
- CN
- China
- Prior art keywords
- channel
- travelling carriage
- request
- search
- communication quality
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 174
- 230000006854 communication Effects 0.000 claims description 100
- 238000004891 communication Methods 0.000 claims description 95
- 238000001514 detection method Methods 0.000 claims description 17
- 230000008859 change Effects 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 15
- 238000013441 quality evaluation Methods 0.000 claims description 11
- 238000007689 inspection Methods 0.000 claims description 10
- 238000011156 evaluation Methods 0.000 claims description 6
- 238000010295 mobile communication Methods 0.000 claims description 4
- 230000004044 response Effects 0.000 claims description 3
- 230000001419 dependent effect Effects 0.000 claims description 2
- 230000003247 decreasing effect Effects 0.000 abstract 1
- 238000005562 fading Methods 0.000 description 16
- 230000006870 function Effects 0.000 description 8
- 230000001413 cellular effect Effects 0.000 description 7
- 230000000903 blocking effect Effects 0.000 description 5
- 238000004088 simulation Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000002474 experimental method Methods 0.000 description 4
- 230000009897 systematic effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 230000009467 reduction Effects 0.000 description 2
- 206010057855 Hypotelorism of orbit Diseases 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
A method for wiring in dynamic channel based on usable channel search includes detecting wire - in of all non-idle channel when channel is distributed and confirming those channel being able to be used by movable table for requesting channel , limiting search in range of usable channel sets when channel search is carried out to avoid that searched out channel can not be used by movable table for decreasing switch - over failure sum in system at unit time so as to increase user volume actually supported by system.
Description
Technical field
The present invention relates to the channel access method in the wireless communication system.Present invention is specifically related to and in DWCS, be used to reduce channel handoff failure total amount, the distributed dynamic channel cut-in method of raising system user capacity.
Background technology
Modern society increases significantly to the demand of radio communication.Yet the utilizable frequency resource of wireless communication system is but very limited, and how making full use of these resources just becomes a major issue in the wireless communication system to keep best power system capacity.In the network of conventional cellular cell structure, the channel of same frequency or time slot can be reused by the sub-district of wide apart usually, thereby makes limited frequency resource can be repeated, effectively use.The current method for channel allocation that is used to improve channel utilization comprises static channel allocation (Fixed Channel Allocation, FCA) algorithm and dynamic channel allocation (DynamicChannel Allocation, DCA) algorithm two big classes.Though these methods have all improved the service efficiency of channel to a certain extent, but when number of users increases sharply, the effective method that increases power system capacity remains the size that reduces cellular cell, thereby makes same channel can be repeated to use in shorter distance.But the reducing of cellular cell size will cause handover quantity significantly to increase, thereby can not obtain the also easier generation of dropped calls that new channel causes during owing to handover.From user's angle, an ongoing conversation is stopped by force more to be difficult to stand than preparing to obtain service when making a phone call.Therefore, how the channel handoff failure probability in the how reduction system supports that under certain channel number more user finishes complete communication process, will be the key issue of required care in the following mobile radio system.
In method for channel allocation,, just this channel allocation can be used to the user, and be need not to carry out any access control in case search out after the channel according to certain search rule based on cellular cell.This is because the space segmentation of channel has guaranteed the establishment of channel multiplexing condition.Yet (Distributed Wireless CommunicationSystem in DWCS, DWCS), the cellular cell structure is broken, be that the virtual subdistrict notion at center replaced with the base station with the travelling carriage be the notion of the conventional cell at center, each travelling carriage has corresponding virtual subdistrict, and virtual subdistrict is made up of with antenna mobile communications current.Travelling carriage will be simultaneously communicates with some antennas of diverse location.When travelling carriage was transferred to another area from an area, virtual subdistrict also can change accordingly.Therefore, with the antenna be the center also just no longer be suitable for system's characteristics of DWCS based on the channel allocation algorithm of cellular cell.And when the dynamic channel allocation algorithm that adopts based on whole system,, therefore after searching a channel, can not guarantee whether this channel satisfies multiplexing condition in whole system according to certain optimal rules because channel can use.So before channel allocation is used to the user, need insert detection, to determine whether the user can use this channel to this channel.
At application number is 200510011384.8, the applying date is on March 4th, 2005, name be called mentioned in the Chinese invention patent application based on the dynamic channel allocation of channel search farthest and using method a kind of based on the dynamic channel allocation and the using method of channel search farthest, this method is by reducing the channel switching times of entire system, the handoff failure number of times of reduction system, thus system user capacity improved.The channel allocation of said method has adopted following flow process: earlier obtain a channel according to certain optimal rules search, and then channel is inserted detection, this channel allocation is used to the user determining whether.If inserting the result who detects is that the user can use this channel, then system uses channel allocation to the user; If inserting the result who detects is that the user can not use this channel, then user's channel request will be interrupted in system, and at this moment, user's new calling will get clogged or ongoing conversation will be interrupted.Though the system complexity of the channel allocation flow process of searching for earlier, detecting is low, but, just because of in search channel and do not know that the user whether channel can be applied channel uses, so the channel that search obtains might be the out of use channel of user, thereby has limited the raising of system user capacity to a certain extent.The present invention proposes in order to overcome above-mentioned shortcoming.
The present invention is based on Two dimensional Distribution formula wireless communication system, a kind of brand-new dynamic channel cut-in method has been proposed, promptly based on the dynamic channel cut-in method of available channel search (Dynamic Channel Access-Search Available Channels, DCA-SAC).Than the dynamic channel allocation algorithm that adopts search earlier, detects again, as based on the dynamic channel allocation and the using method of channel search farthest, this method can effectively reduce the total handoff failure number of times of new probability of call blocking of system and system, the user capacity that the raising system can support.
Summary of the invention
The purpose of this invention is to provide a kind of dynamic channel cut-in method that is used for DWCS.This is a kind of dynamic channel cut-in method based on whole system, and according to this channel access method, a travelling carriage will can not cause that channel switches owing to the change of the change of position or the antenna of communicating by letter with it.Switching will only occur in two hypotelorisms between the travelling carriage that uses same channels, to such an extent as to the interference between the cochannel is excessive, and the situation that the channel communication quality between travelling carriage and the virtual subdistrict can not meet the demands.Because the stochastic behaviour that moves, use same channel travelling carriage since motion separately make between distance can not avoid fully less than the situation of channel multiplexing distance.The channel multiplexing distance is meant when two or more travelling carriages use same channel, in order to satisfy the requirement of channel communication quality, their needed minimum ranges each other.Utilize this new method, the travelling carriage of request channel at first inserted detection to each the bar channel in the system before carrying out channel search, and in all channels, select all available channels, and form set of available channels, select the most suitable channel in the set of available channels kind then.Because channel search only carries out in set of available channels, therefore as long as set of available channels is not an empty set, travelling carriage finally can obtain channel.The qualification of this just channel search scope makes that the total handoff failure number of times of new call blocking rate and system is significantly descended, and system user capacity is improved.
The channel access method main purpose that the present invention proposes is by limiting the scope of channel search, thereby and select suitable channel search method to reduce new call blocking rate and total handoff failure number of times, this method will comprise " channel allocation " and " switch and check " two methods.
Wherein " channel allocation " method will be applied to this situation of travelling carriage request channel, the function that this process will be finished is: each bar channel is inserted detection, determine whether travelling carriage can use, and all available channels are formed set of available channels; It in set of available channels only channel of travelling carriage search of request channel.
Travelling carriage at request channel and by successful allocated channel after, will use assigned channel to communicate.Because travelling carriage mobile has randomness, use the relative position between a plurality of travelling carriages of same channel to change along with moving of each travelling carriage.Therefore be necessary periodically each just to be detected at the communication quality of the employed channel of mobile stations communicating.So that determine that whether travelling carriage is because the deterioration of channel communication quality need be switched current channel.This process is realized by " switching check " method.
In DWCS, processing node is dispersed in the system and by fiber optic network and is connected, each node is carried out some functions in the wireless communication system, several processing nodes are combined, form a distributed treatment groups of nodes, can finish function such as signal of base station processing and wireless transmission management in the conventional cellular cell system.In DWCS, each travelling carriage all has corresponding distributed treatment groups of nodes.Therefore, the channel allocation of each travelling carriage and switching check are all carried out by the pairing distributed treatment groups of nodes of travelling carriage, the distributed treatment groups of nodes of travelling carriage by and the distributed treatment groups of nodes of other travelling carriage between information interaction obtain the relevant information of other travelling carriage, use information, channel quality information, location of mobile station information etc. such as channel, thereby finish channel allocation and switch each step of check.
Dynamic channel cut-in method based on the available channel search of the present invention is characterized in that it contains following each step successively:
Step (1): the travelling carriage with request channel serves as to distribute object, and the channel that each bar in the system is being used inserts detection, is that travelling carriage can use this channel if insert the result who detects, and is available channel with this channel tag then; If inserting the result who detects is that travelling carriage can not use this channel, is unavailable channel with this channel tag then;
Step (2): all available channels are formed set of available channels,, then change step (4) if set of available channels is an empty set; If the set of available channels non-NULL is then carried out next step;
Step (3): according to predefined channel search method, in set of available channels, seek the most suitable channel, and use to the travelling carriage of request channel this channel allocation, finish channel allocation simultaneously, execution in step (5) for travelling carriage;
Step (4): search whether there is idle channel in the system,, then in idle channel, choose any channel allocation and give travelling carriage, finish channel allocation simultaneously, execution in step (5) if exist; Otherwise the refusal channel request finishes channel allocation, execution in step (11) simultaneously;
Step (5): judged whether to arrive the switching interval of setting Check-Out Time, if arrive, switched check, execution in step (7); If do not arrive execution in step (6);
Step (6): judge whether travelling carriage will finish current communication, if, execution in step (11); Otherwise, execution in step (5);
Step (7): whether the virtual subdistrict of checking travelling carriage overlaps with the virtual subdistrict of other travelling carriage that uses same channel, if overlap, system will determine whether this travelling carriage needs to change its current channel so, if travelling carriage need change current channel, execution in step (10); Otherwise, execution in step (8);
Step (8): obtain the signal communication quality evaluation index between each antenna in travelling carriage and the virtual subdistrict;
Step (9): according to the pairing signal communication quality evaluation index of each antenna in the virtual subdistrict, utilize the channel communication quality evaluating method, judge whether the channel communication quality satisfies the communication quality requirement, if, travelling carriage can continue to use current channel, finish to switch checkout procedure, execution in step (6) simultaneously; Otherwise execution next step;
Step (10): interrupt the communication of this travelling carriage on current channel, travelling carriage proposes the channel allocation application, finishes to switch checkout procedure simultaneously; Behind the channel request of system responses travelling carriage, carry out channel allocation, execution in step (1);
Step (11): travelling carriage terminates in the communication on the current channel, logs off simultaneously;
Each travelling carriage has the virtual subdistrict of oneself, and virtual subdistrict is made up of with one or more antennas mobile communications current, and virtual subdistrict constantly changes with the motion of travelling carriage;
Described signal quality estimation index is meant the signal-to-jamming ratio of the uplink signal that antenna end receives;
Step (1) has been described method for channel allocation to step (4), and step (7) has been described the switching method of inspection to step (10).
Access detection method of the present invention is characterized in that, it contains following steps successively:
Step (1): for the channel that inserts detection, check the travelling carriage that all are using this channel, if wherein the virtual subdistrict of any one travelling carriage overlaps with the virtual subdistrict of the travelling carriage of request channel, then the result of record access detection is that travelling carriage can not use this channel, and finishes to insert and detect; Otherwise carry out next step;
Step (2): this channel of the of short duration use of travelling carriage that makes request channel, signal communication quality evaluation index in the travelling carriage of acquisition request channel and the virtual subdistrict between each antenna, and, check whether the travelling carriage of request channel can satisfy the communication quality requirement of channel on this channel according to the channel communication quality evaluating method; If can not, then record inserts the result who detects and can not use this channel for travelling carriage, and finishes to insert and detect; Otherwise carry out next step;
Step (3): for each normal travelling carriage that uses this channel, obtain the signal communication quality evaluation index between each antenna in this travelling carriage and the corresponding virtual sub-district, and according to the channel communication quality evaluating method, check when the travelling carriage of request channel inserts this channel whether the travelling carriage of original normal this channel of use can also satisfy the communication quality requirement of channel on channel; If the travelling carriage of each normal this channel of use all satisfies the communication quality requirement of channel in inspection, then record inserts the result who detects and can use this channel for travelling carriage, and finishes access and detect; If there is any one travelling carriage not satisfy the communication quality requirement of channel in checking process, then record inserts the result who detects and can not use this channel for travelling carriage, and finishes to insert and detect.
Channel communication quality evaluating method of the present invention is characterized in that it contains following steps successively
Set a signal-to-jamming ratio thresholding, the mode that merges according to high specific merges the received uplink signal of each antenna in the corresponding virtual subdistrict of travelling carriage, obtain the resultant signal interference ratio after high specific merges at last, the resultant signal interference ratio is the summation of the signal-to-jamming ratio of each uplink signal, resultant signal interference ratio and signal-to-jamming ratio thresholding are compared, if the resultant signal interference ratio is greater than the signal-to-jamming ratio thresholding, then the channel quality comprehensive evaluation result is that channel can use; If the resultant signal interference ratio is less than the signal-to-jamming ratio thresholding, then the channel quality comprehensive evaluation result is that channel cannot use.
One of channel search method of the present invention is characterized in that, it contains following steps successively:
Step (1): to each the bar channel in the set of available channels, traversal is used all travelling carriages of this channel, therefrom finds out the shortest travelling carriage of travelling carriage distance with request channel, and the travelling carriage that all distances are the shortest is formed a new set;
Step (2): the travelling carriage set that the traversal previous step obtains suddenly, therefrom find out travelling carriage travelling carriage farthest apart from request channel, the employed channel of this travelling carriage is the channel search result;
Because the virtual subdistrict of each travelling carriage is made up of a plurality of antennas, therefore can tentatively obtain the approximate range at this travelling carriage place by the position of a plurality of antennas in the virtual subdistrict, on this basis, can further determine the particular location of travelling carriage by the direction of arrival that the received travelling carriage of a plurality of antennas transmits; This channel search method is called the channel search method of channel farthest of searching for.
Two of channel search method of the present invention is characterized in that, it contains following steps successively:
Step (1): each the bar channel in the set of available channels, calculate its channel utilization, the computing formula of channel utilization is:
Wherein i is the numbering of channel, and summation is the mobile station MS that all is used channel i
jCarry out, k represents mobile station MS
jShared weight in statistics is a positive integer, the value of k and mobile station MS
jAnd the mutual distance dependent between the travelling carriage of request channel, the distance between the travelling carriage is big more, and then k is more little, distance between the travelling carriage is more little, then k is big more, and the value of k satisfies following provisions: suppose to use the travelling carriage of channel i to have M (M is a limited positive integer) individual, be labeled as MS respectively
1, MS
2MS
M, the distance between the travelling carriage of each travelling carriage and request channel is d
1, d
2D
M, and satisfy d
1≤ d
2≤ ... d
M, then have-∞＜k
M≤ ... ≤ k
2≤ k
1＜+∞;
Step (2): in set of available channels, find out the channel of channel utilization maximum: if there is the channel utilization of a plurality of channels identical and all be maximum, then that all channel utilizations are identical and all be that maximum channel is formed the alternative subclass of available channel, and execution in step (3), otherwise use to the travelling carriage of request channel the channel allocation of channel utilization maximum:
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the highest channel search method of search utilance.
Three of channel search method of the present invention is characterized in that, it contains following steps successively:
Step (1): each the bar channel in the set of available channels, calculate its channel distance metric, the computing formula of channel distance metric is:
Wherein i is the numbering of channel, and summation is the mobile station MS that all is used channel i
jCarry out D
UpBe a constant, need meet the following conditions:
D
M0, MSjThe mobile station MS of expression request channel
0With the mobile station MS that uses channel i
jBetween distance;
Step (2): in set of available channels, find out the channel of channel distance metric maximum; If there is the channel distance metric of a plurality of channels identical and all be maximum, then that all channel distance metrics are identical and all be that maximum channel is formed the alternative subclass of available channel, and execution in step (3), otherwise use to the travelling carriage of request channel the channel allocation of channel distance metric maximum;
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the channel search method of search maximum channel distance metric.
Four of channel search method of the present invention is characterized in that, it contains following steps successively:
Step (1): to each the bar channel in the set of available channels, calculate its channel signal interference ratio tolerance, the computing formula of channel signal interference ratio tolerance is:
Wherein i is the numbering of channel, and the summation of back is the mobile station MS that all is used channel i
jCarry out, wherein, SIR
UpBe a constant, need meet the following conditions:
SIR
I, MS0The mobile station MS of expression request channel
0The channel communication quality that on channel i, is obtained, SIR
I, MSiThe level ground friend. the travelling carriage of expression request channel is mobile station MS when using channel i also
jThe channel communication quality that on channel i, is obtained:
Step (2): in set of available channels, find out the maximum channel of channel signal interference ratio tolerance: if there is the channel signal interference ratio tolerance of a plurality of channels identical and all be maximum, then that all channel signal interference ratios tolerance is identical and all be the maximum alternative subclass of channel composition available channel, and execution in step (3), otherwise the channel allocation that channel signal interference ratio tolerance is maximum uses for the travelling carriage of request channel:
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the channel search method of the maximum signal interference ratio tolerance of search.
Dynamic channel cut-in method based on the available channel search has used MicrosoftVisual C++6.0 platform to realize on the type microcomputer of Pentium 4.
The performance of the dynamic channel cut-in method that proposes in order to verify, and for the characteristics that show this method with respect to carrying out the advantage that channel search then inserts the method for channel allocation of detection earlier, we have carried out following experiment and comparison.
It is 200510011384.8 that application number is adopted in control methods, name be called mention in the Chinese invention patent application based on the dynamic channel allocation of channel search farthest and using method based on the dynamic channel allocation and the using method of channel search farthest.For based on the dynamic channel allocation and the using method of channel search farthest, we adopt channel communication quality evaluating method of the present invention that channel quality is estimated in emulation, adopting following method for channel allocation is that the travelling carriage of request channel carries out channel search and distribution: step (1): to each the bar channel in the channel search set, traversal is used all travelling carriages of this channel, therefrom finds out and the Shen
The shortest travelling carriage of travelling carriage distance that please channel, the travelling carriage that all distances are the shortest is formed a new set; Step (2): the travelling carriage set that the traversal previous step obtains suddenly, therefrom find out travelling carriage travelling carriage farthest apart from request channel,
The employed channel of this travelling carriage promptly becomes the channel to be allocated of the travelling carriage of request channel.Step (3): check the travelling carriage that all use channel to be allocated, if the wherein virtual subdistrict of any one travelling carriage and application
The virtual subdistrict of the travelling carriage of channel overlaps, and then jumps to step (5), otherwise carries out next step;
Step (4): make the of short duration use of the travelling carriage channel to be allocated of request channel, check whether the travelling carriage of request channel can satisfy the communication quality requirement of channel on channel to be allocated.Check simultaneously whether the travelling carriage of all normal uses channel to be allocated satisfies the communication quality requirement of channel on this channel.If involved travelling carriage all satisfies the communication quality requirement of channel in the above inspection, then channel allocation to be allocated is given the travelling carriage of request channel; If have any one travelling carriage in checking process, not satisfy the communication quality requirement of channel, then jump to step (5);
Step (5): search whether idle channel is arranged in the system.If have, then in idle channel, choose any channel allocation and give travelling carriage; Otherwise, the refusal channel request.
The method of this configuration is called DCA-SFUC (Dynamic ChannelAlgorithm-Search Farthest Used Channel) method for short in above-mentioned patent application.In above-mentioned patent application, the performance that this method is only comprised in fading environment under the environment of path fading has been carried out emulation.
For the dynamic channel cut-in method based on the available channel search, we have adopted multiple channel search method proposed by the invention to imitate pin.First method is to search for the channel search method of channel farthest.Second method is search utilance the highest channel search method, and we are expressed as the piecewise function of phase mutual edge distance with k in emulation, and the phase mutual edge distance makes k=1 more than or equal to 600m between travelling carriage; And work as the phase mutual edge distance less than 600m, during simultaneously more than or equal to 300m, make k=2; When phase mutual edge distance during, make k=3 less than 300m.The third method is the channel search method of search maximum channel distance metric, and we set D in emulation
Up=1700m.The 4th kind of channel search method that method is measured for the maximum signal interference ratio of search, we set SIR in emulation
Up=200.
Simulation model: emulation is carried out in a two-dimentional system that has 169 antennas, and system as shown in Figure 9.Antenna is according to square arrangement.No matter adopt based on the dynamic channel allocation of channel search farthest and using method and still adopt dynamic channel cut-in method based on the available channel search, the size of all setting virtual subdistrict is 4, therefore, travelling carriage synchronization only and four antennas communicate.When above-mentioned setting to the virtual subdistrict size will guarantee to adopt different dynamic channel cut-in methods in system, the communication quality that intrasystem travelling carriage obtained was identical, thereby guarantees fairness relatively.In experimental system, travelling carriage moving direction in initial the generation will produce at random, travelling carriage will be done rectilinear motion subsequently, when travelling carriage moves to system boundary, to be turned back by mirror image, change the direction of motion, and continue moving linearly, so there is not travelling carriage to enter or leave system by the border according to new direction.
Table 1 experiment parameter is set
| Motion velocity of mobile station | 10m/s |
| Adjacent two antenna distances | 100m |
| Total number of channels order in the system | 90 |
| The signal-to-jamming ratio thresholding | 35dB |
| Each travelling carriage passes through time span | 180s |
| The path attenuation index | 3.5 |
| The shadow fading variance | 8dB |
| New calls (average user load in the little square of unit) in the average each second system | 8/s (10Erlangs) |
The experiment parameter that table 1 has provided in the contrast experiment to be adopted, the path fading model that is adopted during emulation is L=d
-λ, λ represents the path attenuation index.At application number is 200510011384.8, name is called in the Chinese invention patent application based on the dynamic channel allocation of channel search farthest and using method, we are in the performance simulation based on the dynamic channel allocation of channel search farthest and using method that is proposed, the fading environment that is adopted only contains path fading, and do not comprise shadow fading, and in the performance simulation of the present invention to related algorithm, fading environment will comprise path fading and shadow fading simultaneously.Because the adding of shadow fading, make system performance degradation; We are 200510011384.8 at application number, name is called in the Chinese invention patent application and the present invention based on the dynamic channel allocation of channel search farthest and using method, all the DCA-SFUC method has been carried out performance simulation, the result shows that the DCA-SFUC method comprises performance in the environment of shadow fading and path fading in fading environment and will be worse than performance in the environment that fading environment only comprises path fading.
Simulation result:
When table 2 had shown employing different channels distribution method, the average channel in the each second system was switched travelling carriage average call failure total degree and the complete conversation ratio that average channel handoff failure total degree, each second make a call in the system in total degree, the each second system.Complete conversation ratio is meant that the travelling carriage of finishing complete conversation in a period of time accounts for the percentage of the travelling carriage that makes a call, and this index has been indicated when adopting certain channel allocation algorithm, the system user capacity of the actual support of this algorithm institute.
By table 2 as can be seen, than the dynamic channel allocation and the using method of channel search farthest, can reduce the channel handoff failure number of times of entire system greatly based on the dynamic channel cut-in method of available channel search, reduce new probability of call blocking, improve system user capacity; Its cost is that overhead increases (system's switching times increases in the unit interval) and the mobile communications quality descends.
In table 2, DCA-SAC1 represents to adopt the channel search method of channel farthest of searching for based on the channel search method in the dynamic channel cut-in method of available channel search; DCA-SAC2 represents to adopt the highest channel search method of search utilance based on the channel search method in the dynamic channel cut-in method of available channel search; DCA-SAC3 represents to adopt based on the channel search method in the dynamic channel cut-in method of available channel search the channel search method of search maximum channel distance metric; DCA-SAC4 represents to adopt based on the channel search method in the dynamic channel cut-in method of available channel search the channel search method of the maximum signal interference ratio tolerance of search.
The systematic function of table 2 different channels distribution method relatively
| Each second the channel switching times | Each second the handoff failure number of times | New probability of call blocking | Finish the conversation ratio | The average signal interference ratio of travelling carriage (dB) | |
| DCA-SFUC | 26.290 | 2.668 | 0.0473 | 0.6186 | 68.8267 |
| DCA-SAC1 | 44.079 | 1.474 | 0.00494 | 0.8102 | 60.0886 |
| DCA-SAC2 | 121.692 | 0.435 | 0.00181 | 0.9435 | 50.6265 |
| DCA-SAC3 | 116.472 | 0.484 | 0.00209 | 0.9364 | 51.2961 |
| DCA-SAC4 | 117.886 | 0.471 | 0.00207 | 0.9382 | 51.1862 |
Description of drawings
Fig. 1 is the DWCS schematic diagram;
Fig. 2 is the method for channel allocation process flow diagram;
Fig. 3 is for switching method of inspection process flow diagram;
Fig. 4 searches for the channel search procedure flow chart of channel farthest;
Fig. 5 is the highest channel search procedure flow chart of search utilance;
Fig. 6 is the channel search procedure flow chart of search maximum channel distance metric;
Fig. 7 is the channel search procedure flow chart of the maximum signal interference ratio tolerance of search;
Fig. 8 is the channel access method overview flow chart;
Fig. 9 is the two-dimentional system model of 169 antennas;
Figure 10 one dimension example system schematic diagram.
Embodiment
A) overall procedure of the method for the invention
In system, when a Mobile Origination was called out or prepared call accepted, system just carried out the dynamic channel cut-in method of searching for based on available channel for it.When one of following two kinds of situations occurring, system will stop to carry out this method:
A. travelling carriage initiatively requires to finish current communication, abandons the channel of current use simultaneously;
B. travelling carriage does not obtain channel in channel allocation, and system forces travelling carriage to finish current communication, ends travelling carriage simultaneously and uses current channel.
For each travelling carriage, comprise following steps based on the overall procedure of the dynamic channel cut-in method of available channel search:
Step (1): according to method for channel allocation, for the travelling carriage of request channel is sought channel.If find operable suitable channel, travelling carriage uses this channel to communicate, execution in step (2); Otherwise, if travelling carriage fails to obtain channel, execution in step (5);
Step (2): judged whether to arrive the switching interval of setting Check-Out Time, if arrive, execution in step (4); If do not arrive execution in step (3);
Step (3): judge whether travelling carriage will finish current communication, if, execution in step (5); Otherwise, execution in step (2);
Step (4): whether need alternate channel according to switching method of inspection detection travelling carriage,, then send the channel allocation application to system if travelling carriage needs switching channels, behind the channel request of system responses travelling carriage, execution in step (1); If travelling carriage does not need switching channels, execution in step (3);
Step (5): travelling carriage terminates in the communication on the current channel, logs off simultaneously.
The overall procedure explanation:
In system, when a Mobile Origination is called out or prepared call accepted, all need to take a channel and communicate, so travelling carriage can be initiated the application of channel allocation.Receive the channel allocation application of travelling carriage when system after, just carry out based on the dynamic channel allocation and the using method of channel search farthest for it.The process that system carries out this method for each travelling carriage is independently.But system can be by being provided with the switching Check-Out Time of each travelling carriage, thereby control uses the travelling carriage of same channel begin to switch check in the identical moment, thereby facilitate for the optimization of systematic function.
Because the mobility at random of travelling carriage, although in the time of the channel original allocation, distance between the travelling carriage of use same channel is all widened fully, still may occur using the travelling carriage distance of same channel less than channel multiplexing distance even the overlapping situation of generation virtual subdistrict in moving process.So can each travelling carriage all need the presently used channel of regular inspection continue to use.If can not continue to use, then travelling carriage need be selected new channel so that can proceed communication.
B) channel allocation
Channel allocation adopts following method.
Step (1): the travelling carriage with request channel serves as to distribute object, and the channel that each bar in the system is being used inserts detection.If inserting the result who detects is that travelling carriage can use this channel, is available channel with this channel tag then; If inserting the result who detects is that travelling carriage can not use this channel, is unavailable channel with this channel tag then;
Step (2): all available channels are formed set of available channels,, then change step (4) if set of available channels is an empty set; If the set of available channels non-NULL is then carried out next step;
Step (3): according to predefined channel search method, in set of available channels, seek the most suitable channel, and use to the travelling carriage of request channel this channel allocation, finish channel allocation simultaneously for travelling carriage;
Step (4): search whether there is idle channel in the system,, then in idle channel, choose any channel allocation and give travelling carriage, finish channel allocation simultaneously, execution in step (5) if exist; Otherwise the refusal channel request finishes channel allocation simultaneously.
Below progressively describe by the described step of method for channel allocation:
Step (1) illustrates:
After the channel that all are using in the system inserted detection, can determine whether each bar channel in the system can be moved platform and use.Insert the result who detects and to use this channel for travelling carriage, show when the travelling carriage of request channel uses this channel, the travelling carriage that is using this channel to carry out the travelling carriage of proper communication and request channel can both satisfy the requirement of communication quality, and the virtual subdistrict of the travelling carriage of request channel and other are normally using the virtual subdistrict of the travelling carriage of this channel not overlap.If the result who insert to detect can not use this channel for travelling carriage, then possible reason has following three kinds of situations, the one, and the virtual subdistrict of the travelling carriage of request channel and other are normally using between the virtual subdistrict of travelling carriage of this channel appearance overlapping; The 2nd, the communication quality of the travelling carriage of request channel on this channel do not reach requirement; Have is exactly that original normal communication quality of some travelling carriage of this channel that uses does not reach the communication quality requirement because of the adding of the travelling carriage of request channel again.
Step (2) illustrates:
Available channel is formed a set, the scope of having dwindled channel search.If set of available channels is an empty set, then the travelling carriage that all channels that using all can not be applied channel in the illustrative system uses, and in this case, does not just need to carry out channel search; And when the set of available channels non-NULL, the channel that exists some travelling carriages that can be applied channel to use is described, illustrate simultaneously also that in channel allocation the travelling carriage of request channel can be assigned to channel the most at last to begin a new communication process or to continue original communication process.
Step (3) illustrates:
Channel search only carries out in set of available channels, and just carries out channel search when just thinking the set of available channels non-NULL.The rule of channel search is flexibly, that is to say, according to the systematic function target of required realization, can design different channel search rules.For example, when hope reduces the entire system switching times, can adopt the searching method of detection range channel farthest; And if wish the channel utilization of raising system, the searching method of then can the search channel utilance the highest channel.For adopting different channel search rules, the systematic function that can realize difference to some extent on every index.But because the scope of channel search is limited in the set of available channels, therefore the therefore phenomenon that cannot use of the channel that can not occur searching has also improved the user capacity of system.
The implementation of various channel search methods is described for the example under the one dimension environment below.Example system is supposed that mobile station MS 0 proposes the channel allocation application to system now, and mobile station MS 0 current available channel is had four as shown in figure 10, represents with ch1, ch2, ch3, ch4 respectively.In example system, only mark the travelling carriage that uses channel ch1, ch2, ch3, ch4.The coordinate of each travelling carriage is as shown in table 3, and the distance between MS0 and each travelling carriage is as shown in table 4.
The signal of table 3 travelling carriage coordinate
| The travelling carriage numbering | MS0 | MS1 | MS2 | MS3 | MS4 | MS5 | MS6 | MS7 | MS8 |
| Coordinate | 0.5 | -5.5 | -8.5 | 7.5 | 10.5 | 21.5 | 5.5 | -11.5 | 13.5 |
Distance signal between table 4 travelling carriage
| The travelling carriage numbering | MS1 | MS2 | MS3 | MS4 | MS5 | MS6 | MS7 | MS8 |
| And distance between the mobile station MS 0 | 6 | 9 | 7 | 10 | 21 | 5 | 12 | 13 |
| The k value | 3 | 3 | 7 | 2 | 1 | 3 | 2 | 2 |
When searching method is that for the travelling carriage that uses channel ch1, the travelling carriage nearest apart from MS0 is MS1 when searching for the channel search method of channel farthest; For the travelling carriage that uses channel ch2, the travelling carriage nearest apart from MS0 is MS6; For the travelling carriage that uses channel ch3, the travelling carriage nearest apart from MS0 is MS3; For the travelling carriage that uses channel ch4, the travelling carriage nearest apart from MS0 is MS4.In the travelling carriage set that MS1, MS6, MS3, MS4 formed, be MS4 apart from MS0 travelling carriage farthest, so the employed channel ch4 of MS4 will be assigned to MS0 and use as the channel search result.
When searching method during for the highest channel search method of search utilance, the channel utilization of calculating channel ch1, ch2, ch3, ch4 at first.The value that we suppose k is as follows: the phase mutual edge distance makes k=1 more than or equal to 20 between travelling carriage; And work as the phase mutual edge distance less than 20, simultaneously more than or equal to 10 o'clock, make k=2; When the phase mutual edge distance less than 10 the time, make k=3.The channel utilization that then can draw ch1 is 5, and the channel utilization of ch2 is 7, and the channel utilization of ch3 is 3, and the channel utilization of ch4 is 4.Therefore, in channel ch1, ch2, ch3, ch4, the channel utilization of channel ch2 is the highest, so channel ch2 will be assigned to MS0 and use as the channel search result.
When searching method during for the channel search method of search maximum channel distance metric, the channel distance metric of calculating channel ch1, ch2, ch3, ch4 at first.We suppose D
Up=50.The channel distance metric that then can draw ch1 is 81, and the channel distance metric of ch2 is 115, and the channel distance metric of ch3 is 43, and the channel distance metric of ch4 is 78.Therefore, in channel ch1, ch2, ch3, ch4, the channel distance metric maximum of channel ch2 is so channel ch2 will be assigned to MS0 and use as the channel search result.
When searching method was the channel search method of search maximum channel signal interference ratio tolerance, at first the channel signal interference ratio of calculating channel ch1, ch2, ch3, ch4 was measured.We suppose SIR
Up=100.Table 5 has shown when the mobile station MS 0 of request channel uses channel ch1, the channel communication quality of mobile station MS 0, MS1, MS8; Table 6 has shown when the mobile station MS 0 of request channel uses channel ch2, the channel communication quality of mobile station MS 0, MS2, MS5, MS6; Table 7 has shown when the mobile station MS 0 of request channel uses channel ch3, the channel communication quality of mobile station MS 0, MS3; Table 8 has shown when the mobile station MS 0 of request channel uses channel ch4, the channel communication quality of mobile station MS 0, MS4, MS7.According to the data of table 5 to table 7, the channel signal interference ratio tolerance that can obtain channel ch1 is 5.4897, the channel signal interference ratio tolerance of channel ch2 is 47.6749, and the channel signal interference ratio tolerance of channel ch3 is for-21.8254, and the channel signal interference ratio of channel ch4 tolerance is for-22.2042.Therefore, in channel ch1, ch2, ch3, ch4, the channel signal interference ratio of channel ch2 tolerance is maximum, so channel ch2 will be assigned to MS0 and use as the channel search result.
Table 5 uses the travelling carriage channel communication statistic of attribute of channel ch1
| The travelling carriage numbering | MS0 | MS1 | MS8 |
| Channel communication quality (dB) | 59.8513 | 55.5581 | 79.1009 |
Table 6 uses the travelling carriage channel communication statistic of attribute of channel ch2
| The travelling carriage numbering | MS0 | MS2 | MS5 | MS6 |
| Channel communication quality (dB) | 48.3394 | 70.7503 | 84.2269 | 49.0085 |
Table 7 uses the travelling carriage channel communication statistic of attribute of channel ch3
| The travelling carriage numbering | MS0 | MS3 |
| Channel communication quality (dB) | 60.9127 | 60.9127 |
Table 8 uses the travelling carriage channel communication statistic of attribute of channel ch4
| The travelling carriage numbering | MS0 | MS4 | MS7 |
| Channel communication quality (dB) | 69.4857 | 75.1332 | 77.5853 |
Step (4) illustrates:
When set of available channels is empty set,, then idle channel can be distributed to the travelling carriage of request channel if also there is idle channel.This is because because interchannel is a quadrature, can not produce the phase mutual interference between the different channels.So any idle channel is distributed to the travelling carriage of request channel, can guarantee this travelling carriage not can with current Installed System Memory any travelling carriage between produce mutual interference mutually.If when not having idle channel in the system, travelling carriage will can not obtain any channel, therefore the situation that new call barring or ongoing conversation are interrupted by force can occur.
C) switch check
Switch the method for inspection and comprise following steps:
Step (1): whether the virtual subdistrict of checking travelling carriage overlaps with the virtual subdistrict of other travelling carriage that uses same channel, if overlap, system will determine whether this travelling carriage needs to change its current channel so, if travelling carriage need change current channel, execution in step (4); Otherwise, carry out next step;
Step (2): obtain the signal communication quality evaluation index between each antenna in travelling carriage and the virtual subdistrict;
Step (3):, judge whether the channel communication quality satisfies the communication quality requirement according to the pairing signal communication quality evaluation index of each antenna in the virtual subdistrict.If finish to switch check, otherwise carry out next step;
Step (4): interrupt the communication of this travelling carriage on current channel, the guiding travelling carriage enters channel allocation.
Below progressively describe by described step:
Step (1) illustrates:
Checking whether travelling carriage can continue to be suitable in the process of current channel, needing at first to check whether the virtual subdistrict of other a plurality of travelling carriages of the virtual subdistrict of travelling carriage and current use same channel occurs overlapping.If the virtual subdistrict of the another one travelling carriage of travelling carriage and use same channel is overlapping, need that then one of them travelling carriage is carried out channel and switch, can communicate by letter normally between two travelling carriages and separately the virtual subdistrict guaranteeing.Selecting which travelling carriage to carry out the channel switching in two travelling carriages is determined by system.In like manner, overlapping for the virtual subdistrict of other travelling carriage of travelling carriage and a plurality of use same channels, only need make the part travelling carriage switch to new channel, thereby make not no longer overlapping the getting final product of virtual subdistrict of the travelling carriage of switching channels.In a plurality of travelling carriages, select which travelling carriage to carry out the channel switching and also determine by system.Certainly, when virtual subdistrict was overlapping, the composition that also can be by changing virtual subdistrict or the size of virtual subdistrict solved the overlap problem of virtual subdistrict.The method of the invention is at the situation that does not solve overlap problem by the change of virtual subdistrict.System can be by the switching Check-Out Time of each travelling carriage of control, make the travelling carriage that uses same channel begin to switch check at synchronization, like this, system can comprehensively all use the information of the travelling carriage of same channel, carry out complex optimum, thereby determine that rationally which travelling carriage need switch the channel of current use.For some channels, system for the number of the travelling carriage that need to guarantee to switch is few as much as possible, adopts following method need to select the travelling carriage of switching after knowing that overlapping travelling carriage appears in all virtual subdistricts that use this channel:
Initially: set A is expressed as empty set, set B comprise use this channel the overlapping travelling carriage of the virtual subdistrict that occurs, begin following screening process then.
A. select and the overlapping maximum travelling carriage of the virtual subdistrict of other travelling carriage, it is deleted from set A, and join set B;
Whether the virtual subdistrict of B. judging the travelling carriage in the set B has overlapping situation, if having, turns back to A, if do not have, finishes screening process.
After screening process finishes, comprise all in the set A and need carry out the travelling carriage that channel switches, then comprise all in the set B and do not needed to carry out the travelling carriage that channel switches.
When system needing to obtain the travelling carriage set of switching channels by above method after, will notify corresponding mobile station to terminate in communication on the current channel, thereby guarantee the proper communication that other does not need the travelling carriage of switching channels.
Step (2) illustrates:
Through the inspection of step (1), guaranteed that each antenna at most only is a travelling carriage service on each channel.But when using the travelling carriage close together of same channels for two,, still can produce strong interference each other, thereby cause both communication qualities all can not meet the demands though the virtual subdistrict of Shi Yonging does not have overlappingly each other.Therefore also need regularly to obtain the channel communication quality of each antenna in the pairing virtual subdistrict of each travelling carriage, and check according to evaluation method.
Step (3) illustrates:
If the channel communication quality meets the demands, illustrate that then current time uses other travelling carriage of same channel very little to the interference of this travelling carriage, the communication of travelling carriage on this channel is unaffected, still can normally carry out.Otherwise the interference that is subjected to regard to the conversation that illustrates on this channel is too big, and the channel communication quality does not meet the demands, and the current proper communication of travelling carriage is affected, and need switch on the new channel.
Step (4) illustrates:
In order to continue the ongoing communication process of travelling carriage, travelling carriage will be to system's request channel again, compare with other travelling carriages of first application channel, the request priority of this travelling carriage will be higher, reduce ongoing communication process owing to interrupt probability takes place handoff failure with this.
Claims (7)
1. based on the dynamic channel cut-in method of available channel search, it is characterized in that it contains following each step successively:
Step (1): the travelling carriage with request channel serves as to distribute object, and the channel that each bar in the system is being used inserts detection, is that travelling carriage can use this channel if insert the result who detects, and is available channel with this channel tag then; If inserting the result who detects is that travelling carriage can not use this channel, is unavailable channel with this channel tag then;
Step (2): all available channels are formed set of available channels,, then change step (4) if set of available channels is an empty set; If the set of available channels non-NULL is then carried out next step;
Step (3): according to predefined channel search method, in set of available channels, seek the most suitable channel, and use to the travelling carriage of request channel this channel allocation, finish channel allocation simultaneously, execution in step (5) for travelling carriage;
Step (4): search whether there is idle channel in the system,, then in idle channel, choose any channel allocation and give travelling carriage, finish channel allocation simultaneously, execution in step (5) if exist; Otherwise the refusal channel request finishes channel allocation, execution in step (11) simultaneously;
Step (5): judged whether to arrive the switching interval of setting Check-Out Time, if arrive, switched check, execution in step (7): if do not arrive execution in step (6);
Step (6): judge whether travelling carriage will finish current communication, if, execution in step (11); Otherwise, execution in step (5);
Step (7): whether the virtual subdistrict of checking travelling carriage overlaps with the virtual subdistrict of other travelling carriage that uses same channel, if overlap, system will determine whether this travelling carriage needs to change its current channel so, if travelling carriage need change current channel, execution in step (10); Otherwise, execution in step (8);
Step (8): obtain the signal communication quality evaluation index between each antenna in travelling carriage and the virtual subdistrict;
Step (9): according to the pairing signal communication quality evaluation index of each antenna in the virtual subdistrict, utilize the channel communication quality evaluating method, judge whether the channel communication quality satisfies the communication quality requirement, if, travelling carriage can continue to use current channel, finish to switch checkout procedure, execution in step (6) simultaneously; Otherwise execution next step;
Step (10): interrupt the communication of this travelling carriage on current channel, travelling carriage proposes the channel allocation application, finishes to switch checkout procedure simultaneously; Behind the channel request of system responses travelling carriage, carry out channel allocation, execution in step (1);
Step (11): travelling carriage terminates in the communication on the current channel, logs off simultaneously;
Each travelling carriage has the virtual subdistrict of oneself, and virtual subdistrict is made up of with one or more antennas mobile communications current, and virtual subdistrict constantly changes with the motion of travelling carriage;
Described signal quality estimation index is meant the signal-to-jamming ratio of the uplink signal that antenna end receives;
Step (1) has been described method for channel allocation to step (4), and step (7) has been described the switching method of inspection to step (10).
2. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that described access detection method contains following steps successively:
Step (1): for the channel that inserts detection, check the travelling carriage that all are using this channel, if wherein the virtual subdistrict of any one travelling carriage overlaps with the virtual subdistrict of the travelling carriage of request channel, then the result of record access detection is that travelling carriage can not use this channel, and finishes to insert and detect; Otherwise carry out next step;
Step (2): this channel of the of short duration use of travelling carriage that makes request channel, signal communication quality evaluation index in the travelling carriage of acquisition request channel and the virtual subdistrict between each antenna, and, check whether the travelling carriage of request channel can satisfy the communication quality requirement of channel on this channel according to the channel communication quality evaluating method; If can not, then record inserts the result who detects and can not use this channel for travelling carriage, and finishes to insert and detect; Otherwise carry out next step;
Step (3): for each normal travelling carriage that uses this channel, obtain the signal communication quality evaluation index between each antenna in this travelling carriage and the corresponding virtual sub-district, and according to the channel communication quality evaluating method, check when the travelling carriage of request channel inserts this channel whether the travelling carriage of original normal this channel of use can also satisfy the communication quality requirement of channel on channel; If the travelling carriage of each normal this channel of use all satisfies the communication quality requirement of channel in inspection, then record inserts the result who detects and can use this channel for travelling carriage, and finishes access and detect; If there is any one travelling carriage not satisfy the communication quality requirement of channel in checking process, then record inserts the result who detects and can not use this channel for travelling carriage, and finishes to insert and detect.
3. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that the evaluation method of described channel communication quality evaluation index contains following steps successively:
Set a signal-to-jamming ratio thresholding, the mode that merges according to high specific merges the received uplink signal of each antenna in the corresponding virtual subdistrict of travelling carriage, obtain the resultant signal interference ratio after high specific merges at last, the resultant signal interference ratio is the summation of the signal-to-jamming ratio of each uplink signal, resultant signal interference ratio and signal-to-jamming ratio thresholding are compared, if the resultant signal interference ratio is greater than the signal-to-jamming ratio thresholding, then the channel quality comprehensive evaluation result is that channel can use; If the resultant signal interference ratio is less than the signal-to-jamming ratio thresholding, then the channel quality comprehensive evaluation result is that channel cannot use.
4. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that described channel search method contains following steps successively:
Step (1): to each the bar channel in the set of available channels, traversal is used all travelling carriages of this channel, therefrom finds out the shortest travelling carriage of travelling carriage distance with request channel, and the travelling carriage that all distances are the shortest is formed a new set;
Step (2): the travelling carriage set that the traversal previous step obtains suddenly, therefrom find out travelling carriage travelling carriage farthest apart from request channel, the employed channel of this travelling carriage is the channel search result;
Because the virtual subdistrict of each travelling carriage is made up of a plurality of antennas, therefore can tentatively obtain the approximate range at this travelling carriage place by the position of a plurality of antennas in the virtual subdistrict, on this basis, can further determine the particular location of travelling carriage by the direction of arrival that the received travelling carriage of a plurality of antennas transmits; This channel search method is called the channel search method of channel farthest of searching for.
5. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that described channel search method contains following steps successively:
Step (1): each the bar channel in the set of available channels, calculate its channel utilization, the computing formula of channel utilization is:
Wherein i is the numbering of channel, and summation is the mobile station MS that all is used channel i
jCarry out k
jThe expression mobile station MS
jShared weight in statistics is a positive integer, k
jValue and mobile station MS
jAnd the mutual distance dependent between the travelling carriage of request channel, the distance between the travelling carriage is big more, and then k is more little, distance between the travelling carriage is more little, then k is big more, and the value of k satisfies following provisions: suppose to use the travelling carriage of channel i to have M (M is a limited positive integer) individual, be labeled as MS respectively
1, MS
2MS
M, the distance between the travelling carriage of each travelling carriage and request channel is d
1, d
2D
M, and satisfy d
1≤ d
2≤ ... ≤ d
M, then have-∞＜k
M≤ ... ≤ k
2≤ k
1＜+∞;
Step (2): in set of available channels, find out the channel of channel utilization maximum; If there is the channel utilization of a plurality of channels identical and all be maximum, then that all channel utilizations are identical and all be that maximum channel is formed the alternative subclass of available channel, and execution in step (3), otherwise use to the travelling carriage of request channel the channel allocation of channel utilization maximum;
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the highest channel search method of search utilance.
6. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that described channel search method contains following steps successively:
Step (1): each the bar channel in the set of available channels, calculate its channel distance metric, the computing formula of channel distance metric is:
Wherein i is the numbering of channel, and summation is the mobile station MS that all is used channel i
jCarry out D
UpBe a constant, need meet the following conditions: D
Up-D
MSO, MSj＞O, i, j, D
MSO, MSjThe mobile station MS of expression request channel
OWith the mobile station MS that uses channel i
jBetween distance;
Step (2): in set of available channels, find out the channel of channel distance metric maximum; If there is the channel distance metric of a plurality of channels identical and all be maximum, then that all channel distance metrics are identical and all be that maximum channel is formed the alternative subclass of available channel, and execution in step (3), otherwise use to the travelling carriage of request channel the channel allocation of channel distance metric maximum;
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the channel search method of search maximum channel distance metric.
7. according to the dynamic channel cut-in method of searching for based on available channel in the claim 1, it is characterized in that described channel search method contains following steps successively:
Step (1): to each the bar channel in the set of available channels, calculate its channel signal interference ratio tolerance, the computing formula of channel signal interference ratio tolerance is:
Wherein i is the numbering of channel, and the summation of back is the mobile station MS that all is used channel i
jCarry out, wherein, SIR
UpBe a constant, need meet the following conditions: S
IRup-SIR
I, MSj＞O, i, SIR
I, MSOThe mobile station MS of expression request channel
OThe channel communication quality that on channel i, is obtained, SIR
I, MSjThe travelling carriage of expression request channel is mobile station MS when using channel i also
jThe channel communication quality that on channel i, is obtained;
Step (2): in set of available channels, find out the maximum channel of channel signal interference ratio tolerance; If there is the channel signal interference ratio tolerance of a plurality of channels identical and all be maximum, then that all channel signal interference ratios tolerance is identical and all be the maximum alternative subclass of channel composition available channel, and execution in step (3), otherwise the channel allocation that channel signal interference ratio tolerance is maximum uses for the travelling carriage of request channel;
Step (3): in the alternative subclass of available channel, be chosen in and insert detect, the poorest channel of the channel communication quality that travelling carriage obtained of request channel is as the channel search result;
This channel search method is called the channel search method of the maximum signal interference ratio tolerance of search.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100862930A CN100418386C (en) | 2005-08-26 | 2005-08-26 | Dynamic channel switching-in method based on useable channel searching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100862930A CN100418386C (en) | 2005-08-26 | 2005-08-26 | Dynamic channel switching-in method based on useable channel searching |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1741667A true CN1741667A (en) | 2006-03-01 |
| CN100418386C CN100418386C (en) | 2008-09-10 |
Family
ID=36093860
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100862930A Expired - Fee Related CN100418386C (en) | 2005-08-26 | 2005-08-26 | Dynamic channel switching-in method based on useable channel searching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100418386C (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010088795A1 (en) * | 2009-02-03 | 2010-08-12 | 深圳华为通信技术有限公司 | Bearing processing method and apparatus as well as adhesion method and apparatus |
| CN101350681B (en) * | 2008-08-22 | 2011-12-21 | 华为技术有限公司 | Method and apparatus for searching idle channel |
| CN101335994B (en) * | 2007-06-29 | 2012-01-04 | 株式会社日立制作所 | Status notifying method in radio communication |
| CN101529856B (en) * | 2006-10-20 | 2012-08-29 | 阿尔卡特朗讯 | Device for selection of bearer channel type for broadcasting contents to communication terminals |
| CN101742517B (en) * | 2008-11-13 | 2012-09-26 | 中兴通讯股份有限公司 | Method for dynamic frequency and channel allocation when call is established |
| CN101657019B (en) * | 2009-10-12 | 2013-02-06 | 上海交通大学 | Method for allotting idle channels in radio network |
| CN101808332B (en) * | 2009-02-18 | 2013-03-20 | 华为技术有限公司 | Method and device for channel allocation |
| CN103843434A (en) * | 2013-11-11 | 2014-06-04 | 华为技术有限公司 | Method and device of channel allocation and releasing link |
| CN104022796A (en) * | 2014-06-18 | 2014-09-03 | 电子科技大学 | Method and structure for generating frequency hopping sequence based on discontinuous frequency bands |
| CN107613478A (en) * | 2017-08-07 | 2018-01-19 | 中兴克拉科技（苏州）有限公司 | A kind of terminal automatic registration method of LPWAN Internet of Things |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100658293B1 (en) * | 1998-04-03 | 2006-12-14 | 텔레폰악티에볼라겟엘엠에릭슨(펍) | Flexible radio access and resource allocation in a universal mobile telephone system |
| US6359877B1 (en) * | 1998-07-21 | 2002-03-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for minimizing overhead in a communication system |
| DE69914108T2 (en) * | 1999-05-26 | 2004-11-18 | Nokia Corp. | SYSTEM AND METHOD FOR CONTROLLING ACCIDENTAL ACCESSES |
| US6985465B2 (en) * | 2000-07-07 | 2006-01-10 | Koninklijke Philips Electronics N.V. | Dynamic channel selection scheme for IEEE 802.11 WLANs |
| CN1204776C (en) * | 2002-08-07 | 2005-06-01 | 华为技术有限公司 | Call Cut-in control method |
-
2005
- 2005-08-26 CN CNB2005100862930A patent/CN100418386C/en not_active Expired - Fee Related
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101529856B (en) * | 2006-10-20 | 2012-08-29 | 阿尔卡特朗讯 | Device for selection of bearer channel type for broadcasting contents to communication terminals |
| CN101335994B (en) * | 2007-06-29 | 2012-01-04 | 株式会社日立制作所 | Status notifying method in radio communication |
| CN101350681B (en) * | 2008-08-22 | 2011-12-21 | 华为技术有限公司 | Method and apparatus for searching idle channel |
| CN101742517B (en) * | 2008-11-13 | 2012-09-26 | 中兴通讯股份有限公司 | Method for dynamic frequency and channel allocation when call is established |
| WO2010088795A1 (en) * | 2009-02-03 | 2010-08-12 | 深圳华为通信技术有限公司 | Bearing processing method and apparatus as well as adhesion method and apparatus |
| CN101808332B (en) * | 2009-02-18 | 2013-03-20 | 华为技术有限公司 | Method and device for channel allocation |
| CN101657019B (en) * | 2009-10-12 | 2013-02-06 | 上海交通大学 | Method for allotting idle channels in radio network |
| CN103843434A (en) * | 2013-11-11 | 2014-06-04 | 华为技术有限公司 | Method and device of channel allocation and releasing link |
| WO2015066918A1 (en) * | 2013-11-11 | 2015-05-14 | 华为技术有限公司 | Method and device for allocating channel and releasing link |
| CN103843434B (en) * | 2013-11-11 | 2019-03-26 | 华为技术有限公司 | A kind of method and apparatus of channel distribution |
| CN104022796A (en) * | 2014-06-18 | 2014-09-03 | 电子科技大学 | Method and structure for generating frequency hopping sequence based on discontinuous frequency bands |
| CN107613478A (en) * | 2017-08-07 | 2018-01-19 | 中兴克拉科技（苏州）有限公司 | A kind of terminal automatic registration method of LPWAN Internet of Things |
| CN107613478B (en) * | 2017-08-07 | 2020-04-07 | 中兴克拉科技（苏州）有限公司 | Automatic terminal registration method for LPWAN Internet of things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100418386C (en) | 2008-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103210593B (en) | Methods and apparatus for inter-cell interference coordination self-organized network | |
| CN1080529C (en) | Cellular mobile communication system | |
| KR101090542B1 (en) | Method and apparatus of measurement mechanism and efficient paging and broadcasting scheme implementation in mbms dedicated cell of lte systems | |
| CN1106778C (en) | Emulating advanced control algorithm in mobile communications system | |
| CN1822700A (en) | A radio network controller, a mobile communication system, and a neighbor-cell-list filtering method | |
| WO2011090253A1 (en) | Method and apparatus for scheduling resource allocation to control inter-cell interference in a cellular communication system, and base station thereof | |
| CN1805592A (en) | Measurement control method for switching between mobile communication cells | |
| CN101227698B (en) | Resource regulating method | |
| JP2010288282A (en) | Method and device of interference suppression in wireless cellular network | |
| CN1248138A (en) | Method and device for free switching in cellular | |
| CN1754393A (en) | Method for implementing fast-dynamic channel allocation radio resource management procedures | |
| CN1322419A (en) | Method for carrying out handoff between macrocell and microcell in hierarchical cell structure | |
| KR20100065365A (en) | Radio communication system, radio communication method, base station, mobile station, base station control method, mobile station control method, and control program | |
| CN1655630A (en) | Method of operating TDD/virtual FDD hierarchical cellular telecommunication system | |
| JP2015529042A (en) | Apparatus, method and computer program for base station transceiver | |
| CN1468499A (en) | Channel allocation for communication system | |
| JP2013534746A (en) | Handover procedure and signaling for planned cell outage in wireless cellular networks | |
| CN1271238A (en) | CDMA frequency distribution for fixed radio application | |
| CN101061741A (en) | Enhanced dedicated-channel reporting for umts | |
| CN1235436A (en) | Method of handoff control and handoff control system using thereof | |
| CN1765140A (en) | Hard handoff target generation in a multi-frequency CDMA mobile network | |
| CN1913386A (en) | Method for regulating pilot channel transmitting power | |
| CN1741667A (en) | Dynamic channel switching-in method based on useable channel searching | |
| KR101489704B1 (en) | Resource scheduling method, scheduler and base station | |
| CN1992962A (en) | Inter-cell interference coordination method based on evolution network architecture of 3G system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| 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: 20080910 Termination date: 20180826 |