CN109660981B - User scheduling method and device in high-speed rail mobile communication network - Google Patents
User scheduling method and device in high-speed rail mobile communication network Download PDFInfo
- Publication number
- CN109660981B CN109660981B CN201910114413.5A CN201910114413A CN109660981B CN 109660981 B CN109660981 B CN 109660981B CN 201910114413 A CN201910114413 A CN 201910114413A CN 109660981 B CN109660981 B CN 109660981B
- Authority
- CN
- China
- Prior art keywords
- train
- users
- time
- speed rail
- arrival time
- 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
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000010295 mobile communication Methods 0.000 title claims abstract description 42
- 230000003203 everyday effect Effects 0.000 claims abstract description 31
- 230000000737 periodic effect Effects 0.000 claims description 17
- 238000013508 migration Methods 0.000 claims description 12
- 230000005012 migration Effects 0.000 claims description 12
- 238000004891 communication Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 12
- 238000012544 monitoring process Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000012795 verification Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
- H04W8/183—Processing at user equipment or user record carrier
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/121—Wireless traffic scheduling for groups of terminals or users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
- H04W8/20—Transfer of user or subscriber data
- H04W8/205—Transfer to or from user equipment or user record carrier
Abstract
The application discloses a user scheduling method and device in a high-speed rail mobile communication network, relates to the field of wireless communication, and is used for ensuring reasonable resource scheduling and improving resource utilization rate when a user on a non-high-speed rail train in a high-speed rail private network migrates out of a high-speed rail private network cell. The method comprises the following steps: acquiring statistical information of the number of users in a high-speed rail private network cell; determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users; determining a train arrival time window according to the arrival time and the departure time of the train every day; and comparing the first user number with a user number threshold value, and if the first user number is larger than the user number threshold value, migrating the accessed users in the high-speed railway private network cell according to the train arrival time window. The embodiment of the application is applied to the scheduling of the users in the high-speed rail mobile communication network.
Description
Technical Field
The present application relates to the field of wireless communications, and in particular, to a method and an apparatus for scheduling users in a mobile communication network for a high-speed rail.
Background
In a current private network for a high speed railway (hereinafter referred to as a high speed railway), in order to ensure that a private network cell for the high speed railway serves users on a high speed railway train, generally, a user on the high speed railway train and a user on a non-high speed railway train are distinguished by monitoring doppler frequency offset of a user terminal or a moving speed of the user, and then the user on the non-high speed railway train is moved out of the private network cell for the high speed railway.
In the prior art, the doppler frequency offset of a user terminal or the moving speed of a user needs to be continuously monitored, and when no train passes through or system resources are sufficient, the user on a non-high-speed train can be continuously migrated out of a high-speed rail private network cell, so that the problems of resource waste and unreasonable resource scheduling exist in the prior art.
Disclosure of Invention
The embodiment of the application provides a user scheduling method and device in a high-speed rail mobile communication network, which are used for ensuring reasonable resource scheduling and improving resource utilization rate when a user on a non-high-speed rail train in a high-speed rail private network migrates out of a high-speed rail private network cell.
In order to achieve the above purpose, the embodiment of the present application adopts the following technical solutions:
in a first aspect, an embodiment of the present application provides a method for scheduling users in a high-speed rail mobile communication network, where the method includes:
acquiring statistical information of the number of users in a high-speed rail private network cell;
determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users;
determining a train arrival time window according to the arrival time and the departure time of the train every day;
comparing a first user number with a user number threshold value, and if the first user number is greater than the user number threshold value, migrating accessed users in the private network cell of the high-speed rail according to the train arrival time window, wherein the user number threshold value is obtained according to the statistical information of the user number and the wireless bandwidth required to be reserved; the first user number is the sum of the number of accessed users before the train arrives and the number of new accessed users after the train arrives in the high-speed railway private network cell.
In a second aspect, an embodiment of the present application provides a user scheduling apparatus in a high-speed rail mobile communication network, including:
the acquisition module is used for acquiring the statistical information of the number of users in the high-speed rail private network cell;
the determining module is used for determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users obtained by the obtaining module;
the determining module is further used for determining a train arrival time window according to the arrival time and the departure time of the train every day;
the migration module is used for comparing a first user number with a user number threshold value, and if the first user number is greater than the user number threshold value, migrating the accessed users in the high-speed railway private network cell according to the train arrival time window obtained by the determination module, wherein the user number threshold value is obtained according to the statistical information of the user number and the wireless bandwidth required to be reserved; the first user number is the sum of the number of accessed users before the train arrives and the number of new accessed users after the train arrives in the high-speed railway private network cell.
In a third aspect, there is provided a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer, cause the computer to perform the method for scheduling users in a high-speed rail mobile communication network according to the first aspect.
In a fourth aspect, there is provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the method for scheduling users in a high-speed rail mobile communication network according to the first aspect.
In a fifth aspect, an apparatus for scheduling users in a high-speed rail mobile communication network is provided, including: the processor calls the program stored in the memory to execute the user scheduling method in the high-speed rail mobile communication network.
The user scheduling method and device in the high-speed rail mobile communication network provided by the embodiment of the application can accurately obtain the arrival time and departure time of the train every day through the statistical information of the number of users in the high-speed rail private network cell, determine the arrival time window of the train according to the arrival time and the departure time of the train every day, before the train reaches the private network cell of the high-speed rail, the accessed user in the private network cell of the high-speed rail is migrated in advance, compared with the prior art, the method and the device can avoid continuous monitoring of the user terminal, and the application only moves the accessed users in the private network cell of the high-speed rail when the high-speed rail arrives and the number of users exceeds the threshold, thereby avoiding that the users on the non-high-speed rail train can be continuously moved out of the private network cell of the high-speed rail when no train passes or the system resource is sufficient, therefore, the method and the device can ensure reasonable resource scheduling and improve the resource utilization rate when the user on the non-high-speed train in the high-speed rail private network moves out of the high-speed rail private network cell.
Drawings
Fig. 1 is a schematic time window diagram of a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 2 is a first flowchart illustrating a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a second method for scheduling users in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 4 is a first schematic diagram illustrating distribution of second-level users in a cell of a high-speed rail private network according to an embodiment of the present application;
fig. 5 is a schematic diagram illustrating second-level user number distribution in a cell of a high-speed rail private network according to an embodiment of the present application;
fig. 6 is a schematic diagram of a single time window of a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 7 is a schematic diagram of a train arrival time window of a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 8 is a schematic diagram of user number processing provided in an embodiment of the present application;
fig. 9 is a third flowchart illustrating a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 10 is a fourth flowchart illustrating a user scheduling method in a high-speed rail mobile communication network according to an embodiment of the present application;
FIG. 11 is a schematic diagram of a conventional time window rectification provided in an embodiment of the present application;
FIG. 12 is a schematic diagram of a newly added time window provided by an embodiment of the present application;
FIG. 13 is a schematic diagram of an existing time window for deletion provided by an embodiment of the present application;
fig. 14 is a first schematic structural diagram of a user scheduling apparatus in a high-speed rail mobile communication network according to an embodiment of the present application;
fig. 15 is a schematic structural diagram of a user scheduling apparatus in a high-speed rail mobile communication network according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The network that the operator covers the high-speed rail generally adopts a private network coverage scheme, namely, stations or cells are independently built along the high-speed rail to cover the high-speed rail, and the areas outside the high-speed rail are mainly covered by other public network stations.
Because the wireless signals of the high-speed rail private network and other public networks are inevitably overlapped in a staggered way, users on non-high-speed rail trains around the high-speed rail line can also inevitably occupy wireless resources of the high-speed rail private network cell. Particularly, when a high-speed rail line passes through an urban area or an area with dense population, because a lot of users on nearby non-trains are accessed to a high-speed rail private network cell, a large amount of wireless resources of the high-speed rail private network cell are occupied, and when a high-speed rail train reaches the area, because the wireless resources are limited, the service of the users on the high-speed rail train is influenced, so that the actual perception of the users on the high-speed rail is influenced. Therefore, it is necessary to move the accessed users in the private network cell of the high-speed rail out of the private network cell of the high-speed rail before the high-speed rail arrives.
The main idea of the application scheme is to analyze the number of users in the private network cell of the high-speed rail, so as to obtain a time window when the train reaches the private network cell of the high-speed rail, dispatch the users accessed in the private network cell of the high-speed rail to other peripheral public network cells in advance before the train reaches the private network cell of the high-speed rail, and perform a dispatching recovery operation after the train passes through the cell, so as to allow the migrated users to return to the private network cell of the high-speed rail, as shown in fig. 1, the accessed users in the private network cell of the high-speed rail are migrated before the train reaches the start time of time W1, and the migrated users are allowed to return to the private network cell of the high-speed rail after the train reaches the end time of time W1, so as to ensure that the users on a non-high-speed rail train in the private network migrate the private network cell of the private network of the high-speed rail to reasonably dispatch and improve the resource utilization rate.
Examples 1,
An embodiment of the present application provides a user scheduling method in a high-speed rail mobile communication network, as shown in fig. 2, the method includes the following steps:
s101, obtaining statistical information of the number of users in the high-speed rail private network cell.
For example, the statistical information of the number of users in the private network cell for the high-speed rail may be obtained by obtaining the number of users in the second level per day in the private network cell for the high-speed rail 7 days or more than 4 weeks a week, so that the accuracy of the statistical information can be ensured.
And S102, determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users.
Specifically, as shown in fig. 3, the step S102 includes steps S1021 to S1022:
and S1021, obtaining the periodic impulse type distribution of the user number according to the statistical information of the user number.
For example, as shown in fig. 4 and 5, the distribution diagram of the number of users in the second class (24 hours) of the high-speed railway private network cell shows that the number of users in the second class (hour dimension) of the high-speed railway private network cell is very high when the train passes through the high-speed railway private network cell, the distribution is in a pulse mode, and the pulses repeatedly appear according to a certain time period.
And S1022, determining the time of starting to appear the pulse in the periodic pulse type distribution as the arrival time of the train every day, and determining the time of ending the pulse in the periodic pulse type distribution as the departure time of the train every day.
The time when the pulse begins to appear in the periodic pulse distribution is the time when the train enters the high-speed railway private network cell, and the time when the pulse ends in the periodic pulse distribution is the time when the train leaves the high-speed railway private network cell.
Illustratively, according to the periodic pulse distribution of the number of users of the ad hoc network cell in a week, a single time window is established for the arrival time of the train at the ad hoc network cell and the departure time of the train from the ad hoc network cell every day in the week, as shown in fig. 6.
S103, determining a train arrival time window according to the arrival time and the departure time of the train every day.
If the interval of the arrival time of the train per day is less than a first preset time and the interval of the departure time of the train per day is less than the first preset time, determining the earliest time of the arrival time of the train per day as the starting time of the arrival time window and determining the latest time of the departure time of the train per day as the ending time of the arrival time window.
For example, the first preset time is a guard time interval, and it can be known from the train operation schedule that, except for the case of meeting a train, there is a certain guard time interval between two trains, and the guard time is generally greater than 5 minutes.
Illustratively, as shown in fig. 7, after 4 weeks of data are collected, assume that there are 4 single arrival time windows around a time on "monday" in 4 weeks: A. b, C, D, the 4 individual arrival time windows are overlapping. If 4 individual arrival time windows overlap each other or are spaced less than 5 minutes apart, that is, the arrival time intervals of the 4 individual arrival time windows are less than 5 minutes, and the departure time intervals of the 4 individual arrival time windows are less than 5 minutes, the 4 individual arrival time windows can be regarded as individual arrival time windows of the same train at 4 weeks every monday, or can also be regarded as individual arrival time windows when different trains meet, the 4 individual arrival time windows are regarded as one large time window W, the start time of the time window W is the earliest time of arrival time in the 4 individual arrival time windows, that is, the arrival time of the time window a, and the end time of the time window W is the latest time of departure time in the 4 individual arrival time windows, that is, the departure time of the time window D.
S104, comparing the first user number with a user number threshold value, and if the first user number is larger than the user number threshold value, migrating accessed users in the private network cell of the high-speed rail according to a train arrival time window, wherein the user number threshold value is obtained according to statistical information of the user number and wireless bandwidth required to be reserved; the first user number is the sum of the number of accessed users before the arrival of the train in the high-speed rail private network cell and the number of new accessed users after the arrival of the train.
Illustratively, when the sum of the number of users on the non-high-speed train and the number of users on the high-speed train in the high-speed rail private network cell exceeds the capacity limit of the high-speed rail private network cell, the service generated by the users is actually influenced, so a user number threshold value N is set, and when the number of users exceeds the threshold value, the user on the non-high-speed rail train is considered to be migrated and scheduled. To simplify the calculation, the second-level user volume data of each day is structured: and taking the number of users higher than the threshold value N as a peak value of one-time effective high-load users, namely, the arrival time point of the high-speed train with a large number of users is lower than the threshold value N, and performing zero return processing. After the accurate time points of arrival of trains with a large number of users are obtained, the arrival time window W of each effective train can be calculated, as shown in fig. 8, the left side is the number of users in second class, and the right side is the time window of arrival of high-speed rails with a large number of users after processing.
And if the first number of users is larger than the threshold value of the number of users, migrating the accessed users in the private cell of the high-speed rail before the starting time of the train arrival time window so as to reserve resources for the users on the high-speed rail train to arrive.
And after the ending time of the train arrival time window, allowing the migrated users in the private network cell of the high-speed rail to migrate into the private network cell of the high-speed rail, thereby achieving the purposes of reasonably scheduling resources and improving the utilization rate.
Specifically, as shown in fig. 9, the method further includes:
and S105, verifying and correcting the train arrival time window according to the statistical information of the number of the users in the high-speed rail private network cell.
Specifically, as shown in fig. 10, the step S105 includes steps S1051 to S1053:
s1051, regularly obtaining the statistical information of the number of users in the high-speed rail private network cell to obtain a new train arrival time window.
This step is the same as steps S101-S103 described above and will not be repeated here.
And S1052, matching and checking the new train arrival time window and the existing train arrival time window.
And S1053, correcting the existing train arrival time window according to the matching check result.
If a new train arrival time window appears near the existing train arrival time window, no pulse is detected in the existing train arrival time window, the starting time of the new train arrival time window and the starting time of the existing train arrival time window are smaller than a first preset time, and the ending time of the new train arrival time window and the ending time of the existing train arrival time window are smaller than the first preset time, which indicates that the train arrival time window is deviated due to the change of the train operation time, the existing train arrival time window is transferred to the new train arrival time window.
For example, as shown in fig. 11, a new user amount pulse appears near an existing time window W, no pulse appears in the existing time window W, and a time interval between the new pulse and the existing time window W is less than the train interval guard time (5 minutes), which indicates that the existing time window W may be shifted due to a change in train operation time, and at this time, the existing time window W is shifted to a time when the new pulse appears for correction.
If a new train arrival time window appears near the existing train arrival time window, the existing train arrival time window still detects that pulses still appear, the starting time of the new train arrival time window and the starting time of the existing train arrival time window are larger than the first preset time, and the ending time of the new train arrival time window and the ending time of the existing train arrival time window are larger than the first preset time, the situation that the new train arrival time window appears is indicated, and then the train arrival time window is increased.
Illustratively, as shown in fig. 12, the time interval between the new user volume pulse appearing near the existing time window W and the existing time window W exceeds the train protection interval time (5 minutes), and the user pulse still appears in the existing time window W, which indicates that a new time window appears, and the time window is newly added at the time when the new user volume pulse appears.
And if the new train arrival time window is overlapped with the existing train arrival time window, and the sum of the number of the accessed users before the arrival of the train in the new train arrival time window and the number of the newly accessed users after the arrival of the train is smaller than the user number threshold value, indicating that the existing train arrival time window is invalid, deleting the existing train arrival time window. In order to avoid the false deletion, the continuous monitoring needs to be carried out for a long enough time (for example, more than 4 weeks), and if the sum of the number of accessed users before the arrival of the train and the number of newly accessed users after the arrival of the train in the monitoring period is still less than the threshold value of the number of users, the arrival time window of the invalid train can be deleted.
For example, as shown in fig. 13, if the total number of users (i.e., the sum of the number of users on the train and the number of users on the non-train) in the existing time window W has not reached the threshold value N, which results in the failure of the existing time window W, the existing time window is removed.
The method carries out effect prediction on the scheme according to the effect of the existing user migration method, evaluates the number of users in the second level of a single cell, and acquires 7535 sampling points and 76 average users, wherein 225 pulses which accord with the characteristics account for 3%.
The load of a high-speed rail private network cell is obviously reduced after users on a non-high-speed rail train are migrated out of the high-speed rail private network cell by the conventional user migration method, but the users are lost, the average value of the total number of users per hour of 2 carrier frequencies is reduced by 8, and the reduction amplitude is 10.4%. According to the scheme, after the equivalent prepositions and delays are added before and after the pulse, the pulse window period accounts for about 10% of the total time, if the adjustment is only carried out on the window period, the free state of the user is kept in the rest time, the influence on the average number of users is reduced to 10% of the existing method, namely the total number of users per hour is reduced by 0.8, and compared with the existing user migration method, the efficiency of the scheme is improved by (76-0.8)/(76-8) -1 to 10.6%. Compared with the prior user migration method, the influence on the number of average users is reduced, and the user adjustment is only carried out in the window period, so that the situation that the users on non-high-speed trains are continuously migrated out of the high-speed railway private network cell when no train passes through or the system resources are sufficient is avoided, and the resource utilization rate is improved.
The user scheduling method in the high-speed rail mobile communication network provided by the embodiment of the application can accurately obtain the arrival time and the departure time of the train every day through the statistical information of the number of users in the high-speed rail private network cell, determines the arrival time window of the train according to the arrival time and the departure time of the train every day, before the train arrives at the cell, the accessed user in the cell covering the high-speed rail private network is migrated in advance, compared with the prior art, the method and the device can avoid continuous monitoring of the user terminal, and the application only moves the accessed users in the private network cell of the high-speed rail when the high-speed rail arrives and the number of users exceeds the threshold, thereby avoiding that the users on the non-high-speed rail train can be continuously moved out of the private network cell of the high-speed rail when no train passes or the system resource is sufficient, therefore, the method and the device can ensure reasonable resource scheduling and improve the resource utilization rate when the user on the non-high-speed train in the high-speed rail private network moves out of the high-speed rail private network cell.
Examples 2,
An embodiment of the present application provides a user scheduling apparatus in a high-speed rail mobile communication network, as shown in fig. 14, where the user scheduling apparatus 20 includes: an acquisition module 21, a determination module 22, and a migration module 23.
An obtaining module 21, configured to obtain statistical information of the number of users in the high-speed rail private network cell.
Illustratively, to ensure accuracy, the number of users in the second level per day in the high-speed rail private network cell of 7 days and more than 4 weeks a week is acquired.
And the determining module 22 is configured to determine the arrival time and departure time of the train each day according to the statistical information of the number of users obtained by the obtaining module 21.
Specifically, the determining module 22 obtains the periodic impulse type distribution of the number of users according to the statistical information of the number of users.
The determination module 22 determines a time of a start of a pulse in the periodic pulsed distribution as an arrival time of the train per day and a time of an end of the pulse in the periodic pulsed distribution as a departure time of the train per day.
The time when the pulse begins to appear in the periodic pulse distribution is the time when the train enters the high-speed railway private network cell, and the time when the pulse ends in the periodic pulse distribution is the time when the train leaves the high-speed railway private network cell.
The determining module 22 is further configured to determine a train arrival time window according to the arrival time and departure time of the train each day.
If the interval of the arrival time of the train per day is less than a first preset time and the interval of the departure time of the train per day is less than the first preset time, determining the earliest time of the arrival time of the train per day as the starting time of the arrival time window and determining the latest time of the departure time of the train per day as the ending time of the arrival time window.
For example, the first preset time is a guard time interval, and it can be known from the train operation schedule that, except for the case of meeting a train, there is a certain guard time interval between two trains, and the guard time is generally greater than 5 minutes.
The migration module 23 is configured to compare the first number of users with a user number threshold, and if the first number of users is greater than the user number threshold, migrate an accessed user in the private network cell of the high-speed rail according to the train arrival time window obtained by the determination module 22, where the user number threshold is obtained according to statistical information of the number of users and a wireless bandwidth to be reserved; the first user number is the sum of the number of accessed users before the arrival of the train in the high-speed rail private network cell and the number of new accessed users after the arrival of the train.
If the first number of users is greater than the threshold value of the number of users, the migration module 23 migrates the accessed users in the private cell of the high-speed rail before the start time of the train arrival time window, so as to reserve resources for the users on the high-speed rail train to arrive.
The migration module 23 allows the migrated users in the private network cell of the high-speed rail to migrate to the private network cell of the high-speed rail after the termination time of the train arrival time window, so as to achieve the purposes of reasonably scheduling resources and improving the utilization rate.
Specifically, as shown in fig. 15, the user scheduling apparatus 20 further includes: a verification module 24.
And the checking module 24 is configured to check and correct the train arrival time window according to the statistical information of the number of users in the high-speed rail private network cell.
Specifically, the checking module 24 periodically obtains the number of users in the high-speed rail private network cell to obtain a new train arrival time window.
The verification module 24 verifies that the new train arrival time window matches the existing train arrival time window.
The verification module 24 corrects the existing train arrival time window according to the matching verification result.
Embodiments of the present application provide a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer, cause the computer to perform a user scheduling method in a high-speed rail mobile communication network as described in fig. 2-3, 9-10.
Embodiments of the present application provide a computer program product comprising instructions which, when executed on a computer, cause the computer to perform a method for scheduling users in a high-speed rail mobile communication network as described in fig. 2-3, 9-10.
An embodiment of the present application provides a user scheduling apparatus in a high-speed rail mobile communication network, including: a processor and a memory, the memory is used for storing programs, and the processor calls the programs stored in the memory to execute the user scheduling method in the high-speed rail mobile communication network as described in fig. 2-3 and fig. 9-10.
Since the user scheduling apparatus, the computer-readable storage medium, and the computer program product in the high-speed rail mobile communication network in the embodiment of the present application may be applied to the user scheduling method in the high-speed rail mobile communication network, reference may also be made to the above method embodiment for obtaining technical effects, and details of the embodiment of the present application are not repeated here.
The above units may be individually configured processors, or may be implemented by being integrated into one of the processors of the controller, or may be stored in a memory of the controller in the form of program codes, and the functions of the above units may be called and executed by one of the processors of the controller. The processor described herein may be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement embodiments of the present Application.
It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, and for example, the division of the units is only one logical functional division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
Claims (10)
1. A user scheduling method in a high-speed rail mobile communication network is characterized by comprising the following steps:
acquiring statistical information of the number of users in a high-speed rail private network cell;
determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users;
determining a train arrival time window according to the arrival time and the departure time of the train every day;
comparing a first user number with a user number threshold value, and if the first user number is greater than the user number threshold value, migrating accessed users in the private network cell of the high-speed rail according to the train arrival time window, wherein the user number threshold value is obtained according to the statistical information of the user number and the wireless bandwidth required to be reserved; the first user number is the sum of the number of accessed users before the train arrives and the number of newly accessed users after the train arrives in the high-speed railway private network cell;
the determining the arrival time and the departure time of the train each day according to the statistical information of the number of the users comprises the following steps:
obtaining periodic impulse type distribution of the user number according to the statistical information of the user number;
and determining the time of starting to appear the pulse in the periodic pulse type distribution as the arrival time of the train every day, and determining the time of ending the pulse in the periodic pulse type distribution as the departure time of the train every day.
2. The method for scheduling users in a high-speed rail mobile communication network according to claim 1, wherein said determining a train arrival time window according to the arrival time and departure time of the train per day comprises:
and if the interval of the arrival time of the train every day is less than a first preset time and the interval of the departure time of the train every day is less than the first preset time, determining that the earliest time of the arrival time of the train every day is the starting time of the arrival time window, and determining that the latest time of the departure time of the train every day is the ending time of the arrival time window.
3. The method for dispatching users in a mobile communication network of a high-speed rail according to claim 2, wherein the migrating the accessed users in the private network cell of the high-speed rail according to the train arrival time window comprises:
migrating the accessed users in the high-speed rail private network cell before the starting time.
4. The method for scheduling users in a high-speed rail mobile communication network according to claim 3, wherein the method further comprises:
and allowing the migrated users in the private network cell for migrating to the private network cell after the termination time.
5. A user scheduling apparatus in a high-speed rail mobile communication network, comprising:
the acquisition module is used for acquiring the statistical information of the number of users in the high-speed rail private network cell;
the determining module is used for determining the arrival time and the departure time of the train every day according to the statistical information of the number of the users obtained by the obtaining module;
the determining module is further used for determining a train arrival time window according to the arrival time and the departure time of the train every day;
the migration module is used for comparing a first user number with a user number threshold value, and if the first user number is greater than the user number threshold value, migrating the accessed users in the high-speed railway private network cell according to the train arrival time window obtained by the determination module, wherein the user number threshold value is obtained according to the statistical information of the user number and the wireless bandwidth required to be reserved; the first user number is the sum of the number of accessed users before the train arrives and the number of newly accessed users after the train arrives in the high-speed railway private network cell;
the determining module is specifically configured to:
obtaining periodic impulse type distribution of the user number according to the statistical information of the user number;
and determining the time of starting to appear the pulse in the periodic pulse type distribution as the arrival time of the train every day, and determining the time of ending the pulse in the periodic pulse type distribution as the departure time of the train every day.
6. The apparatus for scheduling users in a high-speed rail mobile communication network according to claim 5, wherein the determining module is specifically configured to:
and if the interval of the arrival time of the train every day is less than a first preset time and the interval of the departure time of the train every day is less than the first preset time, determining that the earliest time of the arrival time of the train every day is the starting time of the arrival time window, and determining that the latest time of the departure time of the train every day is the ending time of the arrival time window.
7. The apparatus for scheduling users in a high-speed rail mobile communication network according to claim 6, wherein the migration module is further configured to:
migrating the accessed users in the high-speed rail private network cell before the starting time.
8. The apparatus for scheduling users in a high-speed rail mobile communication network according to claim 7, wherein the migration module is further configured to:
and allowing the migrated users in the private network cell for migrating to the private network cell after the termination time.
9. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer, cause the computer to perform the method for subscriber scheduling in a high-speed rail mobile communication network according to any of claims 1-4.
10. A user scheduling apparatus in a high-speed rail mobile communication network, comprising: a processor and a memory, the memory for storing a program, the processor calling the program stored in the memory to perform the user scheduling method in the high-speed rail mobile communication network according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910114413.5A CN109660981B (en) | 2019-02-14 | 2019-02-14 | User scheduling method and device in high-speed rail mobile communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910114413.5A CN109660981B (en) | 2019-02-14 | 2019-02-14 | User scheduling method and device in high-speed rail mobile communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109660981A CN109660981A (en) | 2019-04-19 |
| CN109660981B true CN109660981B (en) | 2021-08-27 |
Family
ID=66121273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910114413.5A Active CN109660981B (en) | 2019-02-14 | 2019-02-14 | User scheduling method and device in high-speed rail mobile communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109660981B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110505665B (en) * | 2019-08-08 | 2021-12-14 | 武汉绿色网络信息服务有限责任公司 | Method and system for switching cell of high-speed rail mobile terminal user |
| CN111343726B (en) * | 2020-02-27 | 2023-03-24 | 中国联合网络通信集团有限公司 | User scheduling method and device |
| CN111833153B (en) * | 2020-07-17 | 2024-03-05 | 深圳市活力天汇科技股份有限公司 | Method for recommending flights during purchasing high-speed rail tickets |
| CN111884694B (en) * | 2020-07-28 | 2023-03-24 | 中国联合网络通信集团有限公司 | Beam forming control method and device, electronic equipment and storage medium |
| CN112631745A (en) * | 2020-12-02 | 2021-04-09 | 微梦创科网络科技（中国）有限公司 | Timed task execution method, device and system based on time window |
| CN112788526B (en) * | 2020-12-31 | 2023-04-07 | 上海擎昆信息科技有限公司 | Network connection method along high-speed rail, server and storage medium |
| CN117692956A (en) * | 2022-08-29 | 2024-03-12 | 中兴通讯股份有限公司 | User scheduling method, base station and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102938917A (en) * | 2011-08-15 | 2013-02-20 | 鼎桥通信技术有限公司 | Non high-speed rail user switching method and radio network controller (RNC) |
| CN104219730A (en) * | 2013-05-29 | 2014-12-17 | 中国电信股份有限公司 | Method and device for controlling access in high-speed moving scenario |
| CN104918258A (en) * | 2015-05-28 | 2015-09-16 | 成都亿邻通科技有限公司 | Communication method in high-speed railway operation |
| CN105519153A (en) * | 2014-11-12 | 2016-04-20 | 华为技术有限公司 | Terminal user identification method, device and system |
| CN106572503A (en) * | 2015-10-09 | 2017-04-19 | 中兴通讯股份有限公司 | Non-private-network user transferring method and apparatus |
| CN106941682A (en) * | 2016-01-05 | 2017-07-11 | 中国移动通信集团山东有限公司 | A kind of processing method and equipment of the terminal of resident high ferro private network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9414276B2 (en) * | 2011-12-31 | 2016-08-09 | Telefonaktiebolaget L M Ericsson (Publ) | Mobility management method and apparatus in high speed railway |
| EP3188549B1 (en) * | 2014-09-29 | 2020-11-11 | Huawei Technologies Co., Ltd. | Method of controlling user equipment accessing communication network of high-speed moving vehicle |
-
2019
- 2019-02-14 CN CN201910114413.5A patent/CN109660981B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102938917A (en) * | 2011-08-15 | 2013-02-20 | 鼎桥通信技术有限公司 | Non high-speed rail user switching method and radio network controller (RNC) |
| CN104219730A (en) * | 2013-05-29 | 2014-12-17 | 中国电信股份有限公司 | Method and device for controlling access in high-speed moving scenario |
| CN105519153A (en) * | 2014-11-12 | 2016-04-20 | 华为技术有限公司 | Terminal user identification method, device and system |
| CN104918258A (en) * | 2015-05-28 | 2015-09-16 | 成都亿邻通科技有限公司 | Communication method in high-speed railway operation |
| CN106572503A (en) * | 2015-10-09 | 2017-04-19 | 中兴通讯股份有限公司 | Non-private-network user transferring method and apparatus |
| CN106941682A (en) * | 2016-01-05 | 2017-07-11 | 中国移动通信集团山东有限公司 | A kind of processing method and equipment of the terminal of resident high ferro private network |
Non-Patent Citations (1)
| Title |
|---|
| 低速用户迁出缓解高铁容量问题方案探讨;吴细刚;《科技风》;20171130;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109660981A (en) | 2019-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109660981B (en) | User scheduling method and device in high-speed rail mobile communication network | |
| CN109743676B (en) | Network connection control method, device and equipment | |
| CN105722222B (en) | Method and device for managing resources in unauthorized carrier waves | |
| CN103650566A (en) | Neighbour relations management | |
| CN111836371B (en) | Resource selection method, device and terminal | |
| Zhang et al. | Dynamic offloading algorithm in intermittently connected mobile cloudlet systems | |
| CN106612514B (en) | Measurement scheduling method, device and terminal | |
| CN113438666B (en) | Base station determining method and equipment | |
| CN109862620A (en) | A kind of user scheduling method of communication cell and base station | |
| CN110677854A (en) | Method, apparatus, device and medium for carrier frequency capacity adjustment | |
| CN106991484B (en) | Secondary resource reservation method based on intelligent repeated reservation | |
| CN109963292B (en) | Complaint prediction method, complaint prediction device, electronic apparatus, and storage medium | |
| US9451482B2 (en) | Method for tracking and utilizing operational run time of a network element | |
| CN101990228B (en) | Communication network equipment fault detection method and device | |
| CN102307353A (en) | Method for realizing interference coordination by combining multi-frequency hopping way and inter-cell information interaction | |
| CN116719787A (en) | Method and device for uploading equipment logs in track system, medium and electronic equipment | |
| JPWO2016136196A1 (en) | PROCESSING DEVICE, PROCESSING DEVICE CONTROL METHOD, AND RECORDING MEDIUM | |
| CN109963299B (en) | Processing method and device for migrating user terminal out of private network | |
| CN107027182B (en) | Resource allocation method and device | |
| CN114125859A (en) | Method, device and system for spectrum sharing | |
| CN107431938A (en) | A kind of measuring method and relevant device based on unauthorized frequency range | |
| CN110719569A (en) | Tracking area list management method and device based on user frequent movement mode | |
| CN104811993A (en) | Frequency point measuring method | |
| JP6787858B2 (en) | Terminal equipment and communication method | |
| US11503494B2 (en) | Optimizing cell outage mitigation in a communications network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |