QoS sensitive backpressure scheme over wireless network

Abstract

Congestion in wireless network has been occurring when the traffic sources are uncoordinated and communication bandwidth is finite. Links congestion & links introduce have been losses and delays. The wireless network might not meet its quality of service (QoS) requirements because it has enough congestion, delays grow, queues overflow, and service degrades. However, an alternative way to solve this problem, we has proposed a backpressure algorithm under which no frames are dropped inside a wireless network frame, when congestion has builds up. If congested nodes have sent backpressure feedback to neighboring nodes for informing them to unavailable buffering capacity and stopping them from forwarding another frames until sufficient buffer becomes available. While, the potential advantages in backpressure networks has not allow frames dropping. In this paper, we have proposed backpressure algorithm that aims to detecting violations in parameter negotiation. We has evaluated and compared performance of backpressure with policing mechanisms, namely is Leaky Bucket (LB); Jumping Window (JW); and Triggered Jumping Window (TJW): Simulation results has show that wireless frames and backpressure helps to improve throughputs and non dropped frames compared with other policing mechanisms. In any case, backpressure meets its quality-of-service (QoS) requirements when source traffic was low peak rate.