• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

• 산업경영시스템학회지
• /
• 제35권4호
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• 한국통신학회논문지
• /
• 제14권4호
• /
• pp.369-373
• /
• 1989

FDDI MAC 프로토콜에서 8가지 어싱크로노스 액세스 우선순위 등급들의 평균 매체 이용시간을 전송효율, 메시지의 크기, 및 스테이션의 수를 파라미터로 하여서 조사하였다. 전송효율을 변수로 하였을 경우, 상위 우선순의 등급들의 평균 매체 이용시간은 우선순의 등급 별로 유사한 변화들을 나타내며 미시지의크기와 스테이션의 수를 변수로 한 경우는 큰 변화없이 거의 일정하였으나 메시지의 크기가 증가함에 따라 평균 매체 이용시간이 약간씩 증가하였으며, 스테이션 수의 증가에 대해서는 반대로 조금씩 감소하였다. 그러나 최하위 우선순위 등급의 경우, 3가지 변수에 대하여 평균 매체 이용시간이 상대적으로 큰 변화를 나타내었다.

• 한국통신학회논문지
• /
• 제30권9A호
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• 한국통신학회논문지
• /
• 제25권12B호
• /
• pp.1996-2002
• /
• 2000

This paper investigates a priority scheme for IEEE 802.11 Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) protocol in order to provide short access times for priority frames (e.g. time-deadline traffic) even when the overall traffic on the wireless channel is heavy. Under the compatibility constraint for the IEEE 802.11 wireless LANs, two priority systems are simulated: no priority (current IEEE 802.11 standard) for time-deadline traffics and dynamic time-deadline priority. We evaluate algorithms to improve the time-deadline traffic performance using discrete event simulation (DES)

• 대한전자공학회논문지TC
• /
• 제44권4호
• /
• pp.17-27
• /
• 2007

IEEE 802.11e의 EDCA (Enhanced Distributed Channel Access)는 무선 랜에서의 QoS(Quality of Service)를 지원하기 위해 표준화되었다. EDCA는 낮은 우선순위 트래픽의 채널 접근 확률을 낮춤으로써 높은 우선순위 트래픽에 QoS를 제공한다. 이는 높은 우선순위 트래픽에 대한 확정된(Deterministic) 우선순위를 제공하는 것이 아니라 통계적인(Statistical) 우선순위를 제공한다. 그러므로 낮은 우선 순위트래픽은 높은 우선순위 트래픽의 성능에 계속 영향을 미친다. 결과적으로 높은 채널 트래픽 환경에서 EDCA는 음성이나 비디오와 같은 멀티미디어 응용에 QoS를 보장하지 못한다. 본 논문에서는 EDCA 메커니즘의 QoS 성능을 향상시키기 위해 DPCA(Deterministic Priority Channel Access) 방법을 제안한다. 멀티미디어 응용에 보장된 우선순위 채널 접근을 제공하기 위해 제안된 방법은 높은 우선순위 트래픽이 전송할 패킷을 가지고 있을 때 낮은 우선순위 트래픽의 전송을 제한하기 위해 비지톤(Busy Tone)을 사용한다. 제안된 방법의 성능을 수학적 분석과 시뮬레이션을 통해 EDCA와 비교 분석한다. 성능 비교 분석 결과, 제안된 방법이 다양한 경쟁 수준 환경에서 EDCA보다 더 좋은 효율과 지연, 폐기율 등을 가짐을 확인하였다.

• 한국정보통신학회논문지
• /
• 제22권1호
• /
• pp.175-182
• /
• 2018

