• 한국지진공학회논문집
• /
• 제2권4호
• /
• pp.87-94
• /
• 1998

현대의 고층건물들은 점차 유연해지고 경량화 됨으로 인하여 지진이나 바람과 같은 하중에 대하여 취약하다. 그러므로 이러한 하중에 대한 진동수준을 감소시키기 위하여 진동제어 시스템의 성능을 더욱 향상시킬 필요가 있으며 능동제어장치를 이용한 방법이 요구되고 있다 따라서 본 논문에서는 소형 진동대, 건물모델, 건물모델의 응답을 측정하는 센서, 신호처리 보드 그리고, 능동 질량 추진기로 구성된 능동 진동제어 시스템을 구축하였으며 이러한 개별 시스템들의 동적 특성을 실험적인 방법으로 조사하였다 또한 건물모델에 El Centro 지진을 가하여 능동 진동제어 시스템의 성능을 검증하였다,.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.575-596
• /
• 2009

Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.283-285
• /
• 2006

무선 센서 네트워크를 구성하는 센서 노드는 한번 배치되면 사람의 간섭 없이 오랜 기간 동안 동작하는 데 실행중인 소프트웨어를 수정 또는 추가를 할 필요가 있다. 그러나 센서 노드를 회수하기 어려운 경우가 있기 때문에 원격 코드 업데이트 기법이 필요하게 되고, 이를 위한 신뢰성 있는 코드 전송 프로토콜에 대한 연구가 활발하게 진행되고 있다. 하지만 신뢰성만을 고려한 코드 전송 프로토콜은 코드를 안정적으로 전송하기만을 고려하기 때문에 코드를 신속하게 전송한다는 관점에 대한 고려가 부족하다는 한계를 갖는다. 그 결과 긴 코드 전송시간에 의해 불필요한 에너지 소모를 발생함으로써 센서노드의 에너지 효율을 저하시키게 된다. 본 논문에서는 기존의 코드 전송 프로토콜들이 가지는 한계를 극복하는 FCPP(Fast code propagation protocol)을 제안하였다. FCPP는 신뢰성 있는 전송뿐만 아니라 신속함을 고려한 접근 방법을 제시하고 있다. 새로 제안한 알고리즘은 RTT기반의 전송률 조절과 NACK 억제 기법으로 네트워크 상태를 반영한 전송률 조절과 에러복구에 의한 불필요한 전송지연을 피하도록 하여 네트워크의 사용률을 최대화하여 신속한 코드 전송을 가능하게 한다. 또한 ns-2 시뮬레이터를 이용한 실험을 통해 제안한 FCPP가 센서 네트워크의 코드 전송에서 신뢰성 및 신속함을 모두 만족시킬 수 있음을 확인하였다.

• 한국전기전자재료학회논문지
• /
• 제24권12호
• /
• pp.982-987
• /
• 2011

In this study, $Ge_8Se_{(2+x)}Te_{(6-x)}$ thin film amorphous-to-crystalline phase-change rate was evaluated in using a nano-pulse scanner. The focused laser beam with a diameter <10 ${\mu}m$ was illuminated in the power (P) and pulse duration (t) ranges of 1-31 mW and 10-460 ns, respectively, with subsequent detection of the responsive signals reflected from the film surface. We also evaluated the material characteristics, such as optical absorption and energy gap, crystalline phases, and sheet resistance of as-deposited and annealed films. The result of experiments showed that the thermal stability of the Ge-Se-Te film is largely improved by adding Se.

• ETRI Journal
• /
• 제35권1호
• /
• pp.41-50
• /
• 2013

Network Mobility (NEMO) handles mobility of multiple nodes in an aggregate manner as a mobile network. The standard NEMO suffers from a number of limitations, such as inefficient routing and increased handoff latency. Most previous studies attempting to solve such problems have imposed an extra signaling load and/or modified the functionalities of the main entities. In this paper, we propose a more secure and lightweight route optimization (RO) mechanism based on exploiting the firewall in performing the RO services on behalf of the correspondent nodes (CNs). The proposed mechanism provides secure communications by making an authorized decision about the mobile router (MR) home of address, MR care of address, and the complete mobile network prefixes underneath the MR. In addition, it reduces the total signaling required for NEMO handoffs, especially when the number of mobile network nodes and/or CNs is increased. Moreover, our proposed mechanism can be easily deployed without modifying the mobility protocol stack of CNs. A thorough analytical model and network simulator (Ns-2) are used for evaluating the performance of the proposed mechanism compared with NEMO basic support protocol and state-of-the-art RO schemes. Numerical and simulation results demonstrate that our proposed mechanism outperforms other RO schemes in terms of handoff latency and total signaling load on wired and wireless links.

