• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.645-648
• /
• 2017

The existing embedded tester used TCP and shared file system for log processing. In addition, the existing processing method was treated as 1-N structure. This method wastes resources of the tester for exception handling. We implemented a log processing message layer that can be distributed by messaging system. And we compare the transmission method using the message layer and the transmission method using TCP and the shared file system. As a result of comparison, transmission using the message layer showed higher transmission bandwidth than TCP. In the CPU usage, the message layer showed lower efficiency than TCP, but showed no significant difference. It can be seen that the log processing using the message layer shows higher efficiency.

• Convergence Security Journal
• /
• v.15 no.5
• /
• pp.37-45
• /
• 2015

In IT system, logs are an indicator of the previous key events. Therefore, when a security problem occurs in the system, logs are used to find evidence and solution to the problem. So, it is important to ensure the integrity of the stored logs. Existing schemes have been proposed to detect tampering of the stored logs after the key has been exp osed. Existing schemes are designed separately in terms of log transmission and storage. We propose a new log sys tem for integrating log transmission with storage. In addition, we prove the security requirements of the proposed sc heme and computational efficiency with existing schemes.

• Convergence Security Journal
• /
• v.15 no.7
• /
• pp.85-96
• /
• 2015

In IT system, logs are an indicator of the previous key events. Therefore, when a security problem occurs in the system, logs are used to find evidence and solution to the problem. So, it is important to ensure the integrity of the stored logs. Existing schemes have been proposed to detect tampering of the stored logs after the key has been exp osed. Existing schemes are designed separately in terms of log transmission and storage. We propose a new log sys tem for integrating log transmission with storage. In addition, we prove the security requirements of the proposed sc heme and computational efficiency with existing schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1531-1539
• /
• 2017

The existing SSD storage tester processed logs in a 1-N structure between server and client using TCP and network file system. This method causes some problems for example, an increase in CPU usage and difficulty in exception handling, etc. In this paper, we implement a log processing message layer that can deal with asynchronous distributed processing using open source messaging system such as kafka, RabbitMQ and compare this layer with existing log transmission method. A log simulator was implemented to compare the transmission bandwidth and CPU usage. Test results show that the transmission using the message layer has higher performance than the transmission using the message layer, and the CPU usage does not show any significant difference The message layer can be implemented more easily than the conventional method and the efficiency is higher than that of the conventional method.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.41-48
• /
• 2007

In this paper, we propose an optimal placement of sensor nodes with 2.4GHz wireless channel characteristics. The proposed method determines optimal transmission range based on log-normal path loss model, and optimal number of sensor nodes calculating the density of sensor nodes. For the lossless data transmission, we search the optimal locations with self-organizing feature maps(SOM) using transmission range, and number of sensor nodes. We demonstrate that optimal transmission range is 20m, and optimal number of sensor nodes is 8. We performed simulations on the searching for optimal locations and confirmed the link condition of sensor nodes.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.429-432
• /
• 2002

The existing recovery technique using the logging technique in the client/sewer database system only administers the log as a whole in a server. This contains the logging record transmission cost on the transaction that is executed in each client potentially and increases network traffic. In this paper, the logging technique for redo-only log is suggested, which removes the redundant before-image and supports the client-based logging to eliminate the transmission cost of the logging record. Also, in case of a client crash, redo recovery through a backward client analysis log is performed in a self-recovering way. In case of a server crash, the after-image of the pages which needs recovery through simultaneous backward analysis log is only transmitted and redo recovery is done through the received after-image and backward analysis log. Also, we select the comparing model to estimate the performance about the proposed recovery technique. And we analyzed the redo and recovery time about the change of the number of client and the rate of updating operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.333-340
• /
• 2003

In this paper, we propose a new turbo-coded orthogonal frequency division multiplexing (OFDM) transmission scheme that can improve greatly the performance by making all the turbo-coded symbols have the same reliability for OFDM transmission over a frequency selective fading channel. The same reliability, that is, the same fading can be accomplished through multiplexing of turbo-coded symbols using distinct orthogonal codes and spreading over the whole effective subcarriers (hereafter, called as the orthogonal code multiplexing (OCM)). As for the orthogonal code selection, we choose the set of the discrete Fourier transform (DFT) basis sequences, since the code set holds the orthogonality irrespective of the length and also has the equal energy property. We perform computer simulations using the Log-maximum-a-posteriori (Log-MAP) algorithm for iterative decoding in order to assess the performance of the proposed transmission scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.2
• /
• pp.182-191
• /
• 1988

A log periodic microstrip array antenna using direct coupling feeder is designed at the frequency 7.2-12.4GHz. Transmission line analysis method was used for the design of each antenna element in consideration of the effects of dielectric and conductor loss and the discontinuity, also the optimized feeding points were obtained for the impedance matching between a main transmission line and each antenna element. It is shown that the measured VSWR was less that 2.4 at the frequency 7.2-12.4GHz, and 53% bandwidth was achived.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.227-237
• /
• 2014

Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.