CN113133000A - Resource scheduling method of 5G shared micro base station - Google Patents

Resource scheduling method of 5G shared micro base station Download PDF

Info

Publication number
CN113133000A
CN113133000A CN201911418757.1A CN201911418757A CN113133000A CN 113133000 A CN113133000 A CN 113133000A CN 201911418757 A CN201911418757 A CN 201911418757A CN 113133000 A CN113133000 A CN 113133000A
Authority
CN
China
Prior art keywords
resource pool
resource
operator
access
operators
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911418757.1A
Other languages
Chinese (zh)
Other versions
CN113133000B (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.)
Lishui Qingda Technology Partnership LP
Original Assignee
Lishui Qingda Technology Partnership LP
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 Lishui Qingda Technology Partnership LP filed Critical Lishui Qingda Technology Partnership LP
Priority to CN201911418757.1A priority Critical patent/CN113133000B/en
Publication of CN113133000A publication Critical patent/CN113133000A/en
Application granted granted Critical
Publication of CN113133000B publication Critical patent/CN113133000B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a resource scheduling method of a 5G shared micro base station, which mainly comprises the following steps of S1: step S1: a base station acquires a baseband scheduling resource and divides the baseband scheduling resource into a resource pool A and a source pool B; step S2: dividing a resource pool A into N resource pools equally according to the number N of operators, and allocating 1 resource pool A to each operatoriI is 1,2,3 … … N; step S3: setting a resource pool B as a dynamic resource pool, and performing B-type resource allocation on service users of N operators; step S4: the base station judges the user identification of the access UE, judges the operator of the UE according to the operator identification and is the resource pool A of the access UE in the operatoriAllocating A-type resources; step S5: according to the reported information of the UE and the wireless condition, executing a dynamic scheduling algorithm on all the UE by using resources in the B-type resource pool; step S6, according to the access frequency of different operators UE for a long time, adjusting the resource pool A of N operatorsiThe size of (2).

Description

