• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.10
• /
• pp.1349-1354
• /
• 2001

In the Traveling Salesman Problem(TSP), a set of N cities is given and the problem is to find the shortest route connecting them all, with no city visited twice and return to the city at which it started. Since TSP is a well-known combinatorial optimization problem and belongs to the class of NP-complete problems, various techniques are required for finding optimum or near optimum solution to the TSP. Especially DNA computing, which uses real bio-molecules to perform computations supported by molecular biology, has been studied by many researchers to solve NP-complete problem using massive parallelism of DNA computing. Though very promising, DNA computing technology of today is inefficiency because the effective computing models and operations reflected the characteristics of bio-molecules have not been developed yet. In this paper, I design new Polymerase Chain Reaction(PCR) operations of DNA computing to solve TSP.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.36-46
• /
• 2016

Separate transportation card readers that record the amount of transfer volume occurring during movement in-between lines within the metropolitan railway transfer stations do not exist. This research proposes a model to estimate passenger transit movements in transfer stations that adequately reproduces characteristics arising during a transfer trip. The model used in this study assumes that passengers adopt transfer behaviors that minimize their generalized costs during transfer trips. Further, two measures are sought in order to reflect attributes of the metropolitan railway. The first is that similar paths connect origin and destination stations. For this, the M-Similar Paths method is applied to the model to identify the similar paths that arise. The second is that passengers perceive increasing number of transfers as additional transfer costs, which is reflected by means of the Stepwise Transfer Coefficient. Two case studies of metropolitan railway are used to propose measures for analysis of transfer trips. Twenty directional transit phenomena are reproduced for Sindorim railway station. Aggregate directional transit(A), aggregate inter-line transit(B), and B/A are calculated on a percentage basis for 33 metropolitan railway transfer stations, and using this, the functional role of transfers is explored.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.10-21
• /
• 2008

User travel behavior is based on the existence of complete traffic information in deterministic user optimal principle by Wardrop(1952). According to deterministic user optimal principle, users choose the optimal route from origin to destination and they change their routes arbitrarily in order to minimize travel cost. In this principle, users only consider travel time as a factor to take their routes. However, user behavior is not determined by only travel time in actuality. Namely, the models that reflect only travel time as a route choice factor could give irrational travel behavior results. Therefore, the model is necessary that considers various factors including travel time, transportation networks structure and traffic information. In this research, more realistic deterministic optimal traffic assignment model is proposed in the way of route recognizance behavior. This model assumes that when users decide their routes, they consider many factors such as travel time, road condition and traffic information. In addition, route recognizance attributes is reflected in this suggested model by forward searching method and backward searching method with numerical formulas and algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1060-1065
• /
• 2006

본 논문에서는 차세대 네트워크에서 통합적이고 품질을 보장해주는 라우팅 알고리즘을 제안한다. 이 알고리즘은 모니터링 하는 에이전트에 의해 네트워크의 상태를 정보로 전달하여 좀 더 네트워크 상황에 적응력이 높은 것이 특징이다. 우리는 트래픽의 지연이나 손실을 피하기 위해 에이전트를 이용해 네트워크 상황을 모니터링 하게 된다. 이 에이전트들은 시간에 따라 변화하는 네트워크의 트래픽의 수요를 관찰하여 네트워크 상태를 이후 트래픽의 경로를 설정해 주는데 정보로 제공해 준다. 이 알고리즘은 기존에 제안된 다품종 최소비용 문제를 이용한 라우팅 알고리즘을 에이전트를 이용해 개선한 것이다. 우리는 실험을 통해 알고리즘의 성능을 실험해 보았다.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.232-235
• /
• 1999

This paper presents a HNN(Hopfield Neural Network) model to solve the ORP(Optimal Routing Problem) in DSP(Distribution System Planning). This problem is generally formulated as a combinatorial optimization problem with various equality and inequality constraints. Precedent study[3] considered only fixed cert, but in this paper, we proposed the capability of optimization by fixed cost and variable cost. And suggested the corrected formulation of energy function for improving the characteristics of convergence. The proposed algorithm has been evaluated through the sample distribution planning problem and the simmulation results are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.841-848
• /
• 2004

In case of failure in the IP network services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(5-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct_destination Rerouting(DR).

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.38-45
• /
• 2003

This paper presents a meta-heuristic solution technique, Ant System (AS)algerian to solve edge detection problem. We define the quality of edge in terms of dissimilarity, continuity, thickness and length. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that inversely evaluates the quality of edge configuration. Twelve windows for enhancing dissimilarity regions based on the valid edge structures are used. The AS algorithm finds the optimal set of edge pixels based on the cost function. The experimental results show that the properly reduced set of edge pixels could be found regardless how complicated the image is.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.791-798
• /
• 2004

In case of failure in the IP network, services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(s-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct-destination Rerouting(DR).