• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.713-716
• /
• 2007

This paper suggests One-time Password key exchange authentication technique for a strong authentication based on Ad-hoc Networks and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier.

• Journal of Broadcast Engineering
• /
• v.21 no.5
• /
• pp.662-671
• /
• 2016

In this paper, we propose a wireless video transmission system, providing medium and long communication distance in the 5.8GHz band to decrease the loss of video data. Beamforming with multiple antennas in a radio environment to enable more than 10km communication distance and an image transmission method that combines the retransmission to MCS(modulation and coding scheme) are applied. By applying the proposed method in the indoor environment of 80dB attenuation using the payload size of 1000 bytes, the packet loss rate of at least 0.92% is achieved through the FPING with the time-out of 10ms. The transmission distance of 21.2Km is achieved with the transmission rate of 13Mbps in the outdoor environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.603-611
• /
• 2013

In this paper, we propose a new method which estimates and encrypts significant component of digital image such as digital cinema using discrete wavelet packet transform (DWPT). After analyzing the characteristics of images in spatial and frequency domain, the required information for ciphering an image was extracted. Based on this information an ciphering method was proposed with wavelet transform and packetization of subbands. The proposed algorithm can encrypt images in various robust from selecting transform-level and energy threshold. From analyzing the encryption effect numerically and visually, the optimized parameter for encryption is presented. Without additional analyzing process, one can encrypt efficiently digital image using the proposed parameter. Although only 0.18% among total data is encrypted, the reconstructed image dose not identified. The paketization information of subbands and the cipher key can be used for the entire secret key.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.605-614
• /
• 2009

Existing Internet services were almost supported by the best effort service such as the data transmission service and were allowed the transmission delay and packet loss. However, recent Internet multimedia services such as Internet phone, Internet broadcasting are required a real-time processing and high bandwidth. Therefore, many studies for providing Internet QoS are performed at IETF (Internet Engineering Task Force). As the buffer management mechanism among IP QoS methods, active queue management method such as RED (Random Early Detection) algorithm has proposed. However, RED algorithm has a limitation of usage of an average buffer length and unfairness. So, many algorithms proposed as the modified algorithm of RED. But these modified algorithms also have difficulties to satisfy the requirements of various Internet user QoS. Therefore, in this paper we propose the QoS adaptive AQM (Active Queue Management) algorithm for the multimedia services that request various QoS requirements and present a performance evaluation by the simulations using the ns-2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1234-1244
• /
• 2009

Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services and applications on Internet, which makes the need of application-level traffic classification important for the efficient management and control of network resources. Although lots of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in terms of accuracy and completeness. In this paper we propose an application traffic classification method using statistic signatures, defined as a directional sequence of packet size in a flow, which is unique for each application. The statistic signatures of each application are collected by our automatic grouping and extracting mechanism which is mainly described in this paper. By matching to the statistic signatures we can easily and quickly identify the application name of traffic flows with high accuracy, which is also shown by comprehensive excrement with our campus traffic data.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.533-543
• /
• 2008

With technological advances for storage volume size of a semiconductor memory, USB storage is made as products to support a high capacity storage. Hereby, consumers discard pint-sized USB storages which they already had, or do not use them efficiently. To integrate and unify these pint-sized USB storages as one big USB storage, we proposed Sigma Hub. It can be grouping multiple USB storages, which have each different volume size of memory storage, as logical unity Storage through USB Hub. The proposed Sigma Hub includes Sigma Controller as a core management module to unify the multiple USB storages in transaction level layer. Sigma controller can efficiently control transaction packet in Sigma Hub through a USB Storage-Integration algorithms which ensure an integrity for data read and write processes. Consequently, Sigma Hub enables the use of USB storage that is logical unity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.321-325
• /
• 2008

Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.310-315
• /
• 2002

The Bark Coherence Function (BCF) defies a coherence function within perceptual domain as a new cognition module, robust to linear distortions due to the analog interface of digital mobile system. Our previous experiments have shown the superiority of BCF over current measures. In this paper, a new BCF suitable for VoIP is developed. The unproved BCF is based on the wavelet series expansion that provides good frequency resolution while keeping good time locality. The proposed Wavelet based Bark Coherence function (WBCF) is robust to variable delay often observed in packet-based telephony such as Voice over Internet Protocol (VoIP). We also show that the refinement of time synchronization after signal decomposition can improve the performance of the WBCF. The regression analysis was performed with VoIP speech data. The correlation coefficients and the standard error of estimates computed using the WBCF showed noticeable improvement over the Perceptual Speech Quality Measure (PSQM) that is recommended by ITU-T.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1852-1861
• /
• 1999

In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.