Fairness and QoS in multihop wireless networks
Jangeun Jun, Mihail L. Sichitiu
Abstract
Jangeun Jun, Mihail L. Sichitiu
Abstract
In multihop wireless networks, fair allocation of bandwidth among different nodes is one of the critical problems that affect the serviceability of the entire system. Although there is significant research on the fairness issues in single-hop wireless networks, research on multihop fairness is rarely found in the literature. We study various queuing schemes for multihop wireless networks and examine the fairness and throughput performance of each scheme. Each scheme offers a different degree of fairness. While relatively simple queuing schemes require less hardware and processing budget, they inevitably lack good fairness and performance. In contrast, the scheme that provides fairness requires per-flow (i.e., network-layer flow) queuing. Furthermore, we show that in order to achieve the optimal bandwidth utilization, the medium access control (MAC) layer should be able to support different priorities. Without such a MAC-layer QoS scheme, in the worst case, the bandwidth utilization can be degraded by O(N), where N is the number of end users. We theoretically investigate the pros and cons of different queuing schemes and verify the analytical results with detailed simulations.
OpenAlex reports 122 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In multihop wireless networks, fair allocation of bandwidth among different nodes is one of the critical problems that affect the serviceability of the entire system. Although there is significant research on the fairness issues in single-hop wireless networks, research on multihop fairness is rarely found in the literature. We study various queuing schemes for multihop wireless networks and examine the fairness and throughput performance of each scheme. Each scheme offers a different degree of fairness. While relatively simple queuing schemes require less hardware and processing budget, they inevitably lack good fairness and performance. In contrast, the scheme that provides fairness requires per-flow (i.e., network-layer flow) queuing. Furthermore, we show that in order to achieve the optimal bandwidth utilization, the medium access control (MAC) layer should be able to support different priorities. Without such a MAC-layer QoS scheme, in the worst case, the bandwidth utilization can be degraded by O(N), where N is the number of end users. We theoretically investigate the pros and cons of different queuing schemes and verify the analytical results with detailed simulations.
Key concepts: Fairness measure, Fair queuing, Computer science, Maximum throughput scheduling, Computer network, Queueing theory, Max-min fairness, Quality of service