• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2164-2170
• /
• 2010

Digital Radio Frequency Memory, ( as DRFM ), is a device with the ability to restore output to the input RF signal in the required time after storing the incoming RF signals. Therefore DRFM is widely used in Jammer, EW Simulator, Target Echo Generator, and so on. This paper proposes its hardware implementation composed with the high frequency part and the digital processing part consisting of RF input/output module and local oscillator module. It is also proposed the replicated signal generation method which is consisted of the Analog-Digital conversion in the form of pulsed RF signal quantization, and FPGA to save and produce the playback signal, and RF signals to produce a Digital-Analog Conversion in the digital processing unit. This proposed scheme applied to test board and confirmed the validity of the proposed scheme through the test results obtained by the simulated input signals.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.289-302
• /
• 2005

The mobile agent has very various performance according to the element of communication number of times between hosts, quantity of transmission data agent's size, network state etc. specially, migration method is caused much effect in whole performance of distributed system. Most existing migration methods have simplicity structure that it moves doing to accumulate continuously result after achieving task by visiting host in the fixed order. Therefore, in case there are situation such as fault, obstacle, and service absence etc. This can be inefficient due to mobile agent increased network required time. In this paper, we design and implementation Multicast Migration Model for minimizing network required time by solving this problems. Multicast Migration Model includes components such as mobile agent including call module and naming agent, which provides object replication information and distributed server's location transparence. And we evaluate and compare with existing migration method applying prototype system to verify implemented migration model.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.669-679
• /
• 2010

A sample survey design is suggested for the service satisfaction evaluation of regional education offices based on the sample size of 2009 Gyeongnam regional education offices's customer satisfaction survey. The sample design is developed to fit the goal of evaluation of individual regional offices and allocate at least the minimum sample size to each city or county in Gyeongnam to achieve the goal of the survey. The population is stratified according to the regions and the types of schools, and the sample of schools is selected with proportional to the size of classes within each stratum. Finally, each sample student is selected according to two-stage cluster sampling within each sample school. Weighting averages, weighting totals and so on can be evaluated for analysis purposes. Their variance estimates can be evaluated using re-sampling methods like BBR, Jackknife, linearization-substitution methods, which are generally used for the data from a complex sample.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.107-118
• /
• 2019

Based on the Internet of Things technology, one of the core technologies of the fourth industrial revolution, our Ministry of Defense is also pushing to establish M-IoT in defense area to improve management efficiency, innovate military culture and strengthen military power. However, devices connected to the Military Internet of Things can be easily exposed to various of cyber threats as most of them are developed and with a focus on improving sensing and communication skills that collect and transmit data. And it is not easy to uniquely identify the numerous heterogeneous devices, and to establish a secure communication channel between devices or between devices and management servers. In this paper, based on PUF technology, we propose a novel key management scheme that can uniquely identify the various devices, and generate the secret keys needed for the establishment of a secure communication channel using non-replicable information generated by the PUF. We also analyze the efficiency of our proposed scheme through comparison with existing key management scheme and verify the logic and security using BAN Logic.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.41-50
• /
• 2003

For copyright protection of digital contents, we employ watermarking techniques to embed watermark signals into digital host data. In this paper we propose an adaptive watermarking algorithm for three-dimensional (3-D) mesh models. Watermark signals are inserted into vertex coordinates adaptively according to changes of their position values. While we embed strong watermarks in the areas of large variations, watermarks are weakly inserted in other areas. After we generate triangle strips by traversing the 3-D model and convert the Cartesian coordinates to the spherical coordinate system, we calculate variations of vertex positions along the traversed strips. Then, we insert watermark signals into the vertex coordinates adaptively according to the calculated variations. We demonstrate that imperceptibility of the inserted watermark is significantly improved and show the bit error rate (BER) for robustness.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.59-68
• /
• 2005

The amount of digitalized contents has been rapidly increased, but the main distribution channel of them is Internet which is easily accessible. Therefore 'security' necessarily arises as one of the most important issues and the method of protecting contents becomes a major research topic as much as data coding techniques. In recent years, many developers have studied on techniques that allow only authorized person to access contents. Among them the scrambling method is one of well-known security techniques. In this paper, we propose a simple and effective digital video scrambling method which utilizes the intra block properties of a recent video coding technique, H.264. Since intra prediction modes are adopted in H.264 standard, it is easy to scramble a video sequence with modification of the intra prediction modes. In addition to its simplicity, the proposed method does not increase bit rate after scrambling. The inter blocks are also distorted by scrambling intra blocks only. This paper introduces a new digital video scrambling method and verifies its effectiveness through simulation.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.289-296
• /
• 2001

The Election protocol can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. Mobile systems are more prone to failures than conventional distributed system. Solving election in such an environment requires from a set of mobile hosts to choose a mobile host or a fixed host based on the their priority despite failures of both mobile computing and/or fixed hosts. In this paper, we describe a solution to the election problem from mobile computing systems. This solution is based on the Garcia Molina\\`s Bully algorithm.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• Journal of IKEEE
• /
• v.24 no.4
• /
• pp.1122-1128
• /
• 2020

Bandwidth Extension refers to restoring and expanding a narrow band signal(NB) that is damaged or damaged in the encoding and decoding process due to the lack of channel capacity or the characteristics of the codec installed in the mobile communication device. It means converting to a wideband signal(WB). Bandwidth extension research mainly focuses on voice signals and converts high bands into frequency domains, such as SBR (Spectral Band Replication) and IGF (Intelligent Gap Filling), and restores disappeared or damaged high bands based on complex feature extraction processes. In this paper, we propose a model that outputs an bandwidth extended signal based on an autoencoder among deep learning models, using the residual connection of one-dimensional convolutional neural networks (CNN), the bandwidth is extended by inputting a time domain signal of a certain length without complicated pre-processing. In addition, it was confirmed that the damaged high band can be restored even by training on a dataset containing various types of sound sources including music that is not limited to the speech.