• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.37-42
• /
• 1992

The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.

• 한국시뮬레이션학회논문지
• /
• 제10권2호
• /
• pp.61-74
• /
• 2001

The reliability evaluation of the large scale network becomes very complicate according to the growing size of network. Moreover if the reliability is not constant but follows probability distribution function, it is almost impossible to compute them in theory. This paper studies the network evaluation methods in order to overcome such difficulties. For this an efficient path set algorithm which seeks the path set connecting the start and terminal nodes efficiently is developed. Also, various variance reduction techniques are applied to compute the system reliability to enhance the simulation performance. As a numerical example, a large scale network is given. The comparisons of the path set algorithm and the variance reduction techniques are discussed.

• 조명전기설비학회논문지
• /
• 제25권2호
• /
• pp.87-95
• /
• 2011

A Renewable Portfolio Standard(RPS) is a regulation that requires the increased generation of energy from renewable energy sources such as solar, wind, fuel cell, small hydro, biomass and geothermal. By environmental, technical and these regulatory reasons, the amount of renewable energy sources will be increased in a network. However, it is hard to assess risk of a transmission network with large scale renewable energy sources because the output characteristics of renewable energies are intermittent. This paper evaluates effects of a transmission system with supplemental large scale renewable energies into the existing system. To evaluate these effects, a methodology for risk level of components in a network is proposed considering steady state and contingency N-1 in this paper. We consider line current and bus voltage in each state of a network.

• 대한임베디드공학회논문지
• /
• 제18권2호
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• ETRI Journal
• /
• 제30권3호
• /
• pp.483-485
• /
• 2008

A micro-sensor network is comprised of a large number of small sensors with limited memory capacity. Current key-establishment schemes for symmetric encryption require too much memory for micro-sensor networks on a large scale. In this paper, we propose a memory-efficient hypercube key establishment scheme that only requires logarithmic memory overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1454-1466
• /
• 2016

This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.

• 전자공학회논문지S
• /
• 제36S권7호
• /
• pp.1-8
• /
• 1999

본 논문은 게이트웨어로 연결된 대규모 회선 교환망에서 유${\cdot}$무선 가입자에게 서비스를 제공하는 라우팅프로토콜을 제안하고 성능을 평가하였다. 대규모 망은 다수의 서브네트웨크로 구성되어 있으며, 서브네트웨크는 $M{\times}N$ 노드들이 격자 구조로 연결되어 있다. 무선 수신 가입자에 대한 호가 발생할 경우, 기존 프로토콜에 의하면, 전체 망에 대하여 검색하여 수신 가입자를 찾는다. 그 결과, 많은 잉여 패킷이 발생되고, 호 처리가 지연된다. 따라서, 새롭게 제안된 라우팅 프로토콜은 우선, 자신의 서브네트워크에서 무선 수신 가입자를 찾고, 없는 경우에 전체 망에서 찾는다. 성능평가결과 제안된 프로토콜의 성능이 기존 프로토콜의 성능보다 우수한 것으로 나타났다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.136-151
• /
• 2016

Flexible large-scale WLANs are now widely deployed in crowded and highly mobile places such as campus, airport, shopping mall and company etc. But network management is hard for large-scale WLANs due to highly uneven interference and throughput among links. So the traffic is difficult to predict accurately. In the paper, through analysis of traffic in two real large-scale WLANs, Granger Causality is found in both scenarios. In combination with information entropy, it shows that the traffic prediction of target AP considering Granger Causality can be more predictable than that utilizing target AP alone, or that of considering irrelevant APs. So We develops new method -Granger Causality and Vector Auto-Regression (GCVAR), which takes APs series sharing Granger Causality based on Vector Auto-regression (VAR) into account, to predict the traffic flow in two real scenarios, thus redundant and noise introduced by multivariate time series could be removed. Experiments show that GCVAR is much more effective compared to that of traditional univariate time series (e.g. ARIMA, WARIMA). In particular, GCVAR consumes two orders of magnitude less than that caused by ARIMA/WARIMA.

• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.49-54
• /
• 2011

본 논문에서는 대규모 MANET을 대상으로 VoIP 트래픽의 종단간 성능을 측정하고 분석하여 보았다. 측정된 결과의 분석을 통하여 대규모 MANET에서 사용 가능한 VoIP 구현조건을 제시하였다. 성능측정은 NS-2 네트워크 시뮬레이터를 기반으로 제작한 VoIP 시뮬레이터를 사용하였다. 시뮬레이션을 통하여 접속품질로서 호연결율, 전송품질로서 MOS, 네트워크지연, 그 이외의 평가척도로서 패킷손실율을 측정하였다. 본 논문의 결과로서 대규모 MANET에서 VoIP 구축과 운영에 적합한 조건이 단일 네트워크 규모로 최대 $10{\sim}15km^2$이내, 노드수 로 500여개, 호연결수로 100여개임을 확인하였다.