Download now Free registration required
Wireless Mesh Networks have been an emerging technology in the past years. They 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, the authors construct weighted contention graphs for the calculation of maximal capacity per flow and then they search how to maintain fairness per aggregate source-destination flow under bursty traffic. They propose a distributed dynamic contention window algorithm that uses an additional queue per node and they analytically show that their proposal can improve fairness in wireless mesh networks.
- Format: PDF
- Size: 218.3 KB