KR100546002B1 - Method of resource allocation in OFDM based mobile wireless communication system - Google Patents

Abstract

According to the present invention, an orthogonal frequency division multiplexing (OFDM) -based wireless mobile communication system allocates radio resources to packets grouped in groups by grouping a plurality of packets for a forwarded or reversed session. It is about a method.

Resource allocation method in the wireless mobile communication system of the present invention, grouping grouping by the number (K) of packets that can be transmitted at a time per logical block of the wireless mobile communication system at the maximum up to one consecutive uplink or forward packet Steps; And a logical block assignment step of allocating the logical block for each group of packets grouped in the grouping step.

OFDM, wireless communication system, guaranteed service, low power, grouping, grouping

Description

Base station system and terminal system with resource allocation method and packet grouping function of wireless mobile communication system {Method of resource allocation in OFDM based mobile wireless communication system}             

1 is a schematic network diagram of a typical wireless mobile communication system;

2 is a diagram illustrating control information exchanged between a terminal and a base station in a general wireless mobile communication system;

3 is a view illustrating a resource allocation method of forward transmission according to the prior art;

4 is a view illustrating a resource allocation method of reverse transmission according to the prior art;

5 is a configuration block diagram of a base station for a resource allocation method of forward transmission according to an embodiment of the present invention;

6 is a block diagram illustrating a terminal for a resource allocation method of reverse transmission according to an embodiment of the present invention;

7 is a flowchart illustrating a packet grouping method according to an embodiment of the present invention;

8 is a graph of the performance evaluation results of the present invention.

The present invention relates to an orthogonal frequency division multiplexing (OFDM) based wireless mobile communication system. More particularly, the present invention relates to a group of packets grouped by grouping a plurality of packets for a forward transmission or a reverse transmission. A method of allocating resources. The present invention also relates to a base station system and a terminal system having a packet grouping function.

As wireless mobile communication systems become more common, the need for high quality services for multimedia data transmission including voice and high capacity video is increasing. The highest quality service is a real-time service, or guaranteed service, that guarantees the limit of delay that occurs when a packet passes through the network. In order to provide the best quality, the resource scheduler determines the number of sessions that can be guaranteed in real time through admission control based on the maximum radio resource demand that may occur in the worst case.

Orthogonal Frequency Division Multiplexing (OFDM) based wireless mobile communication system is a system capable of transmitting high capacity theoretically by sending several packets together in a unit radio resource. However, packets that can be loaded together are limited to packets destined for the same terminal in the forward direction, and packets generated in the same terminal in the reverse direction.

1 is a schematic network diagram of a general wireless mobile communication system. The wireless mobile communication system includes a base station 100 and a plurality of terminals 101, 102, 103, and the forward or reverse data between the base station 100 and the plurality of terminals 101, 102, 103. Transmission is possible.

Orthogonal Frequency Division Multiplexing (OFDM) -based wireless communication channels have low multi-path fading, resulting in less change in tone quality over time and location within a cell. In addition, the OFDM-based wireless communication channel changes the tones used by each logical channel per OFDM symbol over a random pattern to equalize the quality of each logical channel by equalizing inter-cell interference occurring in a multicell environment.

In an OFDM-based wireless mobile communication system, a radio resource consists of logical blocks of the same size divided into a certain number of logical channels in a certain time interval, and has a certain number of logical blocks in each period. Each logical block may be allocated to different terminals, and one terminal may use all of the logical blocks.

2 is a diagram illustrating control information exchanged between a terminal and a base station in a general wireless mobile communication system.

The terminals 101, 102, and 103 periodically provide channel quality information, for example, a signal-to-interference noise ratio (SINR) value to the base station 100. The base station 100 determines a modulation scheme and a code rate satisfying a target bit error rate (BER) or a frame error rate (FER) for the forward logical block through the SINR value. The number of data bits to be determined is determined, and a plurality of MAC packets are included in a logical block in units of MAC packets having the same L bit size. Therefore, even if the size of the logical block is the same, the number of MAC packets per logical block varies depending on the current channel quality of the user.

In addition, the base station 100 informs the terminals 101, 102, and 103 of the modulation scheme and code rate information used for the reverse logical block. If the modulation scheme is frequency division multiplexing (FDD), this information can be determined through the SINR value extracted from the backward logical block received from the terminals 101, 102 and 103, and the modulation scheme is time division multiplexing (TDD). ), The SINR values periodically reported by the terminals 101, 102, and 103 may be used as they are. Accordingly, as in the case of the downlink logical block, the terminals 101, 102, and 103 may know the maximum number of MAC packets that can be carried per reverse logical block through the information provided from the base station 100. .

