• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.111-120
• /
• 2005

A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.

• Progress in Superconductivity
• /
• v.6 no.2
• /
• pp.113-117
• /
• 2005

In this study, electromagnetic analysis of current paths including meander pattern, spiral pattern, and bi-spiral pattern were performed and in order to verity the analysis results, experiments tests including quench test, and insulation tests were performed. In addition, bubble corner concepts were introduced to enhance insulation reliability. From our study, bi-spiral pattern of YBCO thin films were rather effective for quench and insulation than the other patterns. So this current path pattern was adopted for YBCO thin films in order to develop 6.6 kV resistive fault current limiters. Finally YBCO thin films were connected in series and parallel to enhance capacity, and the test results of current limiting characteristics of 6.6kV resistive SFCL were successful. The Progress in Superconductivity is published every six month and serves as a channel for publications on superconductivity and related topics. The author(s) are required to submit THREE copies of the manuscripts along with original figures directly to the Editor.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.327-333
• /
• 2022

Wireless Sensor Networks (WSNs) plays an important role in our everyday life. WSN is distributed in all the places. Nowadays WSN devices are developing our world as smart and easy to access and user-friendly. The sensor is connected to all the resources based on the uses of devices and the environment [1]. In WSN, Quality of Service is based on time synchronization and scheduling. Scheduling is important in WSN. The schedule is based on time synchronization. Min-Max data size scheduling is used in this proposed work. It is used to reduce the Delay & Energy. In this proposed work, Two-hop neighboring node is used to reduce energy consumption. Data Scheduling is used to identify the shortest path and transmit the data based on weightage. The data size is identified by three size of measurement Min, Max and Medium. The data transmission is based on time, energy, delivery, etc., the data are sent through the first level shortest path, then the data size medium, the second level shortest path is used to send the data, then the data size is small, it should be sent through the third level shortest path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1538-1543
• /
• 2018

For n pairs of points (a,b) on a circle, the line segment to connect two points is called a chord. These chords define a new graph G. Each chord corresponds to a vertex of G, and if two chords intersect, the two vertices corresponding to them are connected by an edge. This makes a graph, called by a circle graph. In this paper, we deal with the problem to find the connected components of a circle graph. The connected component of a graph G is a maximal subgraph H such that any two vertices in H can be connected by a path. When the adjacent matrix of G is given, the problem to find them can be solved by either the depth-first search or the breadth-first search. But when only the information for the chords is given as an input, it takes ${\Omega}(n^2)$ time to obtain the adjacent matrix. In this paper, we do not make the adjacent matrix and develop an $O(n{\log}^2n)$ algorithm for the problem.

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2787-2794
• /
• 2011

A mesh node, a component of a mesh network, is connected with the network by dynamic routing using routing protocol and collects the information of adjacent or connected mesh nodes for its self-management and settings. Also, it relays packets between the mesh nodes and provides AP(Access Point) with its corresponding functions based on IEEE 802.11 a/b/g for clients' access to the network. In this paper, the study focused on the design and performance tests of Wireless Mesh Network(WMN) which is applied to the wireless communication network for the CBTC(Communications Based Train Control) system. The WMN was established on a K-AGT test-line (Kyeongsan city, Gyeongsangbuk-do), and to verify the applicability, its operation and performances are checked by measuring the data throughput, delay latency, quality measurements such as transmission loss, radio interference and path recovery and setup between the on-board and wayside.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.255-266
• /
• 2014

For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x - y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p - 1 are characterized. For every pair a, b of positive integers with $2{\leq}a{\leq}b$, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.769-776
• /
• 2010

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. For a connected graph G, $G^p$ (p > 1) is the graph obtained from G by adding the edges (u, v) to G whenever 2 $\leq$ dist(u, v) $\leq$ p in G. And the pebbling exponent of a graph G to be the least power of p such that the pebbling number of $G^p$ is equal to the number of vertices of G. We compute the pebbling number of fourth power of paths so that the pebbling exponents of some paths are calculated.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.378-380
• /
• 2006

A high speed Analog parallel processing-based Viterbi decoder with a circularly connected 2D analog processing cell array is proposed. It has a 2D parallel processing structure in which an analog processing cell is placed at each node of trellis diagram is connected circulary so that infinitively expanding trellis diagram is realized with the fixed size of circuits. The proposed Viterbi decoder has advantages in that it is operated with better performance of error corrections, has a shorter latency and requires no path memories. In this parer, the performance of error correction as a reference position with the Analog parallel processing-based Viterbi decoder is testd via the software simulation

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.5
• /
• pp.644-650
• /
• 1998

In this paper , a state space model for flexible beam is presented using the assumed-modes approach. The state space equation is derived for a flexible beam in which one end is connected to a motor and is driven by a torque equation and the other end is free. Many of the transfer function proposed thus far use the torque to the flexible beam as the input and the tip deflection of the flexible beam as the output. The Technique for the analysis and synthesis of the dual-input describing function(DIDF) is introduced here and the construction of a non-linear compensator, based on this technique, is proposed. This non-linear compensator, properly connected in the direct path of a closed-loop linear or non-linear control system. The above non-linear network is used to compensate linear and non-linear systems for instability, limit cycles, low speed of response and static accuracy. The effectiveness of the proposed scheme is demonstrated through computer simulation and experimental results.