• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.4
• /
• pp.281-290
• /
• 2017

Transportation plays a vital role in sustainable development, and moreover, bulk transportation provides cost effective movement of goods and human beings with less environmental issues. Nepal is a developing country with increasing urbanization and transportation demands. The growing interest of China to connect with Southeast Asia through Nepal has led to ambitious project proposal of Rasuwa Gadhi to Birgunj Railways, which is the shortest route from China to India. Lack of updated geospatial data has lead the concerned authorities in Nepal to be dependent on analysis and proposals from donor nations. Taking such considerations, based on GIS and free data, this study explores optimal routes to connect cites using slope and land cover. Based on reclassified slope, two shortest optimal routes were found. One passing through Baireni in Dhading and another through Kathmandu towards Birgunj with length of around 172 Kilometers. The study shows that available open source data can be used of preliminary feasibility studies and yet shows limitations for detailed economy based planning. Development and use of high resolution updated geospatial data is of high necessity for Nepal to become self-sustained in planning of development works.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.767-774
• /
• 1997

A procedure presented in this paper greerates test squences to check the conformity of an implementation wihh a protocol specification which is moedled as a determinstic fimite state machine(FSM).We proposed a tech-nique to determine a minium-cost tour of the transition graph of the FSM..The technique using Multiple UIO and Shortest Path(MUSP) sabes the cost 1-9% over MUIO and directly, derive a symertric test graph from an FSM graph From this fact, we proposed a tecuque using Multiple Sate Suganture(MUSS) to solve an open issue that the multiple UIO assignment may not minimize the lengy of the tour.In this paper, the proposed techique is also, applied to generate a synchronizable test wequence.And the result shows that the techique using MUSP anhd MUSS saves the cost 7-29% and 7-42% over the previous approach using MUIO, respect-ively.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.89-99
• /
• 2011

In this paper, we propose an routing algorithm for ultra low power and high reliable transmission in WBAN environment. This algorithm is to minimize energy consumption and to maximize the life and reliability for medical devices. Also, this algorithm is not only medical devices but also non-medical devices is to minimize energy consumption and to maximize the life of device. The combination of the distance from the previous node and residual energy calculates weight. The calculated weight is used to calculate the weight of full path by cumulative weights. The full path to the smallest of the weights are set to the path. Also this algorithm is able to select another path to avoid the error path by determining the link status between nodes, when occurs link error and congestion. In this paper, we show that WSN routing algorithm based on shortest hop count routing algorithm and EAR routing algorithm compared to ensure high reliability and low power characteristic of WBAN to be verified through simulations.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.3-9
• /
• 2013

As interest in green growth picks up, the importance of bicycles which are an environment friendly means of communication has been magnified. However, bicycle routes which are the base of bicycles are designed without considering topographic elements and thus many users are experiencing inconvenience in using bicycles. The present study presents a routing technique to select optimal routes when selecting routes in commuting to school utilizing bicycles. To this end, a formula for optimum route calculation considering slope and intersections was drawn and a method to select optimum routes by applying modified Dijkstra Algorithms was studied. According to the results, the bicycle routes for commuting to school should be selected by the shortest time rather than the shortest distances to the destination, because it required reach the destination faster. Therefore when selecting the routes, it must be based on the shortest time considering waiting time due to crosswalks or crossroads and speed variations due to slopes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.336-345
• /
• 2012

Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer, peer, or provider routes are preferred. Apparently, applying such constraints eliminates many "correct" paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.29 no.2
• /
• pp.114-119
• /
• 2016

This paper dealt with the propagation characteristics of acoustic signal in insulation oil for the purpose of improving the reliability of AE (acoustic emission) method used for condition monitoring of oil-immersed transformers. A discharge source was placed in insulation oil and AE sensors ($f_c$ :140 kHz) were attached on the oil tank to study the changes of velocity and propagation path with the depth and distance. The average velocity was 1,436 m/s and the velocity decreased with the increase of depth from the oil surface to 430 mm. The propagation paths were classified into three sections by the shortest reflection path of the detected signal. The minimum distinguishable distance in each section was 70 mm. It was also verified that PD (partial discharge) with a magnitude over than 500 pC can be detected by the AE sensors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2205-2217
• /
• 2015

Bio-inspired routing protocol uses a principle of swarm intelligence, which finds the optimal path to the destination in a distributed and autonomous way in dynamic environments, so that it can maximize routing performances, reduce control overhead, and recover a path failure quickly according to the change of network topology. In this paper, we propose a bio-inspired routing protocol for mobile ad hoc networks. The proposed scheme uses a function of overhearing via wireless media in order to obtain the routing information without additional overhead. Through overhearing, the pheromone is diffused around the shortest path between the source and destination. Based on this diffused pheromone, a probabilistic path exploration is executed and the useful alternative routes between the source and destination are collected. Therefore, the proposed routing protocol can ensure the up-to-date routing information while reducing the control overhead. The simulation results show that the proposed scheme outperforms the typical AODV and AntHocNet protocols in terms of routing performances and significantly decreases the routing overhead against the AntHocNet.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.