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

Salim Nahle 1 Naceur Malouch 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01295174
Contributor : Lip6 Publications <>
Submitted on : Wednesday, March 30, 2016 - 2:56:13 PM
Last modification on : Thursday, March 21, 2019 - 1:06:44 PM

Identifiers

Citation

Salim Nahle, Naceur Malouch. Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks. IEEE Global Telecommunications Conference, GLOBECOM 2009, Nov 2009, Honolulu, HI, United States. pp.1-7, ⟨10.1109/GLOCOM.2009.5425230⟩. ⟨hal-01295174⟩

Share

Metrics

Record views

55