• Journal of information and communication convergence engineering
• /
• v.1 no.1
• /
• pp.35-38
• /
• 2003

Analyses of performance of wireless broadband communication systems employing fiber-optic link have presented. We have analyzed CNR penalty to evaluate system performance by taking into account, radio link considering rainfall attenuation, and optical link considering several carrier-to-noise ratio versus the optical modulation index.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• 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.

• 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 KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.483-494
• /
• 2001

Most of hypertext retrieval models consider documents as independent entities. They ignore relationships between documents of link semantics. in an information retrieval system for hypertext documents, retrieval effectiveness can be improved when ling information is used. Previous link-based hypertext retrieval models ignore link information while indexing. They utilize link information to re-rank the retrieval results. Therefore they are limited that only the documents is result-set utilize link information. This paper utilizes link information when indexing. We present how to use term weighting and inLinks weighting for ranking the relevant documents. Experimental results show that recall and precision evaluation according to the link semantics and the comparison with previously link_based hypertext retrieval model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1045-1053
• /
• 2012

Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.860-861
• /
• 2010

본 논문에서는 논문들 간의 참조 정보를 이용한 새로운 논문 유사도 계산 방안을 제안한다. 본 논문에서 제안하는 방안은 in-link와 out-link를 undirected-link로 간주함으로써 in-link와 out-link를 동시에 이용하여 논문들 간의 유사도를 적절하게 계산한다. 사례 분석을 통해서 제안하는 방안의 우수성을 검증한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.108-120
• /
• 2017

To this end, the ROK military is developing a Korean Tactical Data Link (Link-K) in two stages: Basic and Completion types. Currently, the basic type of the Link-K has a limitations for supporting Mission Group(MG)s, such as to share unnecessary information and inefficient routing, because all RICCs simply broadcasts the same information in the basic type of the Link-K. In this paper, we propose a Zone-based Wireless Link-K network structure and a routing algorithm. To improve the effectiveness of the proposed routing algorithm, we have studied a filtering method that adjusts the message data according to the priority of the message and a method of controlling the load of the network. In order to evaluate the performance of the proposed scheme, it is proved that it is effective to support the mission task group compared with the existing wireless Link-K routing algorithm according to the operational scenario situation.