Resource scheduling method of 5G shared micro base station
Technical Field
The invention relates to the field of wireless communication resource scheduling methods, in particular to a resource scheduling method of a 5G shared micro base station.
Background
The indoor coverage scene is an important scene of mobile communication coverage, and the indoor coverage system provides the extension of signals and also provides traffic for users, so that the load of the macro station is reduced. With the development of 5G NR, the application of multi-stream MIMO becomes an indispensable option. Meanwhile, as the demand of bandwidth is increased, the frequency band of mobile communication is gradually expanded to higher frequency, and all the factors cause that the traditional passive indoor coverage is not suitable for indoor coverage application of high frequency band and multi-stream MIMO. Massive MIMO becomes a research hotspot of next generation mobile communication. In massive MIMO, multiple antennas form a narrow beam pointing in a specific direction by beamforming to improve communication quality.
Hybrid beamforming combining analog beamforming and digital precoding has become an important research direction for NR (New radio technology) systems, as discussed in 3GPP (3rd Generation Partner Project) RAN1(radio access Network).
However, in the prior art, due to the increase of the frequency band and bandwidth of the 5G NR and the number of MIMO streams, the price of the digital indoor distribution system is greatly increased compared with that of the LTE, which directly increases the network construction cost and hinders the rapid deployment of the 5G network. Each large operator establishes a digital room subsystem respectively, and faces huge capital expenditure, so that a set of digital room subsystem with acceptable cost and sharing needs to be developed, multiple operators and multiple systems are accessed, and on one hand, the repeated investment construction of the whole industry is reduced, and on the other hand, the investment of the operators is reduced.
Disclosure of Invention
The invention discloses a resource scheduling method of a 5G shared micro base station, which reasonably distributes a resource pool in the base station to a plurality of operators by using a dynamic scheduling algorithm, realizes the function of sharing the base station by a plurality of operators and simultaneously ensures that the resource pool occupied by the plurality of operators is relatively fair.
According to an aspect of the present invention, a resource scheduling method for a 5G shared micro base station includes: step S1: a base station acquires a baseband scheduling resource and divides the baseband scheduling resource into a resource pool A and a resource pool B; step S2: dividing a resource pool A into N resource pools according to the number N of operators, and allocating 1 resource pools Ai to each operator, wherein i is 1,2 and 3 … … N; step S3: setting a resource pool B as a dynamic resource pool, and performing B-type resource allocation on N operators; step S4: the base station judges the user identification of the UE in the access process, judges the operator of the UE according to the operator identification, and allocates A-type resources for the UE in the access process in the resource pool Ai of the operator of the UE; step S5: according to the access frequency and the wireless condition of the UE, comprehensively executing a dynamic scheduling algorithm on all the UE in a resource pool B, and distributing B-type resources; step S6: and counting the number of UE accessed by N operators in a period, and adjusting the size of the resource pools Ai of the N operators according to the number of the UE accessed.
Preferably, the N operators schedule a class a resources to the resource pool Ai allocated to them, where the class a resources are access resources; and integrally scheduling B-type resources to the resource pool B, wherein the B-type resources are comprehensive service resources.
Preferably, the resource pool a generates an access value Num for N operators according to the UE access frequency and the radio condition.
Preferably, the dynamic scheduling algorithm comprises a first dynamic scheduling algorithm and a second dynamic scheduling algorithm.
Preferably, the first dynamic scheduling algorithm comprises: generating a first access value sequence according to the access value Num of N operators in an execution period: num1> Num2> Num3> … … > Num (N-1); sequentially judging whether the resource pool Ai of the operator corresponding to the access value is larger than the maximum resource pool or not according to the first access value sequence; if yes, keeping the resource pool Ai of the operator corresponding to the access value unchanged, and judging whether the resource pool Ai of the operator corresponding to the next access value is larger than the maximum resource pool; if not, the resource pool A allocates one more step length resource to the resource pool Ai of the operator corresponding to the access value and finishes executing the first dynamic scheduling algorithm.
Preferably, the second dynamic scheduling algorithm comprises: generating a second access value sequence according to the access value of the N operators: num (N) < Num (N-1) < … … < Num3< Num2< Num 1; sequentially judging whether the resource pool Ai of the operator corresponding to the access value is smaller than a minimum resource pool or not according to the access value sequence; if so, keeping the resource pool Ai distributed by the operator corresponding to the access value unchanged, and judging the resource pool Ai of the operator corresponding to the next access value; if not, the resource pool Ai recovers a step length resource for the resource pool allocated by the operator corresponding to the access value and finishes executing the second dynamic scheduling algorithm.
The invention has the beneficial effects that:
1. the invention ensures that the UE of different operators can be accessed fairly in the total time;
2. the invention ensures that the UE of different operators can normally access the network;
3. the invention can adaptively optimize the static resource scheduling pools of different operators according to long-term data statistics.
Drawings
FIG. 1 is a diagram of a shared indoor micro station architecture in an embodiment of the present invention;
fig. 2 is a schematic diagram of resource pool allocation in an embodiment of the present invention.
Detailed Description
The content of the invention will now be discussed with reference to a number of exemplary embodiments. It is to be understood that these examples are discussed only to enable those of ordinary skill in the art to better understand and thus implement the teachings of the present invention, and are not meant to imply any limitations on the scope of the invention.
As used herein, the term "include" and its variants are to be read as open-ended terms meaning "including, but not limited to. The term "based on" is to be read as "based, at least in part, on". The terms "one embodiment" and "an embodiment" are to be read as "at least one embodiment". The term "another embodiment" is to be read as "at least one other embodiment".
The invention teaches a resource scheduling method of a 5G shared micro base station, which is based on a resource pool resource scheduling method generated by the operation principle of a shared indoor micro station, namely a base station, as shown in fig. 1, the shared indoor micro station is a digital room subsystem consisting of a Base Band Unit (BBU), a remote convergence unit (Hub) and a radio frequency unit (RRU), and can be simultaneously connected to the core network nodes of a plurality of operators.
Example 1:
in the present embodiment, three operators, operator 1, operator 2, and operator 3, are mainly included. Because data of three operators are accessed to a shared resource pool, and different operators have different strategies, if UE (user equipment) of the three operators are all considered uniformly for scheduling, the UE of some operators cannot guarantee the lowest access rate, and based on the minimum access rate, a resource scheduling method based on a 5G shared micro base station is provided, the method utilizes a dynamic scheduling algorithm to allocate the resource pool, and the specific algorithm is realized as follows:
step 1: as shown in fig. 2, all baseband scheduling resources are divided into 2 resource pools, namely a resource pool a and a resource pool B, where the resource pool a is mainly used for performing resource scheduling for user access of an operator, and the resource pool B mainly realizes other service functions for users of the operator, such as performing resource scheduling for a download function and a forwarding function; the resource pool A is divided into a resource pool 1, namely a resource pool A1For access scheduling resources of operator 1; resource pool 2, resource pool A2For access scheduling resources of operator 2; resource pool 3, resource pool A3For access scheduling resources of operator 3; resource pool 4, resource pool B, is used to perform dynamic resource scheduling for three operators.
Step 2: when the UE is accessed, the operator of the UE is judged according to the user identification of the UE, and the UE is accessed to the resource pool and is allocated with resources in the resource pool of the corresponding operator according to the difference of the operators.
And step 3: and in the process of carrying out service processing after the UE finishes the access flow, carrying out comprehensive scheduling in the resource pool 4 according to the reported information and the wireless condition of the UE.
And 4, step 4: within a certain period T, in the present embodiment, the execution period is set to 1 week or 1 month; the UE access conditions of all operators are counted as: num1 (operator 1), Num2 (operator 2), and Num3 (operator 3), which sequence the three access values, and make minor adjustments to the resource pool a of different operators according to the UE access values of each operator. The adjustment strategy comprises a first dynamic scheduling algorithm and a second dynamic scheduling algorithm, and the first dynamic scheduling algorithm comprises the following specific steps:
in an embodiment of the present invention, a first access value sequence is generated according to access values of three operators as Num3< Num2< Num 1;
the first step is to judge whether the resource pool 3 of the operator 3 corresponding to Num3 is less than or equal to the minimum static resource pool; if the resource pool 3 of the operator 3 is less than or equal to the minimum static resource pool, the resource pool 3 is unchanged, and the second step of judgment is carried out; if the resource pool 3 of the operator 3 is larger than the minimum static resource pool, the resource pool A recovers a step length resource for the resource pool 3 of the operator 3, and finishes executing the first dynamic scheduling algorithm;
secondly, judging whether the resource pool 2 of the operator 2 corresponding to the Num2 is less than or equal to the minimum static resource pool; if the resource pool 2 of the operator 2 is less than or equal to the minimum static resource pool, the resource pool 2 of the operator 2 is unchanged, and the execution of the first dynamic scheduling algorithm is finished; if the resource pool 2 of the operator 2 is larger than the minimum static resource pool, the resource pool a recovers a step length resource for the resource pool 2 of the operator 2, and finishes executing the first dynamic scheduling algorithm.
The second dynamic scheduling algorithm comprises the following specific steps:
in an embodiment of the present invention, the second access value sequence is generated according to the access value ordering of three operators as Num1> Num2> Num 3;
the first step is to judge whether the static resource pool of operator 1 corresponding to Num1 is greater than or equal to the maximum static resource pool; if the resource pool 1 of the operator 1 is larger than or equal to the maximum static resource pool, the resource pool 1 of the operator 1 is unchanged, and the second step of judgment is carried out; if the resource pool 1 of the operator 1 is smaller than the maximum static resource pool, the resource pool A increases a step length resource for the resource pool 1 of the operator 1, and finishes executing the second dynamic scheduling algorithm;
secondly, judging whether the resource pool 2 of the operator 2 corresponding to the Num2 is more than or equal to the maximum static resource pool; if the resource pool 2 of the operator 2 is larger than or equal to the maximum static resource pool, the resource pool 2 of the operator 2 is unchanged, and the execution of the second dynamic scheduling algorithm is finished; if the resource pool 2 of the operator 2 is smaller than the maximum static resource pool, the resource pool A increases a step length resource for the resource pool 2 of the operator 2, and finishes executing the second dynamic scheduling algorithm;
it should be understood that the order of execution of the steps in the summary of the invention and the embodiments of the present invention does not absolutely imply any order of execution, and the order of execution of the steps should be determined by their functions and inherent logic, and should not be construed as limiting the process of the embodiments of the present invention.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (6)