Guaranteed service in wired network is to guarantee the limit of end-to-end delay that packet generated by real-time session passes through network and no packet loss.

In general, guarantee service in wireless network allows some packet loss due to channel error due to the property of wireless network, but guarantees end-to-end delay limit for all packets not lost.

3 is a view illustrating a resource allocation method of the forward transmission according to the prior art. The base station 100 may use a resource allocation scheduler 300, for example, a weighted fair queuing (WFQ) scheduler or a service curve scheduler, to provide guaranteed services in the network. The resource allocation scheduler 300 of the base station allocates a logical block, which is a radio resource, in accordance with a real-time request of a packet at the head of each session.

4 is a diagram illustrating a resource allocation method of reverse transmission according to the prior art. When the traffic occurs, the terminals 101, 102, and 103 request the logical block from the resource allocation scheduler 300 of the base station using the logical block requester 400, and are allocated reverse radio resources.

These conventional resource allocation methods have a problem that the scheduler can guarantee a very small number of sessions in real time. In other words, even though one packet arrives, K MAC packets may be loaded per logical block because the terminal is allocated after requesting one logical block to the scheduler without waiting for a later packet. Even if the number of logical blocks equal to the number of packets arriving in the unit time is allocated from the scheduler, one logical block is allocated to each packet, resulting in an inefficient resource consumption.

In addition, when inefficient allocation of logical blocks per packet occurs infrequently, the base station should allocate logical blocks every time a packet arrives and deliver them to the terminal, and the terminal should be active whenever receiving logical blocks. Therefore, there is a problem that the power consumption of the terminal increases.

SUMMARY OF THE INVENTION An object of the present invention is to provide a method for allocating resources by applying a packet grouping method in a wireless mobile communication system having a function of grouping and transmitting a plurality of packets per logical block. have. Another object of the present invention is to provide a base station system and a terminal system having a packet grouping function.

A resource allocation method in a wireless mobile communication system according to an embodiment of the present invention for achieving the above object, it is possible to transmit consecutively inputted reverse or forward packets at one time per logical block of the wireless mobile communication system. Grouping each group into a number K of packets;

And a logical block allocation step of allocating the logical block for each group of packets grouped in the grouping step.

In addition, the base station system for forwarding forward traffic to a plurality of terminals according to the present invention, the number of packets that can be transmitted at a time per logical block of the wireless mobile communication system up to the forward packets continuously input for a plurality of real-time session A plurality of groupers grouping by the number K;

And a resource allocation scheduler for allocating radio resources to group packets bound by the plurality of groupers.

In addition, the terminal system for transmitting the reverse traffic to the base station according to the present invention, the grouping group to group the consecutively inputted reverse packets by the number (K) of packets that can be transmitted at once per logical block of the maximum wireless mobile communication system Wow;

And a logical block requestor which is allocated by requesting a reverse logical block to a resource allocation scheduler of the base station for the group packet bundled in the grouper.

Hereinafter, a base station system and a terminal system having a resource allocation method and a packet grouping function of a wireless mobile communication system according to an embodiment of the present invention will be described in detail with reference to the accompanying drawings.

5 is a configuration block diagram of a base station for a resource allocation method of the forward transmission according to an embodiment of the present invention. The base station 100 is a resource for allocating radio resources to a plurality of groupers 500, 501, 502 that bundles input traffic of a real-time session into a plurality of packets, and a bundle of packets that are bundled at the plurality of groupers 500, 501, 502. An allocation scheduler 300 is provided.

비트이고, 평균 데이터율이

bps인 고정비트율(CBR) 세션 i가 논리블록당

개의 맥(MAC) 패킷을 전송할 수 있는 무선채널을 통과한다고 가정한다.Packet packs have burstyness

Bit, and the average data rate is

Fixed Bit Rate (CBR) session i at bps per logical block

Assume that it passes through a radio channel capable of transmitting two MAC packets.

bps의 비율로 데이터가 입력될 때 최대

개의 패킷을 그룹으로 묶어서 자원할당스케줄러(300)에게 제공한다. 여기서,

값은 단말마다 채널 품질에 의해 변화하고,

값은 세션 i가 처음 연결할 때 트래픽 스펙, 예를 들면 RSVP(resource Reservation Protocol)의 TSpec으로부터 결정되며 변하지 않는 값이다.In the forward direction, a number of groupers 500, 501, 502 must be established before session i requests a logical block.

