• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.88-98
• /
• 2006

VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.173-179
• /
• 2013

The traditional key exchange protocols are transmitted by using the cryptographic. However, these protocols are compromised by the attacker. To solve this problem, this paper proposes a key exchange protocol based on the steganography with the QR code. The steganography technique embed secret information to the images, documents, videos, and MP3 files and transmit to the others. The attacker can't know that the transmission data is the secret data. Therefore, the sender transmits efficiently and safely the secret data to the others. In additional, the cover image is using the QR code image to insert the secret key. If attackers scan the QR code, then they just read the information or connect URL. They can not be recognized that the QR code image is hiding the secret key. The experiments compare the QR code image with the well-known image about the distortion and the safety.

• Research in Community and Public Health Nursing
• /
• v.17 no.2
• /
• pp.242-252
• /
• 2006

Purpose: This study was to identify the state of recognition and experience on love, sex knowledge and self-esteem in youths who attended middle and high schools. Method: Data were collected from 785 Youths of those schools from Aug. 2004 to Nov. 2004. Collected data were analysed through $x^2-test$ and ANOVA. Result: The average flee of the subjects was $16.87{\pm}1.17$(girls) and $16.64{\pm}75$ (boys) years old, and 24.3% of them discussed sex with their parents. The youths' most frequent love experiences showed hand in hand(boys 73.6%, girls 80.8%), and followed by shoulder in shoulder(boys 60.4%, girls 68.5%), arm in arm(boys 57.6%, girls 67.8%), hug(boys 53.3%, girls 57.0%) and light kiss(boys 50.0%, girls 37.9%). There were differences in sexual experiences between boys and girls coitus and pregnancy in boys(23.6%, 5.8%) and girls( .5%, .3%). The scores of sex knowledge were 68.78(girls) and 62.50(boys), and self-esteem 61.05(boys) and 74.38(girls). Sex knowledge were related to gender, and self-esteem were related to sender, age, and discussion with their parents regarding sex. Conclusion: With the results above, majority of Youths were not a hindrance mostly about friendship and love expressions. Support and encouragement from school. home, and society are required so that eye-level sex education by age and positive self-esteem may be formed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.6
• /
• pp.561-566
• /
• 2019

In the Internet space, integrity and security must be maintained for secure and confidential communication, which ensures reliability between sender and receiver. Cryptography is an important factor in maintaining robustness against external attacks. For this purpose, encryption and steganography methods are used. Steganography is a method of hiding confidential information without making statistically significant changes to digital media. I propose a method of transforming the Hangul-Jamo consisting of choseong, jungseong and jongseong, and inserting them into RGB pixel values of the cover image. In order to improve security, a new blending method was used to hide the altered information in the lowest region. In this case, a mixture of LSB and LDR techniques was applied. PSNR was calculated for image quality. The PSNR of the proposed method is 43.225dB, which satisfies the lowest level.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.905-912
• /
• 2004

It is a study LVMPD to solve the fairness problem of inter-session shared bandwidth. Whenever congestion occurs in one session, the highest layer is dropped. Also the highest layer of other sessions in non-congestion is dropped by iner-session fairness. While there is spare bandwidth, receivers of session in non-congestion can't use bandwidth efficiently. In this paper, we proposed a distribution method to use efficiently spare bandwidth that occurred by inter-session fairness. In our method, we considered the highest layer those receivers receiving and the higher layer those receivers requesting. The sender assigns the packet-deleting priority to packets when congestion occurs in receivers, and sets layer add/drop flag when receivers of session in non-congestion request the higher layer. The switch deletes packets with packet-deleting priority and transfers packets with layer add/drop flag for session in non-congestion. Therefore receivers of session in non-congestion can add the higher layer. In experimental results, it was known that proposed algorithm use the inter-session shared bandwidth more effectively compared with already known method.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.642-652
• /
• 2010

Recently, DVC (Distributed Video Coding) techniques are drawing a lot of interests as one of the future research works to achieve low complexity encoding in various applications. But, due to the limited computational complexity, the performances of DVC algorithms are inferior to those of conventional international standard video coders, which use zig-zag scan, run length code, entropy code and skipped macroblock. In this paper, in order to overcome the performance limit of the DVC system, the distortion for every block is estimated when side information is found at the decoder and then we propose a new selective block encoding scheme which provides the encoder side with the motion information for the highly distorted blocks and then allows the sender to encode the motion compensated frame difference signal. Through computer simulations, it is shown that the coding efficiency of the proposed scheme reaches almost that of the conventional inter-frame coding scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1618-1626
• /
• 2013

Virtualization service processes all operation including the data creation, storing, and disposal in a server and transmits processed data as the streaming media form. Therefore, client can use the same environment as the traditional desktop environment without considering the type of device. Virtualization service should consider not only the video quality but also the delay bounds and continuity of video playback for improving the user perceived Quality of Service(QoS) of streaming service. In this paper, we propose a network-adaptive transmission architecture that focuses on guaranteeing QoS requirements for virtualization service. In order to provide those, the proposed architecture have the transmission rate adaptation function based on available bandwidth and the content bit-rate control function based on sender buffer state. Through each function, proposed architecture guarantee the delay bounds and continuity of virtualization contents playback. The simulation results show that proposed network-adaptive transmission architecture provides a improve performance of throughput and transmission delay.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.133-146
• /
• 2001

In a dynamic load distribution policies, each node gathers the current system sates information before making a decision on load balancing. Load balancing policies based on this strategy can suffer from processor thrashing. In this paper, we propose a new algorithm which attempts to decrease the frequency of the processor thrashing, the algorithm is based on the integration of three components. The first, the algorithm of which determine the size of jobs be transferred. The second, negotiation protocol with obtains a mutual agreement between a sender and a receiver on the transferring job size. And the third, a symmetrically-initiated location policy. The algorithm proposed in this paper used Siman IV as simulation tool to prove the improvement of performance. I analyzed the result of simulation, and compared with related works. The mean response time shows that there are no difference with existing policy, but appear a outstanding improvement in high load. The thrashing coefficient that shows the average response time, CPU overhead and the thrashing ratio at both the receiving and sending node has been used in the analysis. A significant improvement in the average response time and the CPU overhead ratio was detected using our algorithm when an overhead occurred in the system over other algorithm. The thrashing coefficient differed in the sending node and the receiving node of the system. Using our algorithm, the thrashing coefficient at the sending node showed more improvement when there was an overhead in the system, proving to be more useful. Therefore, it can be concluded that the thrashing ratio can be reduce by properly setting the maximum and minimum value of the system’s threshold queue.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1B
• /
• pp.26-38
• /
• 2006

To construct seamless collaborative environments, what all participants intent should be delivered, and visual elements such gesture, facial expression, and ambiance should be shared with all participants. In this paper, we propose high-quality video service to support DV(digital video) and HDV(high-definition DV) based on Access Grid(AG) which is a prevalent collaborative system. The proposed service is designed for employing versatile media tools and codecs with SDP(session description protocol) and SAP(session announcement protocol). We also design network-adaptive video transmission module to mitigate the impact of network fluctuation. This periodically monitors multicast performance and controls frame rate on sender side considering network condition. The experimental results over the test bed show that proposed service enhances quality of AG video service and provides seamless high-quality video transport by mitigating the impact of network fluctuation.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.