CN102325381B - Radio spectrum access method for bullet trains - Google Patents
Radio spectrum access method for bullet trains Download PDFInfo
- 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
- speed
- speed train
- channel
- trains
- 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
Links
- 238000001228 spectrum Methods 0.000 title claims abstract description 30
- 238000000034 method Methods 0.000 title claims abstract description 17
- 238000004891 communication Methods 0.000 claims abstract description 20
- 239000011159 matrix material Substances 0.000 claims description 21
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000008030 elimination Effects 0.000 claims description 2
- 238000003379 elimination reaction Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
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
Technical Field
The invention belongs to a wireless spectrum access technology in the technical field of wireless communication, and particularly relates to a wireless spectrum access method for a high-speed train.
Background
High speed trains, for example: airplanes, and high speed trains, will play an increasingly important role in people's lives. Passengers on a high-speed train will need more broadband wireless multimedia services, and thus, broadband wireless communication technology will be one of the requisite technologies for high-speed trains. However, broadband wireless communication based on high-speed trains faces a serious challenge of poor spectrum resources. In recent years, it has been found that the spectrum utilization of television channels is low, and it is considered that access communication is performed using a free television channel without affecting television users. In order not to interfere with the television subscribers, the high-speed train can only access channels that are not used by the current television subscribers. Moreover, interference cannot be generated among different high-speed trains. If a plurality of high-speed trains are randomly accessed to the television channel, not only can no guarantee not to influence television users, but also the utilization rate of idle channels is seriously influenced. Therefore, how to schedule a plurality of high-speed trains to access a proper idle channel so as to improve the utilization rate of the idle channel is an important problem. At present, no method for scheduling the high-speed train to access the proper idle frequency spectrum exists.
Disclosure of Invention
The invention provides a high-speed train wireless spectrum access method by using an idle television channel, which realizes wireless network communication of a high-speed train without influencing television users and can obviously improve the utilization rate of the idle television spectrum.
A high-speed train wireless spectrum access method divides communication time into time slots and divides a target frequency band into channels, and comprises the following steps:
(1) an initialization step: each high-speed train sends the geographical position coordinate and the frequency spectrum requirement of the current time slot to a high-speed train base station, and each television tower sends the geographical position coordinate and the occupied channel of the television tower to the high-speed train base station;
(2) calculating an available channel list: the high-speed train base station determines the occupied channel of the television tower which can be used by each high-speed train under the condition of ensuring that the television tower is not interfered according to the geographical position coordinates of each high-speed train and the geographical position coordinates and occupied channels of each television tower;
(3) and judging the interference of the high-speed train: the high-speed train base station judges that potential interference exists between any two high-speed trains with the distance smaller than the safe communication distance according to the geographical position coordinates of each high-speed train;
(4) and a channel allocation step: the high-speed train base station distributes available channels to the high-speed trains according to the available frequency spectrum list of the high-speed trains to obtain a plurality of high-speed train channel distribution combinations, the high-speed train channel distribution combinations which have two high-speed trains distributed to the same frequency band and potential interference between the two high-speed trains are removed, and the combination with the maximum sum of the distributed channels of all the high-speed trains is selected as the optimal channel distribution result from the removed high-speed train channel distribution combinations;
(5) communication step: and the high-speed train base station sends the optimal channel allocation result to each high-speed train, and each high-speed train utilizes the channel specified by the optimal channel allocation result to carry out communication in the current time slot.
According to the geographical position and the frequency spectrum requirement of the high-speed train, the geographical position of the television tower and the used channel, the high-speed train is scheduled to access the idle television channel by the optimal scheduling matrix in each time slot. Compared with the method for randomly accessing the idle television channel by the high-speed train, the method can improve the utilization rate of the idle television frequency spectrum. Under the specific given parameter condition, the frequency spectrum utilization rate of the random method reaches 51.667%, the optimal scheduling vector solved by the method is utilized, the frequency spectrum utilization rate reaches 93.333%, and the frequency spectrum utilization rate is improved by about 42%; the utilization rate of the idle television frequency spectrum is effectively improved.
Drawings
FIG. 1 is a block diagram of the system of the present invention;
FIG. 2 is a drawing of the present invention
Is used for solving the problem.
Detailed Description
The invention is further described with reference to the following figures and detailed description:
as shown in fig. 1, the method comprises an initialization step, a step of calculating an available channel list, a step of calculating the mutual interference of high-speed trains and a step of calculating an optimal scheduling matrix.
The invention divides the communication time into time slots, equally divides the target frequency band into N channels, wherein N is 1-1000000, and comprises the following steps:
firstly, an initialization step: and each high-speed train sends the geographic position coordinates and the frequency spectrum requirements of the current time slot to the high-speed train base station. And each television tower sends the geographic position coordinates and the occupied channel thereof to the high-speed train base station.
Secondly, calculating an available channel list: the high-speed train base station respectively calculates a channel list which can be used by each high-speed train according to the geographical position coordinate, the movement speed and the direction of each high-speed train per se of the current time slot, the geographical position coordinate of each television tower per se and the occupied channel per se, and the calculation method is as follows: let m denote any one of the high-speed trains, and n denote any one of the channels, then
Wherein,
indicating that the high speed train m can use the channel n,
indicating that the high speed train m cannot use the channel n,
representing a television tower PlThe radius of communication of (a) is,
representing a television tower PlThe radius of the sensor to be sensed,the radius of disturbance of the high-speed train is indicated,
representing a television tower PlAnd the shortest distance of the high-speed train m in the current time slot,representing a set of tv towers using channel n.
Thirdly, calculating the mutual interference of the high-speed trains: the high-speed train base station calculates whether interference exists between any two high-speed trains according to the geographical position coordinates, the movement speed and the direction of each high-speed train in the current time slot, and the calculation method comprises the following steps:
wherein,
indicating high-speed train miAnd mjIf the same channel is used in the current time slot, there is a possibility of mutual interference.
Indicating high-speed train miAnd mjThere is no possibility of mutual interference in the current time slot,
indicating high-speed train mjThe radius of communication of (a) is,
indicating high-speed train miThe radius of interference of (a) is,
indicating high-speed train miAnd mjThe shortest distance within the current time slot.
Fourthly, calculating an optimal scheduling matrix:
will satisfy the formula
And constraint conditionsAnd is
And is
The scheduling matrix delta is recorded as the optimal scheduling matrix delta*I.e., the best channel allocation result, wherein,
to schedule the mth row and nth column elements of matrix delta,
indicating that the high speed train m is assigned a channel n,
the high-speed train M is not allocated with the channel N, M is the number of the high-speed trains, N is the number of the television channels, AmRepresenting the channel requirements of the high speed train m.
(41) grouping high speed trains, wherein the high speed trains in any one group do not have potential interference with the high speed trains in the other group:
the first step is as follows: the train set number s is initialized to s 1. Establishing a matrix F, the mth of whichiLine mjColumn element is F (m)i，mj) When m isi＜mjWhen the temperature of the water is higher than the set temperature,
otherwise F (m)i，mj)＝0；
The second step is that: from left to right, from top to bottom, searching the first non-zero element of F, if the element can be found, turning to the third step, otherwise, turning to the sixth step;
the third step: m-th element of the non-zero elementiRow and mjColumn by columnCovered with straight line and put high-speed train miAnd mjPlacing a train set s (high speed trains are not repeatedly placed into the set), and changing the non-zero element into zero;
the fourth step: if no non-zero element exists under the linear coverage, increasing the value of s by 1, and turning to the second step, otherwise, turning to the fifth step;
the fifth step: m 'of each non-zero element to be linearly covered'iLine and m'jThe lines are respectively covered with straight lines, and m 'of the high-speed train is formed'iAnd m'jPutting the train set s (the high-speed train is not repeatedly put into the set), changing the non-zero element into zero, and turning to the fourth step;
and a sixth step: and finishing the division.
(42) And respectively constructing a combined tree for each group of high-speed trains according to the following modes:
(421) carrying out frequency spectrum allocation on a group of high-speed trains to obtain the nth row element and the mth column element of a plurality of scheduling matrixes delta, delta of the group of high-speed trains
Indicating that the high speed train m is assigned a channel n,
indicating that the high speed train m is not assigned a channel n,
the number of (m-1) N + N;
(422) for any scheduling matrix, arranging the numbers of elements with the element values of 1 from small to large to form a sequence;
(423) taking the sequence as a tree node to construct a tree, wherein the sequence element number of a child node in the tree is 1 greater than that of a parent node, the added element value is greater than all element values of the parent node, and all child nodes of one parent node are sequentially arranged in the tree from left to right according to the added element values from small to large;
(43) searching an optimal scheduling matrix for each group of high-speed trains according to the following modes: traversing the tree from the root node of the tree corresponding to a group of high-speed trains according to the breadth-first search or depth-first principle, wherein the trees meet the constraint conditions in the traversal
And isAnd is
According to the scheduling matrix of the nodeM' is the number of trains of the group of high-speed trains, and the constraint condition is not met
And is
And is
The node (2) is subjected to elimination operation on the node (2) and all child nodes thereof; find outThe scheduling matrix corresponding to the node with the maximum value is recorded as the optimal scheduling matrix of the high-speed train;
(45) combining the optimal scheduling matrixes of all groups of high-speed trains to obtain the optimal scheduling matrix delta of all high-speed trains*。
And (5) each high-speed train accesses the channel to communicate according to the optimal scheduling matrix, enters the next time slot, and then turns to the step one.
Claims (1)
1. A wireless spectrum access method for a high-speed train divides communication time into time slots and divides a target frequency band into channels, and comprises the following steps:
(1) an initialization step: each high-speed train sends the geographical position coordinate and the frequency spectrum requirement of the current time slot to a high-speed train base station, and each television tower sends the geographical position coordinate and the occupied channel of the television tower to the high-speed train base station;
(2) calculating available channels: the high-speed train base station determines the occupied channel of the television tower which can be used by each high-speed train under the condition of ensuring that the television tower is not interfered according to the geographical position coordinates of each high-speed train and the geographical position coordinates and occupied channels of each television tower;
(3) and judging the interference of the high-speed train: the high-speed train base station judges that potential interference exists between any two high-speed trains with the distance smaller than the safe communication distance according to the geographical position coordinates of each high-speed train;
(4) and a channel allocation step: the high-speed train base station distributes available channels to the high-speed trains according to the available frequency spectrum list of the high-speed trains to obtain a plurality of high-speed train channel distribution combinations, the high-speed train channel distribution combinations which have two high-speed trains distributed to the same frequency band and potential interference between the two high-speed trains are removed, and the combination with the maximum sum of the distributed channels of all the high-speed trains is selected from the remaining high-speed train channel distribution combinations after the removal as the optimal channel distribution result;
(5) communication step: the high-speed train base station sends the optimal channel allocation result to each high-speed train, and each high-speed train utilizes the optimal channel allocation result to perform communication for the appointed channel in the current time slot;
the available channel calculation method in the step (2) comprises the following steps:
wherein,
indicating that the high speed train m can use the channel n,
indicating that the high speed train m cannot use the channel n,
representing a television tower PlThe radius of communication of (a) is,
representing a television tower PlThe radius of the sensor to be sensed,
the radius of disturbance of the high-speed train is indicated,
indicating the television tower P in the current time slotlAnd the shortest distance between the high-speed train m,
a set of tv towers representing occupied channel n;
the specific method for judging the high-speed train interference in the step (3) is as follows:
wherein,
indicating high-speed train miAnd mjIf the same channel is used in the current time slot, there is potential interference,
indicating high-speed train miAnd mjThere is no potential interference in the current time slot,
indicating high-speed train mjThe radius of communication of (a) is,indicating high-speed train miThe radius of interference of (a) is,
indicating high-speed train m in current time slotiAnd mjThe shortest distance therebetween;
the step (4) is specifically as follows:
(41) grouping high-speed trains:
grouping high-speed trains, wherein the high-speed trains in any group do not have potential interference with the high-speed trains in the other group;
(42) and respectively constructing a combined tree for each group of high-speed trains according to the following modes:
(421) carrying out frequency spectrum allocation on a group of high-speed trains to obtain the nth row element and the mth column element of a plurality of scheduling matrixes delta, delta of the group of high-speed trains
Indicating that the high speed train m is assigned a channel n,
indicating that the high speed train m is not assigned a channel n,
the number of (m-1) N + N;
(422) for any scheduling matrix, arranging the numbers of elements with the element values of 1 from small to large to form a sequence;
(423) taking the sequence as a tree node to construct a tree, wherein the sequence element number of a child node in the tree is 1 greater than that of a parent node, the added element value is greater than all element values of the parent node, and all child nodes of one parent node are sequentially arranged in the tree from left to right according to the added element values from small to large;
(43) searching an optimal scheduling matrix for each group of high-speed trains according to the following modes: traversing the tree from the root node of the tree corresponding to a group of high-speed trains according to the breadth-first search or depth-first principle, wherein the trees meet the constraint conditions in the traversalAnd is
And isAccording to the scheduling matrix of the node
M' is the number of trains of the group of high-speed trains, and the constraint condition is not met
And is
And is
The node (2) is subjected to elimination operation on the node (2) and all child nodes thereof; find out
The scheduling matrix corresponding to the node with the maximum value is recorded as the optimal scheduling matrix of the high-speed train;
to schedule the mth row and nth column elements of matrix delta,
indicating that the high speed train m is assigned a channel n,
the high-speed train M is not allocated with the channel N, M is the number of the high-speed trains, N is the number of the television channels, AmIndicating the channel requirements of the high speed train m,
(44) combining the optimal scheduling matrixes of all groups of high-speed trains to obtain the optimal scheduling matrix delta of all high-speed trains*I.e. the best channel allocation result.
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)
| 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 |
-
2011
- 2011-09-08 CN CN201110266158.XA patent/CN102325381B/en active Active
Patent Citations (5)
| 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 |
|---|---|---|
| CN101980470B (en) | Chaotic particle swarm optimization-based OFDM system resource allocation algorithm | |
| CN107276660B (en) | Resource allocation methods and device in non-orthogonal multiple air-ground coordination communication system | |
| CN104662809B (en) | Method and system for adaptive channel estimation/predictive filter design | |
| CN104854935B (en) | Method and apparatus of the distributing equipment to the equipment communication resource | |
| CN109691050B (en) | Method, device and system for estimating frequency offset in OFDM system | |
| CN102355730A (en) | Frequency spectrum distribution method based on system revenue in cognitive radio | |
| CN108347769A (en) | The indicating means and device of frequency domain position | |
| CN107659973A (en) | Super-intensive network cluster dividing method based on density K means algorithms | |
| CN103716845B (en) | A kind of PCI distribution method and device | |
| CN103619066B (en) | Method for distributing downlink interference mitigation based on distributed channel | |
| CN104901732B (en) | A kind of pilot multiplex method in Dense nodes configuration system | |
| CN105163328B (en) | A kind of offsetting pilot position distribution method and device | |
| CN104581974B (en) | Dynamic base-station collaboration method based on orthogonal resource in super-intensive network | |
| CN102325381B (en) | Radio spectrum access method for bullet trains | |
| CN106817691B (en) | PCI (peripheral component interconnect) distribution method and device | |
| CN106793122A (en) | A kind of heterogeneous network minimizes Radio Resource safety distribution method per bit | |
| CN103269519B (en) | A kind of processing resource allocation method and system in centralized base station framework | |
| CN108259065B (en) | Method for improving random access channel capacity | |
| CN102740480B (en) | Method and device for interference suppression of paired users | |
| CN106788937B (en) | A kind of pilot distribution method for taking into account fairness between Massive mimo system overall performance and user | |
| CN107493606B (en) | A kind of the timesharing dispatching method and device of user terminal | |
| CN103701577B (en) | Suppress the pilot distribution method of pilot pollution in cloud wireless access network | |
| CN112073976B (en) | User general grouping method in non-orthogonal multiple access based on machine learning | |
| CN109831794B (en) | Base station clustering method based on density and minimum distance in ultra-dense network | |
| CN104883690B (en) | More interference simulations annealing channel allocation method and system based on priority |
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 |