• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.917-922
• /
• 2004

Mobile ad hoc networks (MANETs) are networks of mobile nodes that have no fixed network infrastructure. Since the mobile node's location changes frequently, it is an attractive area to maintain the node's location efficiently. In this paper, we present an adaptive randomized database group (ARDG) scheme to manage the mobile nodes mobility in MHANETs. The proposed scheme stores the network nodes' location in location databases to manage the nodes' mobility. When a mobile node changes its location or needs a node's location, the node randomly select some databases to update or que교 the location information. The number of the selected databases is fixed in the case of querying while the number of the databases is determined according to the node's popularity in the case of updating. We evaluated the performance of the proposed scheme using an analytical model, and compared the performance with that of the conventional randomized database group (RDG) scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.6
• /
• pp.425-429
• /
• 2009

Recently, Chen et al.'s proposed mutual authentication scheme based on the quadratic resiidue, finding the squaring root problem, for avoiding exhaustive search on the server. But, if a malicious reader sends same random value, the tag is traced by an adversary. Moreover, there is realization problem because of its limited ability to compute squaring and hash function. In this paper, we analyze Chen et al.'s scheme and its weakness. Furthermore we present an improved mutual authentication scheme based on the quadratic residue which solves the tracing problem by generating random value on the tag and uses only squaring. We also make the scheme satisfy to forward secrecy without updating and synchronizing and avoid exhaustive search.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.04a
• /
• pp.567-572
• /
• 2002

The equipment of industrial robot in manufacturing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS ). We can save much efforts and time in adjusting robots to newly defined workcells by using Off-Line Programming System. A proposed visual calibration scheme is based on position-based visual feedback. The visual calibration system is composed of a personal computer, an image processing board, a video monitor, and one camera. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not require the precise calculation of tree-dimensional object data and image Jacobian.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2001.10a
• /
• pp.140-145
• /
• 2001

The equipment of industrial robot in manufacturing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS). We can save much efforts and time in adjusting robots to newly defined workcells by using Off-Line Programming System. A proposed visual calibration scheme is based on position-based visual feedback. The visual calibration system is composed of a personal computer, an image processing board, a video monitor, and one camera. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not require the precise calculation of tree-dimensional object data and image Jacobian.

• Journal of the Korean Society of Industry Convergence
• /
• v.17 no.2
• /
• pp.54-60
• /
• 2014

The equipment of SCARA robot in processing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS). We can save much efforts and time in adjusting robots to newly defined workcells by using OLPS. A proposed visual calibration scheme is based on position-based visual feedback. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not requirethe precise calculation of tree-dimensional object data and image Jacobian.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.92-101
• /
• 2012

Security support is a significant factor in ad hoc networks. Especially in dynamic topologies, key agreement with private key updating is essential in providing a secure system. And it is also necessary to protect the identities of individual nodes in wireless environments to avoid personal privacy problems. However, many of the existing key agreement schemes for ad hoc networks do not consider these issues concurrently. This paper proposes an anonymous ID-based private key update scheme and a key agreement scheme for mobile ad hoc networks. We also suggest a method of rekeying between different domains using service-coordinators. These schemes are secure against various attacks and are suitable for service-oriented mobile ad hoc networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.11-20
• /
• 2002

In this paper, we propose an efficient quality providing scheme to satisfy a diversify combination of delay bound and loss ratio requirements from users by a predictive dynamic resource allocation method for real-time video applications. For utilizing the network resources more efficiently while meeting the service requirements, we adjust the resources based on the predicted traffic and the currently provided quality level. We developed a simple delayed-packet counter updating scheme for real time QoS monitoring. Simulation results show that our proposed method can provide an accurate and flexible quality control.

• Advances in Computational Design
• /
• v.1 no.3
• /
• pp.235-251
• /
• 2016

We have performed a design optimization of a stiffened panel with curvilinear stiffeners using an artificial neural network (ANN) residual kriging based surrogate modeling approach. The ANN residual kriging based surrogate modeling involves two steps. In the first step, we approximate the objective function using ANN. In the next step we use kriging to model the residue. We optimize the panel in an iterative way. Each iteration involves two steps-shape optimization and size optimization. For both shape and size optimization, we use ANN residual kriging based surrogate model. At each optimization step, we do an initial sampling and fit an ANN residual kriging model for the objective function. Then we keep updating this surrogate model using an adaptive sampling algorithm until the minimum value of the objective function converges. The comparison of the design obtained using our optimization scheme with that obtained using a traditional genetic algorithm (GA) based optimization scheme shows satisfactory agreement. However, with this surrogate model based approach we reach optimum design with less computation effort as compared to the GA based approach which does not use any surrogate model.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.903-914
• /
• 2022

Mobile and telecommunication networking uses temporary and random identifiers (IDs) to protect user privacy. For greater intelligence and security o the communications between the core network and the mobile user, we design and build a dynamic randomization scheme for the temporary IDs for mobile networking, including 5G and 6G. Our work for ID randomization (ID-RZ) advances the existing state-of-the-art ID re-allocation approach in 5G in the following ways. First, ID-RZ for ID updates is based on computing, as opposed to incurring networking for the re-allocation-based updates, and is designed for lightweight and low-latency mobile systems. Second, ID-RZ changes IDs proactively (as opposed to updating based on explicit networking event triggers) and provides stronger security (by increasing the randomness and frequency of ID updates). We build on the standard cryptographic primitives for security (e.g., hash) and implement our dynamic randomization scheme in the 5G networking protocol to validate its design purposes, which include time efficiency (two to four orders of magnitude quicker than the re-allocation approach) and appropriateness for mobile applications.

• 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.