단말의 수가 증가하고 사물 인터넷 환경이 분산화 됨에 따라 랜덤 접속 기반의 무선전력 통신 네트워크에 관한 연구가 필요하다. 랜덤 접속 기반 무선전력 통신 네트워크에서 단말은 주어진 프레임 내에서 늦게 접속할수록 전송 전에 더 많은 에너지를 하베스팅하여 더 높은 파워로 송신할 수 있기 때문에 접속 성공시 더 높은 처리율을 얻을 수 있다. 이러한 특성에 기반하여 제안하는 랜덤 접속 제어 프로토콜은 채널 값에 따라 단말에게 우선순위를 부여하고 우선순위에 따라 랜덤 슬롯을 구분함으로써 접속점과의 근거리 단말이 원거리 단말보다 먼저 접속하게 만든다. 이를 통하여 근거리 단말의 처리율을 낮추고 원거리 단말의 처리율을 높이는 방식으로 이중 원근 문제를 완화시키고 사용자 공평성을 향상시킨다. 수학적 분석 및 모의실험 결과 제안 접속 제어 방식은 우선순위 레벨에 따라 채널 처리율 및 사용자 공평성 성능을 향상시킨다.

• 반도체디스플레이기술학회지
• /
• 제11권4호
• /
• pp.13-18
• /
• 2012

The semiconductor equipments generate a lot of data traffic via communication channels for the effective manufacturing processes of semiconductors and for the automation of semiconductor equipments. These data should be sent to a host computer in order to keep in a safe. The IEEE 802.11e specification gives differentiated and distributed access to a wireless communication medium with four access categories. These four access categories use different priority parameters which lead to quality of service in data traffic. In this paper, it is shown that the throughput of data depends upon the priority parameters provided by IEEE802.11e. We implement the usage of priority parameters in the SECS protocol for semiconductor equipments. It is necessary that the data from semiconductor equipments should be classified with certain priority for the effective use of our proposed method. Therefore, our scheme will contribute to improving the performance of the manufacturing processes of semiconductors.

• 제어로봇시스템학회논문지
• /
• 제20권6호
• /
• pp.676-688
• /
• 2014

The IEEE 802.11e EDCA (Enhanced Distributed Channel Access) mechanism has been proposed to improve the QoS (Quality of Service) of various services in WLANs (Wireless Local Area Networks). By differentiating the channel access delay depending on ACs (Access Categories), this mechanism can provide the relative service differentiation among ACs. In this paper, we consider that WLAN is deployed in medical environments to transfer medical traffic and we reveal that the quality of the medical traffic (in particular, ECG signals) is significantly deteriorated even with the service differentiation by IEEE 802.11e EDCA. Also, we analyze the reason for performance degradation and show that IEEE 802.11e EDCA has difficulty in protecting the transmission opportunity of high-priority traffic against low-priority traffic. In order to assure medical-grade QoS, we firstly define the service priority of medical traffic based on their characteristics and requirements, and then we propose the enhanced channel access scheme, referred to as DIFF-CW. The proposed scheme differentiates CW (Contention Window) depending on the service priority and modifies the channel access procedure for low-priority traffic. The simulation results confirm that the DIFF-CW scheme not only assures the QoS of medical traffic but also improves the overall channel utilization.

• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.3131-3139
• /
• 1999

Satisfying the rigid timing requirements of various real-time activities in real-time systems often requires some special methods to tune the systems run-time behaviors. Unbounded blocking can be caused when a high priority activity cannot preempt a low priority activity. In such situation, it is said that a priority inversion has occurred. The priority inversion is one of the problems which may prevent threads from meeting the deadlines in the real-time systems. It is difficult to remove such priority inversion problems in the kernel at the same time to bound the worst case blocking time for the threads. A thread is a piece of executable code which has access to data and stack. In this paper, a new real-time systems. It is difficult to remove such priority inversion problems in the kernel at the same time to bound the worst case blocking time for the threads. A threads is a piece of executable code which has access to data and stack. In this paper, a new real-time server model, which minimizes the duration of priority inversion, is proposed to reduce the priority inversion problem. The proposed server model provides a framework for building a better server structure, which can not only minimize the duration of the priority inversion, but also reduce the deadline miss ratio of higher priority threads.