期刊文献+

引入偏移量递阶控制的网络入侵HHT检测算法 被引量:40

Network Intrusion Detection Algorithm Based on HHT with Shift Hierarchical Control
在线阅读 下载PDF
导出
摘要 在强干扰背景低信噪比下对网络潜质入侵信号的准确检测是决定网络安全的关键。传统的Hilbert-Huang变换(HHT)入侵信号检测算法在求解入侵信号的瞬时频率特征时,因包络线失真引起的边界控制误差,会造成频谱泄漏,从而导致检测性能较差。提出了一种基于时间-频率联合分布特征和偏移量递阶控制HHT匹配的网络入侵信号检测算法,即构建网络潜质入侵数学演化模型,把复杂的入侵信号分解成IMF单频信号,得到入侵检测系统的状态转移方程,基于Hilbert变换对入侵信号进行离散解析化处理,构建入侵信号解析模型。对每个入侵信号经验模态分解后的解析模型IMF分量用Hilbert变换进行谱分析,通过递阶控制调整HHT频谱偏移,将残差信号投影与入侵信号的Hilbert边际谱进行匹配,减小包络线失真引起的边界控制误差,抑制频谱泄漏,实现对入侵信号的精确检测和参数估计。实验表明,该算法进行网络入侵信号检测时,具有较强的抗干扰性,能从低信噪比背景下有效检测出入侵信号,检测性能有较大提高。 In the strong interference background and low signal-to-noise,the accurate detection of network intrusion potential signal is the key of network security.The traditional Hilbert-Huang transform (HHT) intrusion signal detection algorithm has boundary control error resulted from envelope distortion,and spectrum leakage is occurred which leads the bad detection performance.An improved detection algorithm was proposed based on the time-frequency distribution feature and offset hierarchical control network HHT matching.The network potential intrusion mathematical evolution model is constructed,and the complex signals are decomposed into IMF single frequency signal.The intrusion detection system state transfer equation is obtained.The discrete analytical processing of the intrusion signal is taken based on Hilbert transform,and the signal model is obtained.The intrusion signal is decomposed with empirical mode,and the IMF component is analyzed by Hilbert spectrum.The HHT frequency shift is adjusted by hierarchical control mechanism,and residual projection and intrusion signal Hilbert marginal spectrum are matched.The envelope distortion is reduced,and the spectral leakage is suppressed.The accurate detection and parameter estimation of intrusion signal are achieved.Experiments show that this algorithm has strong anti-interference performance in intrusion signal detection,which can detect intrusion signal with low SNR effectively,and the performance of detection is improved.
出处 《计算机科学》 CSCD 北大核心 2014年第12期107-111,共5页 Computer Science
基金 浙江水利科技项目(RC1226 RC1421) 浙江省科技创新团队项目(2012R10022-09)资助
关键词 网络入侵 检测算法 递阶控制 Network intrusion Detection algorithm Hierarchical control
  • 相关文献

参考文献13

二级参考文献79

共引文献111

同被引文献227

  • 1刘艳秋,焦妮,李佳.基于确定网络的多级物流网络优化设计[J].沈阳工业大学学报,2015,37(1):64-68. 被引量:12
  • 2Chang Y L, Lin T L: Network-based H.264/AVC whole frame loss visibility model and frame dropping methods[J]. IEEE Transactions on Image Processing, 2012, 21(8):3353-3363.
  • 3Alfaro V M, Vilanovab R. Robust tuning of 2 DoF five-parameter PID controllers for inverse response controlled processes[J]. Journal of Process Control, 2013, 23(4): 453-462.
  • 4Du Q S , Jiang B H .Design and implementation of the embedded based web camera system [J] . Journal of Soffccare , 2012, 7(11): 2560-2566.
  • 5Hartenstein H, Laberteaux K P.A tutorial survey on vehicular adhoe networks [J] . IEEE Communications Magazine , 2008 , 46 (6): 164-171.
  • 6Gustavo M, Marco R, Alessandro A, et al. Safe driving iu LA: report from the greatest intervehicular accident detection test Ever [J] .IEEE Transactions on Vehicular Technology , 2013 , 62(2) : 522-535.
  • 7Li M, Zeng K, Lou W J .Opportunistic broadcast of event-driven warning messages in vehicular Ad Hoe networks with lossy links [J]. Computer Networks,2011,55(10):2443-2464.
  • 8Pratap K S, Eric H W, Agruti J S , et al. BAHG : Back- Bone- Assisted hop greedy routing for vanet's city environments[J].IEEE Transactions on Intelligent Transportation Systems , 2013 , 14(1) : 199- 213.
  • 9Ma X M, Zhang J S, Yin X Y, et al. Design and analysis of a robust broadcast scheme for vanet safety-related services [J] .IEEE Transactions on Vehicular Technology, 2012, 61(1) : 46-61.
  • 10Stankovic M S, Johansson K H, Stipanovic D M. Distributed seeking of Nash equilibria with applications to mobile sensor networks[J]. IEEE Transaction on Automatic Control,2012,57(4):904-919.

引证文献40

二级引证文献183

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部