• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.2
• /
• pp.87-98
• /
• 2012

In recent years, there are many data and multimedia services that are supported by WiFi-enabled mobile devices. As a result, the demand for the ability to connect to the Internet anywhere is rapidly increasing and network infrastructure is becoming increasingly important. The design of cost-efficient network mobility (NEMO) protocol is intended to reduce the demand for limited wired/wireless network bandwidth at the signaling of mobility support and packet delivery operations. In this paper, we propose a cost-effective inter-LMA domain mobility management scheme which provides fast handover with multicasting support in NEMO environments. And our Fast PR-NEMO scheme is compared with N-PMIPv6, rNEMO, and PR-NEMO. In conclusion, our proposed scheme shows the best performance in terms of location updating cost, and packet tunneling cost.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.425-441
• /
• 2013

In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function. The bilinear pairing requires a super-singular elliptic curve group having large number of elements and the relative computation cost of it is approximately two to three times higher than that of elliptic curve point multiplication, which indicates that bilinear pairing is an expensive operation. Moreover, the MTP function, which maps a user identity into an elliptic curve point, is more expensive than an elliptic curve scalar point multiplication. Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments. Thus, a cost-efficient SDVS scheme using elliptic curve cryptography with pairingfree operation is proposed in this paper that instead of MTP hash function uses a general cryptographic hash function. The security analysis shows that our scheme is secure in the random oracle model with the hardness assumption of CDH problem. In addition, the formal security validation of the proposed scheme is done using AVISPA tool (Automated Validation of Internet Security Protocols and Applications) that demonstrated that our scheme is unforgeable against passive and active attacks. Our scheme also satisfies the different properties of an SDVS scheme including strongness, source hiding, non-transferability and unforgeability. The comparison of our scheme with others are given, which shows that it outperforms in terms of security, computation cost and bandwidth requirement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1282-1301
• /
• 2015

Traditional infrastructure has been superseded by cloud computing, due to its cost-effective and ubiquitous computing model. Cloud computing not only brings multitude of opportunities, but it also bears some challenges. One of the key challenges it faces is recovery of computing nodes, when an Information Technology (IT) failure occurs. Since cloud computing mainly depends upon its nodes, physical servers, that makes it very crucial to recover a failed node in time and seamlessly, so that the customer gets an expected level of service. Work has already been done in this regard, but it has still proved to be trivial. In this study, we present a Cost-Time aware Genetic scheduling algorithm, referred to as CTaG, not only to globally optimize the performance of the cloud system, but also perform recovery of failed nodes efficiently. While modeling our work, we have particularly taken into account the factors of network bandwidth and customer's monetary cost. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results show performance gain of our work over the others, in some particular scenarios.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.4
• /
• pp.590-597
• /
• 2011

The IDRS provides detection, classification and bearing/range estimation by performing wavefront curvature analysis on an intercepted active transmission from target. Especially, a estimate of the target bearing/range that significantly affects the optimal operation of own submarine is required. Target bearing/range can be estimated by wavefront curvature ranging which use the difference of time arrival at sensors. But estimation ambiguity occur in bearing/range estimation due to a number of peaks caused by high center frequency and limited bandwidth of the intercepted active transmission and distortion caused by noise. As a result the bearing/range estimation performance is degraded. To estimate target bearing/range correctly, bearing/range estimation method that eliminate estimation ambiguity is required. In this paper, therefore, for wavefront curvature ranging, NLS cost function with curve fitting method is proposed, which provide robust bearing/range estimation performance by eliminating estimation ambiguity. Through simulation the performance of the proposed bearing/range estimation methods are verified.

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.2
• /
• pp.15-22
• /
• 2013

