• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.607-613
• /
• 2015

In order to design M/W(microwave) short backhaul above 10 GHz to meet the increase in mobile traffic demand, the rain attenuation as well as the atmospheric conditions such as Earth bulge and Fresnel zone should be considered. In this paper, the path lengths have been estimated theoretically in various frequency bands using the Korean standard rain rate, and an example of path profile has been analyzed in urban area utilizing spectrum management intelligence system (SMIS). These derived minimum path lengths in various frequency bands are compared to the foreign them, and then will be proposed to improve the Korean minimum path length unitized to 10 km. This paper will provide useful information for microwave engineers in designing a M/W access link, and be utilized to make an efficient usage of high frequency bands for the short mobile broadband backhaul.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.461-467
• /
• 2014

Active queue management (AQM) algorithms run on routers and detect incipient congestion by typically monitoring the instantaneous or average queue size. When the average queue size exceeds a certain threshold, AQM algorithms infer congestion on the link and notify the end systems to back off by proactively dropping some of the packets arriving at a router or marking the packets to reduce transmission rate at the sender. Among the existing AQM algorithms, random early detection (RED) is well known as the representative queue-based management scheme by randomizing packet dropping. To reduce the number of timeouts in TCP and queuing delay, maintain high link utilization, and remove bursty traffic biases, the RED considers an average queue size as a degree of congestions. However, RED do not well in the specified networks conditions due to the fixed parameters($P_{max}$ and $TH_{min}$) of RED. This paper addresses a extended RED to be adapted in various networks conditions. By sensing network state, $P_{max}$ and $TH_{min}$ can be automatically changed to proper value and then RED do well in various networks conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.233-254
• /
• 2022

Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.197-203
• /
• 2016

In this paper, the dipole antenna that can control a beam steering were designed for attaching on LEO(Low Earth Orbit) small satellite. The proposed antenna was based on Yagi-Uda antenna. The parasitic element was proposed as a T-shape. Depending on the state of open or short at the end of a vertical element, we can choose a characteristic of the parasitic element with fixing a vertical element length of the parasitic element. Using this characteristic, we designed the director element and reflector element. The proposed antenna was designed to receive UHF 436.5 MHz. Antenna gain was chosen by link budget between one satellite and the other satellite or between the satellite and the ground station. By changing a vertical element length which is the largest variable that chooses an antenna characteristic, we confirmed that ${\lambda}/2$ length transformer has a result that improve 0.5 dB in comparison ${\lambda}/4$ length transformer from maximum gain direction. In production, we made an on/off switch composed of a diode, capacitor, and inductor control an open and short at the end of the parasitic element. As a result, the gain of antenna used in a link between one satellite and the other satellite had average 5.92 dBi. And the gain of antenna used in a link between the satellite and the ground station had average 0.99 dBi.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.5
• /
• pp.13-25
• /
• 2008

This study analyzed errors of data received from GPS which showed different reception characteristics based on chipset at poor reception area. The digital map made from National Police Agency shows 4% errors of length on the average. The comparison of three different algorithms - Average Spot Speed, Cumulative Travel Length from GPS with Actual Travel Time, Travel Length from Digital Map with Actual Travel Time have been conducted to find significant difference estimating travel time from GPS Data. The algorithm to estimate travel time from travel length and travel time showed the most reliable results from the others.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.189-198
• /
• 2004

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.2
• /
• pp.299-306
• /
• 2016

In this paper, a method of shape prediction of an endoscope handling robot that can imitate a surgeon's behavior using a sensor network is suggested. Unit sensors, which are composed of a 3-axis magnetometer and 3-axis accelerometer pair comprise the network through CAN bus communication. Each unit of the sensor is used to detect the angle of the points in the longitudinal direction of the robot, which is made from a flexible tube. The signals received from the sensor network were filtered using a low pass Butterworth filter. Here, a Butterworth filter was designed for noise removal. Finally, the Euler angles were extracted from the signals, in which the noise was filtered by the low path Butterworth filter. Using this Euler angle, the position of each sensor on the sensor network is estimated. The robot body was assumed to consist of links and joints. The position of each sensor can be assumed to be attached to the center of each link. The position of each link was determined using the Euler angle and kinematics equation. The interpolation was carried out between the positions of the sensors to be able to connect each point smoothly and obtain the final posture of the endoscope in operation. The experimental results showed that the shape of the colonoscope can be visualized using the Euler angles evaluated from the sensor network suggested and the shape of serial link estimated from the kinematics chain model.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.450-452
• /
• 1998

본 논문에서는 멀티캐스트 ABR흐름제어를 위해 현재 ATM포럼을 통해 제안되고 있는 신속한 폭주 통지 기능을 기존 통합 알고리즘들에 적용하여 이들의 성능을 시뮬레이션을 통해 비교 분석하였다. 성능 분석의 지표로 송신원의 ACR(Allowed Cell Rate), 스위치에서의 큐 길이, 링크 이용효율, 공평성 등을 사용하였다 분석결과, 신속한 폭주 통지 기능을 사용한 통합 알고리즘들은 망에 심각한 폭주가 발생한 경우 매우 효과적임을 알 수 있었다. 그러나 이러한 기능을 사용하는 알고리즘들의 성능은 기본적인 통합 알고리즘들의 성능에 매우 민감함을 알 수 있었다.