• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.133-133
• /
• 2001

무선 근거리 지역망(Wireless LAN;WLAN) 환경에서 다중 채널을 이용하여 실시간 서비스를 제공하기 위한 매체 접근제어 계층에서의 채널의 사용 구간 할당 방법을 제안하고, 컴퓨터 모의 실험을 통하여 제한된 방식의 실시간 서비스 지원 성능과 채널의 사용 효율을 분석한다. 제안한 채널 사용 구간 할당 방안은 개선된 매체 접근 제어 프로토콜 RICH-DP (Receiver-Initiated Channel-Hopping with Dual Polling)를 바탕으로 한다. 무선 환경에서 RTS-CTS를 사용하는 프로토콜은 SRMA, MACA, MACAW, IEEE 802.11, FAMA 등이 있다. 최근에 단일 채널을 환경에서 RICH(Receiver Initiated Channel-Mopping) 프로토콜이 제안되었다. RICH는 충돌 회피를 위해서 경쟁 구간에서 충돌 감지(carrier sensing)을 사용한다. RICH는 제한된 어플케이션에 국한되는 단절이 있다. 반면에 RICH-DP는 다중 채널 환경에서 충돌 감지와 특별한 코드(spreading code) 할당 없이 일반화된 충돌 회피를 제공한다. 실시간 서비스를 이용하자 차는 단말들로 하여금 RICH-DP를 사용하여 서비스를 제공할 때, 대역폭에 대한 정보를 AP(Access Point)로 전송토록 함으로써 비경쟁 구간에서 뿐 아니라, 경쟁구간에서도 높은 채널 효율이 얻어질 수 있도록 하고 있다. 제한된 방안의 성능 평가를 위한 모의 실험은 OPNET를 이용하여 실시간 서비스 데이터를 7개의 상태 천이를 갖는 VBR 소스로 모델링하고 비동기 트래픽들은 Poisson 소스로 모델링하여 실시간 서비스 단발들의 이용 대역폭과 채널 처리율과 시스템 지연시간을 성능 평가 인자로 하여 수행하였다. 논문에서 제한된 방법을 적용한 개선된 RICH-DP을 모의 실험을 통하여 분석한 결과 기존의 제한된 RICH-DP는 실시간 서비스에 대한 처리율이 낮아지며 서비스 시간이 보장되지 못했다. 따라서 실시간 서비스에 대한 새로운 제안된 기법을 제안하고 성능 평가한 결과 기존의 RICH-DP보다 성능이 향상됨을 확인 할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1658-1667
• /
• 1994

In a cellular mobile communication control system, assignment channel for a call in a cell so as to achieve high spectral efficience is an important problem within limited frequence bandwidth. The spectral efficiency is related to the coloring problem of graph theory in a cellular mobile communication control system. In this paper, we propose channel offset scheme using a graph theory of cellular mobile communication control system and formulate chromatic bandwidth of channel offset system which is related graph coloring problem. From formulated channel assignment problem, we investgate an optimal channel offset scheme of more efficent frequence spectrum and cell design according to channel constitution and give and upper and lower bound for overall srectral bandwidth.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.571-580
• /
• 2002

In this paper, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. To maximize the throughput for the In-profile traffic and the link utilization, we propose a Cofiguration method of RIO and the admission control criterion based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. Simulation results show that the proposed method can calculate the capacity to guarantee the QoS for the Assured Service and maximize the throughput for the In-profile traffic and the link utilization by applying the RIO parameter values set through the proposed configuration method.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.33 no.6
• /
• pp.31-39
• /
• 2015

• Proceedings of the Optical Society of Korea Conference
• /
• 2006.07a
• /
• pp.211-212
• /
• 2006

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.415-420
• /
• 2014

