KR100932263B1 - Resource allocation method and device in mobile communication system - Google Patents

Abstract

According to the present invention, as a method of allocating a resource in a mobile communication system, a terminal to receive a service is active, and a terminal not to receive the service is divided into children, and a terminal divided into children is inserted into an idle list, and a terminal classified as active is activated. Insert into list

Broadband Wireless Access System, Resource Allocation

Description

Resource allocation method and device in mobile communication system {METHDO AND APPARATUS FOR RESOURCE ALLOCATION IN WIRELESS COMMUNICATION SYSTEM}

The present invention is a resource allocation method based on a service delay for guaranteeing the quality of service (QoS) of the uplink, especially in a broadband wireless access system based on IEEE 802.16 Wireless MAN.

Wireless Broadband (WiBro) system based on IEEE 802.16 Wireless MAN uses various forms of Internet Protocol (IP) provided by wired Internet using wireless transmission technology that guarantees spectrum use efficiency in the 2.3 GHz frequency band. It is a 3.5 generation mobile communication system that provides video and high-speed packet data transmission of based wireless data services (streaming video, FTP, mail, chat). WiBro system supports base station (hereinafter referred to as "BS") and wireless access and network connection of mobile station (hereinafter referred to as "MS") and packet access to perform mobility control and packet routing functions of BS. It includes a router (Packet Access Router, hereinafter referred to as "PAR").

In WiBro system, service is provided through polling which is resource allocation of uplink. The uplink is divided into five data service types. Service types include Unsolicited Grant Service (UGS), Real-Time Variable Rate (RT-VR), Extended Real-Time Variable Rate (ERT-VR), Non Real-Time Variable Rate (NRT-VR), and Best Effort (BE). There is.

UGS supports fixed-size data transmission for a fixed-interval, and applications include Voice over IP without silence suppression This is the same real-time data stream. The QoS service flow parameters required for scheduling of UGS include the minimum reserved traffic rate, maximum latency, size of service data unit (SDU), and tolerated jitter. , Request / Transmission Policy, and Unsolicited Grant Interval. In order to provide a service, the overhead of requesting a frequency bandwidth allocation and receiving a fixed size bandwidth is minimized. The BS periodically allocates a burst frequency bandwidth to the corresponding flow.

RT-VR can be supported through a real-time polling service (hereinafter referred to as "rtPS"). rtPS supports variable-size data transfer over a fixed period of time, with applications such as MPEG video. QoS service flow parameters required for RT-VR scheduling include minimum reserved traffic rate, maximum sustained traffic rate, maximum latency, request / transmission policy, And Unsolicited Polling Interval. The frequency bandwidth required for providing the RT-VR service is a variable sized bandwidth required for data transmission, unlike the UGS. In addition, the BS provides a unicast request opportunity for the corresponding service flow, so that the MS can perform the request process without competition.

ERT-VR is a scheduling scheme proposed for voice over IP like UGS service or real-time uplink service scheduling supporting various sizes of data such as RT-VR. It typically supports Voice over IP with silence suppression. QoS service flow parameters required for ERT-VR service scheduling include maximum latency, tolerated jitter, minimum reserved traffic rate, maximum sustained traffic rate, traffic priority, request / transmission method, And voluntary award intervals.

NRT-VR is a service that can be supported through a non real-time polling service (hereinafter referred to as "nrtPS"). nrtPS supports variable-size data transfers that require a minimum data rate and provides a delay-tolerant data stream service such as FTP. The essential QoS service parameters for service scheduling of the NRT-VR are minimum reservation traffic rate, maximum sustained traffic rate, traffic priority, and request / transmission scheme. The BS provides timely unicast request opportunities for service delivery, so the MS has to compete to make the request.

BE supports traffic for which no minimum service level is required. QoS service flow parameters required for BE service scheduling are maximum sustained traffic rate, traffic priority, and request / transmission scheme.

In the prior art, there is no detailed description of scheduling using QoS service flow parameters as described above, and the periodic allocation (polling) is mainly performed by a round robin method. The round robin method has the advantage of being able to allocate resources fairly to the target who wants to receive the polling service by serving the requested service first, but there is a problem that QoS is difficult to guarantee.

An object of the present invention is to provide a periodic resource allocation method capable of guaranteeing QoS using QoS service flow parameters.

In order to achieve the above object, the resource allocation method of a mobile communication system according to an aspect of the present invention is to active the terminal to receive the service to the terminal that does not want to receive the service to the children classified terminal children Insert into the list, and insert the terminal identified as active into the active list.

In order to achieve the above object, the resource allocation method of the mobile communication system according to another aspect of the present invention inserts a terminal that does not want to receive the service to the idle list, and inserts a service requested by the terminal to receive the service into the active list.

In order to achieve the above object, the apparatus for allocating a resource of a mobile communication system according to another aspect of the present invention is active / child identification for dividing a terminal which is not intended to receive the first service into children by actively making a terminal which is intended to receive a first service. And an idle list inserting unit for inserting the first terminal classified as idle into the idle list and an active list inserting unit for inserting the active terminal separated into the active list.

