CN102325381A - Radio spectrum access method for bullet trains - Google Patents

Radio spectrum access method for bullet trains Download PDF

Info

Publication number
CN102325381A
CN102325381A CN201110266158A CN201110266158A CN102325381A CN 102325381 A CN102325381 A CN 102325381A CN 201110266158 A CN201110266158 A CN 201110266158A CN 201110266158 A CN201110266158 A CN 201110266158A CN 102325381 A CN102325381 A CN 102325381A
Authority
CN
China
Prior art keywords
bullet train
channel
bullet
expression
train
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
Application number
CN201110266158A
Other languages
Chinese (zh)
Other versions
CN102325381B (en
Inventor
江涛
王志强
屈代明
陈达
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201110266158.XA priority Critical patent/CN102325381B/en
Publication of CN102325381A publication Critical patent/CN102325381A/en
Application granted granted Critical
Publication of CN102325381B publication Critical patent/CN102325381B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

A radio spectrum access method for bullet trains belongs to a radio spectrum access technology in the technical field of wireless communication. In the radio spectrum access method, under the condition that a television tower does not receive interference, the occupied channels of the television tower, which can be used by each bullet train, are first determined, the potential interference existing between any two bullet trains at an interval less than the safe communication distance is then judged, the usable channels are allocated to each bullet train according to the usable spectrum list of each bullet train in the end, a plurality of bullet train channel allocation combinations are obtained, moreover, the bullet train channel allocation combination in which the two bullet trains are assigned to the same frequency band and potentially interfere with each other exist is rejected, and from the rest of the bullet train channel allocation combinations, the combination with the maximum sum of the channels allocated to all the bullet trains is chosen as an optimal channel allocation result. The radio spectrum access method schedules the access of the bullet trains into the idle television channels with the optimal channel allocation result in each time slot, thus effectively increasing the utilization rate of idle television spectrum.

Description

A kind of bullet train wireless frequency spectrum cut-in method
Technical field
The invention belongs to the wireless frequency spectrum access technology of wireless communication technology field, be specifically related to a kind of bullet train wireless frequency spectrum cut-in method.
Background technology
Bullet train, for example: aircraft and high-speed train, will in people's life, play the part of more and more important role.Passenger on the bullet train need more broadband radio multi-media service, and therefore, broadband wireless communication technique will be one of indispensable technology of bullet train.Yet being faced with a stern challenge based on the broadband wireless communications of bullet train is the deficient problem of frequency spectrum resource.In the last few years, it is found that the availability of frequency spectrum of television channel was very low, and considered under the situation that does not influence TV user, and utilized idle television channel to carry out access communications.Disturb in order TV user not to be produced, bullet train can only insert the channel that current TV user does not have use.And, can not produce interference between the different bullet trains.If a plurality of bullet trains access television channel at random not only can not guarantee not influence TV user, also can have a strong impact on the utilance of idle channel.So, how to dispatch a plurality of bullet trains and insert suitable idle channel, thereby improve the idle channel utilance, be a very important problem.At present, also there is not the scheduling high-speed train to insert the method for suitable idle frequency spectrum.
Summary of the invention
The present invention provides a kind of bullet train wireless frequency spectrum cut-in method that utilizes idle television channel, under the situation that does not influence TV user, has realized the wireless communication of bullet train, and can significantly improve idle television spectrum utilance.
A kind of bullet train wireless frequency spectrum cut-in method carries out time slot with call duration time and divides, and target band is carried out channel distribution, comprises the steps:
(1) initialization step: each bullet train sends to the bullet train base station with the geographical position coordinates and the spectrum requirement of current time slots self, and each television tower sends to the bullet train base station with self geographical position coordinates and busy channel;
(2) calculate the available channel list step: the bullet train base station is guaranteeing that according to the geographical position coordinates of each bullet train and the geographical position coordinates and the busy channel of each television tower television tower is by the busy channel of definite spendable television tower of each bullet train under the disturbed condition;
(3) judge that bullet train disturbs step: the bullet train base station is judged between any two bullet trains of spacing less than the secure communication distance to have potential interference according to the geographical position coordinates of each bullet train;
(4) channel assignment step: the bullet train base station is carried out available channel according to the usable spectrum tabulation of each bullet train to each bullet train and is distributed; Obtain a plurality of bullet train channel allocation combinations; With wherein existing two bullet trains to be assigned with same frequency range and having the bullet train channel allocation combination of potential interference to reject between the two, select in the bullet train channel allocation combination after rejecting all bullet train allotted channel count summation maximum be combined as the optimum channel allocation result;
(5) communication steps: the bullet train base station sends to each bullet train with the optimum channel allocation result, and each bullet train utilizes optimum channel allocation result channel appointed to communicate in current time slots.
The present invention is according to geographical position, the spectrum requirement of bullet train, and the geographical position of television tower and employed channel, inserts idle television channel at each time slot with optimal scheduling matrix scheduling high-speed train.Insert the method for idle television channel with bullet train at random and compare, the present invention can improve idle television spectrum utilance.Under concrete given parameter condition, the availability of frequency spectrum of random device reaches 51.667%, the optimal scheduling vector that utilizes the present invention to find the solution, and the availability of frequency spectrum reaches 93.333%, and the availability of frequency spectrum has improved about 42%; Effectively improve idle television spectrum utilance.
Description of drawings
Fig. 1 is a system block diagram of the present invention;
Fig. 2 is the flow chart of the present invention's
Figure BDA0000090059070000021
solution procedure.
Embodiment
Below in conjunction with accompanying drawing and embodiment the present invention is further specified:
As shown in Figure 1, the present invention includes initialization step, calculate the available channel list step, calculate bullet train phase mutual interference step and compute optimal dispatch matrix step.
The present invention is divided into time slot with call duration time, and target band on average is divided into N channel, and General N is 1～1000000, comprises the steps:
One. initialization step: each bullet train sends to the bullet train base station with geographical position coordinates, the spectrum requirement of current time slots self.Each television tower sends to the bullet train base station with self geographical position coordinate, self busy channel.
Two. calculate the available channel list step: the bullet train base station is according to geographical position coordinates, movement velocity and the direction of each bullet train with current time slots self; And each television tower is with self geographical position coordinate, self busy channel; Calculating respectively can be by the channel list of each bullet train use; Computational methods are following: make m represent wherein any bullet train, n representes wherein any channel, then
Figure BDA0000090059070000031
Wherein,
Figure BDA0000090059070000032
Expression bullet train m can use channel n, Expression bullet train m cannot use channel n,
Figure BDA0000090059070000034
Expression television tower P lCommunication radius,
Figure BDA0000090059070000035
Expression television tower P lBy the perception radius,
Figure BDA0000090059070000036
The interference radius of expression bullet train,
Figure BDA0000090059070000037
Expression television tower P lWith the beeline of bullet train m in current time slots,
Figure BDA0000090059070000038
The television tower set of channel n is used in expression.
Three. calculate bullet train phase mutual interference step: the bullet train base station calculates between any two bullet trains whether have interference according to geographical position coordinates, movement velocity and the direction of each bullet train with current time slots self, and computational methods are following:
Figure BDA0000090059070000039
Wherein, Expression bullet train m iAnd m jIf in current time slots, use identical channel, just might the phase mutual interference.
Figure BDA00000900590700000311
Expression bullet train m iAnd m jImpossible phase mutual interference in current time slots,
Figure BDA00000900590700000312
Expression bullet train m jCommunication radius, Expression bullet train m iThe interference radius, Expression bullet train m iAnd m jBeeline in current time slots.
Four. compute optimal dispatch matrix step:
To satisfy formula And constraints And And
Figure BDA0000090059070000045
Dispatch matrix δ be designated as the optimal scheduling matrix delta *, i.e. optimum channel allocation result, wherein,
Figure BDA0000090059070000046
Be the capable n column element of m of dispatch matrix δ,
Figure BDA0000090059070000047
Expression bullet train m is assigned with channel n,
Figure BDA0000090059070000048
Expression bullet train m is not assigned with channel n, and M is the bullet train number, and N is the television channel number, A mThe channel demands of expression bullet train m.
The solution procedure of is following:
(41) each bullet train is divided into groups, wherein can there be potential interference in arbitrary group of interior bullet train with the bullet train in other a group:
The first step: s is initialized as s=1 with the train groups sequence number.Set up matrix F, its m iRow m jColumn element is F (m i, m j), work as m i＜m jThe time,
Figure BDA00000900590700000410
Otherwise F (m i, m j)=0;
Second step: from left to right, from top to bottom, first nonzero element of search F if can find, changed for the 3rd step over to, otherwise, changed for the 6th step over to;
The 3rd step: with the m at this nonzero element place iRow and m jRow cover with straight line respectively, and with bullet train m iAnd m jPut into train groups s (bullet train does not repeat to put into set), with this nonzero element vanishing;
The 4th step: if straight line does not have nonzero element under covering, make the value of s increase by 1, changed for second step over to, otherwise, changed for the 5th step over to;
The 5th step: the m ' of each nonzero element that will be covered by straight line iRow and m ' jRow cover with straight line respectively, and with bullet train m ' iAnd m ' jPut into train groups s (bullet train does not repeat to put into set),, changed for the 4th step over to this nonzero element vanishing;
The 6th step: division finishes.
(42) respectively each group bullet train is made up combined tree in the following manner:
(421) one group of bullet train is carried out spectrum allocation may; Obtain a plurality of dispatch matrix δ of this group bullet train; The capable n column element of m
Figure BDA0000090059070000051
the expression bullet train m of δ is assigned with channel n;
Figure BDA0000090059070000052
expression bullet train m is not assigned with channel n,
Figure BDA0000090059070000053
be numbered (m-1) N+n;
(422), be that the numbering of 1 element is arranged from small to large and constituted a sequence with element value for any dispatch matrix;
(423) be that tree node is set structure with the sequence; The sequent prime number of the child node in the tree is bigger by 1 than the sequent prime number of father node; And this element value that has more is greater than all element values of father node; All child nodes of a father node from left to right are arranged in order in tree according to the element value that has more from small to large;
(43) respectively every group of bullet train searched for the optimal scheduling matrix in the following manner: since the root node of the corresponding tree of one group of bullet train; According to BFS or depth-first principle tree is traveled through; In the traversal to satisfying the node of constraints
Figure BDA0000090059070000054
and
Figure BDA0000090059070000055
and
Figure BDA0000090059070000056
; Dispatch matrix according to this node calculates the train number of
Figure BDA0000090059070000057
M ' for this group bullet train; To not satisfying the node of constraints
Figure BDA0000090059070000058
and
Figure BDA0000090059070000059
and
Figure BDA00000900590700000510
, itself and all child nodes thereof are done to reject operation; Find out the optimal scheduling matrix that the corresponding dispatch matrix of the maximum node of
Figure BDA00000900590700000511
value is designated as this group bullet train;
(45) the optimal scheduling matrix with each group bullet train makes up the optimal scheduling matrix delta that obtains all bullet trains *
Each bullet train communicates according to optimal scheduling matrix access channel, gets into next time slot, changes step 1.

Claims (5)

1. a bullet train wireless frequency spectrum cut-in method carries out time slot with call duration time and divides, and target band is carried out channel distribution, and this method comprises the steps:
(1) initialization step: each bullet train sends to the bullet train base station with the geographical position coordinates and the spectrum requirement of current time slots self, and each television tower sends to the bullet train base station with self geographical position coordinates and busy channel;
(2) calculate the available channel list step: the bullet train base station is guaranteeing that according to the geographical position coordinates of each bullet train and the geographical position coordinates and the busy channel of each television tower television tower is by the busy channel of definite spendable television tower of each bullet train under the disturbed condition;
(3) judge that bullet train disturbs step: the bullet train base station is judged between any two bullet trains of spacing less than the secure communication distance to have potential interference according to the geographical position coordinates of each bullet train;
(4) channel assignment step: the bullet train base station is carried out available channel according to the usable spectrum tabulation of each bullet train to each bullet train and is distributed; Obtain a plurality of bullet train channel allocation combinations; With wherein existing two bullet trains to be assigned with same frequency range and existing the bullet train channel allocation combination of potential interference to reject between the two, select all bullet train allotted channel during remaining bullet train channel allocation makes up after rejecting and count the maximum combination of summation as the optimum channel allocation result;
(5) communication steps: the bullet train base station sends to each bullet train with the optimum channel allocation result, and each bullet train utilizes the optimum channel allocation result to communicate for its channel appointed in current time slots.
2. bullet train wireless frequency spectrum cut-in method as claimed in claim 1 is characterized in that:
Available channel computational methods in the said step (2) are:
Figure FDA0000090059060000011
Wherein,
Figure FDA0000090059060000012
Expression bullet train m can use channel n,
Figure FDA0000090059060000013
Expression bullet train m cannot use channel n,
Figure FDA0000090059060000021
Expression television tower P lCommunication radius, Expression television tower P lBy the perception radius,
Figure FDA0000090059060000023
The interference radius of expression bullet train,
Figure FDA0000090059060000024
Be illustrated in television tower P in the current time slots lAnd the beeline between bullet train m,
Figure FDA0000090059060000025
The television tower set of expression busy channel n.
3. bullet train wireless frequency spectrum cut-in method as claimed in claim 1 is characterized in that:
Said step (3) confirms that the concrete grammar of the potential interference of two high speed trains is:
Figure FDA0000090059060000026
Wherein,
Figure FDA0000090059060000027
Expression bullet train m iAnd m jIf in current time slots, use identical channel, just there is potential interference,
Figure FDA0000090059060000028
Expression bullet train m iAnd m jIn current time slots, there is not potential interference,
Figure FDA0000090059060000029
Expression bullet train m jCommunication radius,
Figure FDA00000900590600000210
Expression bullet train m iThe interference radius,
Figure FDA00000900590600000211
Be illustrated in bullet train m in the current time slots iAnd m jBetween beeline.
4. bullet train wireless frequency spectrum cut-in method as claimed in claim 1 is characterized in that:
The computational methods of optimum channel allocation result are in the said step (4):
To satisfy formula
Figure FDA00000900590600000212
And constraints
Figure FDA00000900590600000213
And
Figure FDA00000900590600000214
And
Figure FDA00000900590600000215
Dispatch matrix δ be designated as the optimal scheduling matrix delta *, i.e. optimum channel allocation result, wherein,
Figure FDA00000900590600000216
Be the capable n column element of m of dispatch matrix δ,
Figure FDA00000900590600000217
Expression bullet train m is assigned with channel n,
Figure FDA00000900590600000218
Expression bullet train m is not assigned with channel n, and M is the bullet train number, and N is the television channel number, A mThe channel demands of expression bullet train m.
5. scheduling high-speed train as claimed in claim 4 inserts the method for idle television channel, it is characterized in that:
Said step (4) is specially:
(41) bullet train divides into groups:
Each bullet train is divided into groups, and wherein can there be potential interference in arbitrary group of interior bullet train with the bullet train in other a group;
(42) respectively each group bullet train is made up combined tree in the following manner:
(421) one group of bullet train is carried out spectrum allocation may; Obtain a plurality of dispatch matrix δ of this group bullet train; The capable n column element of m
Figure FDA0000090059060000031
the expression bullet train m of δ is assigned with channel n;
Figure FDA0000090059060000032
expression bullet train m is not assigned with channel n,
Figure FDA0000090059060000033
be numbered (m-1) N+n;
(422), be that the numbering of 1 element is arranged from small to large and constituted a sequence with element value for any dispatch matrix;
(423) be that tree node is set structure with the sequence; The sequent prime number of the child node in the tree is bigger by 1 than the sequent prime number of father node; And this element value that has more is greater than all element values of father node; All child nodes of a father node from left to right are arranged in order in tree according to the element value that has more from small to large;
(43) respectively every group of bullet train searched for the optimal scheduling matrix in the following manner: since the root node of the corresponding tree of one group of bullet train; According to BFS or depth-first principle tree is traveled through; In the traversal to satisfying the node of constraints
Figure FDA0000090059060000034
and
Figure FDA0000090059060000035
and
Figure FDA0000090059060000036
; Dispatch matrix according to this node calculates the train number of
Figure FDA0000090059060000037
M ' for this group bullet train; To not satisfying the node of constraints
Figure FDA0000090059060000038
and
Figure FDA0000090059060000039
and
Figure FDA00000900590600000310
, itself and all child nodes thereof are done to reject operation; Find out the optimal scheduling matrix that the corresponding dispatch matrix of the maximum node of
Figure FDA00000900590600000311
value is designated as this group bullet train;
(45) the optimal scheduling matrix with each group bullet train makes up the optimal scheduling matrix delta that obtains all bullet trains *
CN201110266158.XA 2011-09-08 2011-09-08 Radio spectrum access method for bullet trains Active CN102325381B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110266158.XA CN102325381B (en) 2011-09-08 2011-09-08 Radio spectrum access method for bullet trains

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110266158.XA CN102325381B (en) 2011-09-08 2011-09-08 Radio spectrum access method for bullet trains

Publications (2)

Publication Number Publication Date
CN102325381A true CN102325381A (en) 2012-01-18
CN102325381B CN102325381B (en) 2014-06-18

Family

ID=45453026

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110266158.XA Active CN102325381B (en) 2011-09-08 2011-09-08 Radio spectrum access method for bullet trains

Country Status (1)

Country Link
CN (1) CN102325381B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047430A (en) * 2006-06-16 2007-10-03 华为技术有限公司 Method and system for selecting base station
CN101047432A (en) * 2006-06-23 2007-10-03 华为技术有限公司 Method for distributing uplink resource
CN101056135A (en) * 2006-06-15 2007-10-17 华为技术有限公司 Radio area network system and method for adjusting the cell synchronization
CN101668191A (en) * 2008-09-02 2010-03-10 中广电信有限公司 Method and system for receiving digital broadcast signal by high-speed running train
CN102136877A (en) * 2011-03-11 2011-07-27 北京邮电大学 60GHz millimeter wave based broadband access (BBA) system and method in high-speed rails

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101056135A (en) * 2006-06-15 2007-10-17 华为技术有限公司 Radio area network system and method for adjusting the cell synchronization
CN101047430A (en) * 2006-06-16 2007-10-03 华为技术有限公司 Method and system for selecting base station
CN101047432A (en) * 2006-06-23 2007-10-03 华为技术有限公司 Method for distributing uplink resource
CN101668191A (en) * 2008-09-02 2010-03-10 中广电信有限公司 Method and system for receiving digital broadcast signal by high-speed running train
CN102136877A (en) * 2011-03-11 2011-07-27 北京邮电大学 60GHz millimeter wave based broadband access (BBA) system and method in high-speed rails

Also Published As

Publication number Publication date
CN102325381B (en) 2014-06-18

Similar Documents

Publication Publication Date Title
CN107547184B (en) Dynamic pilot frequency distribution method in large-scale MIMO system
CN104854935B (en) Method and apparatus of the distributing equipment to the equipment communication resource
CN104393972B (en) A kind of extensive mimo system pilot distribution method based on customer position information
CN102355730A (en) Frequency spectrum distribution method based on system revenue in cognitive radio
CN102595417A (en) Planning method and system for community resources
KR20140138878A (en) A method and apparatus for random access in a system wherein user equipment with different operating bandwidths coexist
CN101801000A (en) Secondary user access method for maximization of capacity of dynamic spectrum sharing system
CN106211334A (en) The distribution of arrowband, the acquisition methods of narrowband assignments and device
CN102802269B (en) Method, device and system for processing scheduling information
CN106922018B (en) Positioning method and device
CN108370569A (en) The communication resource distribution of telecommunication network
Zhang et al. Opportunistic spectrum scheduling for mobile cognitive radio networks in white space
CN102347919A (en) Blind detection method
CN108347769A (en) The indicating means and device of frequency domain position
Jiang et al. Efficient spectrum utilization on TV band for cognitive radio based high speed vehicle network
CN102572850A (en) Spectrum allocation method based on operating state switching of authorized user in cognitive radio
CN102647721A (en) Method for aggregating static spectrums in cognitive radio
EP2785126A1 (en) Baseband resource allocation method and device thereof
CN104640117A (en) Allocation method and device of frequency spectrum resources
CN103716845A (en) PCI distribution method and device
CN102572849A (en) Method for automatically planning mobile communication frequency based on combination of graph theory and genetic algorithm
CN102325381A (en) Radio spectrum access method for bullet trains
CN104065600A (en) Method and device for restraining interference between control channels
CN105379334B (en) The method and apparatus for dispatching shared frequency spectrum
CN103269519B (en) A kind of processing resource allocation method and system in centralized base station framework

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