• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.1-12
• /
• 2006

In mobile database environments, the efficient synchronization technique is required to maintain the consistency of replicated data because the same data can be replicated between so many different databases, In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client databases and a server database in mobile environments. The proposed data synchronization technique has the advantage of generality aspect and extensibility aspect by using the tuple-based message digest output to detect the data conflicts.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.21 no.5
• /
• pp.113-120
• /
• 2013

This paper presents a mathematical model to determine the optimal length of static messages that can achieve more efficient use of a FlexRay network. In order to determine the optimal length of static message, the proposed model evaluates the given set of messages with respect to a network utilization index, which is defined in this work. The efficient use of a FlexRay network is achieved by reallocating any static message whose length is equal or greater than the resulting value to the dynamic segment. The effectiveness of the proposed method is investigated by applying to the SAE benchmark data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1904-1919
• /
• 2015

Deniable authentication protocol allows a sender to deny his/her involvement after the protocol run and a receiver can identify the true source of a given message. Meanwhile, the receiver has no ability to convince any third party of the fact that the message was sent by the specific sender. However, most of the proposed protocols didn't achieve confidentiality of the transmitted message. But, in some special application scenarios such as e-mail system, electronic voting and Internet negotiations, not only the property of deniable authentication but also message confidentiality are needed. To settle this problem, in this paper, we present a non-interactive identity-based deniable authenticated encryption (IBDAE) scheme using pairings. We give the security model and formal proof of the presented IBDAE scheme in the random oracle model under bilinear Diffie-Hellman (BDH) assumption.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.87-93
• /
• 2007

In the component based software development, it is very important to interface between modules of component. Almost of existing method, Connectors are deal with all communication channels between two or more components/interfaces by RPC(Remote procedure call) and event call. But these process has limits when component send a lot of request call to other component through connector. That is, we need more efficient interface method that connector can process multi request call. In this paper, I propose interaction scheduling algorithm using message queue in the connector. For this purpose, I use message buffer which operate to save and load message temporarily.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.57-63
• /
• 2016

The purpose of the study is to investigate the preference by emoticon types according to the gender of sender, emotion types of message and intimacy with the recipient. Results show that women mostly prefer to use dynamic and imaged emoticon than men. However, the preference of using text messages increases when both men and women express uncomfortable emotion. Especially, when users send family messages, they tend to prefer for text message. And when users send close friends messages, the preference for dynamic and imaged emoticon is high. When users send distant friends messages, the similar tendency is shown regardless of emotion. These results can provide the information to use emoticon in the filed of education and take advantage in digital education and mobile education.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.39-46
• /
• 2003

We propose a quantum signature scheme with message recovery implemented by a symmetrical quantum key cryptosystem and Creenberger-Horne-Zeilinger(CHZ) triplet states. The suggested scheme relies on the availability of an arbitrator and can be divided into two schemes . one is using a public board and the other is not. The two schemes give us the confidentiality of a message and the higher efficiency in transmission. We propose a quantum signature scheme with message recovery using Greenberger-Home-Zeilinger(GHZ) triplet states.

• 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%.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.6
• /
• pp.53-62
• /
• 2011

Although the demand of Variable Message Sign(VMS) has become pervasive in fulfilling the ITS policy, there are still several unsolved problematic issues. The most critical ones of them are inequality and inefficiency of providing traffic information. This paper proposes the Infra-free Variable Message Sign in order to provide useful informations such as road condition, weather, and traffic of the area, where constructing the infrastructure of communication and power supply is relatively very hard. First of all, the characteristics of infra-free Variable Message Sign are studied and analyzed in deep because of differences between normal Variable Message Sign and Infra-free Variable Message Sign in the configuration and the operating method due to the nature of the Infra-free Variable Message Sign. Futhermore, for effective power management of operating Infra-free Variable Message Sign with limited power acquired through stand-alone PV system, new battery connection structure and dynamically variable power managements for the differently shown messages on Variable Message Sign are proposed. The proposed structure in this paper can be applied to not only power management for Infra-free Variable Message Sign but also power management for the various applications using parallel connection battery system.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2008

In wireless sensor networks, an adversary can launch the wormhole attacks, where a malicious node captures packets at one location and tunnels them to a colluding node, which retransmits them locally. The wormhole attacks are very dangerous against routing protocols since she might launch these attacks during neighbor discovery phase. A strategic placement of a wormhole can result in a significant breakdown in communication across the network. This paper presents a compromise-resilient tunneled packet filtering method for sensor networks. The proposed method can detect a tunneled message with hop count alteration by a comparison between the hop count of the message and one of the encrypted hop counts attached in the message. Since the proposed method limits the amount of security information assigned to each node, the impact of wormhole attacks using compromised nodes can be reduced.