KR102434985B1 - Apparatus and Method for allocating Resource in a RAN Sharing Environment - Google Patents

Abstract

The present invention relates to a method and apparatus for allocating resources in a base station operating in an AN sharing environment, and a resource allocation method in a base station having a RAN sharing function supporting a plurality of operators is An operation of dividing and setting the resource N into a dedicated resource allocated for exclusive use by each of the plurality of operators and a shared resource allocated for shared use by the plurality of operators, an operation of arranging terminals according to transmission priority and allocating resources to the terminal according to the sorted order, first allocating a dedicated resource of the operator to which the terminal belongs, and then allocating the shared resource to the terminal, the radio resource proposed in the present invention The allocation method may enable efficient use of radio resources in a RAN shared environment.

Description

Apparatus and Method for allocating Resource in a RAN Sharing Environment

Various embodiments relate to a method and apparatus for allocating resources in a base station operating in a RAN shared environment.

In July 2014, the government selected public safety LTE (LTE) as a technology method for the newly constructed national public safety communication network, and in November of the same year, the 700MHz band was allocated as a frequency for the integrated public network.

The frequency for the integrated public network is a frequency allocated with a width of 20 MHz in the 700 MHz band and is defined as being used for disaster safety communication networks, high-speed maritime wireless communication networks, and integrated railway wireless networks.

If three public networks using frequencies for the integrated public network service the same area, there is no choice but to share a base station or to build a base station for an individual public network in an adjacent area. However, when the base stations of individual public networks are built in the same area, it may be desirable to share the base stations because there is a risk of mutual interference. Accordingly, RAN sharing (radio access network sharing) technology has been introduced.

The RAN sharing technology is proposed to reduce the construction cost by sharing access equipment such as an eNB by multiple operators to avoid redundant investment in an access network. It should be able to support the PLMN of other operators in addition to the public land mobile network (PLMN) of the operator in which the base station is installed and connected to the multiple operator core network (MOCN).

In this case, a clear definition of how to allocate radio resources of the base station to each operator is required.

Various embodiments of the present invention provide a scheduling method for efficiently allocating radio resources to operators in a base station to which RAN sharing technology is applied.

The technical problems to be achieved in this document are not limited to the technical problems mentioned above, and other technical problems not mentioned can be clearly understood by those of ordinary skill in the art to which the present invention belongs from the description below. There will be.

According to various embodiments of the present disclosure, in a resource allocation method in a base station having a RAN sharing function supporting a plurality of operators, the entire radio resource (N) is used exclusively for each of the plurality of operators. An operation of dividing and setting into a dedicated resource allocated to be shared and a shared resource allocated to be shared and used by the plurality of operators, an operation of arranging terminals according to transmission priority, and an operation of allocating resources to terminals according to the sorted order, It may include an operation of first allocating a dedicated resource of the operator to which the terminal belongs, and then allocating the shared resource to the terminal.

According to various embodiments of the present disclosure, a base station having a RAN sharing function supporting a plurality of operators includes a first communication unit that communicates with a plurality of terminals according to a wireless communication protocol, the plurality of operators a second communication unit communicating with the core network and a processor operatively connected to the first communication unit and the second communication unit, wherein the processor is configured to use the entire radio resource (N) exclusively for each of the plurality of operators The allocated dedicated resource and the shared resource allocated to be shared and used by the plurality of operators are divided and set, the terminals are arranged according to the transmission priority, and the resources are allocated to the terminals according to the sorted order, but to which the terminal belongs The operator's dedicated resource may be allocated first, and then the shared resource may be allocated to the terminal.

According to various embodiments, the radio resource allocation method proposed by the present invention may enable efficient radio resource use in a RAN shared environment.

Effects obtainable in the present disclosure are not limited to the above-mentioned effects, and other effects not mentioned may be clearly understood by those of ordinary skill in the art to which the present disclosure belongs from the description below. will be.

1 is a diagram illustrating an example of a base station operating under RAN sharing (radio access network sharing).
2 is a diagram illustrating an example of a mixed allocation scheme.
3 is a diagram illustrating a flowchart of a resource allocation algorithm according to various embodiments of the present disclosure;
4 is a diagram illustrating an example of sorting terminals according to transmission priority based on single scheduling and storing terminal information in the queue 110 .
5 is a diagram illustrating an example of storing terminal information in the queue 110 by arranging terminals according to transmission priority based on two-step scheduling.
6 is a flowchart illustrating an operation of allocating radio resources to one terminal.
7 is a block diagram of a base station 100 having a RAN sharing function according to various embodiments of the present disclosure.
In connection with the description of the drawings, the same or similar reference numerals may be used for the same or similar components.

