• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.11-20
• /
• 2004

Mobile IP is designed to provide IP services to roaming nodes. Mobile users take advantage of this protocol to obtain the services as if they were connected to their home network. In many cases mobile users is connected through a wireless link and is protected by corporation's firewall in virtual Private network. In order to have a successful deployment of Mobile IP as an extension of a private network, security services should be provided as if the mobile node were attached to its home network. In this paper, we propose the security mechanism of combining Mobile IP and IPSec tunnels, which can provide secure traversal of firewall in a home network. The simulation results show that the proposed mechanism provides the secure and efficient communication.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.1-11
• /
• 2005

Internet has become an essential part of our daily lives. Many of the day to day activities can already be carried out over Internet, and its convenience has greatly increased the number of Internet users. Hut as Internet gains its popularity, the illicit incidents over Internet has also proliferated. The intruder trace-back technology is the one that enables real time tracking the position of the hacker who attempts to invade the system through the various bypass routes. In this paper, the RTS algorithm which is the TCP connection trace-back system using the watermarking technology on Internet is proposed. Furthermore, the trace-bark elements are modeled by analyzing the Proposed trace-back algorithm, and the results of the simulation under the virtual topology network using ns-2, the network simulation tool are presented.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.45-50
• /
• 2003

Guaranteed Frame Rate (GFR) service category is one of the most recent ATM service categories. The GFR specification was recently finalized by the ATM Forum and is expected to become an important service category which can efficiently support TCP/IP traffic in ATM network. In GFR switch implementation, it is important to guarantee MCR (minimum cell rate) and improve fairness. In this paper, we propose a new scheduling algorithm for the GFR service. Proposed algorithm provides priority to VC (virtual circuit)s and high Priority given to a VC which has fewer untagged cells in buffer. High priority VCs are serviced before low priority VCs. Proposed algorithm can guarantee MCR and improve fair sharing of the remaining bandwidth between GFR VCs. From computer simulation results, we demonstrate the proposed scheduling algorithm provide much better performance in TCP goodput and fairness than previous schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.565-570
• /
• 2013

The mirror neuron regions which are distributed in cortical area handled a functionality of intention recognition on the basis of imitative learning of an observed action which is acquired from visual-information of a goal-directed action. In this paper an automated intention recognition system is proposed by applying computational model of mirror neuron system to the human-robot interaction system. The computational model of mirror neuron system is designed by using dynamic neural networks which have model input which includes sequential feature vector set from the behaviors from the target object and actor and produce results as a form of motor data which can be used to perform the corresponding intentional action through the imitative learning and estimation procedures of the proposed computational model. The intention recognition framework is designed by a system which has a model input from KINECT sensor and has a model output by calculating the corresponding motor data within a virtual robot simulation environment on the basis of intention-related scenario with the limited experimental space and specified target object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.973-982
• /
• 2004

High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.314-323
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.674-682
• /
• 2003

Ship autonomous navigation is designated as what computerizes mental faculties possessed of navigation experts, which are building navigation plans, grasping the situation, forecasting the fluctuation, and coping with the situation. An autonomous navigation system, which consists of several subsystems such as navigation system, a collision avoidance system, several data fusion systems, and a motion control system, is based on an intelligent control architecture for the sake of integrating the systems. The motion control system, which is one of the most essential system in autonomous navigation system, controls its propulsion and steering gears to move the ship satisfying its hydrodynamic characteristics. This paper is the study on the ship movement control system and its implementation which are totally developed and run on virtual-world system. Receiving the high-level control values such as a waypoint presented from the collision avoidance system, the motion control system generates them to low-level control values for propulsion and steering devices. In the paper, we develop a ship motion controller using Oldenburger's theory based on mathematical fundamentals, and simulate it with various scenarios in order to verify its performance.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.6
• /
• pp.109-114
• /
• 2008

An improvement of vehicle fuel economy is one of the most important topic in automotive engineering. Lots of engineers make efforts to achieve 1% of fuel economy improvement. Engine friction is an important factor influencing vehicle fuel economy. This paper focuses on effect of engine friction on vehicle fuel economy during warm-up. A computer simulation is one of the powerful tools in automotive engineering field. Recently Simulation is attempting to virtual experiment not using expensive instruments. It is possible to presuppose fuel economy by changing the characteristic of accessories using CRUISE(vehicle simulation software). In this paper, fuel consumption at each part of the vehicle is analyzed by both of experiment and simulation. The results of fuel economy analysis on experiment substitute for Cruise to calculate fuel economy. The simulation data such as engine speed, brake torque, shift pattern, vehicle speed, fuel consumption level is well correlated to experiment data. In this paper, the change of warm-up time, faster or slower, through simulation is performed. As a result of the fast warm-up, fuel economy is improved up to 1.7%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1490-1500
• /
• 1996

One of the important issues for multimedia communications over ATM netowrks is efficient use of net-work resources since transmitting video at low cost requires high utilization of channel bandwidth. In this paper, we propose an effective bandwidth estimation scheme for MPEG sources in ATM networks. It has been known difficult to allocate effective transmission bandwidth to MPEG sources due to its bursty charactersitics. The MPEG traffic stream can bemodeled using five traffic parameters:service rate, burst load ratio, interburst load ratio, burst period, and interburst period. Using these parameters, a transmission bandwidth for each source can be estimated, and the estimated bandwidth is applied synchronously to reduce the queue size in a buffer. For a simple network modelof a high speed link that multiplexes a number of virtual-circuit connections, simulations on adaptive bandwidth allocation were performed, and the results show that the queueing delay is significantly reduced, when compared to a fixed bandwidth allocation.