• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.4
• /
• pp.539-547
• /
• 2011

In this paper, a method of generating path planning map is developed using digitalized geographic information such as FDB(Feature DataBase). FDB is widely used by the Army and needs to be applied to all weapon systems of newly developed. For the autonomous navigation of a robot, it is necessary to generate a path planning map by which a global path can be optimized. First, data included in FDB is analyzed in order to identify meaningful layers and attributes of which information can be used to generate the path planning map. Then for each of meaningful layers identified, a set of values of attributes in the layer is converted into the traverse cost using a matching table in which any combination of attribute values are matched into the corresponding traverse cost. For a certain region that is gridded, i.e., represented by a grid map, the traverse cost is extracted in a automatic manner for each gird of the region to generate the path planning map. Since multiple layers may be included in a single grid, an algorithm is developed to fusion several traverse costs. The proposed method is tested using a experimental program. Test results show that it can be a viable tool for generating the path planning map in real-time. The method can be used to generate other kinds of path planning maps using the digitalized geographic information as well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.371-388
• /
• 2014

Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

• International journal of advanced smart convergence
• /
• v.10 no.1
• /
• pp.56-61
• /
• 2021

Neighbor path selection is to pre-select alternate routes in case geographically correlated failures occur simultaneously on the communication network. Conventional heuristic-based algorithms no longer improve solutions because they cannot sufficiently utilize historical failure information. We present a novel solution model for neighbor path selection by using machine learning technique. Our proposed machine learning neighbor path selection (ML-NPS) model is composed of five modules- random graph generation, data set creation, machine learning modeling, neighbor path prediction, and path information acquisition. It is implemented by Python with Keras on Tensorflow and executed on the tiny computer, Raspberry PI 4B. Performance evaluations via numerical simulation show that the neighbor path communication success probability of our model is better than that of the conventional heuristic by 26% on the average.

• 한국디지털정책학회:학술대회논문집
• /
• 2005.06a
• /
• pp.277-283
• /
• 2005

In this paper, the performance of high data rate-wirelesss personal area network(HDR-WPAN) system is analyzed under multi-path indoor channel. In the analysis, Saleh and Valenzuel channel model is used for the multi-path indoor channel. From the results, HDR-WPAN system has reliability of 10-5 at Eb/No = 18.5dB in multi-path indoor channel. It is a suitable performance for high data rate personal area network applications.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.219-222
• /
• 1999

A SBR/Image ray-tracing technique using triangular ray tubes to predict the effects of walls. rooms. floors, and staircase is considered. Suggested technique is very efficient to estimate the path loss in three-dimensional buildings including the staircase. The model to predict the path loss through walls and floors in a multifloored building is presented. Measurements are made for three corridors having the staircase at 850 MHz, Measured data shows a close agreement with a simulated data.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.433-438
• /
• 2020

Nodes on a data communication path in a wireless network emit electro-magnetic waves whenever they transmit packets; thus, the path can be exposed and identified with capturing and analyzing a sequence of the signals emitted there. One of countermeasures against a malicious eavesdropper is to let certain nodes mimic the nodes on the data path in sending dummy packets. In this paper we propose a packet transfer protocol which establishes the shortest path between source-destination pair a time and restricts heavy generation of dummy packets. We verify the location-privacy of a node on the communication paths through simulation.

• Journal of Environmental Science International
• /
• v.27 no.11
• /
• pp.1073-1081
• /
• 2018

In this study, an operational data set was analysed by establishing a path model to figure out the actual cause-effect relationship of a wastewater treatment plant (WWTP); in particular, for the effluent concentrations of T-N and T-P. To develop the path models, data sets of operational records including effluent concentrations and operational factors were obtained from a field scale WWTP of $680,000m^3$ of treatment capacity. The models showed that the relationship networks with the correlation coefficients between variables for objective expressions indicated the strength of each relationship. The suggested path models were verified according to whether the analyzation results matched known theories well, but sophisticated minute theoric relationships could not be cropped out distinctly. This indicates that only a few paths with strong theoric casual relationships were represented as measured data due to the high non-linearity of the mechanism of the removal process in a biological wastewater treatment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.26 no.1
• /
• pp.31-43
• /
• 2023

In this paper, we propose a method for generating a global path for an unmanned vehicle using public data of road section information. First, the method of analyzing road section information of the Ministry of Land, Infrastructure and Transport is presented. Second, we propose a method of preprocessing the acquired road section information and processing it into meaningful data that can be used for global routes. Third, we present a method for generating a global path using the preprocessed road section information. The proposed method has proven its effectiveness through actual autonomous driving experiments of unmanned ground vehicles.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.7
• /
• pp.1227-1233
• /
• 2003

NURBS (Non Uniform Rational B-Spline) is widely used in CAD system and NC data for high speed machining. Conventional CAM system changes NURBS surface to tessellated meshes or Z-map model, and produces linear tool path. The linear tool path is not good fur precise machining and high speed machining. In this paper, an algorithm to change linear tool path to NURBS one was studied and the machining result of NURBS tool path was compared with that of linear tool path. The N-post including both a post-processing and a virtual machining software was developed. The N-Post transforms linear tool path to NURBS tool path and quickly shades a machined product on OpenGL view, while comparing a machined surface with a original CAD one. A virtulal machined model of original tool path and post-processed tool path was compared to original CAD model. The machining error and machining time of post-processed NURBS tool path were investigated.