Hereinafter, various embodiments will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating an example of a base station operating under RAN sharing (radio access network sharing).

Referring to FIG. 1 , core networks 210 and 220 of a plurality of operators may be connected to a base station 100 . For example, the core network of the disaster safety communication network, the core network of the high-speed maritime wireless communication network, and the core network of the integrated railway wireless network may be connected to the base station 100 .

In addition, a plurality of terminals 310 , 320 , and 330 that want to perform data communication by connecting to different core networks may be connected to the base station 100 .

Then, the base station 100 must allocate uplink or downlink radio resources to each terminal or operator so that the terminals 310 , 320 , and 330 can perform data communication with the corresponding core networks 210 and 220 .

Therefore, the method in which the base station 100 allocates radio resources to each operator becomes a problem. In general, the resource allocation method includes a dedicated allocation method that allows each operator to use a predetermined radio resource exclusively, a shared allocation method that allows all operators to share and use radio resources, and a dedicated allocation of some radio resources to each operator In addition, there may be a mixed allocation scheme in which the remaining radio resources are shared and used by all operators.

The dedicated allocation method may cause an efficiency problem in using radio resources, and the public allocation method may have a problem in not guaranteeing essential services required by each operator. Therefore, the mixed allocation method capable of solving the above problem is most likely to be used as a method for allocating radio resources in the base station.

2 is a diagram illustrating an example of a mixed allocation scheme.

Referring to FIG. 2 , in a wireless communication system such as LTE, radio resources may be displayed in two dimensions of time and frequency. According to an embodiment, the frequency may be referred to as a resource block (RB) indicating a frequency band of a certain size.

In the mixed allocation method, some of the radio resources as shown in FIG. 2 that can be used by the base station are pre-allocated to each operator, so that the radio resource can be used only by the allocated operator, and the rest of the radio resources are used by all operators. to share, so it can be allocated to operators who want to transmit more data. In this way, essential services required by each operator can be guaranteed, and some radio resources are shared by all operators, thereby increasing the efficiency of radio resource use.

In such a mixed allocation method, the base station 100 must perform scheduling to determine which terminal of a specific operator is to be allocated a radio resource in every scheduling interval. Accordingly, the scheduling algorithm used by the base station 100 may perform an important function for efficient use of radio resources.

The present disclosure proposes a resource allocation algorithm that can be used in a mixed allocation scheme.

First, based on the mixed allocation method, a dedicated radio resource for each operator and a shared radio resource shared by all operators may be set.

According to an embodiment, it is assumed that the total number of radio resources usable in each resource allocation interval is N. For example, when an LTE communication system is used, N RBs may be used for data communication in every resource allocation interval.

N operator core networks are connected to the base station 100, and the number of radio resources that the n-th operator can use exclusively may be set to p_n. For example, the number of radio resources that the first operator can use exclusively is p_1, the number of radio resources that the second operator can use exclusively is p_2, and the number of radio resources that the third operator can use exclusively is p_1. The number can be set to p_3.

Then, the number of shared radio resources that can be shared and used by all N operators is set to c. Then the following relationship can be established.

N = p_1 + p_2 + … + p_n + c

3 is a diagram illustrating a flowchart of a resource allocation algorithm according to various embodiments of the present disclosure;

The resource allocation algorithm proposed in FIG. 3 may be independently used in each resource allocation interval in uplink transmission for transmitting data from the terminal to the base station and downlink transmission for transmitting data from the base station to the terminal.

Referring to FIG. 3 , in operation S100 , the base station 100 may sort terminals according to transmission priority. According to an embodiment, the base station may store the terminal information sorted according to the transmission priority in a queue. For example, terminal information at the top of the queue may indicate terminal information having the highest transmission priority. Assuming that the number of terminals to which the base station can allocate resources in one resource allocation interval is i, the queue may store information on a maximum of i pieces of terminal information.

4 is a diagram illustrating an example of sorting terminals according to transmission priority based on single scheduling and storing terminal information in the queue 110, and FIG. It is a diagram showing an example of storing terminal information in the queue 110 by sorting according to the order.