Maximum when data is entered at the rate of bps

Packets are grouped into groups and provided to the resource allocation scheduler 300. here,

The value is changed by the channel quality for each terminal,

The value is determined from the traffic specification, e.g., TSpec of the Resource Reservation Protocol (RSVP) when session i first connects and is a value that does not change.

Packets arriving at the base station from each session in the forward direction are reconstructed into groups after passing through the assigned grouper. The resource allocation scheduler 300 is a group-based algorithm which is a variation of the existing packet-based algorithm, and is implemented by treating each group as a "virtual packet" of the same size (although the amount of packets constituting each group may be different). . For example, when the WFQ algorithm is used as a resource allocation scheduler, a time stamp value per virtual packet is allocated according to a weight, and a logical block is allocated using a low time stamp value. In addition, when using the service curve algorithm as a resource allocation scheduler, a deadline value per virtual packet is allocated according to the service curve, and a logical block is allocated using a low deadline value. Since the virtual packet receiving terminal can know the receiving point in advance through the control information, the terminal supplies power to the data receiving circuit only at the receiving point. In this case, the power consumption of the terminal is proportional to the number of the received virtual packets, and if the group is grouped using a grouper, the number of the packets is reduced, thereby reducing power consumption for data reception of the terminal.

6 is a block diagram illustrating a terminal for a resource allocation method of reverse transmission according to an embodiment of the present invention. Each of the terminals 101, 102, and 103 requests a logical block to the group of resource grouping schedulers 300 of the base station for the group of packets grouped by the grouper 600 and the group of packets packed in the grouper 600, and reverse And a logical block requester 400 for allocating radio resources.

bps일 때, 그루퍼(600)는

bps의 비율로 입력되는 데이터에 대해 최대 K개의 패킷을 그룹으로 묶어서 논리블록요구기(400)에게 제공한다. 역방향 전송에서도 패킷의 묶음을 마치 동일한 크기의 하나의 "가상패킷"으로 취급한다.The reverse channel quality can transmit K MAC packets per logical block, and the reverse average data rate

at bps, the grouper 600 is

Up to K packets are grouped for data input at a bps rate and provided to the logical block requester 400. In reverse transmission, packets are treated as a single "virtual packet" of the same size.

The resource allocation scheduler 300 of the base station transforms and uses the packet-based scheduler algorithm on a group basis. For example, when the WFQ algorithm is used as a resource allocation scheduler, a time-stamp value per virtual packet is assigned according to a weight, a logical block that can be serviced to a virtual packet having the smallest time stamp value is selected, and the determined The schedule is notified through the control channel to the terminal to transmit the virtual packet. Then, the terminal loads the virtual packet in the reverse logical block assigned at the scheduled time and transmits it to the base station. A terminal that loads data in a logical block and delivers the data to the base station supplies power to the data transmission circuit only at the time of transmission. In this case, the power consumption of the terminal is proportional to the number of transmission virtual packets. When the packets are grouped using the grouper, the number of the terminals is reduced, thereby reducing power consumption for data transmission of the terminal.

시간을 더한 값으로 설정하는데, 이 시간이 현재부터

bps의 비율로 계속해서 데이터가 입력되었을 때 하나의 그룹이 생성되는 시간이다. 그리고, 패킷 개수 카운터가 K개가 되는 지를 확인한다(S706). 단계 S706의 확인 결과 N=K이면, 해당 그룹에 포함된 K개의 패킷들을 모두 출력하고(S707), 패킷 개수 카운터 N을 초기화한 후(S708), 타이머를 종료한다(S709).7 is a flowchart illustrating a method of grouping packets in a grouper according to an embodiment of the present invention. When a new packet arrives at the grouper (S701), it is determined whether the arrived packet is the first packet of the new group, that is, the packet count counter N = 0 (S703). As a result of the determination in step S703, if it is the first packet, a timer is set (S704), and the packet number counter N of the current group is increased by one (S705). The timer is the current time

Is set to the time plus, which is the time from now

The time at which a group is created when data is continuously input at the bps rate. Then, it is checked whether the number of packet counters is K (S706). If the result of the check in step S706 is N = K, all K packets included in the corresponding group are output (S707), the packet number counter N is initialized (S708), and the timer is terminated (S709).

On the other hand, if the packet count counter N is not K, as a result of checking in step S706, the process proceeds to step S701 to wait for a new packet to arrive.