As described above, according to the present invention, by allocating resources in consideration of resource allocation cycles and delays, it is possible to improve the efficiency of resources while guaranteeing QoS.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is said to "include" a certain component, it means that it can further include other components, without excluding other components unless specifically stated otherwise. In addition, the terms “… unit”, “… group” described in the specification mean a unit that processes at least one function or operation, which may be implemented by hardware or software or a combination of hardware and software.

Now, a resource allocation method and apparatus of a mobile communication system according to an embodiment of the present invention will be described in detail with reference to the accompanying drawings.

First, a resource allocation apparatus according to an embodiment of the present invention will be described in detail with reference to FIG. 1. 1 is a block diagram of a resource allocation apparatus according to an embodiment of the present invention.

As shown in FIG. 1, an apparatus for allocating resources according to an embodiment of the present invention includes an active / idle separator 110, an active list inserter 120, an active list deleter 130, The idle list inserting unit 140 and the idle list deleting unit 150 are included in the BS of the IEEE 802.16 Wireless MAN based WiBro system.

The active / idle division unit 110 determines whether the MS wants to receive a service and divides the MS into children when the MS wants to receive a service and an MS when the MS does not want to receive a service.

The active list inserting unit 120 inserts a service classified as an active MS or an MS classified as active in the active / idle separating unit 110 into the active list, and the active list deleting unit 130 allows the MS to be a BS. If a resource is no longer required to be allocated after the resource is allocated from the MS, that is, the service is no longer desired to be serviced, the MS or the service that the MS wants to receive is deleted from the active list.

The idle list inserting unit 140 inserts the MS separated by the children from the active / child separator 110 into the idle list, and the idle list deleting unit 150 indicates that the MS of the idle list wants to receive the service. If a resource must be allocated from the MS, delete the MS from the idle list.

Next, a resource allocation method of a mobile communication system according to an embodiment of the present invention will be described with reference to FIGS. 2 to 4. 2 is a flowchart illustrating a resource allocation method of a mobile communication system according to an embodiment of the present invention. 3 is a diagram illustrating an active list and an idle list used in a resource allocation method of a mobile communication system according to an embodiment of the present invention. 4 is a diagram illustrating a method of deleting an additional service in an active list when an MS needs an additional service in a resource allocation method according to an embodiment of the present invention.

As shown in FIG. 2, the base station determines whether the MS wants to be serviced (S201). As a result of the determination, if the MS does not want to receive the service, the MS is inserted into the idle list (S202). When the base station receives a service request from the MS in the idle list (S203), the MS is deleted from the idle list (S204) and the MS or the service requested by the MS is inserted into the active list.

Referring to FIG. 3, when MS 3 is in an idle list and a service request is generated, MS 3 is deleted from the idle list and the service of MS 3 or MS 3 is inserted into the active list.

As a result of the determination in step S201, when the MS wants to receive a service, the base station first calculates a period of time for allocating resources to the MS to support the service desired by the MS using Equation 1 (S205).

는 A보다 크거나 같은 정수 중 가장 작은 정수를 의미한다. Herein, T (Time to expire) is a time interval in which resources should be allocated, F _T is a time when one frame is transmitted, and P is a frame interval in which resources should be allocated as a period.

Is the smallest integer greater than or equal to A.

For example, if the MS wants to receive a multimedia service and resources are to be allocated once every 50 ms, T is 50 ms. If the frame transmission time F _T is 10 ms, the period P is 5. The MS then allocates resources once every 5 frames to support multimedia services.

The base station inserts the MS or the service that the MS wants to receive at the corresponding position of the active list according to the period calculated in step S205 (S206). At this time, the MS may be inserted into the active list or a service that the MS wants to receive may be inserted. If a single MS needs to receive multiple services and allocate resources for each service, it must insert the service into the active list.

The position at which the service of the MS is inserted will be described with reference to FIG. 3. In FIG. 3, Q _p is a p-frame service queue. That is, Q _p is a queue of services or MSs whose resource allocation period is p. Q _p [k] means the service or MS waiting for the k th of Q _p .

As shown in FIG. 3, the resource allocation method according to an embodiment of the present invention manages an idle list and an active list, and the active list has a queue for each resource allocation period.

The position to be inserted into the active list is inserted into the p-frame service queue in the active list when the period calculated by Equation 1 is p. In the above example, since the MS has a resource allocation cycle of 5, the MS or the multimedia service is inserted into Q ₅ .

The base station allocates a resource to the MS to receive the service of the active list (S207). At this time, the MS is allocated to the MS stored in the p-frame service queue or MS to receive the service stored in the p-frame service queue to allocate resources every p frames to support the service. In the above example, since the MS or the multimedia service of the MS is inserted in Q ₅ , the base station allocates resources to the MS once every 5 frames to support the multimedia service.

After allocating resources to the MS, the base station determines whether the MS needs additional services (S208). If no additional service is required, the MS or the service of the MS is deleted from the active list (S209), and the MS is inserted into the idle list (S202). 3 shows that after the Q ₁ [0] service of MS 1 is completed, if no additional service is needed, the Q ₁ [0] MS or service is deleted from the active list and MS 1 is inserted into the idle list. .

