本文選題：前導碼挖掘　切入點：頻繁序列　出處：《計算機應用》2017年02期 　論文類型：期刊論文

【摘要】：針對未知協(xié)議幀切分技術存在的效率較低的問題,提出基于前導碼挖掘的未知協(xié)議幀切分技術。首先介紹前導碼作為標識鏈路幀起始位置的原理,分析候選序列選取問題是現(xiàn)有頻繁序列挖掘方法無法對長度較長的前導碼進行挖掘的原因,并針對該原因以及前導碼挖掘的特點提出從目標比特流中發(fā)現(xiàn)候選序列、基于候選序列集合大小變化特征的候選序列選取等改進方法;然后提出未知前導碼長度的判定與挖掘方法,從挖掘的眾多頻繁序列中找出前導碼序列,進而對幀進行切分;最后通過采集的真實數(shù)據(jù)對所提方法的有效性進行了驗證。實驗結(jié)果表明,所提方法能夠快速準確地挖掘未知協(xié)議比特流中的前導碼序列,相比現(xiàn)有方法降低了空間與時間復雜度。
[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.
【作者單位】： 軍械工程學院信息工程系;
【基金】：國家自然科學基金資助項目(61272491,61309021)~~
【分類號】：TN975

【相似文獻】

相關碩士學位論文 前3條

1 朱峰;前導碼干擾檢測和消除的仿真研究[D];西安電子科技大學;2013年

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

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

，

本文編號：1650617