KR20180088223A - Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network - Google Patents

Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network Download PDF

Info

Publication number
KR20180088223A
KR20180088223A KR1020170013017A KR20170013017A KR20180088223A KR 20180088223 A KR20180088223 A KR 20180088223A KR 1020170013017 A KR1020170013017 A KR 1020170013017A KR 20170013017 A KR20170013017 A KR 20170013017A KR 20180088223 A KR20180088223 A KR 20180088223A
Authority
KR
South Korea
Prior art keywords
terminal
access
wireless mobile
delay time
reducing
Prior art date
Application number
KR1020170013017A
Other languages
Korean (ko)
Inventor
이재용
김종헌
Original Assignee
연세대학교 산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 연세대학교 산학협력단 filed Critical 연세대학교 산학협력단
Priority to KR1020170013017A priority Critical patent/KR20180088223A/en
Publication of KR20180088223A publication Critical patent/KR20180088223A/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0289Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0215Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0284Traffic management, e.g. flow control or congestion control detecting congestion or overload during communication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/02Access restriction performed under specific conditions
    • H04W48/06Access restriction performed under specific conditions based on traffic conditions

Landscapes

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

Abstract

Disclosed is a congestion control method for reducing an access delay time of a terminal in a wireless mobile communication network. The disclosed congestion control method determines the number of retransmissions of a terminal in a specific service and applies different access probabilities for each terminal based on the determined access number. According to the present invention, access delay can be reduced through congestion control in a random access channel (RACH) of the wireless mobile communication network.

Description

무선 이동통신망에서 단말의 접속지연시간 단축을 위한 혼잡 제어 방법{Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network}TECHNICAL FIELD The present invention relates to a congestion control method for reducing a connection delay time of a terminal in a wireless mobile communication network,

본 발명의 실시예들은 무선 이동통신망에서 단말의 접속지연시간 단축을 위한 혼잡 제어 방법에 관한 것이다. Embodiments of the present invention relate to a congestion control method for shortening a connection delay time of a terminal in a wireless mobile communication network.

Machine-type communication (MTC)에 대한 요구가 점차 늘어나면서 무선이동 통신망에서도 이를 지원하는 것이 중요해졌다. MTC는 기존의 human-to-human 통신과는 상이하게 다른 특성을 지닌다. 특히, small data가 많다는 점과 MTC 단말의 수가 스마트 폰에 비하여 매우 많다는 점, 그리고 uplink 위주의 통신이 많다는 점에서, random access channel (RACH)에서의 congestion 문제가 해결해야 할 시급한 문제가 되었다.As the demand for machine-type communication (MTC) grows, it becomes important to support it in the wireless mobile communication network. MTC has different characteristics from existing human-to-human communication. In particular, the congestion problem on the random access channel (RACH) has become an urgent problem to solve because it has a lot of small data, the number of MTC terminals is much larger than that of smart phones, and that there are many uplink-oriented communications.

Random access는 eNB에 접속하고자하는 단말들이 정해진 RACH에 preamble을 전송하면서 시작된다. 이때, preamble은 정해진 수 (V)가 있으며, 단말은 무작위로 하나를 선택하여 전송하게 된다. 이때, 유일한 preamble을 선택한 단말만이 eNB에 의하여 uplink자원을 할당받게 된다. 하나의 preamble을 복수의 단말이 선택하는 경우 collision이 발생하여 해당 RACH에서는 random access를 실패하게 되며, random back-off 이후 다시 random access 과정을 수행하게 된다. 따라서, 너무 많은 단말이 동시에 random access를 하면, preamble collision이 발생하게 되고, Random access의 효율성이 떨어지고 접속 시간이 급증하게 된다.  Random access is initiated when the UEs accessing the eNB send a preamble to the specified RACH. At this time, the preamble has a predetermined number (V), and the terminal randomly selects one to transmit. At this time, only the UE that selected the unique preamble is allocated the uplink resource by the eNB. When a plurality of UEs select one preamble, a collision occurs, random access fails in the corresponding RACH, and the random access process is performed again after the random back-off. Therefore, if too many terminals perform random access at the same time, preamble collision occurs, the efficiency of random access decreases, and the connection time increases rapidly.

