• Title, Summary, Keyword: Adaptive Threshold And Side Information

Search Result 5, Processing Time 0.036 seconds

Traffic Seasonality aware Threshold Adjustment for Effective Source-side DoS Attack Detection

  • Nguyen, Giang-Truong;Nguyen, Van-Quyet;Nguyen, Sinh-Ngoc;Kim, Kyungbaek
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2651-2673
    • /
    • 2019
  • In order to detect Denial of Service (DoS) attacks, victim-side detection methods are used popularly such as static threshold-based method and machine learning-based method. However, as DoS attacking methods become more sophisticated, these methods reveal some natural disadvantages such as the late detection and the difficulty of tracing back attackers. Recently, in order to mitigate these drawbacks, source-side DoS detection methods have been researched. But, the source-side DoS detection methods have limitations if the volume of attack traffic is relatively very small and it is blended into legitimate traffic. Especially, with the subtle attack traffic, DoS detection methods may suffer from high false positive, considering legitimate traffic as attack traffic. In this paper, we propose an effective source-side DoS detection method with traffic seasonality aware adaptive threshold. The threshold of detecting DoS attack is adjusted adaptively to the fluctuated legitimate traffic in order to detect subtle attack traffic. Moreover, by understanding the seasonality of legitimate traffic, the threshold can be updated more carefully even though subtle attack happens and it helps to achieve low false positive. The extensive evaluation with the real traffic logs presents that the proposed method achieves very high detection rate over 90% with low false positive rate down to 5%.

Adaptive Algorithms for Bayesian Spectrum Sensing Based on Markov Model

  • Peng, Shengliang;Gao, Renyang;Zheng, Weibin;Lei, Kejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3095-3111
    • /
    • 2018
  • Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms.

Adaptive SLM and Side Information Insertion Method (적응 SLM 방식과 부가정보 삽입기법)

  • 정락규;유흥균
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.3
    • /
    • pp.276-282
    • /
    • 2003
  • OFDM is effective for the high speed data transmission. However, the nonlinear distortion is a serious problem because of the high PAPR due to many subcarriers. The conventional SLM selects the OFDM signal with the lowest PAPR. In this method, OFDM data can be correctly recovered only if the side information about the phase sequence is transmitted to receiver. This paper proposes a new method of side information insertion into the conventional SLM and reduces the computational complexity by adaptive method. Performances are compared in case that three kinds of phase sequences are used for phase rotation factor. The adaptive SLM method has the same PAPR reduction as the conventional SLM method. The required BER can be guaranteed by the proposed method. When subcarrier number N=32, computational complexity is reduced to 48 %, 72 % and 51 % for the branch number U=4, 8 and 16, respectively.

Layered Media Data Transmission Mechanism Of Considering Adaptive Dynamic QoS Control (동적 QoS 적응을 고려한 계층적 미디어 데이터의 전송 기법)

  • 나윤주;이승하;박준호;남지승;마평수
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.97-100
    • /
    • 2001
  • A common network such as internet does not provide a guaranteed network bandwidth to accommodate multimedia service in a reliable fashion. In this paper, we propose a new rate control mechanism for multimedia service on the internet which is adaptive to the dynamic QoS in real-time. Also we adapt an QoS monitoring module and real-time transmission control module to adapt dynamic network bandwidth. To do this, we used layer attribution of media data and also considered loss rate and buffer threshold in receiver side for measurement of dynamic QoS.

  • PDF

Adaptive Hard Decision Aided Fast Decoding Method in Distributed Video Coding (적응적 경판정 출력을 이용한 고속 분산 비디오 복호화 기술)

  • Oh, Ryang-Geun;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.66-74
    • /
    • 2010
  • Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.