• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.624-629
• /
• 2008

Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.623-629
• /
• 2010

A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2018

In South Korea, Jeju Island has a role as a test bed for electric vehicles (EVs). All conventional cars on the island are supposed to be replaced with EVs by 2030. Accordingly, how to effectively set up EV charging stations (EVCSs) that can charge EVs is an urgent research issue. In this paper, we present a case study on planning the locations of EVCS for Jeju Island, South Korea. The objective is to determine where EVCSs to be installed so as to balance the load of EVCSs while satisfying demands. For a public service with EVCSs by some government or non-profit organization, load balancing between EVCS locations may be one of major measures to evaluate or publicize the associated service network. Nevertheless, this measure has not been receiving much attention in the related literature. Thus, we consider the measure as a constraint and an objective in a mixed integer programming model. The model also considers the maximum allowed distance that drivers would detour to recharge their EV instead of using the shortest path to their destination. To solve the problem effectively, we develop a heuristic algorithm. With the proposed heuristic algorithm, a variety of numerical analysis is conducted to identify effects of the maximum allowed detour distance and the tightness of budget for installing EVCSs. From the analysis, we discuss the effects and draw practical implications.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.563-566
• /
• 2006

In this paper, we studied about AGVs modeling and material handling automation simulation using a virtual AGV. The proposed virtual AGV model that operates independently each other is based on a real AGV. Continuous straight-line and workstation model using vector drawing method that could easily, rapidly work system modeling are suggested. Centralized traffic control, which could collision avoidance in intersection and should not stop AGV as possible, and algorithm for detour routing which performs when another AGV is working in pre-routed path are proposed. The traffic control and the algorithm have been proved efficiently by simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.66-75
• /
• 2016

Due to aggressive scaling of device sizes and reduced noise margins, physical defects caused by aging and process variation are continuously increasing. Additionally, with scaling limitation of metal wire and the increasing of communication volume, fault tolerant method in manycore network-on-chip (NoC) has been actively researched. However, there are few researches investigating reliability in NoC with voltage-frequency-island (VFI) regime. In this paper, we propose a table-based routing technique that can communicate, even if link failures occur in the VFI NoC. The output port is alternatively selected between best and the detour routing path in order to improve reliability with minimized hardware cost. Experimental results show that the proposed method achieves full coverage within 1% faulty links. Compared to $d^2$-LBDR that also considers a routing method for searching a detour path in real time, the proposed method, on average, produces 0.8% savings in execution time and 15.9% savings in energy consumption.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

• Spatial Information Research
• /
• v.16 no.1
• /
• pp.65-77
• /
• 2008

There have been many studies and technologies that define a current location of a moving vehicle with GPS(Global Positioning System). However, the navigation system with GPS has troubles to search an optimized route considering data such as realtime parking status and road conditions. Moreover, the GPS systems show malfunction in the downtown with very tall buildings, underground parking lot and the inside of buildings. On the contrary, the RFID systems are able to reflect real-time status of parking lots and roads in the downtown. This paper proposes a system of guiding path for parking lots to consider real-time constraints based on RFID. The results obtained from the implemented system show smooth guiding of a new route after immediately sensoring the change of the information of parking lots and roads: if a parking lot that a vehicle is heading to is fully occupied, the system re-searches a new route for a neighbor parking lot and immediately transfers it to customer's mobile, and if the designated route is under construction, the system guides a detour path. The proposed method will be useful for advanced integrated parking control system.

• The Journal of Engineering Geology
• /
• v.13 no.1
• /
• pp.129-137
• /
• 2003

We interpreted the seismic signal characteristics from crosswell seismic tomography in the underground cavity like abandoned mines. The first arrival time delay and amplitude attenuation showed clearly at the low velocity zone of cavity and fracture. Also ray density decreased by detour of raypath. As a result of the amplitude spectrum analysis of fresh rock and low velocity zone, there were no noticeable differences of the amplitude up to about 1000Hz frequency, but indicated that the one passed around cavity decreased about 7dB at 2000Hz, and 20dB at 3000Hz. It was possible to compare the signal characteristics between two media by extracting the signal data from the fresh rock zone and the underground cavity through the seismic crosswell tomography.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.199-201
• /
• 2012

무선 멀티미디어 센서 네트워크를 활용하기 위한 응용에서는 대용량 멀티미디어 데이터 저장 및 처리 기술, 데이터 전송 기술 등과 같은 다양한 기반 기술들이 요구된다. 특히, 응용을 실제 환경에 적용하기 위해서는 대용량 데이터에 대한 데이터 보안 기술은 필수적이다. 본 논문은 여러 해킹 기술 중 하나인 스니핑 공격으로부터 원천적인 방어를 위해, 데이터 전송 경로를 위험 요소로부터 물리적으로 회피시키기 위한 다중 경로 라우팅 기법을 제안한다. 제안하는 기법은 위험 요소의 감지 반경과 움직임을 토대로 위험 요소의 인근에 위치한 센서 노드에 준비태세 단계를 설정한다. 이를 기반으로 데이터의 우선 순위를 설정하여 데이터 라우팅 과정에서 준비태세 단계와 데이터의 우선 순위를 고려하여 우선순위에 맞는 안전한 경로를 통해 위험요소 우회 다중 경로 라우팅을 수행한다. 시뮬레이션을 통해 제안하는 기법의 구현 가능성을 제시하였으며, 준비태세를 기반으로 효과적인 위험요소 우회 다중 경로 라우팅을 보였다.