• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.205-213
• /
• 2019

Network robustness is one of the most important characteristics needed as the network. Over the military tactical communication network, robustness is a key function for maintaining attack phase constantly. Tactical Information Communication Network, called TICN, has mixed characteristics of lattice- and tree-type network topology, which looks somewhat weak in the viewpoint of network robustness. In this paper, we search articulation points and bridges in a current Tactical Information Communication Network using graph theory. To improve the weak points empirically searched, we try to add links to create the concrete network and then observe the change of network-based verification values through diminishing nodes. With these themes, we evaluate the generated networks through SNA techniques. Experimental results show that the generated networks' robustness is improved compared with current network structure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.138-146
• /
• 2010

It is well known that many biological networks are very robust against various types of perturbations, but we still do not know the mechanism of robustness. In this paper, we find that there exist a number of feedback loops in a real biological network compared to randomly generated networks. Moreover, we investigate how the topological property affects network robustness. To this end, we properly define the notion of robustness based on a Boolean network model. Through extensive simulations, we show that the Boolean networks create a nearly constant number of fixed-point attractors, while they create a smaller number of limit-cycle attractors as they contain a larger number of feedback loops. In addition, we elucidate that a considerably large basin of a fixed-point attractor is generated in the networks with a large number of feedback loops. All these results imply that the existence of a large number of feedback loops in biological networks can be a critical factor for their robust behaviors.

• Korean Journal of Construction Engineering and Management
• /
• v.19 no.3
• /
• pp.33-42
• /
• 2018

In the aftermath of an earthquake, seismic-damaged infrastructure systems loss estimation is the first step for the disaster response. However, lifeline systems' ability to supply service can be volatile by external factors such as disturbances of nearby facilities, and not by own physical issue. Thus, this research develops the bayesian model for probabilistic inference on common-cause and cascading failure of seismic-damaged lifeline systems. In addition, the authors present network robustness estimation metrics in the context of failure propagation. In order to quantify the functional loss and observe the effect of the mitigation plan, power and water supply system in Daegu-Gyeongbuk in South Korea is selected as case network. The simulation results show that reduction of cascading failure probability allows withstanding the external disruptions from a perspective of the robustness improvement. This research enhances the comprehensive understanding of how a single failure propagates to whole lifeline system performance and affected region after an earthquake.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1359-1370
• /
• 2009

In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.902-911
• /
• 2002

A wireless ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized adminstration or standard support services. Wireless ad-hoc networks may be quite useful in that they can be instantly deployable and resilient to change. In this environment, for many crucial distributed applications, it is necessary to design robust virtual infrastructures that are fault-tolerant, self-stabilized, and resource-efficient. For this task this paper proposes a scheme of maintaining robust spanning trees which are little affected by topological changes. By maintaining such a spanning tree and adapting it to the environments with frequent topological changes, one can improve the reliability and efficiency of many applications that use the spanning tree.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1477-1483
• /
• 2020

The stability guarantee of wireless network based control systems is still challenging due to the lossy links and node failures. This paper proposes a hierarchical cluster-based network protocol called robust wireless sensor and actuator network (R-WSAN) by combining time, channel, and space resource diversity. R-WSAN includes a scheduling algorithm to support the network resource allocation and a control task sharing scheme to maintain the control stability of multiple plants. R-WSAN was implemented on a real test-bed using Zolertia RE-Mote embedded hardware platform running the Contiki-NG operating system. Our experimental results demonstrate that R-WSAN provides highly reliable and robust performance against lossy links and node failures. Furthermore, the proposed scheduling algorithm and the task sharing scheme meet the stability requirement of control systems, even if the controller fails to support the control task.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.663-666
• /
• 2008

본 논문에서는 무선 센서네트워크에 적합한 백본을 형성하여 특정 노드 집합들만 라우팅에 참여하게 함으로써 데이터를 전달하기 위한 오버헤드와 깨어있는 노드의 수를 최소화한다. 이때 백본을 형성하는 노드들은 일반 노드에 비해서 에너지 소모가 크므로 노드의 잔여에너지와 차수를 고려하여 강건한 백본을 형성하여 네트워크의 라이프타임을 증가시키는 것이 중요하다. 그러므로 본 논문에서는 에너지레벨이 높은 노드를 클러스터헤드로 선정해서 강건한 백본을 형성하고, 헤더 주변에 많은 노드들을 배치하여 패킷전달의 역할을 분산함으로써 네트워크 라이프타임을 늘린다. 시뮬레이션 결과에서 제안 알고리즘은 기존 연구에 비해 클러스터헤드의 잔여에너지측면에서 약 58.6%, 차수측면에서 약 79.42%의 성능 향상을 보인다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.4
• /
• pp.1009-1019
• /
• 2018

Bitcoin is the first application utilizing the blockchain, but it has limitations in terms of scalability. The concept of Lightning Network was recently introduced to address the scalability problem of Bitcoin. In this paper, we found that the real-world Bitcoin Lightning Network shows the scale-free property. Therefore, the Bitcoin Lightning Network can be vulnerable to the intentional attacks targeting some specific nodes in the network while it is still robust to the random node failures. We experimentally analyze the robustness of the Bitcoin's Lightning Network via the simulation of network attack model. Our simulation results demonstrate that the real-world Lightning Network is vulnerable to target attacks that destroy a few nodes with high degree.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.57-67
• /
• 2015

A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.37-45
• /
• 2004

In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.