Referring to the first embodiment shown in FIG. 4 , terminals may be sorted according to transmission priorities using a single scheduling algorithm. And each terminal information may be stored in the queue 110 . For example, terminals that need to transmit or receive data, regardless of which operator the terminal is for, use a scheduling algorithm such as round-robin and WFQ (weighted fair queuing) that are commonly used in the prior art. Sort and store terminal information in the queue 110 . Alternatively, the terminals may be sorted based on a priority set in each terminal or a priority set in data to be transmitted or received by each terminal, and terminal information may be stored in the queue 110 . According to an embodiment of FIG. 4 , regardless of which user terminal the corresponding terminal is for, the queue 110 includes a terminal 310 , a terminal 360 , a terminal 340 , a terminal 320 , a terminal 330 , The terminal information of the terminal 350 may be sequentially stored according to the determined transmission priority.

Referring to the second embodiment shown in FIG. 5 , the operation of storing terminal information in the queue 110 according to the transmission priority may be performed through two-step scheduling. The scheduling of the first step may be to determine the transmission priority between the terminals for each operator, and the scheduling of the second step may be to determine the transmission priority between the operators. Even in this case, each scheduling may be performed by using a scheduling algorithm such as round-robin or weighted fair queuing (WFQ), which is generally used in the prior art, or based on a preset priority. In another embodiment, the scheduling of the first step may be performed based on a priority set for each terminal or a priority set according to the data characteristics that each terminal wants to transmit, and the scheduling of the second step of determining the priority between operators is round robin. A scheduling algorithm such as round-robin or weighted fair queuing (WFQ) can be used. For example, the queues 111, 113, and 115 for each operator and the overall queue 110 are set, and the terminal information stored in the queues 111, 113, 115 for each operator is prioritized between terminals belonging to the corresponding operator. may be stored according to an order determined based on . In addition, in order to store the terminal information in the entire queue 110 , the highest terminal information may be fetched from the queue of the operator selected by the scheduling of the second step. According to an embodiment of FIG. 5 , based on the two-step scheduling, the queue 110 includes a terminal 310 , a terminal 350 , a terminal 360 , a terminal 330 , a terminal 340 , and a terminal 320 . Terminal information may be stored in order.

According to the third embodiment, which is slightly modified from the embodiment of FIG. 5 , the entire queue 110 may not exist. Instead, the base station 100 may determine the transmission priority between operators. In addition, resource allocation may be performed first for a terminal in a queue (eg, queue 115) of an operator determined according to the transmission priority.

According to an embodiment, the terminal information stored in the queue may include a logical channel number indicating the terminal, operator information, and/or an allocation size. Here, the allocation size may be the size (byte unit or RB unit) of data to be transmitted or received by the corresponding terminal.

Referring back to FIG. 3 , in operation S200, radio resources may be allocated to the terminal according to the order stored in the queue. An embodiment of allocating radio resources to each terminal may follow the flowchart of FIG. 6 .

6 is a flowchart illustrating an operation of allocating radio resources to one terminal.

In the case of the first embodiment and the second embodiment, the base station 100 wirelessly according to the algorithm shown in FIG. 6 from the frontmost terminal (the terminal having the highest transmission priority) among the terminals stored in the queue 110 . resources can be allocated. When all radio resources are allocated, radio resources are allocated to as many terminals as the number (i) of terminals that can allocate resources in one resource allocation interval, or when radio resource allocation is no longer possible, the base station 100 The resource allocation operation may be completed.

In the case of the third embodiment, the base station 100 performs the algorithm shown in FIG. 6 from the frontmost terminal among the terminals stored in the queue (eg, queue 115) of the operator having the highest transmission priority. Radio resources may be allocated accordingly. When resource allocation to all terminals stored in the operator's queue (eg, queue 115) with the highest transmission priority is completed, the operator's queue (eg, queue 111) having the next priority ), the radio resource may be allocated according to the algorithm shown in FIG. When all radio resources are allocated, radio resources are allocated to as many terminals as the number (i) of terminals that can allocate resources in one resource allocation interval, or when radio resource allocation is no longer possible, the base station 100 The resource allocation operation may be completed.