• 한국진공학회:학술대회논문집
• /
• 한국진공학회 2016년도 제50회 동계 정기학술대회 초록집
• /
• pp.207-207
• /
• 2016

plasma group velocities of neon with oxygen admixture (ug) are obtained by intensified charge coupled device (ICCD) camera images at fixed gate width time of 5 ns. The propagation velocities outside interelectrode region are in the order of 104 m/s.The plasma ambipolar diffusion velocities are calculated to be in the order of 102 m/s. Plasma jet is generated by all fixed sinusoidal power supply, total gas flow and repetition frequency at 3 kV, 800 sccm and 40 kHz, respectively. The amount of oxygen admixture is varied from 0 to 2.75 %. By employing one dimensional convective wave packet model, the electron temperatures in non-thermal atmospheric-pressure plasma jet are estimated to be in a range from 1.65 to 1.95 eV.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.5023-5038
• /
• 2017

Big data is an emerging technology which deals with wide range of data sets with sizes beyond the ability to work with software tools which is commonly used for processing of data. When we consider a huge network, we have to process a large amount of network information generated, which consists of both normal and abnormal activity logs in large volume of multi-dimensional data. Intrusion Detection System (IDS) is required to monitor the network and to detect the malicious nodes and activities in the network. Massive amount of data makes it difficult to detect threats and attacks. Sequential Pattern mining may be used to identify the patterns of malicious activities which have been an emerging popular trend due to the consideration of quantities, profits and time orders of item. Here we propose a sequential pattern mining algorithm with fuzzy logic feature selection and fuzzy weighted support for huge volumes of network logs to be implemented in Apache Hadoop YARN, which solves the problem of speed and time constraints. Fuzzy logic feature selection selects important features from the feature set. Fuzzy weighted supports provide weights to the inputs and avoid multiple scans. In our simulation we use the attack log from NS-2 MANET environment and compare the proposed algorithm with the state-of-the-art sequential Pattern Mining algorithm, SPADE and Support Vector Machine with Hadoop environment.

• 산업공학
• /
• 제22권1호
• /
• pp.95-103
• /
• 2009

During the past few years, design of experiments (DOE) has been gaining acceptance in the telecommunications research community as a mean for designing and analyzing experiments economically and efficiently. In addition, the need for introducing a systematic robust design methodology (i.e., one of the most popular DOE methodologies) to network simulations has been increasing. In this paper, we present an architecture of voice over IP (VoIP) application and the E-Model for calculating the perceived quality of service (QoS). Then, we apply the Taguchi robust design methodology to optimize the perceived QoS of VoIP application, and describe the detailed step-by-step procedures. We have used ns-2 simulator to collect experimental data in which the SN ratio, a robustness measure, is analyzed to determine an optimal design condition. The analysis shows that "initial delay time in playout buffer" is a major control factor for ensuring robust behaviors of the perceived QoS of VoIP. Finally, we verify the proposed optimal design condition using a confirmation experiment.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2006년도 춘계학술발표대회
• /
• pp.1139-1142
• /
• 2006

Mobile Ad-hoc 네트워크(MANET)에서 각 노드들은 한정된 배터리에 의존하여 통신한다. 이와 같은 제한사항을 극복하기 위해 링크의 안정성을 유지하거나 파워 소모를 고려한 프로토콜에 대한 연구들이 활발히 이루어져 왔다. 하지만 링크의 안정성 또는 파워 소모의 어느 한 측면만을 고려함으로써 링크의 안정성은 높일 수 있으나 파워 소모가 효율적이지 못했다. 반면에 전체 파워소모는 줄일 수 있었으나 파워소모의 균형을 이루지 못함으로써 네트워크 수명을 오래 지속시킬 수 없는 문제점이 발생 했다. 본 논문에서는 배터리 잔량에 대한 threshold를 적용함과 동시에 신호세기를 고려하여 각 노드들의 균형된 파워소모와 네트워크 전체의 파워 소모를 최소화함으로써 네트워크 수명을 오래 지속시키기 위한 프로토콜인 PRTRS(Power Aware Routing Protocol based on Both Threshold by Residual Battery Capacity and Signal Strength in Mobile Ad-hoc Network)를 제안한다. PRTRS는 AODV(Ad-hoc On-demand Distance Vector Routing)를 기반으로 하였다. NS-2 네트워크 시뮬레이션 결과 PRTRS는 특정 노드로 집중되는 트래픽을 분산시켜 파워소모의 균형을 이루고 네트워크 전체의 파워소모를 최소화함으로써 네트워크 수명이 연장됨을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.