1. A resource scheduling method of a 5G shared micro base station is characterized by comprising the following steps:
step S1: a base station acquires a baseband scheduling resource and divides the baseband scheduling resource into a resource pool A and a resource pool B;
step S2: dividing a resource pool A into N resource pools equally according to the number N of operators, and allocating 1 resource pool A to each operatori，i＝1,2,3……N；
Step S3: setting a resource pool B as a dynamic resource pool, and performing B-type resource allocation on N operators;
step S4: the base station judges the user identification of the UE in the access process, judges the operator of the UE according to the operator identification and is the resource pool A of the UE in the access process in the operator of the UEiMiddle distribution of class AA resource;
step S5: according to the access frequency and the wireless condition of the UE, comprehensively executing a dynamic scheduling algorithm on all the UE in a resource pool B, and distributing B-type resources;
step S6: counting the number of UE accessed by N operators in a period, and adjusting the resource pools A of the N operators according to the number of the UE accessediThe size of (2).
2. The method according to claim 1, wherein the resource pool A allocated to it by the N operatorsiScheduling A-type resources, wherein the A-type resources are access resources; and integrally scheduling B-type resources to the resource pool B, wherein the B-type resources are comprehensive service resources.
3. The method according to claim 1, wherein the resource pool A generates access values Num for N operators according to the UE access frequency and the radio conditions.
4. The method according to claim 1, wherein the dynamic scheduling algorithm comprises a first dynamic scheduling algorithm and a second dynamic scheduling algorithm.
5. The method according to claim 4, wherein the first dynamic scheduling algorithm comprises:
generating a first access value sequence according to the access value of the N operators: num (N) < Num (N-1) < … … < Num3< Num2< Num 1;
sequentially judging the resource pool A of the operator corresponding to the access value according to the access value sequenceiWhether it is less than the minimum resource pool; if yes, the resource pool A allocated by the operator corresponding to the access value is obtainediKeeping unchanged, and performing resource pool A of the operator corresponding to the next access valueiJudging; if not, the resource pool AiThe resource pool allocated to the operator corresponding to the access value is returnedAnd receiving a step resource and finishing executing the first dynamic scheduling algorithm.
6. The method according to claim 4, wherein the second dynamic scheduling algorithm comprises:
generating a second access value sequence according to the access value Num of the N operators in an execution period: num1> Num2> Num3> … … > Num (N-1);
sequentially judging the resource pool A of the operator corresponding to the access value according to the first access value sequenceiWhether it is greater than the maximum resource pool; if yes, the resource pool A of the operator corresponding to the access valueiKeeping unchanged, and performing resource pool A of the operator corresponding to the next access valueiJudging whether the resource is larger than the maximum resource pool or not; if not, the resource pool A is the resource pool A of the operator corresponding to the access valueiAnd allocating one more step resource and finishing executing the second dynamic scheduling algorithm.
CN201911418757.1A 2019-12-31 2019-12-31 Resource scheduling method of 5G shared micro base station Active CN113133000B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911418757.1A CN113133000B (en) 2019-12-31 2019-12-31 Resource scheduling method of 5G shared micro base station

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911418757.1A CN113133000B (en) 2019-12-31 2019-12-31 Resource scheduling method of 5G shared micro base station

