• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.4
• /
• pp.432-440
• /
• 2015

UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.190-192
• /
• 2012

Vehicular Ad hoc Networks (VANETs) is the new wireless networking concept of mobile ad hoc networks in research community. Routing in vehicular is a major challenge and research area. The majority of current routing algorithms for VANETs utilize indirect metrics to select the next hop and produce optimal node path. In this paper, we propose a distance and angle based routing algorithm for VANETs, which combines a distance approach with an angle based geographical strategy for selecting the next hop, with the purpose of using direct metrics to build a optimal node route. The proposed algorithm has better performance than the previous scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1045-1050
• /
• 2012

In this paper, we propose an effective routing protocol that can be particularly applied to SDDC (Sangmyung Direct Digital Controller) BAS. We have used NS (Network Simulator)-2 to simulate the real building for SDDC BAS. The static, session, DV (Distance Vector), and LS (Link State) algorithms are used and the protocols for performance comparison and evaluation are compared with respect to end to end delay, throughput, and routing overhead. The simulation results show that the DV algorithm is effective for SDDC BAS.

• Journal of Korea Water Resources Association
• /
• v.34 no.5
• /
• pp.551-560
• /
• 2001

The research estimated the roughness coefficients for the reach of Hwawon-Goryeonggyo-Hyeongpung stage stations in the Nakdong River through hydraulic channel routing. The data needed were only stage data from the three stations and river cross section data. Stage-discharge relations were determined from the computed discharges by the channel routing. They are better than the previous stage-discharge relations from direct measurements. Discharge computation errors from stage errors were analyzed and a simple method was suggested to limt reach lengths from prohibiting large errors from lateral inflows.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.97-108
• /
• 2002

Optical Border Gateway Protocol (OBGP) is an extension to BGP for Optical Cross Connects (OXCs) to automatically setup multiple direct optical lightpaths between many different autonomous domains. With OBGP, the routing component of a network may be distributed to the edge of the network while the packet classification and forwarding is done in the core. However, it is necessary to analyze the stable convergence functions of OBGP in case of lightpath failures. In this paper, we first describe the architecture of the OBGP model and analyze the potential problems of OBGP, e.g., virtual BGP router convergence behavior in the presence of lightpath failure. We then propose an OBGP convergence model derived from an inter-AS (Autonomous System) relationship. The evaluation results show that the proposed model can be used for a stable OBGP routing policy and OBGP routing convergence under lightpath failures of the optical Internet.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.1-6
• /
• 1997

This paper describes the design of a network interface controller (NIC) chip which is to be used to support a novel adaptive virtual cut-through routing method for parallel compute systems with direct (i.e., point-to-point) interconnection networks. The NIC chip is designed to provide the interface between a processing node constructed from commercially available microprocessors and another custom-designed router chip, which in turn performs the actual routing of packets to their respective destinations. The NIC, designed using a semi-full-custom VLSi design technique outperform traditional wormhole routing with a minimal amount of hardware overhead. The NIC design has been fully simulated and laid out using a 0.8$\mu\textrm{m}$ CMOS process.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.82-94
• /
• 2013

In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.603-609
• /
• 2003

Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.131-137
• /
• 2007

Recently, Ant Colony Optimization (ACO) is emerged as a simple yet powerful optimization algorithm for routing and load-balancing of both wired and wireless networks. However, there are few researches trying to adopt ACO to enhance routing performance in WSN owing to difficulties in applying ACO to WSN because of stagnation effect. In this paper, we propose an energy-efficient path selection algorithm based on ACO for WSN. The algorithm is not by simply applying ACO to routing algorithm but by introducing a mechanism to alleviate the influence of stagnation. By the simulation result, the proposed algorithm shows better performance in data propagation delay and energy efficiency over Directed Diffusion which is one of the outstanding schemes in multi-hop flat routing protocols for WSN. Moreover, we checked that the proposed algorithm is able to mitigate stagnation effect than simple ACO adoption to WSN.