• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.131-136
• /
• 2012

In these days, with the diffusion of mobile equipments, the number of WiFi Access Point (AP) is increasing, and the growth of WiFi AP causes the throughput degradation due to interferences between APs. This recent phenomenon demands the method able to be utilized with current WiFi network to improve the throughput of Wireless LANs. This paper studied the channel assignment method and several throughput enhancement methods to optimize Radio Resource Management (RRM) for distributed infrastructure WLANs. As a result, it was able to put AP independently, improve older allocation error, and improve execution speed.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.707-715
• /
• 2003

In this paper, we propose a new MAC(Medium Access Control) protocol using Movable-boundary, which tries to guarantee Qos for multimedia traffic in the slotted CDMA system. In this scheme, the traffic scheduler assigns channel resource according to the packet priority per service class and adapts the Movable-boundary concept in which the minimum resource is assigned to each traffic class; the remaining resource if it is available can be assigned dynamically according to the temporal demand of other traffic classes. For performance analysis, we performed computer simulations to obtain throughput and packet loss rate and compared the results with Fixed-boundary system. We observed that the error rate of voice traffic could be maintained below a prescribed value while bursty traffic such as video source shares the same channel. In comparison with Fixed-boundary scheme, our protocol exhibits better throughput and packet loss rate performance.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.3
• /
• pp.1-7
• /
• 1999

일대다 형상을 갖는 통신시스템에서 많이 고려되는 예약 알로하 방식 매체접속제어 프로토콜의 성능은 예약 채널과 데이터 채널의 분배 양식에 의해 달라진다. 본 논문에서는 이 프로토콜을 직렬 2단 대기열 모델로 근사화하고, 데이터의 지연을 성능 척도로 하여 이를 줄이는 세가지 채널 할당 방식을 제시하였다. 그리고 이들에 대한 모의실험을 통해 그 동작 특성을 규명하고 성능을 평가하였다. 그 결과 이들의 성능은 트래픽의 특성, 특히 데이터 길이의 분산에 크게 의존하며, 일반적으로는 데이터에 우선권을 주는 방식이 우수하나, 데이터 길이의 분산이 큰 경우에는 비례배분 할당 방식이 우수한 것으로 평가되었다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.261-264
• /
• 2001

유선 망과 기지국을 가지고 있지 않는 이동 노드들로만 구성된 Ad-Hoc 망에서는 잦은 호스트의 이동과 토폴로지 변화에 의해 패킷의 손실이 자주 발생한다 이러한 환경 하에서 요구되는 Ad-Hoc 라우팅 프로토콜에 초점을 둔 많은 연구는 인터넷 트래픽에 대한 성능 분석에 관해서는 연구가 미진하다. 따라서, 본 논문에서는 DSR과 AODV 라우팅 프로토콜을 사용하여 두 프로토콜간의 트래픽을 비교하기 위해 노드 수를 변화 시켜 모의 실험 하였다. 모의 실험 결과 DSR보다 AODV가 높은 처리율을 나타내었으나, 대역폭 할당에 있어서는 DSR이 AODV보다 더 안정적이라는 것을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.412-414
• /
• 2003

무선 이동망에서 점점 증가하는 멀티미디어 트래픽의 QoS(Quality of Service)를 위해서는 충분한 자원이 제공되어야 한다. 하지만 무선망에서의 자원은 한정적이므로 이를 효율적으로 활용해야 멀티미디어 트래픽에 대한 QoS 보장이 가능하다. 이 논문에서는 무선망에서의 멀티미디어 트래픽에 대한 QoS 보장 알고리즘을 제안하였다. 제안된 알고리즘은 이동단말이 위치한 주위 셀의 자원들을 미리 예약하는 방식을 기반으로 하는 admission control 방법이다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.24-31
• /
• 2000

The channel allocation strategy is very important in wireless multimedia networks since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. A existing strategy to decrease the probability of handoff failure is guard channel method, which reserves channels at each base station for handoff calls. In this paper, we propose an efficient channel allocation strategy based on the prioritization of handoff calls used in the guard channel method. In the Proposed strategy guard channels are shared between non-real time and real time handoff calls. To decrease the probability of handoff failure, (when resources become scarce), the Call Admission Control takes some resources away from the active calls. The simulation results demonstrate that the Proposed strategy Provides higher channel utilization and lower probability of handoff failure than those of existing strategies.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.52-60
• /
• 2008

A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.471-480
• /
• 2000

With the limited wireless resources, various traffic in the cellular system is served based on micro-cell or pico-cell structure. The rapid increase in the number of mobile users results in the frequent handoff which is becoming a critical issue. In this paper, we propose a channel allocation scheme to reduce the probability of handoff failure. In this scheme, we provide a guard channel for each service to handle the handoff processes. It maintains the low probability of failure in handoff calls. To prevent the performance degradation due to the traffic variation, we use a channel arbitration method that adaptively manages the number of channels based on the call density. We evaluated the performance in terms of the initial call blocking probability and the handoff call blocking probability for various traffic and motility. We found that the proposed scheme keeps the lower probability of call blocking through the efficient channel arbitration than other suggested methods even for the irregular traffic conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.270-281
• /
• 2003

E-PON supports efficiently the increased Internet data traffic and efficient bandwidth assignment function by which the shared upstream bandwidth in the broadband access networks. In this paper, when different types of incoming sources are mapped into QoS-aware source and Best-Effort(BE) source, we propose the Dual-GPS schedulaer in E-PON that has the characteristics to provide delay and delay-constraint application, and maximizes the bandwidth to best-effort service. When transmit upstream data in E-PON, The proposed scheme supports the control capabilities of delay and delay-variation for required QoS flow through the novel bandwidth assignment scheme. Simulation results show our scheme outperforms the conventional bandwidth allocation scheme in controlling the delay and delay-variation of E-PON system.