When the base station 100 allocates radio resources to a specific terminal, the size (p_n) and sharing of the current radio resources, that is, the dedicated resources remaining unallocated to the high-priority terminal among the resources allocated to the operator to which the terminal belongs. The size (c) of the resource is known, and the size (k) of data to be transmitted or received by the corresponding terminal is known. Here, the size unit may be a resource block (RB).

In operation S210 and operation S220, if the base station 100 determines that the size (p_n) of the dedicated resource allocated to the operator to which the terminal belongs is greater than the size (k) of data (p_n>k), in operation S230, the terminal A dedicated resource of size k can be allocated. In addition, the size of the dedicated resource remaining for data transmission of the terminal belonging to the nth operator may be updated as p_n=p_n-k.

In operation S210 and operation S220, if the base station 100 determines that the size (k) of the data is greater than the size (p_n) of the dedicated resource, in operation S240, the base station 100 first allocates a dedicated resource of size p_n to the terminal And, the size of the dedicated resource can be reduced to 0 (p_n=0), and the size of the data can be reduced by p_n (k=k-p_n).

In operation S250, the base station 100 may compare the size (c) of the shared resource with the size (k) of the remaining data. As a result of the comparison, if the size of the shared resource is greater than the size of the remaining data (c>=k), in operation S260, the base station 100 may allocate a shared resource equal to the size (k) of the remaining data to the terminal, The size of the shared resource can be reduced by the size of the remaining data (c=c-k).

As a result of the comparison in operation S250, if the size of the shared resource is smaller than the size of the remaining data (c<k), in operation S270, the base station 100 allocates a shared resource equal to the size (c) of the remaining shared resource to the terminal. , and the size of the shared resource becomes 0 (c=0). In addition, the UE has data that has not been transmitted (k=k-c) and may attempt transmission in the next resource allocation interval.

According to another embodiment, the base station 100 determines whether both the dedicated resource and the shared resource allocated to the operator to which the corresponding terminal belongs before starting the radio resource allocation for the terminal (p_n=0 & c=0) can do. As a result of the determination, if all allocations are made, resource allocation may be terminated without further processing for the corresponding terminal. In the case of the third embodiment, the base station 100 performs the radio resource allocation operation according to FIG. 6 for terminals in the queue (eg, queue 115) of the operator having the highest transmission priority while the dedicated resource (p_n) When it is determined that both and the shared resource c are allocated, the radio resource allocation operation according to FIG. 6 may be performed for the terminals in the queue (eg, queue 113) of the operator of the next transmission priority. .

According to another embodiment, when all the shared resources (c) are allocated and only the dedicated resources of the operator remain, the resource is allocated by selecting the terminal according to the predetermined transmission priority, or the transmission data size (k) of the terminal and the A method of obtaining a smaller value among the sizes (p_n) of the remaining dedicated resources and allocating resources to the terminal having the largest value among the obtained values may be used. In the latter case, efficient use of resources may be possible.

According to another embodiment, the base station 100 may have a means for displaying the operator that has used up the dedicated resources in each resource allocation interval. Then, if all the shared resources are also used, the base station 100 may proceed with resource allocation according to the flowchart shown in FIG. 6 only to terminals belonging to the operator whose dedicated resources are not used up based on the corresponding means.

According to another embodiment, the base station 100 stores the number of resource-allocated terminals, and if the number of terminals is equal to the maximum number of allocable terminals (i) in one set resource allocation period, the corresponding resource allocation period You can end resource allocation in .

According to various embodiments, a resource allocation method in a base station having a RAN sharing function supporting a plurality of operators allocates all radio resources (N) to each of the plurality of operators for exclusive use. An operation of dividing and setting a dedicated resource and a shared resource allocated to be shared and used by the plurality of operators, an operation of arranging terminals according to transmission priority, and an operation of allocating a resource to a terminal according to the sorted order, but to which the terminal belongs It may include an operation of first allocating the operator's dedicated resource, and then allocating the shared resource to the terminal.