Publications (2)

Publication Number Publication Date
CN113133000A true CN113133000A (en) 2021-07-16
CN113133000B CN113133000B (en) 2022-08-02

Family

ID=76769314

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911418757.1A Active CN113133000B (en) 2019-12-31 2019-12-31 Resource scheduling method of 5G shared micro base station

Country Status (1)

Country Link
CN (1) CN113133000B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102724760A (en) * 2012-06-18 2012-10-10 中兴通讯股份有限公司 Shared resource processing method and device
US20130303114A1 (en) * 2012-05-09 2013-11-14 Interdigital Patent Holdings, Inc. Flexible network sharing
CN104980935A (en) * 2014-04-03 2015-10-14 中兴通讯股份有限公司 Method, device and system for sharing network
CN105103582A (en) * 2013-01-30 2015-11-25 日本电气株式会社 Communication system for sharing resources between multiple network operators
CN105122876A (en) * 2013-04-10 2015-12-02 日本电气株式会社 Communication system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130303114A1 (en) * 2012-05-09 2013-11-14 Interdigital Patent Holdings, Inc. Flexible network sharing
CN102724760A (en) * 2012-06-18 2012-10-10 中兴通讯股份有限公司 Shared resource processing method and device
CN105103582A (en) * 2013-01-30 2015-11-25 日本电气株式会社 Communication system for sharing resources between multiple network operators
CN105122876A (en) * 2013-04-10 2015-12-02 日本电气株式会社 Communication system
CN104980935A (en) * 2014-04-03 2015-10-14 中兴通讯股份有限公司 Method, device and system for sharing network