이를 해결하기 위한 효율적인 방법으로는 access class barring (ACB) ( 또는 p-persistent method라고도 함) 기법이 제안되었었다. 미리 eNB가 접속하려하는 단말의 수를 예측하고 그 수가 허용 접속 수 보다 큰경우 접속확률을 제어하는 것이다. 일정한 주기로 전송하는 system information block (SIB) 메시지에 접속확률 (barring factor)을 포함하여 보내고, random access를 하려하는 단말은 preamble 전송전에 무작위 값을 선출하여 barring factor 보다 작은경우 이후 random access를 진행한다. 반대의 경우에는, 일정시간 barring이된다. 그러나 이 기법은 단말의 접속 지연시간을 급증시키는 단점이 있다. 따라서, ACB에서는 MTC 단말을 여러 개의 access class (AC)로 나누고 혼잡발생시 priority가 낮은 AC들을 conrtol하게 된다. (AC 기반 control)An access class barring (ACB) (or p-persistent method) technique has been proposed as an effective way to solve this problem. Predicts the number of terminals that the eNB intends to access in advance, and controls the connection probability when the number is larger than the allowed number of connections. A terminal that transmits a system information block (SIB) message including a barging factor and transmits randomly is selected before the preamble transmission. If the random number is less than the barring factor, random access is performed. In the opposite case, it becomes barring for a certain time. However, this technique has a disadvantage that the access delay time of the terminal increases rapidly. Therefore, in ACB, MTC terminal is divided into several access classes (AC), and when congestion occurs, ACs with low priority conrtol. (AC based control)

도 1은 LTE-A에서의 random access 과정을 나타낸 도면이다. 1 is a diagram illustrating a random access procedure in LTE-A.

본 발명은 전술한 종래 기술의 문제점을 해결하기 위한 것으로서, 단말의 접속에 따른 지연 시간을 단축시킬 수 있는 혼잡 제어 방법에 관한 것이다. Disclosure of Invention Technical Problem [8] The present invention is directed to a congestion control method capable of shortening a delay time according to connection of a terminal.

상기와 같은 목적을 달성하기 위해, 본 발명의 일 측면에 따르면, 특정 서비스에서 단말의 재전송 횟수를 판단하고, 상기 판단된 접속 횟수에 기초하여 단말별로 서로 다른 접속 확률을 적용하는 혼잡 제어 방법이 제공된다. According to an aspect of the present invention, there is provided a congestion control method for determining a number of retransmissions of a terminal in a specific service and applying different access probabilities for each terminal based on the determined number of accesses do.

본 발명에 의하면, 무선 이동통신망의 RACH(Random Acess Channel)에서의 혼잡 제어를 통해 접속 지연을 단축시킬 수 있는 장점이 있다. According to the present invention, there is an advantage that connection delay can be shortened through congestion control in the RACH (Random Access Channel) of the wireless mobile communication network.

도 1은 LTE-A에서의 random access 과정을 나타낸 도면.
도 2는 접속 지연의 원인을 분석한 도면.
도 3은 본 발명의 프레임 워크를 도시한 도면.
1 shows a random access procedure in LTE-A;
Figure 2 is an analysis of causes of connection delays;
3 illustrates a framework of the present invention.

이하에서는 첨부한 도면을 참조하여 본 발명을 설명하기로 한다. 그러나 본 발명은 여러 가지 상이한 형태로 구현될 수 있으며, 따라서 여기에서 설명하는 실시예로 한정되는 것은 아니다.DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described with reference to the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein.

