• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.81-91
• /
• 2007

Binding update for the routing optimization in MIPv6 can make the involved nodes vulnerable to various attacks. Therefore, secure binding update becomes an important research issue in MIPv6, and several protocols have been proposed for this purpose. In this paper, we compare several existing binding update protocols such as RR, SUCV and OMIPv6 and analyze the vulnerability of nodes to the possible attacks and drawbacks of address management and scalability and overhead of encryption operations. Then, we suggest the design requirements for the secure binding update and propose an advanced protocol based on the design principle. Through the analysis, we show that our protocol can achieve a higher level of security against the various attacks and enable better management of address, provide the location privacy and reduce the computational overhead of mobile nodes with constraint computational power.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.13 no.1
• /
• pp.31-39
• /
• 1995

We have various methods of measurement for a safety diagnosis of outworn structure, but these methods to find a variation of structure are not convincible with it's exactness and confidence. We have to lay out a scheme for a solution of these problems and improve a visibility of result. In this study, we studied a optimized solution for close-range photogrammetry to offer the more reliable method compare to conventional method and to improve it's confidens and visibility of output. For obtaining these effects, we manufactured the plane models and curved surface ones each devided into two types, normal case and obilique case. In this way, we got a optimum solution to increase a confidence level and visibility of photogrammetry. And actually, this study will be a good way to measure a variation of structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.670-683
• /
• 2016

Network coding, as a new technique to improve the throughput, is studied combined with multi-relay model in this paper to address the challenges of long distance and power limit in deep space communication. First, an amplify-and-forward relaying approach based on analog network coding (AFNC) is proposed in multi-relay network to improve the capacity for deep space communication system, where multiple relays are introduced to overcome the long distance link loss. The design of amplification coefficients is mathematically formulated as the optimization problem of maximizing SNR under sum-power constraint over relays. Then for a dual-hop relay network with a single source, the optimal amplification coefficients are derived when the multiple relays introduce non-coherent noise. Through theoretic analysis and simulation, it is shown that our approach can achieve the maximum transmission rate and perform better over single link transmission for deep space communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1654-1675
• /
• 2014

In practical wireless systems, the erroneous channel state information (CSI) sometimes deteriorates the performance drastically. This paper focuses on robust design of coordinated set planning of coordinated multi-point (CoMP) transmission, with respect to the feedback delay and link error. The non-ideal channel models involving various uncertainty conditions are given. After defining a penalty factor, the robust net ergodic capacity optimization problem is derived, whose variables to be optimized are the number of coordinated base stations (BSs) and the divided area's radius. By the maximum minimum criterion, upper and lower bounds of the robust capacity are investigated. A practical scheme is proposed to determine the optimal number of cooperative BSs. The simulation results indicate that the robust design based on maxmin principle is better than other precoding schemes. The gap between two bounds gets smaller as transmission power increases. Besides, as the large scale fading is higher or the channel is less reliable, the number of the cooperated BSs shall be greater.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2120-2133
• /
• 2013

In this paper, we address the problem of linear minimum mean-squared error (MMSE) transmitter design for the cognitive radio (CR) multi-user multiple-input single-output (MU-MISO) broadcasting channel (BC), where the cognitive users are subject to not only a sum power constraint, but also a interference power constraint. Evidently, this multi-constraint problem renders it difficult to solve. To overcome this difficulty, we firstly transform it into its equivalent formulation with a single constraint. Then by utilizing BC-MAC duality, the problem of BC transmitter design can be solved by focusing on a dual MAC problem, which is easier to deal with due to its convexity property. Finally we propose an efficient two-level iterative algorithm to search the optimal solution. Our simulation results are provided to corroborate the effectiveness of the proposed algorithm and show that this proposed CR MMSE-based scheme achieves a suboptimal sum-rate performance compared to the optimal DPC-based algorithm with less computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

• Smart Structures and Systems
• /
• v.16 no.3
• /
• pp.555-577
• /
• 2015

In the work at hand, the development of a morphing flap, actuated through shape memory alloy load bearing elements, is described. Moving from aerodynamic specifications, prescribing the morphed shape enhancing the aerodynamic efficiency of the flap, a suitable actuation architecture was identified, able to affect the curvature. Each rib of the flap was split into three elastic elements, namely "cells", connected each others in serial way and providing the bending stiffness to the structure. The edges of each cell are linked to SMA elements, whose contraction induces rotation onto the cell itself with an increase of the local curvature of the flap airfoil. The cells are made of two metallic plates crossing each others to form a characteristic "X" configuration; a good flexibility and an acceptable stress concentration level was obtained non connecting the plates onto the crossing zone. After identifying the main design parameters of the structure (i.e. plates relative angle, thickness and depth, SMA length, cross section and connections to the cell) an optimization was performed, with the scope of enhancing the achievable rotation of the cell, its ability in absorbing the external aerodynamic loads and, at the same time, containing the stress level and the weight. The conceptual scheme of the architecture was then reinterpreted in view of a practical realization of the prototype. Implementation issues (SMA - cells connection and cells relative rotation to compensate the impressed inflection assuring the SMA pre-load) were considered. Through a detailed FE model the prototype morphing performance were investigated in presence of the most severe load conditions.

• Smart Structures and Systems
• /
• v.15 no.5
• /
• pp.1233-1252
• /
• 2015

This study investigates the problem of crack detection in post-buckled beam-type structures. The beam under the axial compressive force has a crack, assumed to be open and through the width. The crack, which is modeled by a massless rotational spring, divides the beam into two segments. The crack detection is considered as an optimization problem, and the weighted sum of the squared errors between the measured and computed natural frequencies is minimized by the bees algorithm. To find the natural frequencies, the governing nonlinear equations of motion for the post-buckled state are first derived. The solution of the nonlinear differential equations of the two segments consists of static and dynamic parts. The differential quadrature method along with an arc length strategy is used to solve the static part, while the same method is utilized for the solution of the linearized dynamic part and the extraction of the natural frequencies of the cracked beam. The investigation includes several numerical as well as experimental case studies on the post-buckled simply supported and clamped-clamped beams having open cracks. The results show that several parameters such as the amount of applied compressive force and boundary conditions influences the outcome of the crack detection scheme. The identification results also show that the crack position and depth can be predicted well by the presented method.

• Korean Management Science Review
• /
• v.31 no.1
• /
• pp.27-40
• /
• 2014

Tour products have been recognized as a perishable asset. For tour operation companies (TOCs), improving profitability is a core decision problem for their business. Since package tour products, typical products of TOCs, are perishable after the tour was departed, TOCs have been tried to increase their sales before the departure date with various marketing strategies including price discounts. The pricing problem for perishable assets have been studied in Revenue Management for a long time. However, it is hard to find a research on pricing decisions for tour products. In this paper, we focus on a pricing problem for tour products. In particular, we will consider the pricing scheme with customer preference values on purchasing conditions. With conjoint analysis, we can use the part-worth value as a preference value for each level of purchasing conditions. To construct various discount prices, we use an enumeration method and suggest a mathematical optimization model. With experimental analysis for a sample tour package, we will show that our pricing process is very helpful for designing customer-oriented pricing decision.