Improved Performance Approach for P2P Networks with Network Coding

Network coding based applications are reprehensibly susceptible to malicious pollution attacks. Packets authentication schemes have been well-recognized as the most effective approach to address this security threat. However, existing packets authentication scheme i.e. Times keys scheme utilizes extra bandwidth for transmission of times keys. Bu tin this scheme replay attack can be launched by capturing the Time keys by the attacker, and attacker can introduce a malicious packet in network. As to save bandwidth we are using network coding this attack may get prorogated throughout the network and result into pollution attack. The solution to avoid the problems in Time keys scheme is based on the concept that the source and the destination must agree on the keys along with the network coding process. This scheme of agreeing on the keys is known as adaptive TESLA scheme. Using this proposed scheme the effect of pollution attack and collusion attack is measured in terms of real packets corrupted and dropped. The proposed TESLA scheme for network coding is also compared with times keys in terms of bandwidth usages.