• 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 the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.75-84
• /
• 2010

As broadcasting in Mobile Ad hoc NETwork (MANET) is the process that a node sends a packet to all other nodes in the network. it is used for routing protocols such as Ad hoc On demand Distance Vector (AODV) to disseminate control information for establishing the routes. In this paper, we propose Probabilistic Broadcasting mechanism based on Distance Ratio between sender and receive node in MANETs. The proposed approach is based on the combination of probability and distance based approach. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio from sender. The distance ratio of a node is calculated by the distance from sender and the length of radio field strength. As a node with high distance ratio is located far away from sender, rebroadcast probability is set to high value. On contrary, the low rebroadcast probability is set for a node with low distance ratio which is close to sender. So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3338-3351
• /
• 2012

There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.49-58
• /
• 2003

In a sender-initiated load balancing algorithm, a sender (overloaded processor) continues to send unnecessary request messages for load transfer until a receiver (underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm (GA) for dynamic load balancing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.3
• /
• pp.29-32
• /
• 1983

This paper is an experimental study on the generation principles of digital frequency using ROM-table look-up method and the design of the MF digital Sender used in signalling systems between ESS. After construction of MF digital Sender, through experiment, we concluded that this system well suit for CCITT (International Telegraph and Telephone Consultative Committee) recommendation and this basic principle can be applied to the signalling method using frequency Within voice-band. Also it can be applied to R2 MFC signalling equipment which is used between electronic switching systems (ESS) signalling system.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.751-762
• /
• 1998

The purpose of this study is to enhance the quality of multimedia service under the heterogeneous end-terminals and network environment by monitoring the data receiving status of the group members regularly when the sender multicasts real-time multimedia data to a group. Especially, it focuses to reduce the total number of status information responded to the sender from the receivers. Accordingly. it upgrades the sender's performance by suppressing the number of status information packets generated by the receivers. The key idea of this study starts from how we profile the activity of all the members in a group. We assume that the receiver status in the worst status, so called primary receiver, represents the status of the whole group. This means that the whole group is assumed as being degraded in performance if the primary receiver is degraded, and that the whole group is assumed as being upgraded if the primary one is upgraded. In this algorithm, the primary receiver announces its status information to the whole group prior to other receivers, ana every receiver listening to the primary and other receivers' status compares its own status with them. Accordingly, any receiver may give up the status notification in case its status is not worse than others, resulting in the reduction of unnecessary responses to the sender.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.177-182
• /
• 2014

In this paper, we propose an energy efficient sink node based MAC protocol for Wireless Sensor Networks (WSNs). The proposed sink node-based MAC (SB-MAC) protocol uses a RB(rapid beacon) frame to save sender's energy consumption and to reduce transmission delay. The RB frame is a modified IEEE 802.15.4 beacon frame. The RB frame contains the length of the sender nodes data. Using this information other nodes except sender and receiver nodes can be stay sleep mode long time to reduce energy consumption. Results have shown that the SB-MAC protocol outperformed other protocols like X-MAC and RI-MAC in terms of packet delivery delay and energy consumption. The SB-MAC protocol is especially energy efficient for the networks with one sink node and many senders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2375-2393
• /
• 2016

Key agreement is paramount in secure wireless communications. A promising approach to address key agreement schemes is to extract secure keys from channel characteristics. However, because channels lack randomness, it is difficult for wireless networks with stationary communicating terminals to generate robust keys. In this paper, we propose a Robust Secure Key Agreement (RSKA) scheme from Received Signal Strength (RSS) in stationary wireless networks. In order to mitigate the asymmetry in RSS measurements for communicating parties, the sender and receiver normalize RSS measurements and quantize them into q-bit sequences. They then reshape bit sequences into new l-bit sequences. These bit sequences work as key sources. Rather than extracting the key from the key sources directly, the sender randomly generates a bit sequence as a key and hides it in a promise. This is created from a polynomial constructed on the sender's key source and key. The receiver recovers the key by reconstructing a polynomial from its key source and the promise. Our analysis shows that the shared key generated by our proposed RSKA scheme has features of high randomness and a high bit rate compared to traditional RSS-based key agreement schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.181-182
• /
• 2007