论文部分内容阅读
基于Xinyuan Wang等的水印算法,提出一个有效的主动干扰包间延迟建立连接链关联的算法。以最小干扰包间延迟的原则确定水印值,调整包的发送时间加入水印。通过不断增大包间延迟数目还原一位水印的多个值,由L位的水印值构成水印矩阵;遍历水印矩阵,组合多个L位水印序列,若两个连接链的水印序列的相似度达到规定的域值则为关联连接链。实验表明了算法在应对攻击者对包间延迟的干扰以及存在冗余包的连接链中的有效性。
Based on the watermarking algorithm of Xinyuan Wang et al., An effective active interference inter-packet delay establishment algorithm of link association is proposed. To minimize the interference between the principle of packet delay to determine the watermark value, adjust the packet sending time to join the watermark. A watermark matrix is formed by L-bit watermark values; traversing a watermark matrix and combining a plurality of L-bit watermark sequences; if the similarity of watermark sequences of two connection chains reaches The specified domain value is the associated connection chain. Experiments show that the algorithm is effective in dealing with the attacker’s delay on inter-packet interference and the existence of redundant packets in the connection chain.