그리고 도면에서 본 발명을 명확하게 설명하기 위해서 설명과 관계없는 부분은 생략하였으며, 명세서 전체를 통하여 유사한 부분에 대해서는 유사한 도면 부호를 붙였다.In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

명세서 전체에서, 어떤 부분이 다른 부분과 "연결"되어 있다고 할 때, 이는 "직접적으로 연결"되어 있는 경우뿐 아니라, 그 중간에 다른 부재를 사이에 두고 "간접적으로 연결"되어 있는 경우도 포함한다.Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "indirectly connected" .

또한 어떤 부분이 어떤 구성 요소를 "포함"한다고 할 때, 이는 특별히 반대되는 기재가 없는 한 다른 구성 요소를 제외하는 것이 아니라 다른 구성 요소를 더 구비할 수 있다는 것을 의미한다.Also, when an element is referred to as " comprising ", it means that it can include other elements, not excluding other elements unless specifically stated otherwise.

본 발명의 목적은 delay-constrained한 MTC 단말이 요구하는 접속지연시간(access delay) 조건을 만족하면서 RACH 혼잡을 제어하는 방식을 제안한다. 본 연구에서 가정하는 MTC 단말의 access delay 조건은 다음과 같다. (

Figure pat00001
,
Figure pat00002
) =(MTC 단말의 최대 허용 지연시간, 서비스가 허락하는 access dealy 초과 비율)로 정의된다고 가정한다. 예를 들어 (800ms, 5%)이면 목표 access delay는 800ms이고 5% 미만의 access delay 초과를 요구하는 것이다. 두 조건간에는 다음과 같은 수식이 정의된다.An object of the present invention is to propose a method of controlling RACH congestion while satisfying an access delay condition required by a delay-constrained MTC terminal. The access delay conditions of the MTC terminal assumed in this study are as follows. (
Figure pat00001
,
Figure pat00002
) = (Maximum allowed delay time of the MTC terminal, access allowy excess rate allowed by the service). For example (800ms, 5%), the target access delay is 800ms and requires an access delay of less than 5%. The following equations are defined between the two conditions.

Figure pat00003
(1)
Figure pat00003
(One)

도 2는 접속 지연의 원인을 분석한 도면이다. 2 is an analysis of the cause of the connection delay.

도 2를 수식적으로 정리하면 다음과 같다. FIG. 2 is summarized as follows.

Figure pat00004
Figure pat00004

Figure pat00005
(2)
Figure pat00005
(2)

Figure pat00006
(3)
Figure pat00006
(3)

Figure pat00007
(4)
Figure pat00007
(4)

Figure pat00008
은 재전송 횟수가 r인 단말들의 access delay이다. 수식 (4)는 네트워크에 재전송 횟수에 대한 분포를 eNB가 안다고 가정하였을 때의 네트워크의 예상 access delay를 정의한 것이며,
Figure pat00009
이 재전송 횟수가 r인 단말의 비율이다. 이 값은 random access의 결과로부터 통계적 추측을 통하여 구할 수 있다. 본 발명에서는 이를 normal distribution으로 approximation 하여 재전송 횟수 분포와, 접속확률에 따른 access delay model을 제시한다.
Figure pat00008
Is the access delay of the terminals with the number r of retransmissions. Equation (4) defines the expected access delay of the network when the eNB knows the distribution of the number of retransmissions to the network,
Figure pat00009
Is the ratio of the terminal having the number of retransmissions r. This value can be obtained by statistical guessing from the result of random access. In the present invention, this is approximated by a normal distribution, and a retransmission frequency distribution and an access delay model according to a connection probability are presented.

Figure pat00010
(5)
Figure pat00010
(5)

기존의 ACB의 경우 한 random access channel에 Random access를 하는 단말의 수를 N이라고 예측하는 경우, random access throughput을 최대화하기 위하여 접속 확률을 다음과 같이 결정한다.In the case of the existing ACB, when the number of UEs performing random access to one random access channel is estimated to be N, the connection probability is determined as follows to maximize random access throughput.

