• Journal of IKEEE
• /
• v.26 no.4
• /
• pp.614-621
• /
• 2022

This paper proposes RIDS (Random Forest-Based Intrusion Detection), which is an intrusion detection system to detect hacking attack based on random forest. RIDS detects three typical attacks i.e. DoS (Denial of service) attack, fuzzing attack, and spoofing attack. It detects hacking attack based on four parameters, i.e. time interval between data frames, its deviation, Hamming distance between payloads, and its diviation. RIDS was designed in memory-centric architecture and node information is stored in memories. It was designed in scalable architecture where DoS attack, fuzzing attack, and spoofing attack can be all detected by adjusting number and depth of trees. Simulation results show that RIDS has 0.9835 accuracy and 0.9545 F1 score and it can detect three attack types effectively.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1068-1074
• /
• 2011

In this paper, the proposed scheme is STBC(space-time block codes) system combined with convolution code which is the most popular channel coding to ensure the reliability of data transmission for a high data rate wireless communication. The STBC is one of MIMO(multi-input multi-output) techniques. In addition, this scheme uses a modified viterbi algorithm in order to get a high system gain when data is transmitted. Because we combine STBC and convolution code, the proposed scheme has a little high quantity of computation but it can get a maximal diversity gain of STBC and a high coding gain of convolution code at the same time. Unlike existing viterbi docoding algorithm using Hamming distance in order to calculate branch matrix, the modified viterbi algorithm uses Euclidean distance value between received symbol and reference symbol. Simulation results show that the modified viterbi algorithm improved gain 7.5 dB on STBC 2Tx-2Rx at $BER=10^{-2}$. Therefore the proposed scheme using STBC combined with convolution code can improve the transmission reliability and transmission efficiency.