Also Published As

Publication number Publication date
CN113133000B (en) 2022-08-02

Similar Documents

Publication Publication Date Title
JP5697622B2 (en) Mobile communication system and remote radio unit clustering method thereof
US8649341B2 (en) Joint management of radio and transport resources
EP2924908B1 (en) Pilot time slot allocation for a MIMO system
US8880089B2 (en) Mobile communication system and radio resource assignment method
CN105992220B (en) Method and baseband unit for intra-cell frequency reuse of indoor wireless network
JP5638880B2 (en) Channel assignment method and system in wireless communication system
EP3183932B1 (en) Method and apparatus for determining clusters of access nodes
CN110445518B (en) Pilot frequency distribution method based on micro cell clustering under large-scale MIMO heterogeneous network system
WO2016150488A1 (en) Pilot signal resource allocation for a cellular mimo system
CN102547736A (en) Method and system for controlling downlink interference between neighboring cells
CN108471608A (en) A kind of D2D communication resources dispatching method and device
CN110177340B (en) User-centered ultra-dense network resource allocation method
CN113133000B (en) Resource scheduling method of 5G shared micro base station
CN106851830B (en) Resource allocation method and device for LTE-A heterogeneous network
US20190245588A1 (en) Multi-source same-cell wireless distribution system (wds) with dynamic source adaptation
CN106413110B (en) A kind of dispatching method, device and network node
EP2441304B1 (en) Allocating interlace multiplex pairs for multicast services
CN104170309B (en) A kind of method for managing resource and device
CN103079215B (en) Multi-cell combined optimization method on basis of sector fairness
CN102655654A (en) Telephone traffic statistics method and device as well as networking method and device
CN106413073B (en) Dynamic power allocation method and device for MRRU cell
US11570655B2 (en) Allocating a physical radio resource for a nonguaranteed bit rate bearer in a distributed communications system
CN103781183B (en) A kind of dispatching method and device of downlink resource
KR101784589B1 (en) Method and apparatus for transmitting multicast and unicast combined mu-mimo in multi-cell network
WO2024009127A1 (en) Radio resource management split for radio power pooling in active antenna system

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