A Direct Discrimination Packet Flow Based Improving Security against Reactive Traffic Attacks in Wireless Communication

Abstract

The wireless networks is most difficult of selective filling attacks. If jammer localizations and resistance routing are left alone, both are very promising, and the service overhead is still below the real-time requirements. To propose a new Direct Discriminant Packet Flow Exploration [DDPFE] algorithm based on network utility maximization (NUM) to resolve the centralized reaction disturbance optimization problem in multi-source network without any lose to send the data. The impact of the networks is estimated through interference and combine these estimates with the ability to assign problems in this type of attacks. To overcome this type of physical-layer characterization of cryptographic primitives attacks using a Cooperative Crypto Riddle Hiding Algorithm (CCRHA) for the control channel jamming problem in-network, which takes advantage of the transfer the data using the Ad-hoc network. The resolution to detect the schema attacks and isolate the nodes for the threshold. CCRHA Presenting to find selectively invasive attackers in wireless networks. Multiple metrics are measured to detect areas of interference of the wireless network. Multi-measurement method considered Packet Delivery Ratio (PDR) and signals strength variation as parameters to detect the selective jamming attacks.