• 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.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.596-606
• /
• 2008

In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.243-246
• /
• 2005

Recent ubiquitous computing environments increasingly impact on our lives using the current technologies of sensor network and ubiquitous services. In this paper, we propose ubiquitous architectural framework for ubiquitous sleep aid service(UbiSAS) in the subset of ubiquitous computing for refreshing of human's sleep. And we examine technical feasibility. Human can recover his health through refreshing sleep from fatigue. Ubiquitous architectural framework for UbiSAS in digital home offers agreeable sleeping environment and improves recovery from fatigue. So we present new concept of ubiquitous architectural framework dissolving stress. Specially, we apply context to context-aware framework module. This context is transferred to context adaptive inference engine which has service invocation function in intelligent agent module. Ubiquitous architectural framework for UbiSAS using context adaptive rule inference engine without user intervention is technical issue. That is to say, we should take sleep comfortably during our sleeping. And sensed information during sleeping is changed to context-aware information. This presents significant information in context adaptive rule inference engine for UbiSAS. This information includes all sleeping state during sleeping in context-aware computing technique. So we propose more effective and most suitable ubiquitous architectural framework using context adaptive rule inference engine for refreshing sleep in this paper.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.153-163
• /
• 2007

An adaptive framework paradigm where the bandwidth values of the ongoing calls vary according to the trafficsituations is one of the promising concepts for overcoming poor resource conditions due to handoffs in mobilecellular networks. However, quantifying the level of bandwidth degradation of the ongoing calls in an adaptiveframework is important in view of Quality of Service (QoS) Provisioning. Therefore we introduce new QoSparameters, the Degradation Degree Ratio (DDR), which represents the average portion of the degradationdegree during degradation pehod of a call, and the Degradation Area Ratio (DAR), which represents the averageratio of a call's degradation level considering both the period and the degree of degradation jointly in multi-levelbandwidth service. We also develop a new analytical model for estimating the QoS measures such as theDegradation Pehod Ratio (DPR), DDR and DAR. We show how to calculate the QoS measures and illustrate themethod by numerical examples. The proposed model can be used to determine the optimal parameter of theCAC scheme and analyze the sensitivity ofthe QoS parameters in adaptive networks.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.301-311
• /
• 2013

This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.312-320
• /
• 2003

Recently there is a growing interest in mobile cellular network providing multimedia service. However, the link bandwidth of mobile cellular network is not sufficient enough to provide satisfactory services to users. To overcome this problem, an adaptive framework has been proposed. In this study, we propose a new method of estimating DPR(Degradation Period Ratio) in an adaptive multimedia network where the bandwidth of ongoing call can be dynamically adjusted during its lifetime. DPR is a QoS(Quality of Service) parameter which represents the ratio of allocated bandwidth below a pre-defined target to the whole service time of a call. We improve estimation method of DPR using DTMC(Discrete Time Markov Chain) model by calculate mean degradation period, degradation probability more precisely than in existing studies. Under Threshold CAC(Call Admission Control) algorithm, we present analytically how to guarantee QoS to users and illustrate the method by numerical examples. The proposed method is expected to be used as one of CAC schemes in guaranteeing predefined QoS level of DPR.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.837-844
• /
• 2019

In this paper, we propose the AMBM(: Adaptive Multi-channel Backoff Machisum) -Mac protocol to provide high throughput for non-safety applications in VANET(: Vehicular Ad Hoc Networks) environment. The proposed protocol guarantees the quality of service of non-safety packets by dynamically adjusting CW(: Channel Window) of WSA(: WAVE Service Advertisement) to maximize throughput between non-safety packets of different priority. It also shows that allocating a large amount of time for channel coordination and time slot reservation for SC and dynamically adjusting CW and CCI as nodes increase to reduces transmission delay than IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC, and Q-VCI(: QoS Variable CCH Interval) protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1161-1164
• /
• 2003

본 논문은 ALAN(Application Level Active Network)상에서 GME(Generic Modeling Environment)라고 불리는 컴포지션 메커니즘을 이용하는 AWCS(Adaptive Web Caching Service)에 관하여 언급하였다. ALAN상의 웹 캐싱의 요구사항은 자치 구성성(self-configuration)과 자치 적응성(self-adaptation)이다 이러한 요구사항을 지원하기 위해서 본 논문에서는 친AN상에서 IN(Intelligent Inetwork)에서 유래된 SCE(Service Creation Environment)와 유사한 서비스 컴포지션 메커니즘인 GME를 이용하여 AWCS 의 설계 및 구현에 관하여 언급하였다

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1000-1005
• /
• 1993

In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.