• Korean journal of communication and information
• /
• v.39
• /
• pp.224-249
• /
• 2007

This paper tried to examine a relationship between demographic factors(sex, age) and online flaming, and between personality trait(verbal aggression) and flaming. Further, the current study researched the impact of message credibility on significant explaining variables which increase hostile aggressive communication. The research data were collected by a reliable online research center and analysed through SPSS 12.1 software. According to the results, age, sex, and verbal aggression trait were statistically significantly related with flaming. Especially, man, teen age, and the people having high verbal aggression had more frequent flaming behavior than women, other aged people, people with low verbal aggression trait. On the other hand, the message credibility was partially associated with personality trait. The persons who had high verbal aggression trait showed fewer flaming when they met high credible message. This fact might imply that the quality of online contents could decrease online flaming.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.83-89
• /
• 2010

Scalable routing is one of the key challenges in designing and operating large scale MANETs. Performance of routing protocols proposed so far is only guaranteed under various limitation, i.e., dependent of the number of nodes in the network or needs the location information of destination node. Due to the dependency to the number of nodes in the network, as the number of nodes increases the performance of previous routing protocols degrade dramatically. We propose Cluster Overlay Dynamic Source Routing (CODSR) protocol. We conduct performance analysis by means of computer simulation under various conditions - diameter scaling and density scaling. Developed algorithm outperforms the DSR algorithm, e.g., more than 90% improvement as for the normalized routing load. Operation of CODSR is very simple and we show that the message and time complexity of CODSR is independent of the number of nodes in the network which makes CODSR highly scalable.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.328-334
• /
• 2004

Recently, Software DSMs continue to improve its performance and scalability As Software DSMs become attractive on larger clusters, the focus of attention is likely to move toward improving the reliability of a system. A popular approach to tolerate failures is message logging with checkpointing, and so many log-based rollback recovery schemes have been proposed. In this work, we propose a remote logging scheme which uses the volatile memory of a remote node assigned to each node. As our remote logging does not incur frequent disk accesses during failure-free execution, its logging overhead is not significant especially over high-speed communication network. The remote logging tolerates multiple failures if the backup nodes of failed nodes are alive. It makes the reliability of DSMs grow much higher. We have designed and implemented the FT-KDSM(Fault Tolerant KAIST DSM) with the remote logging and showed the logging overhead and the recovery time.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.891-902
• /
• 2004

Membership changing is deeply associated with scalability problem for group key management. If members of the group join or leave, new group key has to be geneerated and distributed to all remaining members of group. Group key changing is perform for group controller. The following parameters are important evaluating criteria of multicast key management scheme that generate and deliver new keys for rekeying: the number of keys stored by both controller and member, messages to deliver, keys to initially be delivered by controller, blocking capability of collusion attacks, messages to deliver at the batch rekeyng. Batch rekeying can reduce messages to deliver and operation costs of generation for message rather than removing members sequentially in fashion one after another. We propose efficient batch rekeying scheme applicable to Pegueroles scheme using random number and prove to be a efficient group key scheme for enhanced Pegueroles model with batch rekeying capability.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.804-808
• /
• 2010

In this paper, we propose Restricted Angle-control Flooding considered density network of sensor nodes and node‘s limit energy. Restricted Angle-control Flooding, increase energy efficiency by reducing unnecessary candidate nodes involved in forwarding closer to the destination. And The Hole when faced with our proposal to raise rates data through Hole Detection which is sender‘s forwarding area is extended or broadcast to the entire network. Compared to the traditional flooding, we show the superiority at the node’s energy consumption, data rate and network lifetime through the performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2679-2687
• /
• 2000

위성 ATM 망에서 TCP/IP 기반의 응용 서비스를 제공하기 위해서는 위성의 긴 전송지연과 이성 채널의 버스트 오류 특성에 따른 정확한 전송 성능의 영향과 분석이 요구되며, 아울러 성능 목표치가 제시되어야 한다. 본 논문은 2Mbps급 KOREASAT위성을 이용한 위성망과 지상망이 상호 연동된 실제 위성/지상 ATM LANE(LAN Emulation)을 구현하고, 위성 채널의 Eb/No와 TCP 소켓 버퍼 크기, 그리고 전송 메시지 크기를 바꾸어 가면서 그때의 TCP/IP 트래픽과 FTP의 전송성능을 비교 분석하였다. 아울러 IPoA(IP over ATM)기반의 영상회의 서비스에 대한 전송 품질 및 메시지 전달 특성 등을 분석하였다. 연구결과 TCP 소켓 버퍼 크기가 증가할 때 TCP의 전체 성능이 증가함을 알 수 있으나 제한된 최대 윈도우 크기 64kbytes와 위성채널의 오류 특성으로 인해 실제 최대 전송속도는 이론상의 목표치를 달성하지 못함을 보여 주었다. 또한 2Mbps 위성링크에서 Eb/No가 6dB 이하에서는 실제적으로 제공할 수 있는 최대 전송성능의 50%이하로 떨어져 TCP/IP over ATM 서비스가 거의 불가능함을 보여주었다. FTP의 경우, 파일 크기가 작으면 최대 전송속도에 도달하기 전에 파일 전송이 완료되어 대역폭 이용의 효율성 측면에서 TCP/IP의 slow start 메케니즘이 적절하지 않음을 보여주었다. 이울러 IPoA영상회의 서비스에서도 Eb/No가 약 6.5dB 이하에서는 영상이 거의 정지되고, 메시지 전달시간도 ITU에서 권고하는 목표치를 훨씬 상회하여 서비스가 거의 불가능함을 보였다.

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

The most important metric in wormhole-routed networks is the start-up latency. In this paper, we present new multicast algorithms that reduce node contention so that multiple multicast messages can be implemented with reduced latency. By exploiting available channels evenly as much as possible, these new algorithms show better performance than the existing multicast algorithms for wormhole 2D systems when multiple multicasts are involved. All algorithms presented are proven to be deadlock-free. A simulation study has been conducted that compares the performance of these multicast algorithms under various situations in a 2D mesh. We show that the overall performance of ours are up to 20% better than the previous studies. We observe that reducing the number of the generated multidestination messages closely related to shorter message latency. These proposed algorithms can be easily extended to 3D mesh systems.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.47-54
• /
• 2004

By using wireless terminal, the number of users who wish to use the multimedia service like the Internet as well as Short Message Services and voice service has increased dramatically over the last years. We propose the method that improves Mobile IPv4 (MIPv4) Regional Registration in wireless mobile networks to decrease traffic's transmission delay and message generation compared with an existing method We design the scheme in MIPv4 environments that a packet do not pass through the home agent transmitted from correspondent node to mobile node, if a mobile node moves to other mobility agent. Simulation results show that the proposed method significantly reduces the expenses for registration and delivering packet.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.1
• /
• pp.17-27
• /
• 2020

Many users are using password managers in order to conveniently manage several usernames and passwords needed to access the web sites. The password manager encrypts and stores several passwords on the server, and the user accesses the server to receive the password information. Thus, if an attacker can sniff a message between the password manager and the server and decrypt the message content, or if an attacker can steal the computer's memory and decrypt the message content, then all the passwords will be exposed to the attacker. In this paper, we analyze the client-server communications and encryption process of password mangers and show there is a serious vulnerability in memory attack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2899-2910
• /
• 2014

In this paper, we present method that verifies the validity of inputted message rather than showing last character on virtual keyboard. This encrypts password and valid input only can receive right feedback. This is implemented on Android phone and tested. This shows higher security than former method by 68.23% and accuracy shows 100%. This secure keypad is practical and secure so this can replace current input keypad without difficulty.