On the other hand, even if K packets are not collected in one group, when the timer value ends (S702), the process proceeds to step S707 to output all the packets included in the group and initializes the N value to 0 (S708).

Therefore, with the grouper, packets can be bundled and loaded together in one logical block, thereby greatly reducing the number of groups output at a given time.

Hereinafter, the effect of the present invention is demonstrated by comparing the use of the grouper with the use of the grouper by using a formula.

-그루퍼를 사용하지 않는다면, 길이가 t인 시간 구간 동안 입력되는 패킷 데이터 양이

비트보다 크지 않을 때 그 구간 동안 출력되는 최대 패킷 수는

이다.if

If the grouper is not used, the amount of packet data input during the time interval of length t

When not greater than a bit, the maximum number of packets output during that interval is

to be.

비트보다 크지 않고, 생성하는 패킷의 크기는 동일한 크기 L비트라고 가정하자. 그러면 세션 i의 트래픽이

-그루퍼를 통과했을 때 t인 시간 구간 동안 출력되는 그룹수는

개를 넘지 않는다. The amount of packet data generated by CBR session i is generated during any time interval of length t.

Assume that the size of the packet to be generated is not greater than bits, and the same size L bits. Then traffic from session i

When passing through the grouper, the number of groups output during the time interval t is

No more than dogs

That is, the first effect of the present invention is that the maximum number of logical blocks required by the resource allocation scheduler is reduced by 1 / K when the grouper is used.

를 넘지 않는다는 것을 증명해 보면 다음과 같다.When using the present invention, the number of groups to be output

Prove that it does not exceed the following.

동안 출력되는 그룹 수를

로 표기한다.

동안 타이머 종료와 K 개의 도착 패킷에 의해서 생성된 그룹 수를 각각

와

로 표기하면 아래의 [수학식 1]을 얻을 수 있다.Any time interval

The number of groups output during

It is written as.

During the timer end and the number of groups generated by the K arrival packets, respectively.

Wow

In Equation 1, Equation 1 below can be obtained.

[Equation 1]

의 최대값을 도출하면 다음과 같다.About the following three cases

The maximum value of is derived as follows.

구간 동안 출력된 첫 번째 그룹이 t₁ 시간 이전에 도착한 패킷을 포함하고 그 그룹 생성 방식이 K 개의 패킷 도착으로 만들어진 경우이다.In the first case,

It is the case that the first group output during the interval includes packets arriving before t ₁ hour and the group generation method is made up of K packet arrivals.

비트보다 크지 않다.

구간 동안 타이머 종료에 의해서 그루퍼로부터 출력된 그룹 수가

개라고 가정하고, 이 구간 동안 세션 i로부터 입력된 데이터들 중 타이머 종료에 의해서 생성된 그룹들에 포함된 데이터들을 제외한 것들을

라고 표기한다. 타이머 종료에 의한 시간 구간은

이므로,

은

구간에다가

을 뺀 시간 구간 동안 입력될 수 있는 최대 데이터 양으로서, 아래의 수학식 2와 같다.The amount of packet data generated by session i is for any time interval of length t.

Not greater than a bit

The number of groups output from the grouper by the end of the timer during the interval.

Suppose that is a dog, and the data input from the session i during this interval are excluded from the data included in the groups generated by the timer termination.

It is written. The time interval by the end of the timer

Because of,

silver

In the section

It is the maximum amount of data that can be input during the time interval subtracted from Equation 2 below.

[Equation 2]

중 KL 비트가 함께 모였을 때 하나의 그룹으로 출력되므로

는 아래의 수학식 3과 같다.And,

When the KL bits are gathered together, they are output as a group.

Is the same as Equation 3 below.

[Equation 3]

는 아래의 수학식 4와 같다.The addition of 1 in Equation 3 above means the first group including packets arriving before t ₁ hour. therefore,

Is the same as Equation 4 below.

[Equation 4]

구간 동안 출력된 첫 번째 그룹이 t₁ 시간 이전에 도착한 패킷을 포함하고, 그 그룹 생성 방식이 타이머 종료에 의해 만들어진 경우이다.In the second case

It is the case that the first group output during the interval includes packets arriving before t ₁ hour, and the group generation method is created by the timer termination.

구간 동안 타이머 종료에 의해서 그루퍼로부터 출력된 그룹수가

+1 개라고 가정한다. 여기서, 1을 더한 것은 타이머 종료에 의해서 생성된 그 첫 번째 그룹을 의미한다. 또한,