According to various embodiments, the operation of allocating the resource to the terminal is an operation of comparing the size (p_n) of an allocable dedicated resource of the operator to which the terminal belongs and the size (k1) of the data of the terminal, the comparison result of the terminal If the size of the data is less than or equal to (k1<=p_n), the operation of allocating a dedicated resource of the operator to which the terminal belongs as much as the size of the data of the terminal to the terminal and the size of the allocable dedicated resource is the data of the terminal (p_n = p_n -k1) operation of reducing by the size of Allocating a resource, reducing the size of the data of the terminal by the size of the allocable dedicated resource (k2=k1 -p_n), updating the size of the allocable dedicated resource to 0 (p_n=0), and It may include an operation of comparing the size (k2) of the reduced data of the terminal with the size (c) of the allocable shared resource. In addition, if the size of the allocable shared resource is greater than or equal to the comparison result (c>=k2), the operation of allocating the shared resource as much as the size of the reduced data (k2) to the terminal and the size of the allocable shared resource The method may further include an operation of reducing by the size of the reduced data (c=c-k2), and as a result of the comparison, if the size of the allocable shared resource is small (c<k2), the size of the allocable shared resource to the terminal ( The method may further include an operation of allocating the shared resource as much as c), an operation of setting the size of the remaining data of the terminal (k1 = k2 - c), and an operation of updating the size of the allocable shared resource to 0.

According to various embodiments, in the operation of allocating resources to the terminal, if the size of the allocable dedicated resource of the operator to which the terminal belongs is 0 (p_n=0) and the size of the allocable shared resource is 0 (c=0) , it may further include the operation of completing without allocating a resource to the terminal.

According to various embodiments, the arranging of the terminals according to the transmission priority may be performed by performing round robin or weighted fair queuing (WFQ) for the terminals to be allocated resources regardless of the operator to which the terminals belong. It may include the operation of arranging the terminals by determining the transmission priority of the terminals by a scheduling method.

According to various embodiments, the operation of arranging the terminals according to the transmission priority is a priority set in each terminal or each terminal transmits or receives for the terminals to be allocated resources regardless of the operator to which the terminals belong. and arranging the terminals by determining the transmission priorities of the terminals based on the priority set in the data.

According to various embodiments, the operation of arranging the terminals according to the transmission priority is the operation of determining the operator transmission priority for the plurality of operators and the operator having a higher transmission priority based on the operator transmission priority. It may include the operation of aligning the terminals by giving a higher transmission priority to the belonging terminal.

According to various embodiments, the operation of arranging the terminals according to the transmission priority is a priority set in each terminal or a priority set in data to be transmitted or received by each terminal, for the terminals to be allocated resources for each operator. The method may further include arranging the terminals for each operator by determining the transmission priority of the terminals based on the .

According to various embodiments, the operation of arranging the terminals according to the transmission priority is the transmission data size (k) of each terminal and the size of the remaining dedicated resources (p_n) for the terminals to be allocated resources for each operator. The method may further include an operation of obtaining a smaller value among these, and arranging the terminals for each operator by giving a higher transmission priority to a terminal having a larger size of the obtained value.

7 is a block diagram of a base station 100 having a RAN sharing function according to various embodiments of the present disclosure.

Referring to FIG. 7 , a base station 100 having a RAN sharing function according to various embodiments of the present invention includes a processor 150 , a first communication unit 120 , a second communication unit 130 , and a memory 140 . may include.

According to various embodiments, the processor 150 may include an application processor for performing a base station application and a communication processor for performing communication according to a wireless communication protocol standard (eg, long term evolution (LTE), 5th generation (5G)). can According to another embodiment, the communication processor may be located in the first communication unit 120 .

The processor 150 may control at least one other component (eg, a hardware or software component) of the base station 100 connected to the processor 150 by executing a program for performing a base station function, and may process various data Or you can perform an operation. According to an embodiment, as at least part of data processing or operation, the processor 150 loads a command or data received from other components of the base station 100 into the volatile memory, and processes the command or data stored in the volatile memory. and the result data may be stored in a non-volatile memory.

The first communication unit 120 is a part that performs communication according to a wireless communication protocol standard, and may communicate with a plurality of terminals. Here, the plurality of terminals belong to a plurality of different operators and may be connected to different core networks. In addition, the wireless communication protocol standard may be a long-term evolution (LTE) communication standard.

The second communication unit 130 may communicate with a plurality of core networks according to a local area network (LAN) or wide area network (WAN) communication standard to support the RAN sharing function.

The memory 140 may store programs and data necessary for the processor 150 to execute a base station function. The memory 140 may include a volatile memory or a non-volatile memory. Software stored in the memory 140 and executed by the processor 150 may include an operating system, middleware, or applications. Also, the memory 140 may store a program implementing the aforementioned radio resource allocation algorithm.

