• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.699-717
• /
• 2012

In this paper, we deal with the robust mixed $H_2/H_{\infty}$ guaranteed-cost control problem involving uncertain neutral stochastic distributed delay systems. More precisely, the aim of this problem is to design a robust mixed $H_2/H_{\infty}$ guaranteed-cost controller such that the close-loop system is stochastic mean-square exponentially stable, and an $H_2$ performance measure upper bound is guaranteed, for a prescribed $H_{\infty}$ attenuation level ${\gamma}$. Therefore, the fast convergence can be fulfilled and the proposed controller is more appealing in engineering practice. Based on the Lyapunov-Krasovskii functional theory, new delay-dependent sufficient criteria are proposed to guarantee the existence of a desired robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which are derived in terms of linear matrix inequalities(LMIs). Furthermore, the design problem of the optimal robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which minimized an $H_2$ performance measure upper bound, is transformed into a convex optimization problem with LMIs constraints. Finally, two simulation examples illustrate the design procedure and verify the expected control performance.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.59-66
• /
• 2003

We propose the novel optical burst switching scheme to guarantee a minimum bandwidth for multiple classes. To date, QoS studies on OBS network are capable of differentiating two classes, but have difficulties in providing a minimum bandwidth lot several classes because of lower classes' collision with the highest class bursts in the networks. To solve that problem, in our proposed scheme we assign time zones in a data channel for each class periodically, making one burst have top priority at least its zone. Also, the new burst assembling algorithm, as well as the way of managing data channel, is necessarily proposed to coordinate with the proposed OBS scheme. Through the evaluation, we show that the worst-case end-to-end delay is small enough and the received bandwidth of the lower classes is still assured regardless of the traffic load of the highest class.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.100-104
• /
• 2004

In this paper, we propose multicast routing algorithm to guarantee QoS in mobile computing environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that DQDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Journal of information and communication convergence engineering
• /
• v.15 no.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.

• Current Optics and Photonics
• /
• v.2 no.1
• /
• pp.39-46
• /
• 2018

Visible-light communication (VLC) combined with advanced illumination can be expected to become an integral part of next-generation communication networks. One of the major concerns in VLC implementation is developing resource-allocation schemes in a multi-user scenario. However, the scheduling for heterogeneous quality of service (QoS) traffic has not been studied so far, for the indoor VLC downlink system. In this paper, we creatively introduce effective-bandwidth and effective-capacity theory into the multi-user scheduling (MUS) problem, to guarantee the user's statistical delay QoS. We also take account of the aggregate interference (AI) in the indoor VLC downlink system, and analyze its impact on the user-centric MUS problem for the first time. Simulations show that the AI has a nonnegligible influence on the scheduling result, and that the proposed scheduling scheme could guarantee the user's QoS requirement under the premise of ensuring sum capacity.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.58-66
• /
• 2001

GPC has been reported as a useful self-tuning control algorithm for systems with unknown time-delay and parameters. GPC is easy to understand and implement, and thus has won popularity among many practicing engineers. Despite its success, GPC does not guarantee is nominal stability. So, in this paper, GPC is rederived in frequency domain instead of in the time domain to guarantee its nominal stability. Derivation of GPC in frequency domain involves spectral factorization and Diophantine equation. Frequency domain GPC control law is stable because the zeros of characteristic polynomial are strictly Schur. Recursive least square algorithm is used to identify unknown parameters. To see the effectiveness of the proposed controller, the controller is simulated for a numerical problem that changes in dead-time, in order and in parameters.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.311-319
• /
• 2006

This paper presents a terminal-assisted frame-based packet reservation multiple access (TAF-PRMA) protocol, which optimizes random access control between heterogeneous traffic aiming at more efficient voice/data integrated services in dynamic reservation TDMA-based broadband access networks. In order to achieve a differentiated quality-of-service (QoS) guarantee for individual service plus maximal system resource utilization, TAF-PRMA independently controls the random access parameters such as the lengths of the access regions dedicated to respective service traffic and the corresponding permission probabilities, on a frame-by-frame basis. In addition, we have adopted a terminal-assisted random access mechanism where the voice terminal readjusts a global permission probability from the central controller in order to handle the 'fair access' issue resulting from distributed queuing problems inherent in the access network. Our extensive simulation results indicate that TAF-PRMA achieves significant improvements in terms of voice capacity, delay, and fairness over most of the existing medium access control (MAC) schemes for integrated services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.513-516
• /
• 2002

분산 멀티미디어 기술이 궁극적으로 지향하는 것은 사용자들에게 선명한 화질과 뚜렷한 음성을 인터넷으로 전달하는 것이다. 이를 위해서, 대부분 멀티미디어 스트리밍 기술을 사용한다. 멀티미디어 스트리밍 기술은 최소한의 지연(delay)과 지터(jitter)를 갖는 네트워크 상에서 time-based media인 오디오와 비디오를 연속적으로 전달 및 처리하는 기술을 의미한다. 하지만, 지금까지의 멀티미디어 스트리밍 기술은 "Guarantee" 서비스가 아닌, "Best of quality" 서비스에 가깝다. 따라서, 본 논문에서는 "Guarantee" 서비스 지원 및 처리가 가능한 실시간 멀티미디어 스트리밍 구조를 설계하였다. 특히, MMStream TMO는 멀티미디어 데이터의 입출력 및 변환을 실시간으로 처리하는 TMO 객체로써, 복잡한 분산 멀티미디어 응용프로그램 개발이 용이하고, 신뢰성 있는 멀티미디어 스트리밍 서비스를 보장하도록 설계되었다.