• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.86-88
• /
• 2004

Personal Robot System in developing, have a module architecture, each module are connected through variety network system like ethernet, WLAN (802.11), IEEE 1394 (firewire), bluetooth, CAN, or RS-232C. In developing personal robot system. We think that the key of robot performance is interoperablity among modules. Each network protocol are well connected in the view of network system for the interoperability. So we make a bridging architecture that can routing converting, and transporting packets with matching each network's properties. Furthermore, we suggest a advanced design scheme for realtime / non-realtime and control signal (short, requiring hard-realtime) / multimedia data (large, requiring soft-realtime).

• ETRI Journal
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.1-9
• /
• 2011

This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.4
• /
• pp.151-157
• /
• 2023

RPL (IPv6 Routing Protocol for Low-power Lossy Network) is a standardized routing protocol for LLNs (Low power and Lossy Networks) by the IETF (Internet Engineering Task Force). RPL creates routes and builds a DODAG (Destination Oriented Directed Acyclic Graph) through OF (Objective Function) defining routing metrics and optimization objectives. RPL supports a leaf mode which does not allow any child nodes. In this paper, we propose INFRA-RPL which provides a dynamic leaf mode functionality to a leaf node with the mobility. The proposed protocol is implemented in the open-source IoT operating system, Contiki-NG and Cooja simulator, and its performance is evaluated. The evaluation results show that INFRA-RPL outperforms the existing protocols in the terms of PDR, latency, and control message overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.767-773
• /
• 2014

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and there have been various systems which have been recently studied. For a successful economic ship routing system, it is needed to properly control an engine power or change a geographical path considering weather forecast. An optimal geographical path is difficult to be determined, though, because it is a minimal dynamic-cost path search problem where the actual fuel consumption is dynamically variable by the weather condition when the ship will pass the area. In this paper, we propose an geographical path-search algorithm based on evolutionary strategy to efficiently search a good quality solution out of tremendous candidate solutions. We tested our approach with the shortest path-based sailing method over seven testing routes and observed that the former reduced the estimated fuel consumption than the latter by 1.82% on average and the maximum 2.49% with little difference of estimated time of arrival. In particular, we observed that our method can find a path to avoid bad weather through a case analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.8
• /
• pp.1088-1094
• /
• 2021

This paper proposes a partial BMA (Broadcasting Multiple Access) network structure and D-ARP (Distributed Address Resolution Protocol) method in order to support full mesh routing function in the DAMA (Demand Assigned Multiple Access)-based MF-TDMA (Multi Frequency-Time Division Multiple Access) satellite system. The partial BMA network enables legacy router devices and routing protocols to be adopted in the satellite communication system, and decreases the amount of routing protocol overhead. In addition, we introduce the D-ARP method that help a spoke satellite node acquiring the MAC (Media Access Control) address from remote satellite nodes in none BMA satellite network. The D-ARP method provides the MAC address of remote nodes to each other nodes through the broadcasting-enabled satellite channel. And we lastly evaluate and analysis the network performance of the proposed approach.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2787-2794
• /
• 2011

A mesh node, a component of a mesh network, is connected with the network by dynamic routing using routing protocol and collects the information of adjacent or connected mesh nodes for its self-management and settings. Also, it relays packets between the mesh nodes and provides AP(Access Point) with its corresponding functions based on IEEE 802.11 a/b/g for clients' access to the network. In this paper, the study focused on the design and performance tests of Wireless Mesh Network(WMN) which is applied to the wireless communication network for the CBTC(Communications Based Train Control) system. The WMN was established on a K-AGT test-line (Kyeongsan city, Gyeongsangbuk-do), and to verify the applicability, its operation and performances are checked by measuring the data throughput, delay latency, quality measurements such as transmission loss, radio interference and path recovery and setup between the on-board and wayside.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.149.2-149
• /
• 2001

In this paper, we present an agent-based transportation routing method in a semi-conductor production line. The main characteristic of the proposed method is that each AGV agent individually searches candidates of its route with reference of the pheromone information based on the use of an analogy of Ant System. The proposed method is applied to several routing problems. The performances of the proposed method are compared with those of a Genetic Algorithm. The effectiveness of the proposed method is conrmed by many numerical examples. In order to demonstrate the effectiveness of the proposed method for an actual problem, the proposed method is applied to a dynamic motion planning. The proposed method ...

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.11
• /
• pp.140-151
• /
• 1996

In this study, we designed the routing structure and logic block of a SRAM cell-based FPGA with symmetrical-array architecture. The designed routing structure is composed of switch matrices, routing channels and I/O blocks, and the routing channels can be subdivided into single length channels, double length channels and global length channels. The interconnection between wires is made through SRAM cell-controlled pass transistors. To reduce the signal delay in pass transistors, we proposed a scheme raising the gate-control voltage to 7V. The designed SRAM cells have built-in shift register capability, so there is no need for separate shift registers. We designed SRAM cells in the LUTs(look-up tables) to enable the wirte operations to be performed synchronously with the clock for ease of system application. Each logic block (LFU) has four 4-input LUTs, flip-flops and other gates, and the LUTs can be used a sSRAM memory. The LFU also has a dedicated carry logic, so a 4-bit adder can be implemented in one LFU. We designed our FPGA using 0.6.mu.m CMOS technology, and simulation shows proper operation of a 4 bit counter at 100MHz.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.