The processor 150 may read the radio resource allocation program from the memory 140 and execute the aforementioned radio resource allocation algorithm.

In the present disclosure described above, an algorithm for allocating radio resources to operator terminals in a base station performing a RAN sharing function has been proposed. Accordingly, the base station can provide essential services by allocating dedicated resources to each operator, and also provide efficient use of radio resources by allowing operators to share the shared resources.

According to various embodiments, a base station having a RAN sharing function supporting a plurality of operators includes a first communication unit that communicates with a plurality of terminals according to a wireless communication protocol, a core network of the plurality of operators, and a second communication unit for communicating and a processor operatively connected to the first communication unit and the second communication unit, wherein the processor allocates all radio resources (N) to each of the plurality of operators for exclusive use. and divided into shared resources allocated to be shared and used by the plurality of operators, sorted terminals according to transmission priority, and resources are allocated to terminals according to the sorted order, but dedicated resources of the operator to which the terminal belongs may be allocated first, and then the shared resource may be allocated to the terminal.

According to various embodiments, the processor compares the size (p_n) of the allocable dedicated resource of the operator to which the terminal belongs and the size (k1) of the data of the terminal, and as a result of the comparison, the size of the data of the terminal is smaller or the same If (k1<=p_n), allocate to the terminal the dedicated resource of the operator to which the terminal belongs as much as the size of the data of the terminal, and reduce the size of the allocable dedicated resource by the size of the data of the terminal (p_n = p_n -k1), if the size of the data of the terminal is large as a result of the comparison (k1>p_n), the dedicated resource of the operator to which the terminal belongs is allocated to the terminal by the size of the allocable dedicated resource, and the data of the terminal is The size is reduced by the size of the allocable dedicated resource (k2 = k1 -p_n), the size of the allocable dedicated resource is updated to 0 (p_n = 0), and the reduced data size of the terminal (k2) and allocable The size (c) of the shared resource can be compared. In addition, as a result of comparison, if the size of the allocable shared resource is greater than or equal to (c>=k2), the shared resource is allocated to the terminal as much as the size of the reduced data (k2), and the size of the allocable shared resource is If the size of the reduced data is reduced (c=c-k2), and as a result of the comparison, if the size of the allocable shared resource is small (c<k2), the shared resource is equal to the size (c) of the allocable shared resource to the terminal. may be allocated, the size of the remaining data of the terminal may be set (k1 = k2 - c), and the size of the allocable shared resource may be updated to 0.

According to various embodiments, when the size of the allocable dedicated resource of the operator to which the terminal belongs is 0 (p_n=0) and the size of the allocable shared resource is 0 (c=0), the processor provides the resource to the terminal It can be done without assignment.

According to various embodiments, the processor prioritizes transmission of the terminals according to a scheduling method of round robin or weighted fair queuing (WFQ) for terminals that need to be allocated resources regardless of the operator to which the terminals belong. It is possible to sort the terminals by determining the rank.

According to various embodiments, the processor, for the terminals to be allocated resources regardless of the operator to which the terminals belong, based on a priority set in each terminal or a priority set in data to be transmitted or received by each terminal It is possible to sort the terminals by determining the transmission priority of the terminals.

According to various embodiments, the processor determines a carrier transmission priority for the plurality of carriers, and gives a higher transmission priority to a terminal belonging to an operator of a higher transmission priority based on the carrier transmission priority to sort the terminals.

According to various embodiments, the processor is the transmission priority of the terminals based on a priority set in each terminal or a priority set in data to be transmitted or received by each terminal for the terminals to be allocated resources for each operator. can be determined to sort the terminals for each operator.

According to various embodiments, the processor obtains the smaller of the transmission data size (k) of each terminal and the size (p_n) of the remaining dedicated resources for the terminals to be allocated resources for each operator, and By giving a higher transmission priority to a terminal having a large size, the terminals may be arranged for each operator.

The various embodiments of this document and the terms used therein are not intended to limit the technical features described in this document to specific embodiments, and should be understood to include various modifications, equivalents, or substitutions of the embodiments. In connection with the description of the drawings, like reference numerals may be used for similar or related components. The singular form of the noun corresponding to the item may include one item or a plurality of items, unless the relevant context clearly dictates otherwise.

