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

Radio spectrum access method for bullet trains Download PDF

Info

Publication number
CN102325381B
CN102325381B CN201110266158.XA CN201110266158A CN102325381B CN 102325381 B CN102325381 B CN 102325381B CN 201110266158 A CN201110266158 A CN 201110266158A CN 102325381 B CN102325381 B CN 102325381B
Authority
CN
China
Prior art keywords
bullet train
channel
bullet
represent
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.)
Active
Application number
CN201110266158.XA
Other languages
Chinese (zh)
Other versions
CN102325381A (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 radio spectrum access method for bullet trains
Technical field
The wireless frequency spectrum access technology that the invention belongs to wireless communication technology field, is specifically related to a kind of radio spectrum access method for bullet trains.
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 bullet train will need more broadband radio multi-media service, and therefore, broadband wireless communication technique will be one of indispensable technology of bullet train.But it is the deficient problem of frequency spectrum resource that the broadband wireless communications based on bullet train is faced with a stern challenge.In the last few years, it is found that the availability of frequency spectrum of television channel was very low, and consider, in the situation that not affecting TV user, to utilize idle television channel to carry out access communications.In order TV user not to be produced and to be disturbed, bullet train can only access the channel that TV user does not use.And, between different bullet trains, can not produce interference.If the access television channel that multiple bullet trains are random, not only can not ensure not affect TV user, also can have a strong impact on the utilance of idle channel.So, how to dispatch multiple bullet trains and access suitable idle channel, thereby improve idle channel utilance, be a very important problem.At present, also do not have scheduling high-speed train to access the method for suitable idle frequency spectrum.
Summary of the invention
The invention provides a kind of radio spectrum access method for bullet trains that utilizes idle television channel, in the situation that not affecting TV user, realized the wireless communication of bullet train, and can significantly improve idle television spectrum utilance.
A kind of radio spectrum access method for bullet trains, carries out time slot division by call duration time, and target band is carried out to channel distribution, comprises the steps:
(1) initialization step: the geographical position coordinates of current time slots self and spectrum requirement are sent to bullet train base station by each bullet train, the geographical position coordinates of self and busy channel are sent to bullet train base station by each television tower;
(2) calculate available channel list step: bullet train base station is according to the geographical position coordinates of the geographical position coordinates of each bullet train and each television tower and busy channel, at the busy channel that ensures to determine under the not disturbed condition of television tower the spendable television tower of each bullet train;
(3) judge that bullet train disturbs step: bullet train base station is according to the geographical position coordinates of each bullet train, judge that spacing is less than between any two bullet trains of secure communication distance to have potential interference;
(4) channel assignment step: bullet train base station is carried out available channel distribution according to the usable spectrum list of each bullet train to each bullet train, obtain multiple bullet train channel allocation combinations, will wherein exist two bullet trains to be assigned with same frequency range and have the bullet train channel allocation combination of potential interference to reject between the two, that in the bullet train channel allocation combination after rejecting, selects number of channel summation maximum that all bullet trains are assigned with is combined as optimum channel allocation result;
(5) communication steps: optimum channel allocation result is sent to each bullet train by bullet train base station, the channel that each bullet train utilizes optimum channel allocation result to specify in current time slots communicates.
The present invention is according to the geographical position of bullet train, spectrum requirement, and the geographical position of television tower and the channel using, and accesses idle television channel at each time slot with optimal scheduling matrix scheduling high-speed train.Compared with the method that accesses at random idle television channel with bullet train, the present invention can improve idle television spectrum utilance.Under concrete given Parameter Conditions, the availability of frequency spectrum of random device reaches 51.667%, the optimal scheduling vector that utilizes the present invention to solve, and the availability of frequency spectrum reaches 93.333%, and the availability of frequency spectrum has improved approximately 42%; Effectively improve idle television spectrum utilance.
Brief description of the drawings
Fig. 1 is system block diagram of the present invention;
Fig. 2 is the present invention
Figure BDA0000090059070000021
the flow chart of solution procedure.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is further described:
As shown in Figure 1, the present invention includes initialization step, calculate available channel list step, calculate bullet train phase mutual interference step and calculate optimal scheduling matrix step.
Call duration time is divided into time slot by the present invention, and target band is on average divided into N channel, and General N is 1～1000000, comprises the steps:
One. initialization step: the geographical position coordinates of current time slots self, spectrum requirement are sent to bullet train base station by each bullet train.Self geographical position coordinate, self busy channel are sent to bullet train base station by each television tower.
Two. calculate available channel list step: bullet train base station according to each bullet train by the geographical position coordinates of current time slots self, movement velocity and direction, and each television tower is by self geographical position coordinate, self busy channel, calculate respectively the channel list that can be used by each bullet train, computational methods are as follows: make m represent wherein any one bullet train, n represents wherein any one channel,
Figure BDA0000090059070000031
Wherein,
Figure BDA0000090059070000032
represent that bullet train m can use channel n,
Figure BDA0000090059070000033
represent that bullet train m cannot use channel n,
Figure BDA0000090059070000034
represent television tower P lcommunication radius,
Figure BDA0000090059070000035
represent television tower P lperceived radius, represent the interference radius of bullet train,
Figure BDA0000090059070000037
represent television tower P lwith the beeline of bullet train m in current time slots, represent to use the television tower set of channel n.
Three. calculate bullet train phase mutual interference step: bullet train base station by the geographical position coordinates of current time slots self, movement velocity and direction, calculates between any two bullet trains whether have interference according to each bullet train, and computational methods are as follows:
Figure BDA0000090059070000039
Wherein,
Figure BDA00000900590700000310
represent bullet train m iand m jif use identical channel in current time slots, just likely phase mutual interference.
Figure BDA00000900590700000311
represent bullet train m iand m jimpossible phase mutual interference in current time slots,
Figure BDA00000900590700000312
represent bullet train m jcommunication radius,
Figure BDA00000900590700000313
represent bullet train m iinterference radius,
Figure BDA0000090059070000041
represent bullet train m iand m jbeeline in current time slots.
Four. calculate optimal scheduling matrix step:
To meet formula
Figure BDA0000090059070000042
and constraints and
Figure BDA0000090059070000044
and
Figure BDA0000090059070000045
dispatch matrix δ be designated as optimal scheduling matrix delta *, i.e. optimum channel allocation result, wherein,
Figure BDA0000090059070000046
for the capable n column element of m of dispatch matrix δ,
Figure BDA0000090059070000047
represent that bullet train m is assigned with channel n,
Figure BDA0000090059070000048
represent that bullet train m is not assigned with channel n, M is bullet train number, and N is television channel number, A mrepresent the channel demands of bullet train m.
Figure BDA0000090059070000049
solution procedure as follows:
(41) to the grouping of each bullet train, wherein the bullet train in arbitrary group not can with other one group in bullet train there is potential interference:
The first step: train groups sequence number s is initialized as to s=1.Set up matrix F, its m irow m jcolumn element is F (m i, m j), work as m i< m jtime,
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, proceeds to the 3rd step, otherwise, proceed to the 6th step;
The 3rd step: by the m at this nonzero element place irow and m jrow cover with straight line respectively, and by bullet train m iand m jput into train groups s (bullet train does not repeat to put into set), by 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, proceed to second step, otherwise, proceed to the 5th step;
The 5th step: by the m ' of the each nonzero element being covered by straight line irow and m ' jrow cover with straight line respectively, and by bullet train m ' iand m ' jput into train groups s (bullet train does not repeat to put into set), by this nonzero element vanishing, proceed to the 4th step;
The 6th step: divide complete.
(42) respectively each group bullet train is built to combined tree in the following manner:
(421) one group of bullet train is carried out to spectrum allocation may, obtain multiple dispatch matrix δ of this group bullet train, the capable n column element of m of δ
Figure BDA0000090059070000051
represent that bullet train m is assigned with channel n,
Figure BDA0000090059070000052
represent that bullet train m is not assigned with channel n,
Figure BDA0000090059070000053
be numbered (m-1) N+n;
(422), for any one dispatch matrix, the numbering of the element that is 1 by element value is arranged from small to large and is formed a sequence;
(423) set structure taking sequence as tree node, the sequent prime number of the child node in tree is than the sequent prime number of father node large 1, and this element value having more is greater than all element values of father node, all child nodes of a father node according to the element value having more from small to large, are from left to right arranged in order in tree;
(43) respectively every group of bullet train searched for to 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 traversal to meeting constraints
Figure BDA0000090059070000054
and and
Figure BDA0000090059070000056
node, calculate according to the dispatch matrix of this node m ' is the train number of this group bullet train, to not meeting constraints
Figure BDA0000090059070000058
and
Figure BDA0000090059070000059
and
Figure BDA00000900590700000510
node, itself and all child nodes thereof are done to reject operation; Find out maximum dispatch matrix corresponding to node of value is designated as the optimal scheduling matrix of this group bullet train;
(45) the optimal scheduling matrix of each group of bullet train is combined to the optimal scheduling matrix delta that obtains all bullet trains *.
Each bullet train communicates according to optimal scheduling matrix access channel, enters next time slot, goes to step one.

Claims (1)

1. a radio spectrum access method for bullet trains, carries out time slot division by call duration time, and target band is carried out to channel distribution, and the method comprises the steps:
(1) initialization step: the geographical position coordinates of current time slots self and spectrum requirement are sent to bullet train base station by each bullet train, the geographical position coordinates of self and busy channel are sent to bullet train base station by each television tower;
(2) calculate available channel step: bullet train base station is according to the geographical position coordinates of the geographical position coordinates of each bullet train and each television tower and busy channel, at the busy channel that ensures to determine under the not disturbed condition of television tower the spendable television tower of each bullet train;
(3) judge that bullet train disturbs step: bullet train base station is according to the geographical position coordinates of each bullet train, judge that spacing is less than between any two bullet trains of secure communication distance to have potential interference;
(4) channel assignment step: bullet train base station is carried out available channel distribution according to the usable spectrum list of each bullet train to each bullet train, obtain multiple bullet train channel allocation combinations, will wherein exist two bullet trains to be assigned with same frequency range and exist the bullet train channel allocation combination of potential interference to reject between the two, the combination of selecting afterwards the number of channel summation maximum that all bullet trains are assigned with in remaining bullet train channel allocation combination in rejecting is as optimum channel allocation result;
(5) communication steps: optimum channel allocation result is sent to each bullet train by bullet train base station, it is that the channel of its appointment communicates that each bullet train utilizes optimum channel allocation result in current time slots;
Available channel computational methods in described step (2) are:
Figure FDA0000452533370000011
Wherein,
Figure FDA0000452533370000012
represent that bullet train m can use channel n,
Figure FDA0000452533370000013
represent that bullet train m cannot use channel n,
Figure FDA0000452533370000014
represent television tower P lcommunication radius,
Figure FDA0000452533370000015
represent television tower P lperceived radius,
Figure FDA0000452533370000016
represent the interference radius of bullet train,
Figure FDA0000452533370000017
be illustrated in television tower P in current time slots land beeline between bullet train m,
Figure FDA0000452533370000021
represent the television tower set of busy channel n;
Described step (3) judge bullet train disturb concrete grammar as:
Figure FDA0000452533370000022
Wherein,
Figure FDA0000452533370000023
represent bullet train m iand m jif use identical channel in current time slots, just there is potential interference,
Figure FDA0000452533370000024
represent bullet train m iand m jin current time slots, there is not potential interference,
Figure FDA0000452533370000025
represent bullet train m jcommunication radius, represent bullet train m iinterference radius,
Figure FDA0000452533370000027
be illustrated in bullet train m in current time slots iand m jbetween beeline;
Described step (4) is specially:
(41) bullet train grouping:
To the grouping of each bullet train, wherein the bullet train in arbitrary group not can with other one group in bullet train there is potential interference;
(42) respectively each group bullet train is built to combined tree in the following manner:
(421) one group of bullet train is carried out to spectrum allocation may, obtain multiple dispatch matrix δ of this group bullet train, the capable n column element of m of δ
Figure FDA0000452533370000028
represent that bullet train m is assigned with channel n,
Figure FDA0000452533370000029
represent that bullet train m is not assigned with channel n,
Figure FDA00004525333700000210
be numbered (m-1) N+n;
(422), for any one dispatch matrix, the numbering of the element that is 1 by element value is arranged from small to large and is formed a sequence;
(423) set structure taking sequence as tree node, the sequent prime number of the child node in tree is than the sequent prime number of father node large 1, and this element value having more is greater than all element values of father node, all child nodes of a father node according to the element value having more from small to large, are from left to right arranged in order in tree;
(43) respectively every group of bullet train searched for to 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 traversal to meeting constraints and
Figure FDA00004525333700000310
and node, calculate according to the dispatch matrix of this node
Figure FDA0000452533370000033
m ' is the train number of this group bullet train, to not meeting constraints
Figure FDA0000452533370000034
and
Figure FDA00004525333700000312
and
Figure FDA00004525333700000313
node, itself and all child nodes thereof are done to reject operation; Find out
Figure FDA0000452533370000036
maximum dispatch matrix corresponding to node of value is designated as the optimal scheduling matrix of this group bullet train;
Figure FDA0000452533370000037
for the capable n column element of m of dispatch matrix δ,
Figure FDA0000452533370000038
represent that bullet train m is assigned with channel n,
Figure FDA0000452533370000039
represent that bullet train m is not assigned with channel n, M is bullet train number, and N is television channel number, A mrepresent the channel demands of bullet train m,
(44) the optimal scheduling matrix of each group of bullet train is combined to the optimal scheduling matrix delta that obtains all bullet trains *, be optimum channel allocation result.
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 CN102325381A (en) 2012-01-18
CN102325381B true 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
CN102325381A (en) 2012-01-18

Similar Documents

Publication Publication Date Title
CN107276660B (en) Resource allocation methods and device in non-orthogonal multiple air-ground coordination communication system
CN104393972B (en) A kind of extensive mimo system pilot distribution method based on customer position information
CN103533529B (en) A kind of method of resource multiplex improving D2D system energy efficiency and system
CN102355730A (en) Frequency spectrum distribution method based on system revenue in cognitive radio
Zhang et al. Opportunistic spectrum scheduling for mobile cognitive radio networks in white space
CN103634799B (en) Cognitive radio system-based spectrum allocation method and equipment
CN106060943B (en) A kind of accidental access method of multi-aerial radio communication system
CN108370569A (en) The communication resource distribution of telecommunication network
CN107005996B (en) A kind of terminal, base station and data transmission method
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
CN104640117A (en) Allocation method and device of frequency spectrum resources
CN103024913B (en) Method for direct-through self-adaptive grouping and resource allocating of cellular communication system terminals
CN102572849A (en) Method for automatically planning mobile communication frequency based on combination of graph theory and genetic algorithm
CN102325381B (en) Radio spectrum access method for bullet trains
CN103269519B (en) A kind of processing resource allocation method and system in centralized base station framework
CN106788937B (en) A kind of pilot distribution method for taking into account fairness between Massive mimo system overall performance and user
CN109275163A (en) A kind of non-orthogonal multiple access joint bandwidth and method of rate allocation based on structuring sequencing feature
Sheng et al. Spectrum allocation algorithm aware spectrum aggregation in cognitive radio networks
CN103188809A (en) Free duplex communication system and channel allocation method thereof
Foukalas et al. Cross-layer design of csma/ca with spectrum sensing for cognitive radio networks
CN107347220B (en) User scheduling method and device in non-orthogonal multiple air-ground coordination communication system
CN105979591A (en) Optimal user scheduling method based on minimum effective SINR under low-power-consumption large-connection scene
CN102123424B (en) Method for selecting number of reserved sub-channels in IEEE 802.22 network

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