Pseudo Random Sequence Generating Strategy in CH-DSSS Wireless Network
Communication and network security is very important in web and mobile business systems. To enhance the performance of anti-jamming and counterreconnaissance, code-hopping scheme is applied in DSSS wireless network. Besides the correlation of pseudo random sequence, which is momentous for multiuser system, the linear complexity and nonlinear complexity of codes are crucial for communication security. A chaotic sequence generator based on digital filter structure is proposed. Two DFS units arc combined, whereas the addition and convolution operation are modified. Berlekamp-Massey iterative algorithm is used to analyze the linear complexity of Cold sequence and DFS chaotic sequence, and the production algorithm is used to analyze the Lempel-Ziv complexity. It shows that sequences with low complexity will tamper with the performance of anti-jamming and counterreconnaissance, whereas, the DFS chaotic sequence has the almost perfect linear complexity and finer Lempel-Ziv complexity, so application of DFS chaotic sequence is preferable in CH-DSSS wireless network for communication security.
CH-DSSS communication security complexity chaos pseudo random sequence
Jinglei Xia Shenru Zhang Jianhua Fan
Telecommunication TechnoIogy Institute PLA Univ. of Sci. &Tech Nanjing, P. R. China Institute of Sciences PLA Univ. of Sci. &Tech Nanjing, P. R. China Telecommunication Technology Institute PLAUniv. of Sci. &Tech Nanjing, P. R. China
国际会议
成都
英文
615-618
2010-12-17（万方平台首次上网日期，不代表论文的发表时间）