• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.21-28
• /
• 2007

Hierarchical Mobile IPv6 improves performance of Mobile IPv6 by managing Binding Update in terms of location, With improved handover delay, realization of delay-sensitive services (e,g, VoIP or video streaming) has become more persuadable, Comparing with Mobile IPv6, however, Hierarchical Mobile IPv6 brings security threats related to Local Binding Update to mobile network, In the RFC 4140, specific methods to authenticate Local Binding Update message are not explicitly presented. It is essential that design secure architecture to address problems related to authenticating Local Binding Update, Many secure suggestions for Local Binding Update, however, concentrate on infrastructure-based solutions such as AAA PKI. These approaches may cause scalability problem when the suggested solutions are applied to real network. Therefore we suggest authentication method that doesn't require infrastructure, In addition to authentication of Local Binding Update, our method also provides mobile node with power saving ability.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.643-648
• /
• 2003

In order to provide efficient retrieving results for user query on the web environment, the various searching algorithms have developed and considered user's preference and convenience. However, the searching algorithms are developed on the horizontal and non hierarchical web environment in general and could not apply to the complex hierarchical and functional web environments such like the enterprise network. In this paper, we purpose the multi-agent based web mining system which can provide the efficient mining results to the user on the special web environment. For doing this, we suggest the network model with the hierarchical web environment and model the multi agent based web mining system which has four corporation agents and fourteen process modules. Then, we explain the detailed functions of each agent considered the hierarchical environment according to the module. Especially, we purpose the new merging agent and improved ranking algorithm by using the graph theory.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.433-440
• /
• 2018

I investigated whether network structure of legislators affects legislative performance in a cosponsorship network. I presented the theoretical basis with network closure and structural holes, and analyzed the network in the 19th National Assembly of Republic of Korea. In the directed and weighted network, each tie means that cosponsors support the bill sponsors proposed. The performance was measured by the number of initiatives and the ratio of reflected legislation, and the network structure was measured by size, density, hierarchy, and constraint. I found that the legislators with brokerage structure have a lot of initiatives in making connection with many legislators in various groups and the legislators with hierarchical structure have the higher ratio of reflected legislation with the continuous and strong support from the members of their group. I also found that the network of ruling party lawmaker is more hierarchical than the network of opposition lawmaker.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.105-114
• /
• 2006

In ubiquitous environment where various kinds of computers are embedded in persons, objects and environment and they are interconnected and can be used in my place as necessary, different types of data need to be exchanged between heterogeneous machines through home network. In the environment, the efficient processing, transmission and monitoring of image data are essential technologies. We need to make research not only on traditional image processing such as spatial and visual resolution, color expression and methods of measuring image quality but also on transmission rate on home network that has a limited bandwidth. The present study proposes a new motion vector estimation algorithm for transmitting, processing and controlling image data, which is the core part of contents in home network situation and, using algorithm, implements a real time monitoring system of multi dimensional images transmitted from multiple cameras. Image data of stereo cameras to be transmitted in different environment in angle, distance, etc. are preprocessed through reduction, magnification, shift or correction, and compressed and sent using the proposed metamorphosis hierarchical motion vector estimation algorithm for the correction of motion. The proposed algorithm adopts advantages and complements disadvantages of existing motion vector estimation algorithms such as whole range search, three stage search and hierarchical search, and estimates efficiently the motion of images with high variation of brightness using an atypical small size macro block. The proposed metamorphosis hierarchical motion vector estimation algorithm and implemented image systems can be utilized in various ways in ubiquitous environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.15-23
• /
• 2017

The person Re-identification is the most challenging part of computer vision due to the significant changes in human pose and background clutter with occlusions. The picture from non-overlapping cameras enhance the difficulty to distinguish some person from the other. To reach a better performance match, most methods use feature selection and distance metrics separately to get discriminative representations and proper distance to describe the similarity between person and kind of ignoring some significant features. This situation has encouraged us to consider a novel method to deal with this problem. In this paper, we proposed an enhanced recurrent neural network with three-tier hierarchical network for person re-identification. Specifically, the proposed recurrent neural network (RNN) model contain an iterative expectation maximum (EM) algorithm and three-tier Hierarchical network to jointly learn both the discriminative features and metrics distance. The iterative EM algorithm can fully use of the feature extraction ability of convolutional neural network (CNN) which is in series before the RNN. By unsupervised learning, the EM framework can change the labels of the patches and train larger datasets. Through the three-tier hierarchical network, the convolutional neural network, recurrent network and pooling layer can jointly be a feature extractor to better train the network. The experimental result shows that comparing with other researchers' approaches in this field, this method also can get a competitive accuracy. The influence of different component of this method will be analyzed and evaluated in the future research.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.23-32
• /
• 2007

