• ETRI Journal
• /
• 제34권5호
• /
• pp.771-774
• /
• 2012

Typical channel allocation algorithms for secondary users do not include processes to reduce the frequency of switching from one channel to another caused by random interruptions by primary users, which results in high packet drops and delays. In this letter, with the purpose of decreasing the number of switches made between channels, we propose a nonparametric channel allocation algorithm that uses robust kernel density estimation to effectively schedule idle channel resources. Experiment and simulation results demonstrate that the proposed algorithm outperforms both random and parametric channel allocation algorithms in terms of throughput and packet drops.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2007년도 춘계학술대회 논문집
• /
• pp.45-57
• /
• 2007

During the design phase of a system, which requires high reliability and safety such as aircraft, high speed train and nuclear power plant, reliability engineer must set up the target system reliability. To meet a reliability goal for the system, reliability allocation should be done gradually from the system to its element. For this end, first of all, we need to construct functional block diagram based on the design output and PWBS(Project Work Breakdown System). Another important input data for reliability allocation is the relationship between the cost and the reliability. In this study we investigate various reliability allocation models, which can be applicable to aircraft, vehicle, and power plant, and etc. And we suggest a proper reliability allocation model which can be effectively applicable to KTX-II high speed train to achieve the target system reliability.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권11호
• /
• pp.660-668
• /
• 2005