Figure pat00011
Figure pat00011

그러나 N이 매우 큰경우 작은 p가 설정이 되며 이는 access delay를 급증시키는 결과를 초래한다. 따라서, 본 연구에서는 우선 기존의 ACB로 동작하다가, 많은 접속이 예상되는 경우 access delay 조건을 충족하기 위하여 enhanced ACB를 동작시킨다.However, if N is very large, a small p is set, which results in a spike in access delay. Therefore, in this study, we operate the existing ACB first and then operate the enhanced ACB to meet the access delay condition when a lot of connections are expected.

도 3은 본 발명의 프레임 워크를 도시한 도면이다. 3 is a diagram showing a framework of the present invention.

수식 (3)으로 부터, r이 큰 (재전송을 많이 한) 단말의 access delay는 클 확률이 높다고 할 수 있다. Access delay를 줄이기 위해서는 네트워크에 오래 머물러있는, 즉 재전송 횟수가 큰 단말들에게 접속 우선권을 줄 수 있다면, access delay를 만족시킬 수 있을 것이다. From Equation (3), it can be said that the access delay of a terminal with a large r (retransmitted) is high. In order to reduce access delay, access delay can be satisfied if it is possible to give access priority to the terminals that stay on the network for a long time, that is, the number of retransmissions.

따라서, 본 발명에서는 접속 횟수에 따라 서로 다른 접속확률을 적용하는 방안을 제안한다.

Figure pat00012
을 재전송 횟수가 r인 단말들에게 적용되는 접속확률이라고 정의하자. Access delay를 감소시키는
Figure pat00013
을 구하기 위하여 utility function을 정의한다.
Figure pat00014
은 재전송 횟수가 r인 단말들의 utility function이며 r이 클수록 (즉, 오랜 시간 패킷을 못보낸 단말일수록) 접속권한을 줬을 때 큰 값을 나타낸다. 이를 간단한 모델로 정의하여
Figure pat00015
로 정의한다.
Figure pat00016
은 가중치 값으로
Figure pat00017
for
Figure pat00018
를 만족하는 상수이다. 결과적으로 본 발명에서 제안하는 방식을 수식화하면 다음과 같다.Therefore, the present invention proposes a method of applying different access probabilities according to the number of connections.
Figure pat00012
Is defined as a connection probability applied to terminals having a retransmission count r. Reducing Access Delays
Figure pat00013
The utility function is defined to obtain
Figure pat00014
Is the utility function of the terminals with the number of retransmissions r, and it shows a large value when the r is larger (that is, the terminal that has not sent the packet for a long time) gives the access right. We define this as a simple model
Figure pat00015
.
Figure pat00016
Is the weight value
Figure pat00017
for
Figure pat00018
. As a result, the method suggested by the present invention can be expressed as follows.

(P1)

Figure pat00019
(6)(P1)
Figure pat00019
(6)

s.t. (c1)

Figure pat00020
st (c1)
Figure pat00020

(c2)

Figure pat00021
(c4)
Figure pat00022
(c2)
Figure pat00021
(c4)
Figure pat00022

(C.1)은 Access delay condition 이며 (즉, access delay를 초과하는 비율), (C.2) RACH throughput 조건이다. (C.1) is the access delay condition (ie, the ratio exceeding access delay), and (C.2) RACH throughput condition.

이 optimization 문제를 품으로 써, access delay condition을 만족하면서, 어느정도의 RACH throughput을 보장하는

Figure pat00023
집합을 구하게 된다. By using this optimization problem, it is possible to guarantee a certain amount of RACH throughput while satisfying the access delay condition
Figure pat00023
And a set is obtained.

전술한 본 발명의 설명은 예시를 위한 것이며, 본 발명이 속하는 기술분야의 통상의 지식을 가진 자는 본 발명의 기술적 사상이나 필수적인 특징을 변경하지 않고서 다른 구체적인 형태로 쉽게 변형이 가능하다는 것을 이해할 수 있을 것이다.It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be.