We propose a group-based security scheme for hierarchical wireless sensor networks. We model the network for secure routing with 3-tier sensor network comprised of three types of nodes: Base Station, Group Dominator and ordinary Sensor Nodes. Group-based deployment is performed using Gaussian (normal) distribution and show that more than 85% network connectivity can be achieved with the proposed model. The small groups with pre-shared secrets form the secure groups where group dominators form the backbone of the entire network. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors; i.e., local sensed data are collected by the dominating nodes and sent an aggregated packet to the base station via other group dominators. The scheme is shown to be light-weight, and it offers a stronger defense against node capture attacks. Analysis and simulation results are presented to defend our proposal. Analysis shows that robustness can significantly be improved by increasing the deployment density using both the dominating and/or ordinary sensor nodes.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.1
• /
• pp.18-23
• /
• 2011

We have investigated the Intelligent Shift-map Module(ISM) to improve some problems in the conventional Automatic Transmission(AT) for automobiles. The typical AT lacks flexibility regarding the shift point because it does not consider the driver's habits and inclinations. Also it often is occurred phenomenon like kick-down. Therefore, we designed a decision module which considers the driving style of the individual driver. The driving style was determined by the inclination of the driver and the driving technique using actual automobile data. The Hierarchical Neural Network(HNN) was applied in generating an intelligent shift map with Multilayer Neural Network(MNN). It was found that the proposed ISM provided a suitable shift point and time because the necessary toque and velocity of the automobile was considered along with the driving style of each driver when designing the ISM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.947-956
• /
• 2003

The current IP Routing Protocolspacket networks also need to provide the network QoS based of DiffServ, RSVP, MPLStraffic model which is standardized as IETF reference model for NGN. The first topic of this paper is to propose Traffic-Balanced Routing Protocol(TBRP) to process existing best effort traffic. TBRP will process low priority interactive data and background data which is not sensitive to dealy. Secondly Hierarchical Traffic-Traffic-Scheduling Routing Protocol(HTSRP) is also proposed. HTSRP is the hierarchical routing algorithm for backbone and access networkin case of fixed-wireless convergence network. Finally, HTSRP_Q is proposed to meet the QoS requirement when user want interactive or streaming packet service. This protocol will maximize the usage of resources of access layer based on the QoS parameters and process delay-sensitive traffic. Service classes are categorized into 5 types by the user request, such as conversational, streaming, high priority interactive, low priority interactive, and background class. It could be processed efficiently by the routing protocolstraffic model proposed in this paper. The proposed routing protocolstraffic model provides the increase of efficiency and stability of the next generation network thanks to the routing according to the characteristic of the specialized service categories.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.337-349
• /
• 2013

In this paper, we propose a new mobility management scheme, called i-FP(intelligent Fast PMIPv6). Our proposed i-FP scheme is addressed for solving the existing local mobility management problems from legacy frameworks. To move MN(Mobile Node) to other networks in one domain, i-FP employs three network entities which are extended from PMIPv6(Proxy Mobile IPv6), LMA(Local Mobility Anchor), MAG(Mobile Access Gateway) and MN. In i-FP, the three network entities can reduce the handover delay time of MNs. Also, i-FP uses an IP header swapping mechanism to avoid the traffic overhead and improve the throughput of network. To evaluate the performance of i-FP, we analyze our i-FP, HMIPv6(Hierarchical Mobile IPv6) and PMIPv6 which are legacy protocols of local mobility management in terms of various parameters. Finally, our i-FP scheme shows good performance(reduction of routing hops 10.2%, signaling costs 58.5% and handover delay 16.3%) than other network schemes for the total cost.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.515-524
• /
• 2005

As the number of the mobile nodes (MNs) increases in the networks, the signaling traffic generated by mobility management for MNs will increase explosively, and such a phenomenon will probably affect overall network performance. In this paper, we propose a novel analytical approach using a continuous-time Markov chain model and hierarchical network model for the analysis on the signaling load of representative IPv6 mobility support Protocols such as Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6). According to these analytical modeling, this paper derives the various signaling costs, which are generated by an MN during its average domain residence time when MIPv6 and HMIPv6 are deployed under the same network architecture, respectively. In addition, based on these derived costs, we investigate the effects of various mobility/traffic-related parameters on the signaling costs generated by an MN under MIPv6 and HMIPv6. The analytical results show that as the average moving speed of an MN gets higher and the binding lifetime is set . to the larger value, and as its average packet arrival rate gets lower, the total signaling cost generated during its average domain residence time under HMIPv6 will get relatively lower than that under MIPv6, and that under the reverse conditions, the total signaling cost under MIPv6 will get relatively lower than that under HMIPv6.