Skip to Main content Skip to Navigation
Conference papers

Use of a Weighted Conflict Graph in the Channel Selection Operation for Wi-Fi Networks

Lafdal Abdelwedoud 1, 2 Anthony Busson 1 Isabelle Guérin-Lassous 1 
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : Allocation algorithms in IEEE 802.11-based WLAN, that consist to associate to each AP a channel, are mainly based on a conflict graph that represents the conflicts (interference, CCA detection, etc.) between APs. In this paper, we propose to use an enriched version of the conflict graph, namely a weighted conflict graph. This latter models the CCA detection that can be total (all transmissions are detected) or partial. Beside, a model is given to compute the throughput of each AP for a given allocation. This model is combined to a greedy algorithm that aims to find the allocation that maximizes the proportional fairness. Simulations based on the recent IEEE 802.11ax amendment are carried out for small WLANs with a few APs and very dense networks. Results show that when the network is dense or constrained, there is a gain to consider partial detection.
Document type :
Conference papers
Complete list of metadata
Contributor : Anthony Busson Connect in order to contact the contributor
Submitted on : Monday, June 21, 2021 - 2:58:27 PM
Last modification on : Tuesday, May 17, 2022 - 2:34:26 PM
Long-term archiving on: : Wednesday, September 22, 2021 - 6:45:31 PM


Files produced by the author(s)



Lafdal Abdelwedoud, Anthony Busson, Isabelle Guérin-Lassous. Use of a Weighted Conflict Graph in the Channel Selection Operation for Wi-Fi Networks. WONS 2021 - 16th Wireless On-demand Network systems and Services Conference, Mar 2021, Virtual Conference, France. pp.1-4, ⟨10.23919/WONS51326.2021.9415558⟩. ⟨hal-03266173⟩



Record views


Files downloads