구간 동안 세션 i로부터 입력된 데이터들 중 타이머 종료에 의해서 생성된 그룹들에 포함된 데이터들을 제외한 것들을

라고 표기하면,

는 아래의 수학식 5와 같다.

The number of groups output from the grouper by the end of the timer during the interval

Assume +1. Here, the addition of 1 means the first group generated by the timer termination. Also,

The data input from the session i during the interval are excluded from the data included in the groups generated by the timer termination.

If you write,

Is the same as Equation 5 below.

[Equation 5]

중 KL 비트가 함께 모였을 때 하나의 그룹으로 출력되므로

는 아래의 수학식 6과 같고,

는 아래의 수학식 7과 같다.And,

When the KL bits are gathered together, they are output as a group.

Is equal to Equation 6 below,

Is the same as Equation 7 below.

[Equation 6]

[Equation 7]

구간 동안 출력된 첫 번째 그룹이 t₁ 시간 이전에 도착한 패킷을 포함하지 않는 경우이다.In the third case,

It is the case that the first group output during the interval does not include packets arriving before t ₁ hour.

구간 동안 타이머 종료에 의해서 그루퍼로부터 출력된 그룹수가

라고 가정한다. 또한,

구간 동안 세션 i로부터 입력된 데이터들 중 타이머 종료에 의해서 생성된 그룹들에 포함된 데이터들을 제외한 것들을

라고 표기하면,

는 아래의 수학식 8과 같다.

The number of groups output from the grouper by the end of the timer during the interval

Assume that Also,

The data input from the session i during the interval are excluded from the data included in the groups generated by the timer termination.

If you write,

Is the same as Equation 8 below.

[Equation 8]

중 KL 비트가 함께 모였을 때 하나의 그룹으로 출력되므 로

는 아래의 수학식 9와 같고,

는 아래의 수학식 10과 같다.And,

Of KL bits are output as a group when they are gathered together.

Is equal to Equation 9 below,

Is the same as Equation 10 below.

[Equation 9]

[Equation 10]

-그루퍼를 사용하면 최악의 경우 논리블록 요구량을 약 1/K로 줄이므로 보장서비스를 제공할 수 있는 세션수를 최대 K배 늘릴 수 있다는 것이다. 이 두 번째 효과에 대해 구체적인 예를 들어 설명한다.The second effect of the present invention is an important advantage derived as a result of the first effect described above,

Using the grouper, in the worst case, reduces the logical block requirements to about 1 / K, increasing the number of sessions that can provide guaranteed services up to K times. This second effect will be explained with specific examples.

The base station has 16 logical blocks per 11.3 ms and each logical block can carry one to a maximum of 10 MAC packets according to the channel quality of the UE, and each MAC packet is 240 bits in size. Assume that this base station requires burst service with 8000 bits of burst and an average data rate of 128 Kbps.

8 illustrates a session that can be approved when the base station uses the WFQ algorithm as a resource allocation scheduler and the delay limits from the base station to the terminal are 50 ms and 100 ms, respectively, when the proposed grouper is used or not. Display the number.

It can be seen that the use of groupers increases the number of sessions that can be accepted when the number of packets that can be loaded per logical block increases, but not when the grouper is not used.

To show how this experimental result was obtained, consider the case where the K value is 3 and the delay limit is 100 ms. The capacity that the system can guarantee is 994 Kbps when (3, 128 Kbps) -grouper is used for each session. (= 1415 logical block / sec * 3 packets / logical block * 240 bits). If the grouper is not used, the capacity that can be guaranteed by the system is 331 Kbps because one logical block sends one packet. Each grouper can generate delays of up to 5.493 (= 3 * 240 / 128K) ms, so the WFQ algorithm can guarantee a 100 ms and 94.507 ms delay limit, respectively, with and without groupers.

If we guarantee 128 Kbps for each session, the delay limit is 62.9 (= (8000 + 240) / 128K) ms, so we can guarantee the delay limit by assigning 128 Kbps as the weight in both cases. At this time, if the delay limit to be guaranteed is smaller than 62.9 ms, a larger weight should be assigned to reduce the delay. Thus, the number of sessions that can be granted with and without groupers is 7 (= 994 / 128K) and 2 (= 331 / 128K), respectively.

