• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.430-435
• /
• 2018

In this paper, an improved decoding scheme for low-complexity parity-check(LCPC) code with small code length is proposed. The LCPC code is less complex than the turbo code or low density parity check(LDPC) code and requires less memory, making it suitable for communication between internet-of-things(IoT) devices. The IoT devices are required to have low complexity due to limited energy and have a low end-to-end delay time. In addition, since the packet length to be transmitted is small and the signal processing capability of the IoT terminal is small, the LCPC coding system should be as simple as possible. The LCPC code can correct all single errors and correct some of the two errors. In this paper, the proposed decoding scheme improves the bit error rate(BER) performance without increasing the complexity by correcting both errors using the soft value of the modulator output stage. As a result of the simulation using the proposed decoding scheme, the code gain of about 1.1 [dB] was obtained at the bit error rate of $10^{-5}$ compared with the existing decoding method.

• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.21-27
• /
• 2013

In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. Hadoop has been widely utilized as a typical distributed storage and processing framework. The tasks in Mapreduce based on the Hadoop distributed file system are allocated to the map as close as possible by considering the data locality. However, there are data being requested frequently according to the data analysis tasks of Mapreduce. In this paper, we propose a hot-data replication mechanism to improve the processing speed of Mapreduce according to data access patterns. The proposed scheme reduces the task processing time and improves the data locality using the replica optimization algorithm on the high access frequency of hot data. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the load of access frequency.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.660-669
• /
• 2005

In this paper 10Mbps master-slave based PLC modems are tested for measuring and analyzing both network and application level performances in the general buildings. The devices under test consist of one master PLC modem and three slave modems. The selected parameters for inspecting the performances are throughput, latency and frame loss rate from the RFC 2544, and one-to-many and many-to-one throughput from the RFC 2285. The results of the performance test show that the PLC modems have Performed better in data transmission when the frame size is increased and the transmission speed is decreased. It is expected that these results will be useful to analyze the effect of noise sources when compared to the performance test under the noiseless environments.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.394-399
• /
• 2006

In this paper, we investigated performance for 5.8GHz dedicated short range communication system using OFDM which will be applied to Intelligent transportation system services. The maximum speed of a vehicle in DSRC channel is very fast as 180km/h, so a service time is very short to serve a various traffic information if hand-off is not occurred. Therefore higher bit rate is required to proved advanced and intelligent service to the drivers of various vehicle and the data transmission rate of the next generation DSRC system if being promoted over 10Mbps. The signals received in Clarke & Gans channel have been simulated using the computer simulator.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.907-916
• /
• 2005

RMCP is an application layer multicast protocol and was established as a standard by ITU-T Also, RMCP includes a scheme which can statically construct a multicast tree. In this paper, we propose a QoS based tree construction scheme which can dynamically construct a multicast tree. And this scheme shows more superior performance than the static tree scheme of RMCP in terms of start-up delay and user requirement QoS. This scheme consists of a best-fit method using multiple sub-net groups which are satisfied a user requirement QoS and a first-fit method using one sub-net group which has maximum transmission bandwidth. In simulation result, two proposed methods are superior to the existing static tree scheme.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.799-808
• /
• 2005

This paper proposes low latency handover procedure for seamless connectivity and QoS support between wired (e.g. Ethernet) and wireless (e.g. WLAN, WiBro(802.16-compatible), CDMA) networks by the mobile-assisted and server-initiated handover strategy. It is assumed that the server decides the best target network considering network status and user preferences. In this algorithm a mobile terminal associates with the wireless link decided at the server In advance and receives CoA as well. When handover occurs without the prediction in wired networks, the server performs fast binding update using physical handover trigger through the MIH(media independent handover) function. As a result, a mobile terminal does not need to perform L2 and L3 handover during handover so that this procedure decreases handover latency and loss.

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

Much researches have studied for seamless mobility service. Those focused on minimizing the delay time due to the handover. In this paper, we suggest seamless mobility service with the network-based preemptive operations. With these operations, if it's found that the MT(Mobile Terminal)'s handover using L2-trigger event, old access network buffers the delivering data. Therefore this can decrease the data drop rates. And also, this can deal with the ping-pong's phenomenon of MT. At the end of MT's movement, these operations can provide seamless mobility service sending buffered data after checking the MT's movement. This mechanism uses MPLS-LSP(MultiProtocol Label Switching-Label Switched Path) in core network for fast process.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.55-64
• /
• 2007

Behind the popularity of VoIP in these days, it may present significant security challenges in privacy and accounting. Authentication and message encryption are considered to be essential mechanisms in VoIP to be comparable to PSTN. SIP is responsible for setting up a secure call in VoIP. SIP employs TLS, DTLS or IPSec combined with TCP, UDP or SCTP as a security protocol in VoIP. These security mechanisms may introduce additional overheads into the SIP performance. However, this overhead has not been understood in detail by the community. In this paper we present the effect of the security protocol on the performance of SIP by comparing the call setup delays among security protocols. We implement a simulation of the various combinations of three security protocols and three transport layer protocols suggested for SIP. UDP with any combination of security protocols performs a lot better than the combination of TCP. TLS over SCTP may impose higher impact on the performance in average because TLS might have to open secure channels as the same number of streams in SCTP. The reasons for differences in the SIP performances are given.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.172-181
• /
• 2010

In this paper, we propose an adaptive block quantization method. The propose method perfrect reconstructs side information without high complexity in the encoder side, as transmitting motion vectors from a decoder to an encoder side. Also, at the encoder side, residual signals between reconstructed side information and original frame are adaptively quantized to minimize parity bits to be transmitted to the decoder. The proposed method can effectively allocate bits based on bit error rate of side information. Also, we can achieved bit-saving by transmission of parity bits based on the error correction ability of the LDPC channel decoder, because we can know bit error rate and positions of error bit in encoder side. Experimental results show that the proposed algorithm achieves bit-saving by around 66% and delay of feedback channel, compared with the convntional algorithm.