As a result of the determination in step S208, when additional services are needed, a resource allocation period is calculated (S205). At this time, the resource allocation period is calculated using Equation 2.

는 A보다 작거나 같은 정수 중 가장 큰 정수를 의미한다. Here, P _t means the t-th period, D means the delay,

Is the largest integer less than or equal to A.

As can be seen in Equation 2, the period for the additional service is determined in consideration of the previous period (P _{t- 1} ) and the delay.

That is, as shown in FIG. 4, when a large number of delays occur in a previous cycle and a service needs to be performed in a shorter period than the previous cycle, an MS or a service is inserted into a short cycle queue (401), and the service is easily performed. If so, the MS or service is inserted into the queue with a period longer than the previous period (402).

Embodiments of the present invention are not implemented only through the above-described apparatus and / or method, but may be implemented through a program for realizing a function corresponding to the configuration of the embodiments of the present invention, a recording medium on which the program is recorded, and the like. Such implementations may be readily implemented by those skilled in the art from the description of the above-described embodiments.

Although the embodiments of the present invention have been described in detail above, the scope of the present invention is not limited thereto, and various modifications and improvements of those skilled in the art using the basic concepts of the present invention defined in the following claims are also provided. It belongs to the scope of rights.

1 is a block diagram of a resource allocation apparatus according to an embodiment of the present invention.

2 is a flowchart illustrating a resource allocation method of a mobile communication system according to an embodiment of the present invention.

3 is a diagram illustrating an active list and an idle list used in a resource allocation method of a mobile communication system according to an embodiment of the present invention.

4 is a diagram illustrating a method of deleting an additional service in an active list when an MS needs an additional service in a resource allocation method according to an embodiment of the present invention.

Claims (16)

In the resource allocation method in the base station of the mobile communication system, Dividing the terminal which is not intended to receive the service into children by actively selecting the terminal which is to be served; Inserting the first terminal identified by the children into an idle list; And Inserting the second terminal classified as active into an active list; Inserting into the active list Calculating a first resource allocation period, which is a period of allocating resources to the second terminal to support a first service that the second terminal wants to receive; And Inserting the second terminal into a position in the active list determined using the first resource allocation period; Resource allocation method comprising a. delete The method of claim 1, The first resource allocation period is a resource allocation method that is the smallest integer greater than or equal to a value obtained by dividing a time interval in which one frame is transmitted by the second terminal to allocate resources to support the first service. The method of claim 1, The active list has a queue for each resource allocation period, The inserting at a position in the active list may include inserting the second terminal into the queue corresponding to the first resource allocation period. The method of claim 1, Allocating resources to the second terminal according to the resource allocation period; And Determining whether the second terminal additionally wants to receive a second service. The method of claim 5, Calculating a second resource allocation period by using a delay while receiving the first service when the second terminal wants to receive the second service; And Inserting the second terminal into a position in the active list determined using the second resource allocation period, The second resource allocation period means a period for allocating resources to provide the second service to the second terminal. The method of claim 6, And wherein the second resource allocation period is a sum of the largest integer among the integers less than or equal to a value obtained by dividing the delay by the time when the one frame is transmitted and the first resource allocation period. The method of claim 5, And deleting the second terminal from the active list and inserting the second terminal into the idle list if the second terminal does not want to receive the second service. The method according to any one of claims 1 and 3 to 8, And deleting the first terminal from the idle list when receiving a service request from the first terminal. In the resource allocation method in the base station of the mobile communication system, Inserting a first terminal, which is not intended to receive a service, into an idle list; And Inserting a first service requested by a second terminal to receive a service into an active list; Inserting into the active list Inserting the first service into a location in the active list determined using a first resource allocation period; The first resource allocation period is a period of allocating resources to the second terminal to support the first service, and a frame having a time interval in which the second terminal should be allocated resources to support the first service. Is the smallest integer greater than or equal to divided by the time it is sent. Resource allocation method. delete The method of claim 10, Determining whether the second terminal additionally wants to receive a second service; Calculating a second resource allocation period by using a delay while receiving the first service when the second terminal wants to receive the second service; Inserting the second service into a position in the active list determined using the second resource allocation period, The second resource allocation period means a period for allocating resources to provide the second service to the second terminal. The method of claim 12, And deleting the first service from the active list and inserting the second terminal into the idle list if the second terminal does not want to receive the second service. In the resource allocation apparatus of the base station of the mobile communication system, An active / idle division unit for dividing a terminal not to receive the first service into children as a terminal active to receive a first service; An idle list inserting unit inserting the first terminal classified as idle into an idle list; And An active list insertion unit for inserting the second terminal classified as active into an active list, The active list insertion unit inserts the second terminal into a position in the active list determined using a resource allocation period, The resource allocation period is a period of allocating resources to the second terminal in order to support a service that the second terminal wants to receive. Resource Allocation Device. delete The method of claim 14, An active list deleting unit for deleting the third terminal from the active list when the third terminal inserted in the active list no longer receives the service after allocating a resource from the base station; And an idle list deleting unit for deleting the fourth terminal from the idle list when the fourth terminal inserted in the idle list requests a service.

Images