Font Size: a A A

Research On Anti-pollution Algorithm In Random Linear Network Coding System

Posted on:2015-07-10Degree:MasterType:Thesis
Country:ChinaCandidate:C LiuFull Text:PDF
GTID:2308330482955038Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Network coding technology changes the traditional storage and forwarding routing method. It allows intermediate nodes to encode data before forwarding. Network coding can make the information transmission rate achieve the network maximum flow. However, due to the characteristics of data fusion, it is more vulnerable to pollution attacks in the process of data transmission, which can destroy the integrity of the data and the availability of the network. Therefore, how to resist pollution attacks in the application of network coding is an urgent need to solve.According to the attacker’s pollution behavior, the corresponding solutions are put forward. Focusing on the anti-tamper, the batch validation method based on homomorphic hash is proposed. The intermediate nodes and destination nodes apply the properties of the homomorphism hash function and global coding vector to detect the integrity of the received multiple data. Focusing on the anti-forgery, redundant information solution based on the step is proposed. The redundant information of each packet changes dynamically with the message vector coded. Even if the malicious nodes has the ability to intercept and analyze data packet formats, the probability of the fake packet through validation close to zero; Focusing on single-source random linear network coding system, the homomorphic signature scheme based on RSA is put forward. The source node calculates homomorphic signature of the raw packets. The intermediate nodes and destination nodes can make use of the public key of source node to verify integrity and authenticity. At the same time, source node can not denial behavior of sending packets; For dual-source random linear network coding system, homomorphic signature scheme based on bilinear pairings is proposed. The intermediate nodes use the properties of the bilinear pairings and the homomorphism signature to verify the data from dual-source nodes. Without private key of source, the intermediate nodes can calculate the homomorphic signature of the new coded packets, which will be the validation of the new coded packet. In accordance with the requirements of safety, verification probability of node and data packets will be dynamically adjusted, which can reduce the overhead of detecting attack.The designed anti-pollution scheme is tested in NS2 network simulation software. The simulation results and theoretical analysis show that the proposed algorithm can effectively resist pollution attack and keep good performance in packet delivery ratio, average end-to-end delay.
Keywords/Search Tags:Network coding, anti-pollution, homomorphism hash, redundant information, adaptive detection
PDF Full Text Request
Related items