• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.418-428
• /
• 2000

이동호스트를 지원하는 네트워크에서의 멀티캐스트 라우팅은 그룹 멤버의 빈번한 위치 변화를 가져와서 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 라우팅 프로토콜을 적용할 경우 많은 문제점을 발생시킨다. 이런점에서 Mobile-IP를 유니캐스트 라우팅 방식으로 사용하는 이동환경에서의 이동호스트를 위한 몇가지 멀티캐스팅 방법이 제시되었으나 이 방법들 또한 비최적 경로로의 데이터 전송, 비효율적인 데이터 중복 전송, 그리고 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 가지고 있다. 따라서 본 논문에서는 이런 문제점들을 구찰하고 이 문제점들을 보와하는 효과적인 멀티캐스트 라우팅 프로토콜을 제안하고자 한다. 제시하는 프로토콜은 Mobile-IP를 사용하는 이동호스트에게 멀티캐스트 서비스를 지원하는 멀티캐스트 에이전트와 이들 멀티캐스트 에이전트들 중에서 선택된 멀티캐스트 포워더를 이용하여 동작한다 이동호스트는 이웃한 멀티캐스트 포워더로부터 데이터를 터널링받거나 또는 로컬네트워크에 위치한 멀티캐스트 라우터로부터 멀티캐스트 데이터를 직접전송받게 된다. 따라서 멀티캐스트 데이터의 전송 경로를 단축시키고 중복되는 데이터 및 터널링으로 전송되는 데이터를 감소시킴으로써 전체 네트워크 트래픽량을 줄이는 효과를 얻을 수 있다. 제시하는 프로토콜의 성능은 다양한 환경의 시뮬레이션을 통하여 확인해 본다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.154-156
• /
• 2001

최근 호스트의 이동성을 IP 네트워크상에서 지원하는 연구가 이루어지고 있으며, 현재 Mobile IP가 이러한 연구의 기본으로 사용되고 있다. 그러나 mobile IF는 유니캐스트에 대한 지원을 기본으로 하기 때문에, 본 논문에서는 Mobile IP에 멀티캐스트까지 지원하는 프로토콜을 제시하고자 한다. 여기서 모든 전송은 GMR(group Management router)를 통해 이루어지며. GMR은 모바잎 호스트가 위치하는 멀티캐스트 트리상의 라우터들 중에서 각 멀티캐스트 그룹의 세션을 관리하기 위해 선택된다. GMR을 통만 멀티캐스트 전송은 triangle 문제를 해결하고 가장 최적의 경로로 전송이 이루어진다. 다른 모바일 멀티캐스트 프로토콜인 Bi-directional Tunneling과 MoM보다 네트워크상에 적은 수의 메지가 전송되기 때문에 더 나은 성능을 가짐을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.262-264
• /
• 2001

컴퓨터 네트웍 시스템에서 부각되고 있는 두 가지 중요한 추세는 아마도 ‘멀티미디어’와 ‘이동 컴퓨팅’일 것이다. 멀티캐스트는 멀티미디어 데이터가 차지하는 많은 네트웍 트래픽을 수신 컴퓨터들에게 효율적으로 분배함으로써 네트웍 트래픽을 줄일 수 있다. 그러나 이동 호스트를 지원하는 이동 네트웍에서의 멀티캐스팅은 빈번한 그룹 멤버쉽의 변화와 함께 그룹 멤버의 위치변화로 인해서 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 프로토콜을 적용하는 것은 적합하지 못한다. 이런 점에서 Mobile IP를 기본 유니캐스팅 환경에서 채택하여 이동 호스트에게 멀티캐스트를 지원하기 위한 몇 가지 방법이 제시되었으나, 비최적 경로로의 데이터 전송, 비효율적인 데이터 중복 전송, 또는 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 내포하고 있다. 제안된 프로토콜에서는 이동 호스트에게 멀티캐스트 서비스를 제공하는 FMA(Foreign Multicast Agent)를 유동적으로 선정하고 이동 호스트가 가지는 타임아웃 값을 이용하여 이동성으로 인해 발생하는 문제점들을 완화시킴으로써, Mobile IP를 이용하는 이동 호스트에게 IP멀티캐스팅을 효과적으로 제공한다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.637-646
• /
• 2012

Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

• Journal of the Korean Society of Industry Convergence
• /
• v.21 no.2
• /
• pp.53-62
• /
• 2018

This study propose a new approach to control the optimal working path of vertical type articulated robot with translation joint for trimming working process automation in forging manufacturing process. The basic structure of the proposed robotic joints controller consists of a Proportional-Intergral controller and a Proportional-Derivative controller in parallel. The proposed control scheme takes advantage of the properties of the fuzzy PID controllers. The proposed method is suitable to control of the trajectory and path control in cartesian space for vertical type articulated robot manipulator. The results illustrates that the proposed fuzzy computed torque controller is more stable and robust than the conventional computed torque controller. The reliability is varified by simulation test for vertical type s articulated robot with seven joints including one trqanslation joint.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.329-342
• /
• 2003

Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.685-694
• /
• 2003

Recently as the mobile computing is burgeoning, multimedia services have become very popular. Multimedia services require large data volume and have to send the same data to several users. In order to provide efficient multimedia services that have those characteristic to mobile users, efficient multicast technique to support host mobility is required. Previous research that support multicast services in mobile computing based on Mobile IP have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the multicast tree, and service disruption problem. In this paper, we propose the mobility pattern based multicast technique using variable service range according to the mobility of mobile hosts and resource reservation to solve this problems. The experimental results show that our proposed mechanism has improved performance than previous research.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.67-75
• /
• 2020

This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.