Abstract—In IEEE 802.11 based Wireless Mesh Networks (WMNs), unfair bandwidth sharing may arise since the CSMA/CA protocol is designed to provide per station fairness only in one hop. As the hop count from a mobile client to the gate-way node increases, throughput of the node decreases drastically

throughput. In literature many solutions aimed at improving TCP fairness through modifications of the congestion avoidance algorithm have been proposed. However, all these solutions are not suitable for wireless networks because they still interpret transmission losses as congestion clue while it is not

fundamental tradeoff between throughput and fairness. We propose a new scheduling algorithm called Limited Resource Earliest Deadline (LRED) that couples redundant scheduling with deadline-driven scheduling in a flexible way by using a simple tunable parameter to exploit this tradeoff. Our evaluation of LRED

Low throughput due to unfairness is a key problem in multirate wireless local area networks. To promote fairness and hence throughput, T 2-Fair groups flows according to their average data rate, provides each group fair time allocations and ensures throughput fairness for flows in each group. Since

We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log log N) per packet (inclusive of sorting costs

Abstract We describe an ejjicient fair queuing scheme, Leap

the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making

router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor

combined with Leaky Bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees, and is efficient in that each of the servers is work

mechanisms that keep throughput high but avemge queue sizes low. In the absence of explicit feedback from the gateway, there are a number of mechanisms that have been proposed for transport-layer protocols to maintain high throughput and low delay in the network. Some of these proposed mechanisms