新型否定選擇算法的入侵檢測模型研究及實現(xiàn)
[Abstract]:With the development of computer and the popularization of network, people pay more and more attention to the problem of network security. However, the early passive defense technology can only detect known attacks because of its own limitations, and can not meet the needs of the growing network. As a new security technology, intrusion detection system (IDS) can solve the limitation of traditional passive defense technology. In view of the fact that the immune system and the intrusion detection system are similar to each other to a great extent, that is, they have a series of characteristics, such as autonomy, diversity, adaptability, tolerance and distribution. The principle and mechanism of immune system are applied to intrusion detection system, and the model of intrusion detection system is improved to make it more feasible. The intrusion detection model is realized by a new negative selection algorithm based on deterministic crowding to simulate the maturation mechanism of T cells. It is a autologous / non-autologous detection method in the artificial immune system. The existing negative selection algorithm proposed by Forrest-Perelson et al has some defects, which results in the low detection efficiency of the artificial immune system for non-autologous detection. In this paper, we find that the reason of the low detection efficiency of the negative selection algorithm is that the algorithm needs a large number of detectors to completely cover the dissident space as far as possible, which is not feasible in reality. Therefore, how to balance the number of detectors and maximize the coverage of dissident space is a problem to be solved. In this paper, a new negative selection algorithm based on deterministic congestion is proposed to improve the problems of large search space and low running efficiency in solving the network security problems in the traditional negative selection algorithm. The main work of this paper is to improve the intrusion detection. It is proved that the deterministic congestion based negative selection algorithm can estimate the offset of a more accurate method without affecting its performance, generate a set of fewer detectors and be more efficient in computing power. The experimental results show that the proposed negative selection algorithm based on deterministic congestion has higher detection efficiency and accuracy than the original algorithm.
【學(xué)位授予單位】:西安電子科技大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:TP393.08
【相似文獻】
相關(guān)期刊論文 前10條
1 張楠;李志蜀;張建華;;基于混沌理論的否定選擇算法[J];四川大學(xué)學(xué)報(工程科學(xué)版);2006年01期
2 晏義威;張鳳斌;楊曉君;張科;;改進的混沌否定選擇算法[J];計算機工程;2009年11期
3 張雄美;易昭湘;宋建社;李俊山;;基于矩陣形式的否定選擇算法研究[J];電子與信息學(xué)報;2010年11期
4 謝婧;印潤遠;顏祿涵;;改進的否定選擇算法在入侵檢測中的應(yīng)用[J];微計算機信息;2012年01期
5 張福勇;齊德昱;胡鏡林;;終身學(xué)習(xí)的否定選擇算法[J];沈陽工業(yè)大學(xué)學(xué)報;2012年03期
6 金章贊;廖明宏;肖剛;;否定選擇算法綜述[J];通信學(xué)報;2013年01期
7 王大偉;張鳳斌;;區(qū)域否定選擇算法[J];計算機工程與應(yīng)用;2008年12期
8 李卓君;;一種改進的否定選擇算法[J];信息通信;2012年01期
9 莫秀良;王春東;;基于否定選擇算法的木馬檢測與研究[J];煤炭技術(shù);2013年07期
10 張鳳斌;王天博;;實值n維混沌映射否定選擇算法[J];計算機研究與發(fā)展;2013年07期
相關(guān)會議論文 前1條
1 魏春英;劉培玉;;否定選擇算法及其改進[A];山東省計算機學(xué)會2005年信息技術(shù)與信息化研討會論文集(一)[C];2005年
相關(guān)碩士學(xué)位論文 前10條
1 史樂;否定選擇算法及可視化實現(xiàn)研究[D];南京大學(xué);2015年
2 宋偉;新型否定選擇算法的入侵檢測模型研究及實現(xiàn)[D];西安電子科技大學(xué);2014年
3 仲巍;新型否定選擇算法的研究與應(yīng)用[D];江蘇大學(xué);2008年
4 張建;基于深度學(xué)習(xí)和信息增益的否定選擇算法[D];西安電子科技大學(xué);2012年
5 喬宗杰;基于熵理論的實值否定選擇算法研究[D];哈爾濱理工大學(xué);2012年
6 劉巖;基于否定選擇算法的異常檢測模型研究[D];哈爾濱工程大學(xué);2008年
7 趙紅霞;基于新型否定選擇算法的計算機病毒檢測技術(shù)研究[D];太原理工大學(xué);2010年
8 王衛(wèi)民;基于人工免疫系統(tǒng)的否定選擇算法改進相關(guān)研究[D];電子科技大學(xué);2008年
9 李海;否定選擇算法在IDS中的應(yīng)用研究[D];電子科技大學(xué);2009年
10 李彬;基于否定選擇算法的入侵檢測系統(tǒng)[D];太原理工大學(xué);2011年
,本文編號:2193552
本文鏈接:http://sikaile.net/guanlilunwen/ydhl/2193552.html