Digital communication networks have become a core technology in advanced building automation systems. BACnet (Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing (MS/TP) protocol as one of its field level networks. Tn this study, we introduce a method of implementing bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we examined the validity of bandwidth allocation scheme using simulation models. The results from the simulation experiment show that the proposed scheme satisfies the requirements of real-time communication.

• Journal of Information Processing Systems
• /
• 제18권3호
• /
• pp.389-401
• /
• 2022

The business of Internet of Vehicles (IoV) is growing rapidly, and the large amount of data exchange has caused problems of large mobile network communication delay and large energy loss. A strategy for resource allocation of IoV communication based on mobile edge computing (MEC) is thus proposed. First, a model of the cloud-side collaborative cache and resource allocation system for the IoV is designed. Vehicles can offload tasks to MEC servers or neighboring vehicles for communication. Then, the communication model and the calculation model of IoV system are comprehensively analyzed. The optimization objective of minimizing delay and energy consumption is constructed. Finally, the on-board computing task is coded, and the optimization problem is transformed into a knapsack problem. The optimal resource allocation strategy is obtained through genetic algorithm. The simulation results based on the MATLAB platform show that: The proposed strategy offloads tasks to the MEC server or neighboring vehicles, making full use of system resources. In different situations, the energy consumption does not exceed 300 J and 180 J, with an average delay of 210 ms, effectively reducing system overhead and improving response speed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 추계학술대회 논문집 학회본부
• /
• pp.191-193
• /
• 1989

This paper presents a optimal Var allocation algorithm for minimizing power loss and improving voltage profile in a given system. In this paper, nodal input data is considered as Gaussian distribution with their mean value and their variance. A stochastic Linear Programming technique based on chance constrained method is applied to solve the probabilistic constraint. The test result in IEEE-14 Bus model system showes that the voltage distribution of load buses is improved and the power loss is more reduced than before Var allocation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.61-64
• /
• 2003

GPRS is designed for transmitting packet data and supposed to take its radio resource form the pool of channels unused by GSM voice services. In this paper, The GPRS and GSM circuit switched services share the same radio resource. Whenever a channel is not used by circuit switched services, it may be utilized by GPRS. In this paper, the main aim is performance and comparison resource management policies with channel de-allocation in GPRS network. Three resource management policies is voice priority, R-reservation, dynamic reservation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1313-1316
• /
• 1993

This paper presents a fuzzy system that estimates the optimal bit allocation matrices for the spatially active subimage classes of adaptive transform image coding in noisy channels. Transform image coding is good for image data compression but it requires a transmission error protection scheme to maintain the performance since the channel noise degrades its performance. The fuzzy system provides a simple way of estimating the bit allocation matrices from the optimal bit map computed by the method of minimizing the mean square error between the transform coefficients of the original and the reconstructed images.

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.405-410
• /
• 2012

Several attempts have been made to add journaling capability to a traditional file allocation table (FAT) file system. However, they encountered issues such as excessive system load or instability of the journaling data itself. If journaling data is saved as a file format, it can be corrupted by a user application. However, if journaling data is saved in a fixed area such as a reserved area, the storage can be physically corrupted because of excessive system load. To solve this problem, a new method that dynamically allocates journaling data is introduced. In this method, the journaling data is not saved as a file format. Using a reserved area and reserved FAT status entry of the FAT file system specification, the journaling data can be dynamically allocated and cannot be accessed by user applications. The experimental results show that this method is more stable and scalable than other log-based FAT file systems. HFAT was tested with more than 12,000 power failures and was stable.

• 한국정보과학회논문지:정보통신
• /
• 제31권1호
• /
• pp.37-52
• /
• 2004

브로드 캐스트(Broadcast)는 하나 또는 여러 개의 채널을 이용해서 다수의 이동 단말기들이 빈번하게 필요로 하는 데이타를 효과적으로 전송하기 위한 방법 중에 하나이다. 이동 단말기의 배터리 소모량을 최소화하기 위해서, 브로드캐스트 되는 데이타를 위한 접근시간을 최소화하는 것이 가장 중요한 문제로 대두되었다. 이런 관점에서 브로드캐스트 되는 데이타에 인덱스를 제공함으로써 데이타 접근시간을 최소화하는데 초점을 맞춘 연구들이 수행되어 왔다. 이 논문에서는 멀티채널(Multi Channels) 환경에서의 효과적인 브로드캐스트(Broadcast)를 위한 인덱스 할당 방법에 대해 연구하였다. 지금까지 제안된 방법들은 브로드캐스트 되는 데이타와 인덱스의 크기가 같아야 한다는 가정을 필요로 하거나 사용되는 인덱스 트리의 깊이와 같은 수의 채널이 주어지지 않을 경우 본래의 성능을 보이지 못하는 단점을 가지고 있다. 앞에서 언급한 두 가지 문제점은 브로드캐스트 데이타에 대해서 평균 접근시간의 증가를 초래하게 된다. 이러한 문제점을 극복하기 위하여 본 논문에서는, 채널을 데이타와 인덱스 채널로 분리한 후, 빈도수가 높은 데이타와 해당 데이타에 대한 트리 구조 인덱스를 보다 많이 브로드캐스트 함으로써 브로드캐스트 데이타에 대한 평균 접근 시간을 최소화하는 방법을 제안한다. 본 논문에서는 제안하는 방법의 실험적 및 이론적인 성능 분석을 이와 비슷한 다른 방법들과 비교함으로써 수행한다. 제시한 방안의 성능 분석은 현존하는 다른 방법과 비교해서 브로드캐스트 데이타에 대해서 현저한 평균 접근 시간 감소를 보여준다.

• 한국산학기술학회논문지
• /
• 제13권6호
• /
• pp.2713-2719
• /
• 2012

위치를 기반으로 하는 서비스가 다양해짐에 따라 고가용성과 고확장성을 제공하기 위한 분산 데이터 스트림 처리 기법에 대한 연구가 널리 수행되고 있다. 기존 연구는 분산된 노드들에서 부하의 균형을 유지하기 위해 공간 데이터 스트림의 지리적인 특성을 고려하지 않고 있어 공간적으로 인접한 연산을 수행함에 있어 전체 시스템의 부하를 증가시키고 있다. 본 논문에서는 분산 환경의 공간 데이터 스트림을 처리하기 위해 공간 영역의 겹침을 고려한 연산배치 기법을 제안한다. 제안 기법에서는 인접한 공간 영역을 대상으로 하는 연산을 효율적으로 분리하기 위해 질의 영역이 겹치는 부분의 연산을 우선적으로 동일 노드에 분배하여 중복 영역에 대한 공유의 최대화를 보장한다.