• Annual Conference of KIPS
• /
• 2003.05a
• /
• pp.285-288
• /
• 2003

기존의 침입탐지 시스템은 오용탐지모델이 널리 사용되고 있다. 이 모델은 낮은 오판율(False Alarm rates)을 가지고 있으나 새로운 공격에 대해 전문가시스템(Expert Systems)에 의한 규칙추가를 필요로 하고, 그 규칙과 완전히 매칭되는 시그너처만 공격으로 탐지하므로 변형된 공격을 탐지하지 못한다는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 보완하기 위해 주성분분석(Principle Component Analysis ; 이하 PCA)과 시간지연신경망(Time Delay Neural Network ; 이하 TDNN)을 이용한 침입탐지 시스템을 제안한다. 패킷은 PCA를 이용하여 주성분을 결정하고 패킷이미지패턴으로 만든다. 이 연속된 패킷이미지패턴을 시간지연신경망의 학습패턴으로 사용한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.656-665
• /
• 1992

In this paper, the performance of the various multiple access techniques for the mobile computer network has been studiedi in the consideration of the charactersitics of the mobile cimmunication channel. In the case of the hidden node occurring. It could be seen that the performance of the code division multiple access (CDMA) technique with simultaneous access function is better than that of the other packet access methods such as carrier sendsed multiple access (CDMA), busy tone multiple access (BTMA) and idle signal multiple access (ISMA) in the view of the throughput and mean delay time. Also, it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access (CSMA), etc. when the fading effect or impulsive noise exists in the mobile channel, Especially, in the case of the distributed mobile network it has been shown that the receivertransmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

• Journal of Sensor Science and Technology
• /
• v.7 no.1
• /
• pp.23-30
• /
• 1998

In this paper, we analyzed the effect of the time delay of the image sensor in the tracking loop of Electro-Optical Tracking System(EOTS). we showed that Smith predictor can greatly improve the stability and various performances of EOTS with time delay. And also, to verify the realistic validity, we executed the experiment in EOTS recently developed, and confirmed the effectiveness in EOTS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.1
• /
• pp.24-30
• /
• 2006

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. When the stuff bits are generated by bit-stuffing mechanism in the CAN network, it causes jitter including variations in response time and delay In order to eliminate this jitter, stuff bits must be controlled to minimize the response time and to reduce the variation of data transmission time. This paper proposes the method to reduce the stuff bits by restriction of available identifier and bit mask using exclusive OR operation. This da manipulation method are pretty useful to the real-time control strategy with respect to performance. However, the CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO(Inha Semvung Humanoid Robot).

• Journal of the Korea Society for Simulation
• /
• v.27 no.4
• /
• pp.27-45
• /
• 2018

The terrestrial communication network and the underwater acoustic communication network have very different communication characteristics each other in operational environments, communication media, propagation delay, frequency bandwidth, transmission speed, bit error rate, and so on. These different characteristics cause some different address schemes and different maximum transmission units and, as a result, these differences must form certainly obstacles to the intercommunication between a terrestrial communication network and an underwater acoustic communication network. In this paper, we presents a method to use the virtual addresses to resolve the interconnection problem caused by different address schemes between a terrestrial communication network and an underwater acoustic communication network, and, through a mathematical modeling, we analyze the performance on the message transceiving delay time in the underwater environment.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.105-110
• /
• 2005

With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.1-12
• /
• 2005

In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.