Another crucial issue is a providing secondary user(SU) with the its guaranteed quality of service(QoS) in cognitive radio systems, from the SU view to be allowed to opportunistically utilize the primary user(PU) spectrum on non-interfering. In this paper, we propose a bandwidth reallocation scheme for reducing SU dropping rate through renegotiation of requested channel numbers when available bandwidth is not enough for accepting the spectrum handoff SUs. We categorize SU calls into two types : the first priority and the second priority SU, and the first SU' service is supported by bandwidth reservation based on ARMA prediction model for PU arrivals, while the second SU's bandwidth demands for spectrum handoff is to be reallocated through their renegotiation. Simulation results show that our scheme can improve SU dropping rate and system resource utilization efficiency by bandwidth reallocation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.110-118
• /
• 2006

In part-I of the paper, two sub-channel structures, either contiguous or distributed, were considered. Modeling the SNR distribution over a sub-channel as Ricean in general, the statistical chracteristics were investigated. In this part of the paper, we develop a generalized two step channel/resource allocation algorithm, which incorporates the two statistical measurements, and analyze the spectral efficiency of OFDMA in terms of average frequency utilization for the two sub-channel structures. In OFDMA with distributed structure, the key design parameter would be the sub-channel bandwidth. To give an insight into the impact on this parameter, we show in the numerical results the frequency utilization as a function of sub-channel bandwidth normalized to coherence bandwidth. As confirmed by numerical results, for contiguous sub-channel structure, we obtain the nominal multiuser diversity gain when the sub-channel bandwidth is smaller than the coherence bandwidth and lose the gain as it is getting larger.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.83-93
• /
• 2003

Differentiated service networks, based on bandwidth broker, perform the control and management of QoS provisioning for the QoS guaranteed services, However, the centralized bandwidth broker model has a scalability problem since it has centralized resource management for the admission control function of all call attempts, Therefore, in this paper, we proposea novel adaptive admission control mechanism according to the attempted call status for enhancing the scalability under the centralized bandwidth broker model in IP differentiated service networks, The proposed mechanism decouples the function of admission control from the bandwidth broker, So, the ingress edge node performs the admission control and the bandwidth broker performs the resource management and QoS provisioning, We also introduce an edge-to-edge path concepts and the ingress edge node performs the admission control under the allocated bandwidth to eachpath. The allocated bandwidth per path adaptively varies according to the status of the attempted calls, This mechanism can significantly reduce the number of communication message between the bandwidth broker and each edge node in the network and increase the bandwidth utilization via adaptable resource allocation, In this paper we study the adaptive admission control operation and show the efficient and extensive improvement through the performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1490-1500
• /
• 1996

One of the important issues for multimedia communications over ATM netowrks is efficient use of net-work resources since transmitting video at low cost requires high utilization of channel bandwidth. In this paper, we propose an effective bandwidth estimation scheme for MPEG sources in ATM networks. It has been known difficult to allocate effective transmission bandwidth to MPEG sources due to its bursty charactersitics. The MPEG traffic stream can bemodeled using five traffic parameters:service rate, burst load ratio, interburst load ratio, burst period, and interburst period. Using these parameters, a transmission bandwidth for each source can be estimated, and the estimated bandwidth is applied synchronously to reduce the queue size in a buffer. For a simple network modelof a high speed link that multiplexes a number of virtual-circuit connections, simulations on adaptive bandwidth allocation were performed, and the results show that the queueing delay is significantly reduced, when compared to a fixed bandwidth allocation.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.933-938
• /
• 2006

Different multimedia services over networks not only require different amounts of bandwidth but also have different Qualify of Service (QoS) requirements. For example, QoS guarantees for higher priority calls is an important issue in multimedia communication networks. In this paper, we develop an adaptive bandwidth management algorithm, which is able to provide QoS guarantees for higher priority calls while accommodating as many heterogeneous multimedia call connections as possible. Our scheme, based on reservation and bandwidth adaptation, manages bandwidth based on real time estimates of current network conditions. Simulation results indicate the superior performance of our scheme providing excellent trade off between contradictory requirements.