As used herein, the term “module” or “unit” may include a unit implemented in hardware, software, or firmware, and is used interchangeably with terms such as, for example, logic, logic block, component, or circuit. can be used A module may be an integrally formed part or a minimum unit of a part or a part thereof that performs one or more functions. For example, according to an embodiment, the module may be implemented in the form of an application-specific integrated circuit (ASIC).

According to various embodiments, each component (eg, a module or a program) of the above-described components may include a singular or a plurality of entities. According to various embodiments, one or more components or operations among the above-described corresponding components may be omitted, or one or more other components or operations may be added. Alternatively or additionally, a plurality of components (eg, a module or a program) may be integrated into one component. In this case, the integrated component may perform one or more functions of each component of the plurality of components identically or similarly to those performed by the corresponding component among the plurality of components prior to integration. According to various embodiments, operations performed by a module, program, or other component are executed sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations are executed in a different order, or , omitted, or one or more other operations may be added.

Claims (16)

In a resource allocation method in a base station having a RAN sharing (radio access network sharing) function supporting a plurality of operators,
dividing and setting the entire radio resource (N) into a dedicated resource allocated for exclusive use by each of the plurality of operators and a shared resource allocated to be shared and used by the plurality of operators;
sorting terminals according to transmission priority; and
Allocating resources to the terminal according to the sorted order, including first allocating a dedicated resource of the operator to which the terminal belongs, and then allocating the shared resource to the terminal,
The operation of sorting the terminals according to the transmission priority is,
determining a transmission priority among the terminals of each of the plurality of operators;
determining a carrier transmission priority for the plurality of carriers; and
Based on the carrier transmission priority, the method comprising the operation of arranging the terminals so that the terminals belonging to the operator of the higher transmission priority have a higher transmission priority than the terminals belonging to the operator of the lower priority, the resource allocation method .
According to claim 1,
The operation of allocating resources to the terminal is,
comparing the size (p_n) of an allocable dedicated resource of the operator to which the terminal belongs and the size (k1) of data of the terminal;
As a result of the comparison, if the size of the data of the terminal is less than or equal to (k1<=p_n),
allocating to the terminal a dedicated resource of an operator to which the terminal belongs as much as the size of data of the terminal;
reducing the size of the allocable dedicated resource by the size of data of the terminal (p_n = p_n -k1);
As a result of the comparison, if the size of the data of the terminal is large (k1>p_n),
allocating a dedicated resource of an operator to which the terminal belongs by the size of the allocable dedicated resource to the terminal;
reducing the size of the data of the terminal by the size of the allocable dedicated resource (k2 = k1 -p_n);
updating the size of the allocable dedicated resource to 0 (p_n=0);
Comparing the size (k2) of the reduced data of the terminal and the size (c) of the allocable shared resource;
As a result of comparison, if the size of the allocable shared resource is greater than or equal to (c>=k2),
allocating the shared resource to the terminal by the reduced data size (k2);
reducing the size of the allocable shared resource by the size of the reduced data (c=c-k2);
As a result of comparison, if the size of the allocable shared resource is small (c<k2),
allocating the shared resource to the terminal by the size (c) of the allocable shared resource;
setting the size of the remaining data of the terminal (k1 = k2 - c);
updating the size of the allocable shared resource to 0;
Including, resource allocation method.
3. The method of claim 2,
The operation of allocating resources to the terminal is,
If the size of the allocable dedicated resource of the operator to which the terminal belongs is 0 (p_n=0) and the size of the allocable shared resource is 0 (c=0), the method further includes the operation of completing without allocating resources to the terminal How to allocate resources.
According to claim 1,
The operation of sorting the terminals according to the transmission priority is,
For the terminals to be allocated resources regardless of the operator to which the terminals belong, the terminals are sorted by determining the transmission priority of the terminals by a scheduling method of round robin or weighted fair queuing (WFQ) A method of allocating resources, comprising an action.
According to claim 1,
The operation of sorting the terminals according to the transmission priority is,
For the terminals to be allocated resources regardless of the operator to which the terminals belong, the transmission priority of the terminals is determined based on the priority set in each terminal or the priority set in the data to be transmitted or received by each terminal. A resource allocation method comprising the operation of aligning terminals.
delete According to claim 1,
The operation of determining the transmission priority between the terminals of each of the plurality of operators is,
For the terminals to be allocated resources for each operator, the transmission priority of the terminals is determined on the basis of the priority set in each terminal or the priority set in data to be transmitted or received by each terminal, and the terminals for each operator A method of allocating resources, comprising the operation of determining a transmission priority between the two.
According to claim 1,
The operation of determining the transmission priority between the terminals of each of the plurality of operators is,
For terminals that need to be allocated resources for each operator, the smaller of the transmission data size (k) of each terminal and the size of the remaining dedicated resource (p_n) is obtained, and the higher transmission priority is given to the terminal with the larger size of the obtained value A method for allocating resources, comprising the operation of determining a transmission priority between the terminals for each operator by assigning a priority.
In a base station having a RAN sharing (radio access network sharing) function that supports a plurality of operators,
a first communication unit for communicating with a plurality of terminals according to a wireless communication protocol;
a second communication unit communicating with the core networks of the plurality of operators; and
a processor operatively connected to the first communication unit and the second communication unit;
The processor is
The entire radio resource (N) is divided and set into a dedicated resource allocated for exclusive use by each of the plurality of operators and a shared resource allocated for shared use by the plurality of operators,
Determining a transmission priority between the terminals of each of the plurality of operators,
Determining the carrier transmission priority for the plurality of carriers,
Sorting the terminals so that terminals belonging to a higher transmission priority operator based on the operator transmission priority have a higher transmission priority than terminals belonging to a lower priority operator,
A base station for allocating resources to the terminal according to the sorted order, first allocating a dedicated resource of the operator to which the terminal belongs, and then allocating the shared resource to the terminal.
10. The method of claim 9,
The processor is
Comparing the size (p_n) of an allocable dedicated resource of the operator to which the terminal belongs and the size (k1) of data of the terminal,
As a result of the comparison, if the size of the data of the terminal is equal to or smaller than (k1<=p_n), a dedicated resource of the operator to which the terminal belongs is allocated to the terminal as much as the size of the data of the terminal, and the size of the allocable dedicated resource reduce by the size of the data of the terminal (p_n = p_n -k1),
As a result of the comparison, if the size of the data of the terminal is large (k1>p_n), the dedicated resource of the operator to which the terminal belongs is allocated to the terminal as much as the size of the allocable dedicated resource, and the size of the data of the terminal is allocable Reduced by the size of the dedicated resource (k2 = k1 -p_n), the size of the allocable dedicated resource is updated to 0 (p_n = 0), the reduced data size of the terminal (k2) and the size of the allocable shared resource ( c) compare,
As a result of comparison, if the size of the allocable shared resource is greater than or equal to (c>=k2), the shared resource is allocated to the terminal by the size of the reduced data (k2), and the size of the allocable shared resource is reduced Reduce by the size of the data (c = c-k2),
As a result of comparison, if the size of the allocable shared resource is small (c<k2), the shared resource is allocated to the terminal by the size (c) of the allocable shared resource, and the size of the remaining data of the terminal is set (k1) = k2 - c) and updating the size of the allocable shared resource to 0, the base station.
11. The method of claim 10,
The processor is
When the size of the allocable dedicated resource of the operator to which the terminal belongs is 0 (p_n=0) and the size of the allocable shared resource is 0 (c=0), the base station completes without allocating resources to the terminal.
10. The method of claim 9,
The processor is
For the terminals to be allocated resources regardless of the operator to which the terminals belong, the terminals are sorted by determining the transmission priority of the terminals by a scheduling method of round robin or weighted fair queuing (WFQ) , base station.
10. The method of claim 9,
The processor is
For the terminals to be allocated resources regardless of the operator to which the terminals belong, the transmission priority of the terminals is determined based on the priority set in each terminal or the priority set in the data to be transmitted or received by each terminal. A base station that aligns the terminals.
delete 10. The method of claim 9,
The processor is
For the terminals to be allocated resources for each operator, the transmission priority of the terminals is determined on the basis of the priority set in each terminal or the priority set in data to be transmitted or received by each terminal, and the terminals for each operator The base station determines the transmission priority between the two.
10. The method of claim 9,
The processor is
For terminals that need to be allocated resources for each operator, the smaller of the transmission data size (k) of each terminal and the size of the remaining dedicated resource (p_n) is obtained, and the higher transmission priority is given to the terminal with the larger size of the obtained value A base station for determining a transmission priority between the terminals for each operator by giving a priority.

Images