Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
IEEE Transactions on Mobile Computing
Performance analysis under finite load and improvements for multirate 802.11
Computer Communications
Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
Fast-converging scheduling and routing algorithms for WiMAX mesh networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
| Hi-index | 0.00 |
Wireless Mesh Networks are mainly used for providing last-mile broadband wireless access. It is then highly recommended to ensure fairness among different users regardless of their physical locations while increasing their throughput. In this paper, we construct weighted contention graphs for the calculation of maximal capacity per flow and then we search how to maintain fairness per aggregate source-destination flow under bursty traffic. We propose a distributed dynamic contention window algorithm that uses an additional queue per node and we analytically show that our proposal can improve fairness in wireless mesh networks. We also show by simultions on OMNET++ the efficiency of the proposed solution even in bursty conditions. Thanks to the proposed solution, throughput capacity is much more fair compared to basic multihop networks.