• Proceedings of the Korea Water Resources Association Conference
• /
• 2003.05b
• /
• pp.847-850
• /
• 2003

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.543-550
• /
• 2005

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.859-876
• /
• 2012

Since the existing protocols separated mobility management part and routing protocol part in their design and used a flooding, they suffer from the high control overhead, thereby limiting performance. In this paper, we use a tree-based mobility management method and present a simple and efficient routing protocol that exploits the topology information which is built additionally through mobility management. Thus, the mobility management and the routing protocol closely cooperate to optimize control overhead. Furthermore, we use a progressive path discovery method to alleviate traffic congestion around IG and a unicast-based broadcast method to increase the reliability of message delivery and to judge link validity promptly. The proposed protocol reduces control overhead greatly and works in a stable manner even with the large number of nodes and high mobility. This was proven by comparing with the AODV protocol that employs the hybrid mobility management protocol.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.3
• /
• pp.213-221
• /
• 2003

In this paper, we consider a multi-objective part-machine grouping problem, in which part types have several alternative part routings and each part routing has a machining sequence. This problem is characterized as optimally determining part type sets and its corresponding machine cells such that the sum of inter-cell part movements and the sum of machine workload imbalances are simultaneously minimized. Due to the complexity of the problem, a two-stage heuristic algorithm is proposed, and experiments are shown to verify the effectiveness of the algorithm.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.379-384
• /
• 2010

Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.

• The KIPS Transactions:PartC
• /
• v.8C no.4
• /
• pp.479-488
• /
• 2001

디지털 오디오나 비디오와 같은 멀티미디어 트래픽 QoS 제약 조건(종단간 지연, 대역폭 가용성, 패킷 분실률, 지터 등)을 요구하고 있다. 이러한 멀티미디어 트래픽의 제약 조건을 보장하기 위해서는 데이터 전송을 하기 전에 실시간 채널을 설정할 필요가 있으며 그러한 채널의 설정은 QoS 제약 조건을 고려한 효율적인 경로 설정 알고리즘을 필요로 한다. 일반적으로 네트워크에서 지연 제약 조건과 최소 비용을 만족하는 경로를 찾는 것은 NP-complete임이 증명되었다. 따라서 본 논문에서는 간단하고 분산된 루프 프리 라우팅 알고리즘(Loop-free Delay-constrained Routing algorithm with Load balancing : DRL)을 제안한다. 제안한 DRL은 지연 제약 조건을 만족하는 경로를 선택하며 네트워크의 상태에 따라 부하를 분산시키는 기능을 갖고 있다. 또한 지연 제약 라우팅을 위해 각 노드에서는 한정된 네트워크 상태 정보만을 필요로 한다. 시뮬레이션 결과는 DRL이 LDP와 마찬가지로 지연 제약조건을 만족하는 경로를 제공하면서 DCUR에 비해 루프가 발생하지 않는 경로 설정을 수행한다는 것을 보여주고 있다.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.265-268
• /
• 1988

Several routing algorithms use the link lengths that reflect the traffic conditions on the links to route messages. The idea is to assign a large length to a congested link so that they will tend not to use it as part of a routing path. When these lengths depend on current traffic conditions, dynamic behavior such as stability, convergence and the speed of convergence are of interest. But it sometimes induces the possibility of violent oscillation. This paper is the one that analyze these issues systematically.

• Korean Management Science Review
• /
• v.33 no.1
• /
• pp.89-99
• /
• 2016

A scheduled airlift is the most critical part of the air transportation operations in ROK Air Force. The military cargo-plane routing problem is a PDPLS (pickup and delivery problem in which load splits and node revisits are allowed). The cargo which is transported by a military cargo-plane is measured in pallet. The efficiency of pallet needs to be considered with respect to its volume and weight. There are some guidelines about orders of priorities and regulations in the military air transportation. However, there are no methodologies which can raise the efficiency of flight scheduling using Operations Research (OR) theories. This research proposes the effective computing methodology and the related heuristic algorithms that can maximize the effectiveness of the path routing model.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.1-7
• /
• 2009

This paper presents a process routing (PR) algorithm with multiple objectives. PR determines the optimum sequence of operations for transforming a raw material into a completed part within the available machining resources. In any computer aided process planning (CAPP) system, selection of the machining operation sequence is one of the most critical activities for manufacturing a part and for the technical specification in the part drawing. Here, the goal could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The Pareto Stratum Niche Cubicle (PS NC) GA has been adopted to find the optimum sequence of operations that optimize two conflicting criteria; production cost and production quality. The numerical analysis shows that the proposed PS NC GA is both effective and efficient to the PR problem.