• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1064-1070
• /
• 2010

Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.247-253
• /
• 2008

Web 2.0 and Semantic Web technology will be merged to be a next generation Web that leads presentation-oriented Web to data-centric Web. In the next generation Web. semantic processing. Web Platform, and data fusion are most important technology factors. Resolving the Link Rot is the one of the essential technologies to enable these features. The Link Rot causes not only simple annoyances to users but also more serious problems including data integrity. loss of knowledge. breach of service. and so forth. We have suggested a new XRI-based persistent Web link architecture to cure the Link Rot that has been considered as a deep-seated Problem of the Web. The Proposed architecture is based on the XRI suggested by OASIS and it is designed to support a persistent link by using URL rewriting. Since the architecture is designed as a server-side technology, it is superior to existing research especially in Interoperability. Transparency and Adoptability. In addition to this, the architecture provides a metadata identification to be used fer context-aware link resolution.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.91-99
• /
• 2019

Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.428-439
• /
• 2015

In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O($N^3$) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.7-12
• /
• 2008

The study discussed the link analysis for the Ka band satellite broadcasting service in Korea with respect to the transmission schemes based on the DVB-S2 standard. To analyze the effect of the rain fading to the link budget, we estimated the rain attenuation from the measured rainfall intensity in Korea. We analyzed the link budget for the Ka band transponders of Koreasat-3, and DirecTV BSS-99W, and showed the possible link availability with the DVB-S2 transmission schemes for each transponder. Based on the link analysis of the available satellites with the Ka band transponders, we suggested the required EIRP for the satellite which will be employed for the Ka band satellite broadcasting service in Korea.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.848-857
• /
• 2021

This paper proposes an efficient approach based on a machine learning technique to predict the local stresses on mooring chain links. Three-link and multi-link finite element analyses were conducted for a target chain link of D107 with steel grade R4; 24,000 and 8000 analyses were performed, respectively. Two serial Artificial Neural Network (ANN) models based on a deep multi-layer perceptron technique were developed. The first ANN model corresponds to multi-link analyses, where the input neurons were the tension force and angle and the output neurons were the interlink angles. The second ANN model corresponds to the three-link analyses with the input neurons of the tension force, interlink angle, and the local stress positions, and the output neurons of the local stress. The predicted local stresses for the untrained cases were reliable compared to the numerical simulation results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.2
• /
• pp.15-25
• /
• 2007

This paper aims at testing the applicability of RFID (radio frequency identification) based link travel time estimation algorithm in urban street settings in Jeju island Korea. For this, we developed algorithm and compared link travel times derived from the RFID probe based algorithm with those from (already available) GPS based link travel time estimation algorithm and with the actual link travel times from survey. RFID readers are composed of master reader and slave reader and the participating passenger cars were supposed to be equipped with RFID tag inside the vehicle. The data were sent to traffic information center and we used those data in comparison. The algorithm produced link travel times in a successful manner and the accuracy of those link travel times was about 88%. For the same link segments, the accuracy of GPS based link travel times was 93%. The t-test showed that both RFID and GPS based link travel times were not different in accuracy from statistical point of view. The applicability of RFID was tested successfully and the algorithm proposed seemed to be used in similar urban settings. Some limits and future research agenda have also been presented.

• Journal of Ocean Engineering and Technology
• /
• v.32 no.5
• /
• pp.297-309
• /
• 2018

After an accident involving mooring link failures in an offloading buoy, verification of the fatigue safety in terms of the out-of-plane bending (OPB) and in-plane bending (IPB) moments has become a key engineering item in the design of various floating offshore units. The mooring links for an 8 MW floating offshore wind turbine were selected for this study. To identify the OPB stiffness (OPB moment versus interlink angle), a numerical simulation model, called the 3-link model, is usually composed of three successive chain links closest to the fairlead or chain hawse. This paper introduces two numerical simulation techniques for the 3-link analyses. The conventional and advanced approaches are both based on the prescribed rotation approach (PRA) and direct tension approach (DTA). Comparisons of the nominal stress distributions, OPB stiffnesses, hotspot stress curves, and stress concentration curves are presented. The multiple link analyses used to identify the tension angle versus interlink angle require the OPB stiffness data from the 3-link analyses. A convergence study was conducted to determine the minimum number of links for a multi-link analysis. It was proven that 10 links were sufficient for the multi-link analysis. The tension angle versus interlink angle relations are presented based on multi-link analyses with 10 links. It was found that the subsequent results varied significantly according to the 3-link analysis techniques.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.27-33
• /
• 2006

To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.