• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1119-1127
• /
• 2012

The one of features of M2M communications, which are recently attracted attention as a future business of mobile communications, is that there is a large number of devices compared with traditional communication services. Hence, the control signal that are generated by the M2M devices may cause a significant congestion in the network and in order to solve this problem, a standardization is progressing for reducing the redundant signaling by managing M2M devices as a group in 3GPP standardization. In this paper, we propose a method of group based mobility management by managing M2M devices that have the same mobility as a group. In the proposed method, M2M devices that have the same mobility are grouped by the Mobility Management Entity (MME) and the MME elects a group header among the M2M devices in the group. Then, the group header performs the Tracking Area Update (TAU) on behalf of the group members to reduce the signaling overhead of mobility management. With the proposed method, we can achieve 80% decrease of the signaling overhead of mobility management compared with the case where each M2M device individually performs its TAU procedure.

• Journal of Information Management
• /
• v.38 no.1
• /
• pp.75-98
• /
• 2007

Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.184-191
• /
• 2008

NanoQplus, which is an embedded operating system for wireless sensor networks (WSNs) and developed by Electronics and Telecommunications Research Institute (ETRI), provides programmer-friendly preemptive multi-threading programming technique, but it has poor network protocol stack, as compared to TinyOS, one of the famous operating systems for WSNs. In this paper, we apply dynamic MANET on-demand routing (DYMO) protocol, which is being standardized in Internet Engineering Task Force (IETF), to NanoQplus. Since DYMO has been proposed for mobile ad-hoc networks (MANETs) and MANETs have less resource restrictions than WSNs, the basic DYMO protocol cannot be applied to WSNs without modifications. Moreover, coherence with MAC protocol should be considered in order to eliminate redundant data between MAC and network layers. Thus, we propose a modified version of the basic DYMO protocol for NanoQplus. The experimental results from a real sensor network test-bed show that the DYMO implementation using NanoQplus works efficiently in WSNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.1-8
• /
• 2012

In this paper, we propose an algorithm to improve collision avoidance in Vehicle-to-Vehicle (V2V) networks based on IEEE 802.11p. Since IEEE 802.11p adopts CSMA/CA as a multiple access scheme and an emergency warning message (EWM) is delivered to behind vehicles in a multi-hop manner, due to transmission collision, the more vehicles in the vehicle chain results in a longer delay. The longer delay increases the possibility of a rear-end collision. In order to ensure message reception with low latency, we consider implicit acknowledgement of a broadcasted EWM message and propose an algorithm to reduce redundant message transactions, called Two-Way Implicit Acknowledgement (TWIA). By simulations, we show that our proposed algorithm can reduce the latency until the last car receives the message by 9% and the success rate every car receives the message within 0.7sec by 12% at 100 fixed-number-of-car environment.

• Journal of Digital Convergence
• /
• v.12 no.5
• /
• pp.1-12
• /
• 2014

Recently, the need for non-stop service is increasing by the business mission-critical Internet banking, e-payment, e-commerce, home shopping, securities trading, and petition business increases, clustered in a single database of existing, redundant research on high-availability technologies related to technique, etc. is increasing. It provides an API based on the Active Log in addition to the technique of redundancy, ALTIBASE$^{TM}$ Log Analyzer (below, ALA), provides scalability and communication of the same model or between heterogeneous. In this paper, we evaluated the performance of ALA by presenting the design of the database system that you can use the ALA, to satisfy all the synchronization features high scalability and high availability, real-time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.137-140
• /
• 2013

Conventionally embedded devices used simple operating system (OS); however, the number of embedded devices using Linux as OS is increasing to keep up with hardware's performance improvement and customer's various needs. While embedded devices using Linux can take advantage of expandability, generality, portability, Linux's flexibility nature may cause undesirable overheads because of its increased complexity. One such overhead makes boot stage optimization essential in most embedded systems, where many features are redundant and possible to be removed or reconfigured. This paper applies well-known software optimization technique for Linux's boot stage to an CLM9722 DTK, measures the results, and studies about limitation of such techniques from hardware dependancy on the standard framework of Linux. The booting time from power-on until completion were decreased by 33% approximately.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.129-142
• /
• 2004

As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.822-832
• /
• 1994

DSC-HDTV image compression algorithm removes spatial, temporal, and amplitude redundancies of an image by using transform coding, motion-compensated predictive coding, and adaptive quantization, respectively. In this paper, leak processing method which is used to recover image quality quickly from scene change and transmission error and adaptive quantization using perceptual weighting factor obtained by HVS are proposed. Perceptual weighting factor is calculated by contrast sensitivity, spatio-temporal masking and frequency sensitivity. Adaptive quantization uses the perceptual weighting factor and global distortion level from buffer history state. Redundant bits according to adaptation of HVS are used for the next image coding. In the case of scene change, DFD using motion compensated predictive coding has high value, large bit rate and unstabilized buffer states since reconstructed image has large quantization noise. Thus, leak factor is set to 0 for scene change frame and leak factor to 15/16 for next frame, and global distortion level is calculated by using standard deviation. Experimental results show that image quality of the proposed method is recovered after several frames and then buffer status is stabilized.

• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.2
• /
• pp.251-267
• /
• 1991

Plastic strength analysis using plastic failure mode as a limit state is adopted instead of a conventional elastic structural analysis to predict the ultimate strength of Web frame idealized by a plane frame. Linear programming arid Compact procedure are developed for determining the collapse load factor. It is found that the final results are good agreement with the results of Elasto-plastic analysis. Besides, the redundant structures like Web frame is known to have multiple failure modes. Web frame may collapse under any of the possible failure modes. Thus, the identification of these possible failure modes is necessary and very important in the reliability analysis of Web frame. In order to deal with multiple failure modes, automatic generation method of all failure modes and basic failure modes is used for selecting the dominant failure modes. The probability of failure pastic collapse of Web frame is calculated using these dominant failure modes. The safety of Web frame is asscssed and compared by performing the deterministic and probabilistic analysis.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.218-226
• /
• 2016

Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.