Evaluating the Vulnerability of Network Traffic
Using Joint Security and Routing Analysis
The Joint analysis of security and routing protocols together in wireless networks brings out the vulnerabilities of secure network traffic that would otherwise remain undetected when security and routing protocols are examined independently.Here, a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols is formulated. set theoretic and circuit theoretic interpretations of the security of network traffic are used. These approaches allow a network analyst or an adversary to determine weaknesses in the secure network. The node capture attacks using the vulnerability metric has been formalised as a nonlinear integer programming minimization problem and propose the GNAVE(Greedy Node capture Approximation using Vulnerability Evaluation.
) algorithm. the availability of security parameters to the adversary is discussed and reach the conclusion that unknown parameters can be estimated using probabilistic analysis. The vulnerability evaluation using the proposed metrics and node capture attacks are demonstrated using the GNAVE algorithm through detailed examples and simulation.
The prevoius studies on node capture attacks mentioned here have all focused on the ability of an adversary to compromise the security of single-hop wireless links. But messages in a wireless network traverse multiple links and paths between a source and destination node, and a message may be compromised by traversing a single insecure link.
a message may be compromised by traversing a single insecure link as the messages in a wireless network traverse multiple links and paths between a source and destination node.
A class of metrics for the vulnerability of network traffic is defined and the minimum cost node capture attack problem as a nonlinear integer program using the defined vulnerability metrics is formulated. GNAVE algorithm, a Greedy Node capture Approximation using Vulnerability Evaluation, to approximate the minimum cost node capture attack.
-When information about the key assignment protocol is hidden from the adversary using privacy-preserving protocols, the indeterminate quantities can be estimated probabilistically without significant degradation in the attack performance.
-Analogies to evaluate the message security.
-the impact of node capture attacks using the GNAVE algorithm in wireless networks is demonstrated with examples of both classical routing and network coding protocols.Also, the impact of node capture attacks using the GNAVE algorithm in wireless networks is compared with examples of both classical routing and network coding protocols.
Here we maintain the overall integrity and confidentiality among nodes path.
We give secure in least link also.
Front End : Java Swing
Back End : SQL Server
Technology : ServerSocket
Hard disk : 40 GB
RAM : 256 Ram
Processor : Pentium IV 3GHZ
The full text pdf is available in the IEEE digital library:
Also i got this one: