Optimization of an Error Minimizing or Localizing Jammers in Wireless Networks

Wireless networks have already grown considerably and will certainly go on doing so, consequently the security and secrecy has become a critical issue. Earlier research efforts have mostly solved this problem (i) efficient detection and elimination of cheating node, (ii) range-based localization without using radio coverage and (iii) range-based localization in the presence of cheating node. The proposed system guarantees an upper bound on the localization jamming error. Most of the malicious node detection techniques are based on consensus building or geometric estimation, and are rather restrictive with high false-positive or false-negative rate. In this paper is the design and implementation of an efficient and lightweight jamming localization algorithm. Our technique control scheme guarantees stability robustness to multiple jamming nodes in different channels and changeful presented bit-rate (PBR) bandwidth. It also achieves two expectant goals, i. e. it ensures convergence of queue length to the desired steady-state value and satisfies a weighted fairness condition. The higher priority queue results in reducing the input delay of packets which results in traffic control mechanisms, the scheduling is assigned on FIFO scheduling mechanisms. The algorithm good performance of jamming location. Simulation results show that the control system is rapid, robust, and adaptive and the quality of service (QOS) is guaranteed.