The third effect of the present invention is an advantage derived as a result of the first effect described above, and the use of a grouper allows the packets to be packed together in one logical block at maximum within a range that does not violate the delay limit. The average number of logical blocks required for the network is reduced. Therefore, when the amount of traffic input from the base station to the terminals is large, more packets can be delivered to the terminals.

The fourth effect of the present invention is an advantage derived as a result of the second effect described above. Since the terminal receiving the virtual packet (group) can know the reception point in advance through the control information channel, the terminal receives data only at the reception point Since power is supplied to the circuit, power consumption of the terminal is proportional to the number of virtual packets, and the number of the virtual packets is reduced by the grouper, thereby reducing the power consumption for data reception of the terminal. In addition, power consumption for data transmission of the terminal can be reduced.

Although the technical spirit of the present invention has been described above with reference to the accompanying drawings, it is intended to exemplarily describe the best embodiment of the present invention, but not to limit the present invention. In addition, it is obvious that any person skilled in the art may make various modifications and imitations without departing from the scope of the technical idea of the present invention.

As described above, according to the present invention, the amount of radio resources required by the resource allocation scheduler can be reduced, the number of real-time sessions that can provide guaranteed service can be increased, and the total radio capacity by efficient use of logical block resources. This is an advantage, and there is an advantage that can reduce the power consumed by the terminal.

Claims (12)

Grouping consecutively inputted reverse or forward packets into groups by the number (K) of packets that can be transmitted at one time per logical block of the maximum wireless mobile communication system; And a logical block allocating step of allocating the logical block for each group of packets grouped in the grouping step. The method of claim 1, wherein the grouping step, A group start detection step of checking whether the newly entered packet is the first packet of the new group when a new packet is input, Increasing the number of packets of the group by one; If the number of packets of the group is K, resource allocation of the wireless mobile communication system comprising performing the logical block allocation step for the packets included in the group and initializing the number of packets of the group. Way. The method of claim 2, wherein the grouping step, If the newly input packet is the first packet of the new group in the group start detection step, the timer is set and then the packet number increase step is performed, and the timer ends while the group start detection step or the packet number increase step is performed. And performing a logical block allocation step for the packets included in the group, and forcibly terminating the grouping of packets in the group. The method of claim 1, wherein the logical block assignment step, And allocating time stamp values according to weights to the packet groups, and allocating the logical blocks in order of decreasing time stamp values. In the base station system for forwarding forward traffic to a plurality of terminals, A plurality of groupers for grouping forward packets sequentially input for a plurality of real time sessions by a number (K) of packets that can be transmitted at one time per logical block of the wireless mobile communication system; And a resource allocation scheduler for allocating radio resources to group packets bound by the plurality of groupers. The method of claim 5, wherein the grouper, When a new forward packet is input, it is checked whether the newly input forward packet is the first forward packet of the new forward group, and the number of packets of the forward group is increased by one. If the number of packets of the forward group is K, the forward group is checked. The base station system of the wireless mobile communication system, characterized in that for initializing the number of packets of the group after forwarding the included forward packets to the resource allocation scheduler. The method of claim 6, wherein the grouper, If the newly entered forward packet is the first forward packet of the new forward group, a timer is set, and when the timer expires, forwards forward packets included in the forward group to the resource allocation scheduler and initializes the number of packets of the forward group. Base station system of a wireless mobile communication system, characterized in that. The method of claim 5, wherein the resource allocation scheduler, And assigning a time stamp value according to a weight to the forward packet group, and assigning a forward logical block in descending order of the time stamp value. In a terminal system for transmitting reverse traffic to a base station, A grouper for grouping consecutively inputted reverse packets into groups (K) of packets that can be transmitted at one time per logical block of a maximum wireless mobile communication system; And a logical block requestor for requesting a reverse logical block to the resource allocation scheduler of the base station for the group packet bound by the grouper. The method of claim 9, wherein the grouper, When a new reverse packet is input, it is checked whether the newly input reverse packet is the first reverse packet of the new reverse group, and the number of packets of the reverse group is increased by one. And transmitting the included packets to the logical block requester and initializing the number of packets of the reverse group. The method of claim 10, wherein the grouper, If the newly inputted reverse packet is the first reverse packet of the new reverse group, a timer is set, and when the timer expires, the reverse packets included in the reverse group are transmitted to the logical block requester, and then the number of packets of the reverse group is initialized. Terminal system, characterized in that. 10. The terminal system of claim 9, wherein the resource allocation scheduler allocates a time stamp value according to a weight to the reverse packet group, and allocates the reverse logical blocks in the order of decreasing time stamp values.

Images