• Journal of the Korean Physical Society
• /
• v.73 no.10
• /
• pp.1589-1595
• /
• 2018

Similarity index measures the topological proximity of node pairs in a complex network. Numerous similarity indices have been defined and investigated, but the dependency of structure on the performance of similarity indices has not been sufficiently investigated. In this study, we investigated the relationship between the performance of similarity indices and structural properties of a network by employing a two-state random network. A node in a two-state network has binary types that are initially given, and a connection probability is determined from the state of the node pair. The performances of similarity indices are affected by the number of links and the ratio of intra-connections to inter-connections. Similarity indices have different characteristics depending on their type. Local indices perform well in small-size networks and do not depend on whether the structure is intra-dominant or inter-dominant. In contrast, global indices perform better in large-size networks, and some such indices do not perform well in an inter-dominant structure. We also found that link prediction performance and the performance of similarity are correlated in both model networks and empirical networks. This relationship implies that link prediction performance can be used as an approximation for the performance of the similarity index when information about node type is unavailable. This relationship may help to find the appropriate index for given networks.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.79-86
• /
• 2016

Physical layer security is cryptography technique to protect information by using physical nature of signals. Currently, many works on physical layer security have been actively researching while those researching models still have some problems to be solved. Eavesdropper does not share its channel state information with legitimate users to hide its presence. And when node transmits signal, hardware impairments are occurred, whereas many current researches assume that node model is ideal node and does not consider hardware impairments. The main features and contributions of this paper to solve these problems are as follows. First, our proposed system model deploys torch node around legitimate user to obtain channel state information of eavesdropper and considers hardware impairments by using channel state information of torch node. Second, we derive closed-form expression of intercept probability for the proposed system model. The results of the performance evaluation through various simulations to find out the effects on proposed system model in physical layer security show that imperfect channel state information does not effect on intercept probability while imperfect node model effects on intercept probability, Ergodic secrecy capacity and secrecy capacity.

• Journal of Gastric Cancer
• /
• v.17 no.4
• /
• pp.306-318
• /
• 2017

Purpose: Guidelines in Western countries recommend retrieving ${\geq}15$ lymph nodes (LNs) during gastric cancer resection. This study sought to determine whether the number of examined lymph nodes (eLNs), a proxy for lymphadenectomy, effects survival in node-negative disease. Materials and Methods: The US National Cancer Database (2003-2011) was reviewed for node-negative gastric adenocarcinoma. Treatment was categorized by neoadjuvant therapy (NAT) vs. initial resection, and further stratified by eLN. Kaplan-Meier and Weibull models were used to analyze overall survival. Results: Of the 1,036 patients who received NAT, 40.5% had ${\leq}10eLN$, and most underwent proximal gastrectomy (67.8%). In multivariate analysis, greater eLN was associated with improved survival (eLN 16-20: HR, 0.71; P=0.039, eLN 21-30: HR, 0.55; P=0.001). Of the 2,795 patients who underwent initial surgery, 42.5% had ${\leq}10eLN$, and the majority underwent proximal gastrectomy (57.2%). In multivariate analysis, greater eLN was associated with improved survival (eLN 11-15: HR, 0.81; P=0.021, eLN 16-20: HR, 0.73; P=0.004, eLN 21-30: HR, 0.62; P<0.001, and eLN >30: HR, 0.58; P<0.001). Conclusions: In the United States, the majority of node-negative gastrectomies include suboptimal eLN. In node-negative gastric cancer, greater LN retrieval appears to have therapeutic and prognostic value, irrespective of initial treatment, suggesting a survival benefit to meticulous lymphadenectomy.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1395-1401
• /
• 1989

An efficient file allocation algorithm and a new method which calculate appraisal value of candidate computer site for distributed computer systems are proposed. The file allocation problem size is reduced by using the preassignment condition. The appraisal value of candidate node is calcualted as the user state array and node state array are varied according to control variables. As the selection criteria is applied to the candidates, the reasonable node is selected and assign state is determined. The proposed algorithm is heuriatic polynomial time algorithm. By performing algorithm for sample problems. It is shown that the proposed algorithm is superior to conventional method in terms of deviation from optimal solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.57-62
• /
• 2008

In this paper, we suggest new fast recovery mechanism in RPR network, in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this paper we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node's state, rpr node transmit protection messages. But interval of this protection messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairness message. And We also suggest fast failure detecting mechanism.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.73-81
• /
• 2009

Wireless media communication has lower robustness and stability than wired communication because of narrow bandwidth and unstable channel state. To make up for the deficient points of wireless communication, we used the diversity effect of cooperation communication and the error correction effect of channel coding schemes. In this paper, the cooperative communication system with RCPC codes and Hybrid ARQ transmission scheme is proposed for improving reliability on wireless communication, and we executed these simulations. From the simulation results, proposed system is showed lower BER performance than legacy system. In addition, we confirm the fact that the channel state of Relay-node and source-node is more important than the channel state of Relay-node and destination-node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.1
• /
• pp.5-21
• /
• 2008

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.