Problem statement: An important and challenging problem is that of tracing DOS/DDOS attack source. IP traceback is the process of identifying the actual source(s) of attack packets, So that the attackers can be held accountable as also in mitigating them, either by isolating the attack sources or by filtering packets for away from the victim. Several IP traceback schemes have been proposed to solve this problem. Among many IP traceback schemes, a recent development was Directed Geographical Traceback (DGT). Though multidirectional two-dimensional DGT schemes were available, in the real scenario, three dimensional, Multidirectional DGT has potential applications. Approach: The Direction Ratio Algorithm (DRA) has the limitation of the impossibility of ensuring sufficient unused space in the packet header for the complete Direction Ratio List (DRL) especially when the length of the path is not known apriori. To overcome this, DRSA was proposed. The methods used in DRSA were random sampling methods, where the sufficient numbers of samples were drawn; one can reconstruct the path of the attack packets and trace the attack source. Results: In this study those limitation had been overcome using Direction Ratio Sampling Algorithm (DRSA) which works well for 3-dimensional, multi-directional, geographical IP traceback. This approach enables the attack path reconstruction was easily possible and hence a victim can typically reconstruct the path after receiving 75 packets from the attacker. This same algorithm can efficiently discern multiple attacks. When attackers from different sources produce disjoint edges in the tree structure of reconstruction, the number of packets needed to reconstruct each path is independent of other paths. Conclusion: DRSA was found to be a robust scheme of attack path reconstruction in Geographical traceback
Integrating an efficient Error detection and correction scheme with less encoding and decoding complexity to support the distribution of keying material in a secure group communication is an important issue, since the amount of information carried out in the wireless channel is high which produces more errors due to noise available in the communication channel. Moreover, the key must be sent securely to the group members. In this paper, we propose a new efficient group key computation protocol that provides more security and also integrates an encoding method in sender side and decoding method in the receiver side. To achieve security in key computation process, we propose Euler's totient function based Diffie-hellman key distribution protocol. To provide efficient error detection and correction method while distributing the Keying and re-keying information, we introduce tanner graph based encoding stopping set construction algorithm in sender and receiver side of the group communication. Two major operations in this scheme are joining and leaving operations for managing group memberships. The encoding and decoding complexity of this approach is computed in this paper and it is proved that this proposed approach takes less decoding time complexity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.