ABSTRACT

In the wireless networks, the routing process is the one of the major concern and it is the fundamental process in the ad hoc networks. To aid this exertion, we proposed an experimental assessment of backpressure mechanisms for wireless networks. By this proposed system, we will address many scheduling and routing problems and also improve the throughput and delay that are mainly caused by the packets at the node transmission.TheBackpressure routing is a compact and increased throughput for wireless networks, but undergoesincreased delays. In routing, the backpressure algorithm is known to afford throughput optimality with dynamic traffic. The important assumption in the backpressure algorithm is that all nodes are benevolent and observe the algorithm rules leading the information exchange and principal optimization requirements.In the proposed system, we demonstrate that how the node is stabilize at the backpressure algorithm routing and also by jointly alleviating the virtual trust queue and the real packet queue.The backpressure algorithm not only accomplishesflexibility, but also tolerates the throughput performance undersecurity attacks. This system is mainly enhances the node behavior at the time of communication and also it improves the node security at the time of many threats in the wireless applications.