Low-Temperature-cofired ceramics (LTCC) antenna packages have been extensively researched and utilized in recent years due to its excellent electrical properties and ease of implementing dense package integration topologies. This paper introduces some of the key research and development activities using LTCC packaging solutions for 60 GHz antennas at Samsung Electronics [1]. The LTCC 60 GHz antenna element topology is presented and its measured results are illustrated. However, despite its excellent performance, the high cost issues incurred with LTCC at millimeter wave (mmWave) frequencies for antenna packages remains one of the key impediments to mass market commercialization of mmWave antennas. To address this matter, for the first time to the author's best knowledge this paper alleviates the high cost of mmWave antenna packaging by devising a novel, broadband antenna package that is wholly based on low-cost, high volume FR4 Printed Circuit Board (PCB). The electrical properties of the FR4 substrate are first characterized to examine its feasibility at 60 GHz. Afterwards a compact multi-layer antenna package which exhibits more than 9 GHz measured bandwidth ($S_{11}{\leq}-10$ dB) from 57~66 GHz is devised. The measured normalized far-field radiation patterns and radiation efficiency are also presented and discussed.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1999.11a
• /
• pp.191-194
• /
• 1999

Recently, with the rapid development and demand for compactness of portable communications, the requirement for compact and low-cost filter is increasing. One of the methods for reducing size and cost is to use high dielectric constant and low loss dielectric material in filter. The other is new monoblock dielectric band-pass filter (BPF) which has holes in a single dielectric body without additional coupling elements. This structure effectively reduces the size and cost of the filters. For previous conventional coaxial type dielectric BPF, dielectric substrates were used for coupling between adjacent resonators and additional input and output ports were needed. Coupling between adjacent resonators of monoblock BPF can be otained via electrode pairs. Capacitances of electrode pair structure for coupling are intensively investigated by 3-D FEM. The BPF for PCS has been designed to have a 30 MHz pass-bandwidth with center frequency of 1855 MHz and an attenuation pole at below the passband using a commercial 3-D structure simulator.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.5
• /
• pp.282-296
• /
• 2006

In a wireless client server environment, data broadcasting is an efficient data dissemination method; a server broadcasts data, and some of broadcasted data are cached in a mobile client's cache to save the narrow communication bandwidth, limited resources, and data access time. A server also broadcasts invalidation reports to maintain the consistency between server data and a client's cached data. Most of existing works on the cache consistency problems simply purge the entire cache when the disconnection time is long enough to miss the certain amount(window size) of IRs. This paper presents a cache invalidation method to increase mobile clients' cache reusability in case of a long disconnection. Instead of simply dropping the entire cache regardless of its consistency, a client estimates the cost of purging all the data with the cost of selective purge. If the cost of dropping entire cache is higher, a client maintains the cache and selectively purge inconsistent data using uplink bandwidth for validation request. The simulation results show that this scheme increases the cache reusability since it effectively considers the update rates and the broadcast frequencies of cached data in estimating the cost of cache maintenance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.1
• /
• pp.100-105
• /
• 2003

In this paper, we propose the novel test method effectively to detect short and open faults in CMOS op-amp. The proposed method uses a sinusoidal signal with higher frequency than unit gain bandwidth. Since the proposed test method doesn't need complex algorithm to generate test pattern, the time of test pattern generation is short, and test cost is reduced because a single test pattern is able to detect all target faults. To verify the proposed method, CMOS two-stage operational amplifier with short and open faults is designed and the simulation results of HSPICE for the circuit have shown that the proposed test method can detect short and open faults in CMOS op-amp.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.5-12
• /
• 2005

Establishment of bandwidth and effective traffic processing are required to treat various traffics according to a rapid increase in Internet traffic. A wavelength based transferring method was introduced to support a broadband bandwidth according to this requirement, and consequently, a label processing procedure has been investigated to treat various traffics. This paper introduces a regular shape of stack structure in order to solve the present MPLS label stack processing unit, and analyzes the relationship to label merging, which is initiated between label merging inside and outside the LSP tunnel. By applying an adaptive label structure and merging point a hierarchical label, which is aroused in the GMPLS, can be uniformly simplified and improved from the perspective of cost and processing time at a node