그러므로 이상에서 기술한 실시예들은 모든 면에서 예시적인 것이며 한정적이 아닌 것으로 이해해야만 한다.It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive.

예를 들어, 단일형으로 설명되어 있는 각 구성 요소는 분산되어 실시될 수도 있으며, 마찬가지로 분산된 것으로 설명되어 있는 구성 요소들도 결합된 형태로 실시될 수 있다.For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.

본 발명의 범위는 후술하는 특허청구범위에 의하여 나타내어지며, 특허청구범위의 의미 및 범위 그리고 그 균등 개념으로부터 도출되는 모든 변경 또는 변형된 형태가 본 발명의 범위에 포함되는 것으로 해석되어야 한다.The scope of the present invention is defined by the appended claims, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included within the scope of the present invention.

Claims (1)

특정 서비스에서 단말의 재전송 횟수를 판단하고, 상기 판단된 접속 횟수에 기초하여 단말별로 서로 다른 접속 확률을 적용하는 혼잡 제어 방법.





Determining a number of retransmissions of a terminal in a specific service and applying a different connection probability for each terminal based on the determined connection count.





KR1020170013017A 2017-01-26 2017-01-26 Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network KR20180088223A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020170013017A KR20180088223A (en) 2017-01-26 2017-01-26 Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020170013017A KR20180088223A (en) 2017-01-26 2017-01-26 Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network

Publications (1)

Publication Number Publication Date
KR20180088223A true KR20180088223A (en) 2018-08-03

Family

ID=63250434

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020170013017A KR20180088223A (en) 2017-01-26 2017-01-26 Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network

Country Status (1)

Country Link
KR (1) KR20180088223A (en)

Similar Documents

Publication Publication Date Title
KR102161831B1 (en) Method and appratus of applying extended access barring in mobile communication system
Tello-Oquendo et al. Reinforcement learning-based ACB in LTE-A networks for handling massive M2M and H2H communications
KR102181920B1 (en) Communications device and method for improving the transmission of random access messages
Osti et al. Analysis of PDCCH performance for M2M traffic in LTE
KR101564951B1 (en) One method of delegate-based group channel access
US20160143063A1 (en) Enhanced RACH Design for Machine-Type Communications
US8811325B2 (en) Network side device and method for transmitting configuration information of pathloss power threshold thereof
CN108924939B (en) Uplink transmission preamble allocation method for NB-IoT system to prioritize devices
CN103795511A (en) Method and apparatus for performing random access procedures
CN103929826A (en) Self-adaptive random access method and system of machine type communication terminal
Tello-Oquendo et al. Dynamic access class barring parameter tuning in LTE-A networks with massive M2M traffic
Morvari et al. Two-stage resource allocation for random access M2M communications in LTE network
CN102740492A (en) Method and system for random access control
CN104320859A (en) Competition and allocation combined MAC access method based on AP control
de Andrade et al. Random access mechanism for RAN overload control in LTE/LTE-A networks
CN105812092A (en) Repeated transmission processing method, device and node
Zhao et al. QoS-based dynamic allocation and adaptive ACB mechanism for RAN overload avoidance in MTC
Arouk et al. On improving the group paging method for machine-type-communications
KR101707163B1 (en) Method and apparatus for dynamic random access control and resource allocation in wireless communication system
Bello et al. Frame based back-off for Q-learning RACH access in LTE networks
Kim et al. Dynamic extended access barring for improved M2M communication in LTE-A networks
CN109076613A (en) Two stages for wireless communication system access procedure keep out of the way
KR20180088223A (en) Method of Controlling Congestion for Reducing Acess Delay time of Terminal in Wireless Mobile Network
KR101830227B1 (en) Method and apparatus for setting barring factor for controlling access of user equipment
Morvari et al. Learning automaton based adaptive access barring for M2M communications in LTE network