• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.679-687
• /
• 2005

A mobile ad-hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. It is necessary to use bandwidth effectively because MANET has limited bandwidth. In this paper, we propose SMGS (source based multiple gateway selection routing protocol). In SMGS, each node estimates its expected life time (ELT) and if its ELT is larger than that of current gateway it becomes a candidate node. When a source node establishes a path, in each grid the candidate node will take the route request and be a gateway node for the each source node. The node that is expected to stay the longest time in the grid is selected so that we can reduce frequent gateway handoff, packet loss, and handoff delay.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.445-453
• /
• 2016

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.107-117
• /
• 1996

This paper considers the part assignment to workstations in flexible manufactuirng system (FMS). Parts are processed through several workstations according to processing order. The machines of each workstation can do multiple Processing functions. Therefore, a processing of a part can be processed in several workstations, which are non-identical in functional performance. Although a processing of a part can be processed in the multiple workstations, it has to be processed in only one among available several workstations, Parts are transported with unit load by automated guided vehicles (AGVs). The criteria of part assignment is to minimize the maximum value of the processing times of each workstation and the total transport times of vehicles. Model formulation is suggested, and numerical example is shown.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.666-668
• /
• 1998

In this paper, we consider a bi-objective vehicle routing problem to minimize total distance traveled and maximize minimum integrated satisfaction level of selecting desirable routes in an fuzzy graph. The fuzzy graph reflects a real delivery situation in which there are a depot, some demand points, paths linking them, and distance and integrated satisfaction level are associated with each route. For solving the vi-objective problem we introduce a concept of routing vector and define non-dominated solution for comparing vectors. An efficient algorithm involving a selection method of non-dominated solutions based on DEA is proposed for the vehicle routing problem with rigid distance and integrated satisfaction level.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.1
• /
• pp.61-67
• /
• 2008

This paper introduces the multi-vehicle routing problem(MRP) which is different from the traveling sales problem(TSP), and presents the ant system(AS) applied to the MRP. The proposed MRP is a distributive model of TSP since many vehicles are used, not just one salesman in TSP and even some constraints exist. In the AS, a set of cooperating agents called vehicles cooperate to find good solutions to the MRP. To make the proposed MRP extended more, Tokyo city model(TCM) is proposed. The goal in TCM is to find a set of routes that minimizes the total traveling time such that each vehicle can reach its destination as soon as possible. The results show that the AS can effectively find a set of routes minimizing the total traveling time even though the TCM has some constraints.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.6
• /
• pp.867-873
• /
• 2011

The transportation of a truss-spar hull from a transport barge of 6000 ton topside module on the spar hull is investigated in the present study. Two possible routes from a fabrication yard in Teeside, England to the Gulf of Mexico are considered in the paper. The results of motion responses of the transport barge obtained from a spectral analysis and the limiting criteria of sea fastening, deck wetness and lateral acceleration are compared and the route selection is discussed. Long-crested waves and short-crested seas as well as the joint probabilities of significant wave heights and wave periods in different sea areas are considered. Generally speaking, the results for long-crested seas are higher than those for short-crested waves.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• Korean Journal of Geomatics
• /
• v.3 no.2
• /
• pp.123-128
• /
• 2004

As the applied fields of GIS are expanded to the transportation, developing internet-based applications for transportation information is getting attention increasingly. Most applications developed so far are primarily focused on guidance systems for owner-driven cars. Although some recent ones are devoted to public transportation systems, they show limitations in dealing with the following aspects: (i) people may change transportation means not only within the same type but also among different modes such as between buses and subways, and (ii) the system should take into account the time taken in transfer from one mode to the other. This study suggest the framework for developing a public transportation guidance system that generates optimized paths in the transportation network of mixed means including buses, subways and other modes. For this study, the Genetic Algorithms are used to find the best routes that take into account transfer time and other service-time constraints.

• Journal of the Korean Society of Industry Convergence
• /
• v.10 no.4
• /
• pp.249-254
• /
• 2007

Recently, the items of construction planning have magnified and specialized and the problems occurring at the first step of the construction planing process have complicated. In this research, AHP(Analytic Hierarchy Process) method which is simple to apply and clear to decide has been proposed when a people making a plan at the first step of the construction planing process. As an example, the best solution has been obtained in a railway construction line choice that consist of various items by applying for this method, which proves the possibility of application of this method to the complicated problems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.355-358
• /
• 2011

무선 센서 네트워크의 효율적인 에너지 사용은 무선 센서 네트워크의 수명과 관련된 중요한 요소이다. 무선센서 네트워크의 역동적인 환경에서는 전력량, 간섭 요소를 고려한 신호의 세기, 노드간의 거리 등의 특성을 고려하여 최적의 경로를 선택하는 것은 에너지 사용량에 많은 영향을 준다. TORA(Temporally-Ordered Routing Algorithm)는 이동성이 심한 무선 네트워크 환경에 적합하게 설계되어 있고 다중경로를 이용하여 링크 단절 시 빠른 복구가 가능한 장점이 있지만, 네트워크 생존의 측면에서 전력 사용의 효율성을 개선 및 보완할 필요가 있다. 본 논문에서는 TORA의 다중 경로 중에서 최적의 경로를 선택하는 방법에 대해서 논하고자 한다.