• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.534-547
• /
• 2014

Large-scale failures resulting from natural disasters or intentional attacks are now causing serious concerns for communication network infrastructure, as the impact of large-scale network connection disruptions may cause significant costs for service providers and subscribers. In this paper, we propose a new framework for the analysis and prevention of network service disruptions in large-scale failure scenarios. We build dynamic deterministic and probabilistic models to capture the impact of regional failures as they evolve with time. A probabilistic failure model is proposed based on wave energy behaviour. Then, we develop a novel approach for preventive protection of the network in such probabilistic large-scale failure scenarios. We show that our method significantly improves uninterrupted delivery of data in the network and reduces service disruption times in large-scale regional failure scenarios.

• Journal of Sensor Science and Technology
• /
• v.26 no.1
• /
• pp.1-6
• /
• 2017

The advanced driver assistant system (ADAS) requires the collection of a large amount of information including road conditions, environment, vehicle status, condition of the driver, and other useful data. In this regard, large-scale sensor networks can be an appropriate solution since they have been designed for this purpose. Recent advances in sensor network technology have enabled the management and monitoring of large-scale tasks such as the monitoring of road surface temperature on a highway. In this paper, we consider the estimation and fusion problems of the large-scale sensor networks used in the ADAS. Hierarchical fusion architecture is proposed for an arbitrary topology of the large-scale sensor network. A robust cluster estimator is proposed to achieve robustness of the network against outliers or failure of sensors. Lastly, a robust hierarchical data fusion scheme is proposed for the communication channel between the clusters and fusion center, considering the non-Gaussian channel noise, which is typical in communication systems.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.155-162
• /
• 2003

A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.715-723
• /
• 2003

A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1319-1327
• /
• 2015

As wind power farm (WPF) installations continue to grow, monitoring and controlling large-scale WPFs presents new challenges. In this paper, a hierarchical network architecture is proposed in order to provide remote monitoring and control of large-scale WPFs. The network architecture consists of three levels, including the WPF comprised of wind turbines and meteorological towers, local control center (LCC) responsible for remote monitoring and control of wind turbines, and a central control center (CCC) that offers data collection and aggregation of many WPFs. Different scenarios are considered in order to evaluate the performance of the WPF communications network with its hierarchical architecture. The communications network within the WPF is regarded as the local area network (LAN) while the communication among the LCCs and the CCC happens through a wide area network (WAN). We develop a communications network model based on an OPNET modeler, and the network performance is evaluated with respect to the link bandwidth and the end-to-end delay measured for various applications. As a result, this work contributes to the design of communications networks for large-scale WPFs.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.201-204
• /
• 1998

This paper presents a new construction method of candidate controllers using Multi-modal Neural Network(MNN). To improve a control performance of multiple controller, we construct, candidate controllers which consist of MNN. MNN can learn more complicated function than multilayer neural network. MNN consists of preprocessing module and neural network module. The preprocessing module transforms input signals into spectra which are used as input of the following neural network module. We apply the proposed method to multiple control system which controls the cart-pole balancing system and show the effectiveness of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.620-636
• /
• 2015

Survivability is a necessary property of network system in disturbed environment. Recovery ability is a key actor of survivability. This paper concludes network survivability into a novel composite metric, i.e. Network Recovery Degree (NRD). In order to measure this metric in quantity, a concept of Source-Destination Pair (SD Pair), is created to abstract end-to-end activity based on end nodes in network, and the quality of SD Pair is also used to describe network performance, such as connectivity, quality of service, link degree, and so on. After that, a Survivability Test method in large scale Network based on SD pairs, called STNSD, is provided. How to select SD Pairs effectively in large scale network is also provided. We set up simulation environment to validate the test method in a severe destroy scenario and evaluate the method scalability in different large scale network scenarios. Experiment and analysis shows that the metric NRD correctly reflects the effort of different survivability strategy, and the proposed test method STNSD has good scalability and can be used to test and evaluate quantitative survivability in large scale network.

• Journal of Information Technology Services
• /
• v.17 no.2
• /
• pp.179-190
• /
• 2018

This study is about the influence of authors' centrality on research outcomes in a large-scale collaborative research network. Using the social network analysis method, five types of centralities were derived. Six research outcomes of individual researchers were also derived through bibliographic information of the social science field for the last 10 years. A multivariate regression analysis was conducted to examine the causal relationship between the centrality and research outcome, and the effect of centrality on research outcomes was found to be statistically significant. The result of this study shows that the revised citation and H-index significantly influenced the authors' centrality. This result can imply that the centrality of the researcher can expect a considerable influence of the thesis as well as a certain level of productivity. The meaning of this study is to analyze the effect of centrality on the research outcomes of the large-scale collaborative research network in the past decade, and is carefully to suggest a guideline in order to support new research information services for active researchers and the advancement of collaborative research. This study has its limitation for interpreting the diverse academic fields of the social sciences in a uniform way. In future study, it is necessary to conduct studies using various weighted indices for network centrality in order to measure the influence of research.

• Smart Structures and Systems
• /
• v.24 no.5
• /
• pp.587-595
• /
• 2019

Deformation measurement of large scale structures, such as the ground beds of high-rise buildings, tunnels, bridge, and railways, are important for insuring service quality and safety. The pose-relay videometrics method and displacement-relay videometrics method have already presented to measure the pose of non-intervisible objects and vertical subsidence of unstable areas, respectively. Both methods combine the cameras and cooperative markers to form the camera series networks. Based on these two networks, we propose two novel videometrics methods with closed-loop camera series network for deformation measurement of large scale structures. The closed-loop camera series network offers "closed-loop constraints" for the camera series network: the deformation of the reference points observed by different measurement stations is identical. The closed-loop constraints improve the measurement accuracy using camera series network. Furthermore, multiple closed-loops and the flexible combination of camera series network are introduced to facilitate more complex deformation measurement tasks. Simulated results show that the closed-loop constraints can enhance the measurement accuracy of camera series network effectively.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.