• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.63-67
• /
• 2014

A distributed zero-beamforming based cooperative jamming technique is useless when an eavesdropper detects the sharing seed. In addition, the currently alternatives are very limited when the eavesdropper is located nearby a source for wiretapping. This letter presents a solution to this extreme case. Relay randomly generates and transmits a binary jamming message to both source and destination in the first phase. When these two receivers securely and correctly decode the message, the source creates and transmits another message based on the use of exclusive-or for its information message and the decoded message. Consequently, the next transmission can avoid the eavesdropping.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.1089-1094
• /
• 2003

Recently, Software development method supported CBD is applied with many concern and is researched with part of application and composition based-on architecture effectively use it. Effectively, C2 architecture has been concern with the point of component composition method based-on message driven for supported GUI. But, In case of classified sequence in component and method call method in server component, component must be modified to apply it. Thus, In this paper, Message handling part with a part of C2 architecture change is locate in the message neither component not connector. So, Although method call method it can be composit and operate component for support Plug-and-Play without modification. Also, it's possible the more flexible message handling with parallel composition of component between message without classified sequence.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.24 no.4
• /
• pp.386-391
• /
• 2016

A traffic message delivery system using visible light communication(VLC) link has been demonstrated. The system is proposed to deliver simple traffic messages between cars at low speed. The message set is programmed in an FPGA-based digital board and one of the messages is sent to the other car. Considering the outdoor and indoor environments, the effects of sunlight and fluorescent lamps on received signal waveforms are described. The delivered message is successfully recovered over 2 meter. The link for message delivery can be concatenated.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.642-649
• /
• 2018

The Modbus protocol is the most widely used protocol for connecting multiple slave control units (SCUs) in the master control unit. However, the Modbus protocol does not identify which SCU response message corresponds to the service request message. Therefore, when using the Modbus protocol, one service request message can be transmitted after processing the previous message. In this paper, we propose a Modbus application protocol with an index code and a service code to solve the problem. As a result of experimentation, it is possible to transmit the next service request message without processing the previous service request message. And when a communications error occurs, it is possible to identify what type of error occurred using an error detection algorithm. Also, with simultaneous multiple service requests, the proposed protocol can improve processing time by about 66.2%, compared to the original Modbus protocol.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.84-92
• /
• 2006

In this paper, we propose an efficient multicasting algorithm in multistage interconnection networks (MIN's) employing the region encoding scheme. The proposed algorithm uses the recursive scheme to recycle a multicast message at most two times through MIN, in order to send it to its desired destinations. It is composed of two recycling phases which are the copying phase and the routing phase of the multicast message. In the first phase, a source sends the message to a region that contains the largest number of destination regions, and destinations in these regions receive and store the message in this phase. The remaining destinations can finally receive the message in the second phase. This method of the algorithm can improve its performance by reducing the delay of message and the volume of traffic. Moreover, we evaluate the performance of our algorithm in terms of the average number of recycling and the number of internal links used per destination, comparing with the previously proposed algorithm.

• Journal of Advanced Navigation Technology
• /
• v.14 no.5
• /
• pp.625-631
• /
• 2010

In this paper, robustness performance of SNUR message is compared with those of existing ones, RTCM(Radio Technical Commission for Maritime Services) v2 MT(Message Type) 18/19 and MT 20/21 under a poor broadcast condition such as temporary data loss or disconnection We defined the temp oral data loss as 2 second delay and reconnection after disconnection as 7 second latency, and then evaluated its robustness for each latency case by double differentiating the observables. Our result shows that SNUR protocol method can reduce the latency error of the existing RTCM messages by 30~60%. Moreover, a rover using SNUR message, whose latency error is bounded within 1/4 L1 wave length, can figure out its own fixed position continuously in spite of 7 second disconnection, while the other using RTCM message, whose error is larger than half wave length, cannot keep its previous fixed solution.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.2
• /
• pp.255-266
• /
• 2022

Messenger applications applied end-to-end encryption on their own to prevent message exposure to servers. Standardization of a group messaging protocol called Message Layer Security (MLS) with end-to-end encryption is being discussed for secure and efficient message communication. This paper performs safety checks based on the operation process and security requirements of MLS. Confidentiality to a middleman server, which is an essential security requirement in messenger communication, can be easily violated by a server administrator. We define a server administrator who is curious about the group's communication content as a curious admin and present an attack in which the admin obtains a group key from MLS. Reminds messenger application users that the server can view your communication content at any time. We discuss ways to authenticate between users without going through the server to prevent curious admin attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1238-1246
• /
• 2000

In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.362-372
• /
• 2000

The causal message logging is a low-cost technique of building a distributed system that can tolerate process crash failures. Previous research in causal message logging protocol assumes that the number of processes in a fault-tolerant system is fixed. This assumption makes all processes modify their data structures when a new process is added or an existing process terminates. However, the proposed approach in this paper allows to each process retain identifiers of only the communicating processes instead of all processes. This mechanism enables the fault-tolerant system to operate at many different scales. Using this mechanism, we develop a new algorithm that can be adapted for recovery in existing causal message logging protocols. Our recovery algorithm is 1) a distributed technique which does not require recovery leader, 2) a nonblocking protocol which does not force live processes to block while recovery is in progress, and 3) a novel mechanism which can tolerate failures of an arbitrary number of processes. Earlier causal message logging protocols lack one or more of the above properties.

• Management & Information Systems Review
• /
• v.31 no.1
• /
• pp.247-272
• /
• 2012

This study scarcity of recent online message promotion limited quantity of messages and time the message is limited controlled variable message whose regulatory focus and promotional discounts depending on the presence of any differences in attitudes and purchase intention appears, was to verify empirically. The results of this study, first, if limited quantity of messages focus on prevention rather than focusing on messages promoting promotion attitudes and purchase intention was higher. Second, the scarcity message is simply, as well as adjust the focus, such as price discounts and promotional activities can be controlled by a variety of points were identified. If the message is particularly limited quantity discounts are not present, rather than the message, the message is presented when the discount promotional attitudes and purchase intention, except that the amplification has been demonstrated. If the message is limited time, however, these discounts are worth the extra promotion on attitudes and purchase intentions are least likely to affect the thing that was found.