• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.1
• /
• pp.40-48
• /
• 2005

A hydraulic hose is an important part of the hydraulic system which transmits power using pressurized fluids. It allows relative motion between components at each end of the hose assembly, and it is much easier to route a hose assembly than it is to bend and install a rigid tubing assembly. Unnecessary loads, which drop the hose's pressure capability and shorten service life, depend on a hose-routing. Therefore, the Hydraulic system designers must be aware to consider unnecessary load does not affect the here. For this consideration in an early stage of the design process, CAD system must support the hose assembly routing design function which is to generate routing path and design fitting angle properly. This paper proposes 2 methods. One is to generate curves that are similar to routing paths of the real hose assembly using the energy minimization method and the optimization method. The other is to design fitting angles that are important design elements of a hose assembly using the Parallel Transport Frame. To implement the proposed methods above, commercial CAD software, CATIA has been integrated with our program.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.257-260
• /
• 2001

Routing region modeling methods for PCB auto-routing system in Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size. In this paper we design PCB(Printed Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) Shaped based type without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system.

• Journal of IKEEE
• /
• v.24 no.1
• /
• pp.326-332
• /
• 2020

This paper presents the design of a routing metric for energy-efficient and low-delay path selection and a new routing protocol utilizing the metric in duty-cycyled wireless sensor networks. The new routing metric based on duty cycle, EDW, can reduce the energy and delay of transmission paths, which represents total waiting time from source to destination due to duty cycle. Therefore, in this paper, we propose a new multipath routing protocol based on cross-layer information utilizing the new routing metric, and simulation results show that the proposed protocol shows better performance of end-to-end delay and energy consumption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.65-69
• /
• 2001

Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and flouter forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour routing path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the proposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly

• Smart Media Journal
• /
• v.11 no.9
• /
• pp.39-46
• /
• 2022

The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.702-704
• /
• 2010

Wireless LAN(Local Area Network) environment to support QoS in IEEE802.11 Working Group has standardized on the IEEE 802.11e. IEEE 802.11e EDCA channel access of the high priority traffic as by raising the probability of a chance to support QoS. This is a high priority traffic than low priority traffic, channel access is not necessarily the first. Therefore, as all traffic channels, if you have the same routing path, lower priority traffic on the performance of high priority traffic, sustainable impact. As a result, EDCA, such as voice or video to guarantee QoS for multimedia applications, follow the crowd. In this paper, to solve these problems by using Multi-Interface Multi-Path Routing Algorithm is proposed. Interface for each use in IEEE 802.11e EDCA Access Category much differently by each of the Routing Path for high priority traffic and guarantee QoS.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.