• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.4
• /
• pp.122-128
• /
• 2007

This paper represents the Input/Output (I/O) serial communication methods between overground and overhead controllers using a programmable logic controller (PLC). In general, the systems composed by overground and overhead controllers use exclusive serial communication units. This, however, has a demerit such as a high cost as well as some restrictions of the system itself. Thus, this paper suggests methods by I/O cards for data communication between overground and overhead controllers. In this system, there is no special card and it therefore has a lower cost and is more flexible than the exclusive serial communication unit.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1142-1145
• /
• 2008

This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By applying a self-adaptive multi-hop clustering, we avoid the empty region problem of grid system and omit the need of GPS device. The novelty of the proposed scheme is in its exploitation of hashing function for location querying to achieve low communication overhead. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios. Experiment results demonstrate that our scheme reduces the communication overhead significantly.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1394-1400
• /
• 2014

The current flowing through the overhead transmission lines causes induced voltage on the communication lines, which can be prevented by calculating the induced voltage at the planning stage for overhead transmission line installment through an agreement between the communication and electric power companies. The procedures to calculate the induced voltages, however, are complicated due to the variety of parameters and tower types of the overhead transmission lines. The difficulty necessitates the development of a simulator to measure the induced voltage on the communication lines. This paper presents two simulators developed for this purpose; one using the Data Base (DB) index method and the other using the Graphic User Interface (GUI) method. The simulators described in this paper have been implemented by the EMTP (Electromagnetic Transient Program).

• Proceedings of the KIEE Conference
• /
• 1998.07e
• /
• pp.1641-1643
• /
• 1998

In recent the maximum voltage of overhead power transmission lines in Korea was upgraded to 765kV. In general a overhead ground wire is installed for protecting overhead power transmission lines from lightning. For the 765kV line, Composite Overhead Ground Wire with Optic Fiber (OPGW) is applied as a overhead ground wire and have a function of the communication line between substations. In this paper, the construction and properties of OPGW, and its installation methods are discribed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.4
• /
• pp.223-228
• /
• 2014

It is known that a belief propagation algorithm is a fast decoding scheme for LT codes but it require a large overhead, especially for a short block length LT codes. In this paper an improved belief decoding algorithm using searching method for degree-1 packets is proposed for a small overhead. The proposed decoding scheme shows the desirable performance in terms of overhead while guaranteeing the same computational complexity with respect to the conventional BP decoding scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.5
• /
• pp.222-238
• /
• 2008

In this paper, the random key pre-distribution scheme introduced in ACM CCS'02 by Eschenauer and Gligor is reexamined, and a generalized form of key establishment is introduced. As the communication overhead is one of the most critical constraints of any successful protocol design, we introduce an alternative scheme in which the connectivity is maintained at the same level as in the original work, while the communication overhead is reduced by about 40% of the original overhead, for various carefully chosen parameters. The main modification relies on the use of a two-level key pool design and two round assignment/key establishment phases. Further analysis demonstrates the efficiency of our modification.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.63-74
• /
• 2012

Multicast data communication is an efficient communication scheme, especially inmulti-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all users. IEEE 802.11 does not support reliable multicast owing to its inability to exchange request-to-send/clear-to-send and acknowledgement packets with multiple recipients. Thus, several MAC layer protocols have been proposed to provide reliable multicast. However, additional overhead is introduced, as a result, which degrades the system performance. In this paper, we propose an efficient wireless multicast MAC protocol with small control overhead required for reliable multicast in multi-hop wireless ad hoc networks. We present analytical formulations of the system throughput and delay associated with the overhead.

• Current Optics and Photonics
• /
• v.6 no.5
• /
• pp.463-472
• /
• 2022

At certain wavelengths, single-pixel imaging is considered to be a solution that can achieve high quality imaging and also reduce costs. However, achieving imaging of complex scenes is an overhead-intensive process for single-pixel imaging systems, so low efficiency and high consumption are the biggest obstacles to their practical application. Improving efficiency to reduce overhead is the solution to this problem. Salient object detection is usually used as a pre-processing step in computer vision tasks, mimicking human functions in complex natural scenes, to reduce overhead and improve efficiency by focusing on regions with a large amount of information. Therefore, in this paper, we explore the implementation of salient object detection based on single-pixel imaging after a single pixel, and propose a scheme to reconstruct images based on Fourier bases and use U²Net models for salient object detection.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.327-338
• /
• 2010

Complete Subtree scheme(CS) is a well known broadcast encryption scheme to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message overhead in transmitting key material. We propose a Merged Complete Subtree scheme(MCS) to reduce the communication overhead. It is more practical to make broadcast encryption schemes in network environments with limited bandwidth resources. We define all possible subset unions for ever two subsets of CS as new subsets having own key. The modification causes more storage overhead. Nevertheless, it is possible to make the size of a header, including key materials, half using subset unions of MCS, because the size of a header depends on the number of used subsets. Our evaluation therefore shows that the proposed scheme significantly improves the communication overhead of CS, reducing by half the rekey communication cost. The proposed scheme has the advantage of rekey communication cost when the number of revoked users is significant percentage of the number of potential users. The proposed scheme is fully collusion resistant.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.57-62
• /
• 2011

In this paper an efficient LT decoding scheme using GE triangularization is proposed. The proposed algorithm has the desirable performance in terms of both overhead and computational complexity. Belief propagation algorithm is a fast and simple decoding scheme for LT codes. However, for a small code block length k, it requires a large overhead to decode, and OFG which has a small overhead has a large computational complexity. Simulation results show that the proposed algorithm noticeably reduces the computational complexity by more than 1/5 with respect to that of OFG and also its overhead has a small value about 1~5%.