• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.724-737
• /
• 2020

Corrected Block TEA(or XXTEA) is a block cipher designed to correct security weakness in the original block TEA in 1998. In this paper, XXTEA cipher hardware which can encrypt or decrypt between 64-bit and 256-bit messages using 128-bit master key is implemented. Minimum message block size is 64-bit wide and maximal message block size is 256-bit wide. The designed XXTEA can encrypt and decrypt variable-length message blocks which are some arbitrary multiple of 32 bits in message block sizes. XXTEA core of this paper is described using Verilog-HDL and downloaded on Vertex4. The operation frequency is 177MHz. The maximum throughput for 64-bit message blocks is 174Mbps and that of 256-bit message blocks is 467Mbps. The cryptographic IP of this paper is applicable as security module of the mobile areas such as smart card, internet banking, e-commerce and IoT.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.384-389
• /
• 2005

The objective on this project is to develop a cooperative Field Robot (FR), by using a customize Open Control Platform (OCP) as design and development process. An OCP is a CORBA-based solution for networked control system, which facilitates the transitioning of control designs to embedded targets. In order to achieve the cooperation surveillance system, two FRs are distributed by navigation messages (GPS and sensor data) using CORBA event-channel communication, while graphical information from IR night vision camera is distributed using CORBA Asynchronous Method Invocation (AMI). The QoS features of AMI in the network are to provide the additional delivery method for distributing an IR camera Images will be evaluate in this experiment. In this paper also presents an empirical performance evaluation from the variable chunk sizes were compared with the number of clients and message latency, some of the measurement data's are summarized in the following paragraph. In the AMI buffers size measurement, when the chuck sizes were change, the message latency is significantly change according to it frame size. The smaller frame size between 256 bytes to 512 bytes is more efficient fur the message size below 2Mbytes, but it average performance in the large of message size a bigger frame size is more efficient. For the several destination, the same experiment using 512 bytes to 2 Mbytes frame with 2 to 5 destinations are presented. For the message size bigger than 2Mbytes, the AMI are still able to meet requirement far more than 5 clients simultaneously.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.155-158
• /
• 2013

In this paper, a study has been conducted on designing messages which provide minimization of the size by converting Air Track message which is Fixed Message Format, Link-16 Standard, to Variable Message Format (VMF) and assessing the Message Conversion Reliability in order to maximize message transmit efficiency during transmitting many track information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.172-174
• /
• 2016

In heterogeneous platoons, consisting of various size of vehicles, the signal from/to a small-size vehicle may be blocked by adjacent large-size ones. In this case, some vehicles in between the source and the destination should relay the messages. We design an efficient message relaying scheme for these platoons and evaluate its performance, taking the linear topology of platoons into account.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.304-312
• /
• 2010

This paper presents the design of alert message and message segmentation method for the Terrestrial DMB Automatic Emergency Alert Service Standard. This paper begins with the introduction of the standard and some background. The alert message contains the essential information of the alert. Structured information is represented as coded fields and the unstructured as short sentences. Design factors of each field are analyzed first. Next each field’s semantics and syntax are described. The message segmentation method is presented next. The previous study selected FIDC as the message delivery channel. However, in most cases, the size of the alert message exceeds the maximum size of FIG, which is the basic unit packet for the channel. The current T-DMB standard does not support the segmentation method for FIDC. To solve the problem, this paper proposes an elegant segmentation method that garantees reliable, flexible, and fast receiver characteristic. This paper concludes with some additional tasks that should be resolved before the full-time alert service.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.29-37
• /
• 2009

Recently, message based data transmission plays an important role in modem computing systems. Especially JMS(Java Message Service) is one of the most popular messaging platform. However, because of its characteristics for maintaining reliability, if we want to use it for transmission of large scale messages in a distributed Internet environment by using a WAN connection which may not be robust enough, we need to employ a different method to minimize total transmission time of messages. We found the fact that the total time of message transmission heavily depends on size of a message. In order to achieve the ideal size of a message, we develope a novel mechanism and a system which finds the ideal size of a message and automatical1y control JMS applications for minimizing transmission time. Finally, we test the proposed mechanism and system using real-data in order to prove advantages and compared with the naive mechanism. As a conclusion, we showed that our proposed mechanism and system provide an effective way to reduce transmission time of large scale messages in distributed environment.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.537-545
• /
• 2009

In this paper, we proposed an effective multicast causal order algorithm with hand-off protocol for mobile networks. Since the size of control informations needed to enforce message transfer order has much influence on the performance of hand-off and message transfer in mobile networks, size of control information need to be minimized. We reduced the size of control information by analyzing all the valid communication patterns and pruning redundant information not required to enforce causal order as early as possible, and used hand-off protocol which requires minimal amount of control information to be transferred. By simulation, we found that the proposed algorithm showed better performance than other existing algorithms.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.465-482
• /
• 2015

IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.637-640
• /
• 2022

To maximize performance in a high-performance multicore processor system. it is essential to enable effective data communication between processing cores. Data communication between processor nodes can be broadly classified into collective and point-to-point communications. Collective communication comprises scattering and gathering. This paper presents a efficient message scattering and gathering based on processing node status. In the proposed algorithms, the transmission order is changed according to the data size of the pre-existing communication, to reduce the waiting time required until the collective communications begin. From the simulation, the performances of the proposed message scattering and gathering algorithms were improved by approximately 71.41% and 69.84%.

• KIISE Transactions on Computing Practices
• /
• v.23 no.12
• /
• pp.670-676
• /
• 2017

Naval combat systems use real-time processing and compositing of collected information to provide the optimal combat capabilities that maximize survival and ensure mission effectiveness. The software for a combat system has dozens to thousands of components depending on the size of the system, and the communication between the components is achieved via DDS. Although the message interface of the combat system is managed through MDMS, an increase in the system size can result in problems such as the deterioration of the development efficiency. In this paper, we implement XMDMS to operate a distributed processing environment and then solve the problem of the reduction in the development efficiency caused by a load at the server. The experimental results shows that XMDMS improves the processing delay and network performance compared to MDMS.