• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2213-2218
• /
• 2016

In this paper, we propose a new relay selection scheme which can decrease the secrecy outage probability in a relay communication network with multiple relays and an eavesdropper. In the conventional relay selection scheme, a relay transmits jamming signal toward an eavesdropper to decrease the successful decoding probability of the eavesdropper. The coventional scheme has a critical problem that the successful decoding probability of a receiver also decreases. The new relay selection scheme proposed in this paper can significantly enhance the secrecy outage probability by selecting a pair of relays which can increase the successful decoding probability of the receiver while decreasing the successful decoding probability of the eavesdropper. We performed extensive computer simulation based on Monte-Carlo. The simulation results reveal that the proposed relay selection scheme can improve the secrecy outage probability by 10 to 50 times compared to the existing relay selection scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.997-1004
• /
• 2015

In this paper, we study vertical sectorization techniques in multiple-input single-output (MISO) downlink active antenna systems (AAS). In the AAS, antenna beam patterns can be adjusted in each sector and multiple vertical beams can form the vertical sectorization. Since an exhaustive search based vertical sectorization algorithm requires high computational complexity to find the optimal tilt angles, we propose two vertical sectorization algorithms to reduce the complexity. First, we provide an asymptotic sum rate based algorithm which utilizes a large system approximation of the average sum rate based on the random matrix theory. Next, by using the result in the single sector transmission, the single sector based algorithm is proposed. In the simulation results, we confirm that the proposed algorithms are close to the performance of the exhaustive search algorithm with much reduced complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1597-1601
• /
• 2013

Multiple antenna technique is attracting attention as a core technology for next-generation mobile communication systems to accommodate explosively increasing mobile data traffic. Especially, recent researches focus on multi-user multiple input multiple output (MU-MIMO) system where base stations are equipped with several tens of transmit antennas and transmit data to multiple terminals (users) simultaneously. To enhance the performance of MU-MIMO systems, we, in this paper, propose an adaptive user selection algorithm which adaptively selects a user set according to varying channel states. According to Monte-Carlo based computer simulations, the performance of proposed scheme is significantly improved compared to the conventional scheme without user selection and approaches that of exhaustive search-based optimal scheme. On the other hand, the proposed scheme can reduce the computational complexity to $K/(2^K-1)$ compared to the optimal scheme where K denotes the number of total users.

• Journal of the Korea Convergence Society
• /
• v.8 no.7
• /
• pp.29-37
• /
• 2017

Compared to the commercial networks, R&E networks have the strength such as flexible network engineering and design. Based on those features of R&E networks, we propose our storage cloud service model which supports general-purpose network users in a central region and experimental network users in distributed regions simultaneously. We prototype our service model utilizing multiple proxy controllers of OpenStack Swift service in order to deploy several regions via experimental backbone networks. Our experiments on the influence of the network latency and the size of data to be transmitted show that the bigger size of data is preferable to the smaller size of data in an experimental backbone network where the network latency increases within 10ms because the rate of throughput decline in the bigger object is comparatively small. It means that our service model is appropriate for experimental network users who directly access the service in order to move intermittently high volume of data as well as normal users in the central region who access the service frequently.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.533-540
• /
• 2006

This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.91-98
• /
• 2019

LTE's extension for unlicensed spectrum called Licensed Assisted Access (LAA) is equipped with Listen-Before-Talk (LBT) designed similar with the backoff mechanism of Wi-Fi for coexistence. However, Wi-Fi's backoff mechanism has not evolved from its old design for compatibility with legacy devices, thus LAA's LBT is not efficient either in utilizing spectrum. If LAA operates with no Wi-Fi systems in proximity, it can run more efficient LBT. In this paper, we propose Narrowband Clear Channel Assessment (NCCA) for narrowband transmission. In NCCA, an LAA node performs LBT in either wide or each narrow bandwidth segment. This allows multiple LAA nodes to perform simultaneous transmissions in orthogonal bandwidth segments in the same time slot. We design four variants of NCCA implementation and model their performance using a mathematical model. The coexistence performance of NCCA with conventional wideband nodes and the accuracy of the model are shown via simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.247-252
• /
• 2019

The diffraction properties of optical signals by multi-layered periodic structures is formulated in two-dimensional space by using Fourier expansions associated with basic grating profile. The fields in each layer are then expressed in terms of characteristic modes, and the complete solution is found rigorously by using a modal transmission-line theory(MTLT) to address the pertinent boundary-value problems. Such an approach can treat periodic arbitrary gratings containing arbitrarily shaped dielectric components, which may generally have optical properties along directions that are parallel or perpendicular to the multi-layers. This paper illustrates the present approach by comparing our numerical results with data reported in the past for simple periodic circular 2D structures. In addition, this proposed theory can apply easily for more complex configurations, which include multiple periodic regions with several possible canonic shapes and high dielectric constants.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.85-90
• /
• 2019

This paper related with the M-CMA adaptive equalization algorithm which is possible to improve the residual isi and robustness performance compare to the current MMA algorithm that is reduce the intersymbol interference occurs in channel when transmitting the QAM signal. The current MMA algorithm depend on the cost function and error function using fixed signal dispersion constant, but the M-CMA algorithm depend on the new proposed cost function and error function using multiple dispersion constant. By this, it is possible to having robustness of the CMA and simultaneous compensation of amplitude and phase of MMA. The computer simulation was performed in the same channel and noise environment for compare the proposed M-CMA and current MMA algorithm. The equalizer output signal constellation, residual isi, MD, MSE learning courves and SER, represents the robustness were used for performance index. As a result of simulation, the M-CMA has more superior to the MMA in robustness and other performance index.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1935-1941
• /
• 2021

In order to develop an algorithm using deep learning, which has been recently applied to various fields, it is necessary to have rich, high-quality learning data. In this paper, we propose an acquisition system for biological signals that simultaneously collects bio-signal data such as optical videos, thermal videos, and voices, which are mainly used in developing deep learning algorithms and useful in derivation of information, and transmit them to the server. To increase the portability of the collector, it was made based on Raspberry Pi, and the collected data is transmitted to the server through the wireless Internet. To enable simultaneous data collection from multiple collectors, an ID for login was assigned to each subject, and this was reflected in the database to facilitate data management. By presenting an example of biological data collection for fatigue measurement, we prove the application of the proposed acquisition system.