本文選題：前導(dǎo)碼挖掘　切入點(diǎn)：頻繁序列　出處：《計(jì)算機(jī)應(yīng)用》2017年02期 　論文類型：期刊論文

【摘要】：針對(duì)未知協(xié)議幀切分技術(shù)存在的效率較低的問(wèn)題,提出基于前導(dǎo)碼挖掘的未知協(xié)議幀切分技術(shù)。首先介紹前導(dǎo)碼作為標(biāo)識(shí)鏈路幀起始位置的原理,分析候選序列選取問(wèn)題是現(xiàn)有頻繁序列挖掘方法無(wú)法對(duì)長(zhǎng)度較長(zhǎng)的前導(dǎo)碼進(jìn)行挖掘的原因,并針對(duì)該原因以及前導(dǎo)碼挖掘的特點(diǎn)提出從目標(biāo)比特流中發(fā)現(xiàn)候選序列、基于候選序列集合大小變化特征的候選序列選取等改進(jìn)方法;然后提出未知前導(dǎo)碼長(zhǎng)度的判定與挖掘方法,從挖掘的眾多頻繁序列中找出前導(dǎo)碼序列,進(jìn)而對(duì)幀進(jìn)行切分;最后通過(guò)采集的真實(shí)數(shù)據(jù)對(duì)所提方法的有效性進(jìn)行了驗(yàn)證。實(shí)驗(yàn)結(jié)果表明,所提方法能夠快速準(zhǔn)確地挖掘未知協(xié)議比特流中的前導(dǎo)碼序列,相比現(xiàn)有方法降低了空間與時(shí)間復(fù)雜度。
[Abstract]:In view of the low efficiency of the unknown protocol frame segmentation technology, an unknown protocol frame segmentation technique based on preamble mining is proposed. Firstly, the principle of using the preamble code to identify the starting position of the link frame is introduced. Analyzing the problem of candidate sequence selection is the reason why the existing frequent sequence mining methods can not mine the long preamble. According to this reason and the characteristics of preamble mining, we propose to find candidate sequences from the target bit stream. An improved method of selecting candidate sequences based on the variation of candidate sequence size is presented, and then an unknown preamble length determination and mining method is proposed to find the preamble sequences from many frequent sequences, and then segment the frames. Finally, the validity of the proposed method is verified by the real data collected. The experimental results show that the proposed method can quickly and accurately mine the preamble sequences in the unknown protocol bitstream. Compared with the existing methods, the complexity of space and time is reduced.
【作者單位】： 軍械工程學(xué)院信息工程系;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61272491,61309021)~~
【分類號(hào)】：TN975

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前3條

1 朱峰;前導(dǎo)碼干擾檢測(cè)和消除的仿真研究[D];西安電子科技大學(xué);2013年

2 廖輝;一種WCDMA系統(tǒng)前導(dǎo)碼檢測(cè)的算法方案及實(shí)現(xiàn)[D];哈爾濱工業(yè)大學(xué);2009年

3 王淡宜;高速移動(dòng)場(chǎng)景下蜂窩無(wú)線通信網(wǎng)絡(luò)群切換策略研究[D];西南交通大學(xué);2014年

，

本文編號(hào)：1650617