• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.39-44
• /
• 2010

In LTE-Advanced systems, every sector uses the entire range of the frequency resource, and when the UEs are located at a cell edge, user throughputs degrade due to the interferences from the adjacent cells. In this paper, we propose a combined scheme for inter-cell interference avoidance and power control. In the proposed algorithm, the sectors consist of the right edge, the left edge and the center for resource allocation and we control the transmission power to improve the user throughputs at the edge of each cell. Using a system level simulation, we analyze low 5th percentile and average user throughputs of the UEs who are located the cell, center and edge when the inter-cell interference avoidance and the power control are combined.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.69-76
• /
• 2013

Reader-to-reader interference in RFID system is occurred due to the use of limited number of frequencies, and this is the main cause of read rate reduction in the passive RFID tags. Therefore, in order to maximize the read rate under the circumstances of limited frequency resources, it is necessary to minimize the frequency interference among RFID readers. This paper presents a hybrid FDM/TDM constraint satisfaction problem models for frequency interference minimization problems of the RFID readers, and assigns optimal channels to each readers using conventional backtracking search algorithms. A depth first search based on backtracking are accomplished to find solutions of constraint satisfaction problems. At this moment, a variable ordering algorithm is very important to find a solution quickly. Variable ordering algorithms applied in the experiment are known as efficient in the graph coloring. To justify the performance of the proposed constraint satisfaction problem model, optimal channels for each readers in the passive UHF RFID system are allocated by using computer simulation satisfying various interference constraints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.115-119
• /
• 2006

The channel is one of the precious and limited resources in wireless networks. There are many researches on the channel management. Recently, the optimization problem of guard channels has been an important issue. In this paper, we propose an intelligent channel management technique based on the neural networks. An SRN channel alteration model is developed to generate the learning data for the neural networks and the performance analysis of system. In the proposed technique, the neural network is trained to generate optimal guard channel number g, using backpropagation supervised learning algorithm. The optimal g is computed using the neural network and compared to the g computed by the SRN model. The numerical results show that the difference between the value of g by backpropagation and that value by SRN model is ignorable.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.45-53
• /
• 2000

In wireless environment, due to the limited capacity of radio channels it is not easy to guarantee QoS provisioning to mobile users. Therefore, one of the key problems to support broadband multimedia multi-services in wireless ATM networks is to study an effective call admission control(CAC). The purpose of this paper is to propose a distributed CAC scheme that guarantees multi QoS and multi-class service. Control parameters of the proposed scheme are QoS threshold and channel overload probability. With these parameter control, we show that the scheme can guarantee the requested QoS to both new and handover calls. In the scheme, channels are allocated dynamically, and QoS measurements are made in a distributed manner. We show that by providing variable data rate to calls it can effectively prohibit the QoS degradation even if there are severe fluctuations of network traffic. We compare the proposed CAC scheme to the well-known schemes such as guard band call admission control scheme. Through numerical examples and simulations, the proposed scheme is shown to improve the performance by lowering the probability of handover call dropping

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.

• Economic and Environmental Geology
• /
• v.54 no.3
• /
• pp.353-364
• /
• 2021

Since the mid-twentieth century, geology has gradually evolved as an interdisciplinary context in South Korea. The journal of Economic and Environmental Geology (EEG) has a long history of over 52 years and published interdisciplinary articles based on geology. In this study, we performed a literature review using topic modeling based on Latent Dirichlet Allocation (LDA), an unsupervised machine learning model, to identify geological topics, historical trends (classic topics and emerging topics), and association by analyzing titles, keywords, and abstracts of 2,571 publications in EEG during 1968-2020. The results showed that 8 topics ('petrology and geochemistry', 'hydrology and hydrogeology', 'economic geology', 'volcanology', 'soil contaminant and remediation', 'general and structural geology', 'geophysics and geophysical exploration', and 'clay mineral') were identified in the EEG. Before 1994, classic topics ('economic geology', 'volcanology', and 'general and structure geology') were dominant research trends. After 1994, emerging topics ('hydrology and hydrogeology', 'soil contaminant and remediation', 'clay mineral') have arisen, and its portion has gradually increased. The result of association analysis showed that EEG tends to be more comprehensive based on 'economic geology'. Our results provide understanding of how geological research topics branch out and merge with other fields using a useful literature review tool for geological research in South Korea.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.411-422
• /
• 2002

Recently, there have been active researches about the VPCS (Virtual Parallel Computing System) based on multiple agents. The PVCS uses personal computers or workstations that are dispersed all over the internet, rather than a high-cost supercomputer, to solve complex problems that require a huge number of calculations. It can be made up with either homogeneous or heterogeneous computers, depending on resources available on the internet. In this paper, we propose a new method in order to distribute worker agents and work packages efficiently on the VPCS based on the IBM Aglets. The previous methods use mainly the master-slave pattern for distributing worker agents and work packages. However, in these methods the workload increases dramatically at the central master as the number of agents increases. As a solution to this problem, our method appoints worker agents to distribute worker agents and workload packages. The proposed method is evaluated in several ways on the VPCS, and its results are improved to be worthy of close attention as compared with the previous ones.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.279-286
• /
• 2010

Unbalanced traffic load offered to the nodes making up a path in the network guaranteeing quality-of-service has been known as a main cause deteriorating the capability of the path in admitting traffic flows. Several path load balancing methods have been developed to resolve this problem which used a feedback control scheme that adjusts the delay budget of a flow allocated to each node according to the conditions of available resource in the path. Because of no consideration about the probabilistic characteristics of the service quality, it is impossible for them to prevent in advance a bottleneck on the path which leads to a native restriction in the improvement of the capability being deteriorated. This paper proposes a preventive intra-path load balancing method applicable to the RSVP system which is based on the probabilistic characteristics of the quality-of-service of the offered load. The results of the simulation of the proposed method on a simple evaluation network showed that it provides the gain of 4~22% compared to the legacy one in terms of the number of admitted flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1013-1020
• /
• 2008

Cognitive radio(CR) techniques have been considered as a strong solution of frequency scarcity due to the limitation of frequency resource, In this paper, an orthogonal beamforming method is proposed that enables cognitive radio systems to coexist with a primary users' system in the same spectrum and region without causing interference to primary systems. The orthogonal multiple beams for multi-users of CR systems are obtained through the generation of orthogonal subspaces from primary users' channel state information. To increase the sum-rate of the CR systems, the proposed scheme adopts opportunistic radio resource allocation techniques. Simulation results provides that the proposed scheme achieves 2.72bps/Hz, the sum-rate capacity at 20 cognitive users in an area with two antennas at the cognitive radio basestation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.6 s.360
• /
• pp.48-56
• /
• 2007

OFDMA (Orthogonal Frequency Division Multiple Access) is widely used as multiple access techniques for next generation mobile communication systems. However, OFDMA has a disadvantage of high peak-to-average power ratio and SC-FDMA (Single-Carrier Frequency Division Multiple Access) was proposed for uplink systems to overcome the drawback. SC-FDMA also has several demerits including degraded performance with high-order modulations or with multiple antenna techniques, and less flexibility in resource allocation and pilot patterns. In order to achieve the best performance over a wide range of environments, each mobile station should select either of OFDMA and SC-FDMA according to the given condition and a pilot structure for SC-FDMA systems should be similar to that of OFDMA to maintain the same frame structure. While conventional SC-FDMA schemes require an entire SC-FDMA symbol or a separate short symbol for pilots, this paper proposes a method which supports the pilots included in SC-FDMA data parts and enables a SC-FDMA frame to hold the same structure as an OFDMA frame.