Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks

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 ca...

Full description

Saved in:
Bibliographic Details
Published inGLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference pp. 1 - 7
Main Authors Nahle, S., Malouch, N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2009
Subjects
Aggregates
Algorithm design and analysis
Heuristic algorithms
Proposals
Queueing analysis
Spread spectrum communication
Telecommunication traffic
Throughput
Traffic control
Wireless mesh networks
Online AccessGet full text

Cover

More Information
Summary: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 simulations 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.
ISBN:9781424441488
142444148X
ISSN:1930-529X
2576-764X
DOI:10.1109/GLOCOM.2009.5425230