Inference of Wi-Fi Busy Time Fraction based on Markov Chains - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2022

Inference of Wi-Fi Busy Time Fraction based on Markov Chains

Abstract

IEEE 802.11 has emerged as a vital wireless network access technology for mobile devices. By providing the potential for high connectivity speeds, this technology has led to a huge rise in the number of access points (APs). In such environments, mobile devices have the choice to join several Wi-Fi networks. Despite its importance to user Quality of Experience (QoE), the AP selection is still trivial since it focuses at best on the received signal strength if not only the user's history. Crucial metrics that capture the overall dynamics of the AP load condition, such as the network load, are not taken into account. In this paper, we propose to use the Busy Time Fraction (BTF) as a metric to choose the best AP to attach to. The BTF level of a given channel is inferred based on the frame aggregation scheme proposed since the 802.11n standard. In this regard, we build a proof of concept system, FAM (Frame Aggregation based method) that leverages the theoretical frame aggregation levels of a probe traffic returned by two analytical Markovian models and the measured ones in order to estimate not only the BTF but also the nature of the traffic. We validate the accuracy of our proposed approach against ns-3 simulations under several scenarios.
Fichier principal
Vignette du fichier
Ad_Hoc_networks_journal_nour_2022.pdf (884.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03641948 , version 1 (14-04-2022)

Identifiers

  • HAL Id : hal-03641948 , version 1

Cite

Nour El Houda Bouzouita, Anthony Busson, Hervé Rivano. Inference of Wi-Fi Busy Time Fraction based on Markov Chains. [Research Report] Inria Lyon. 2022, pp.1-35. ⟨hal-03641948⟩
68 View
82 Download

Share

Gmail Facebook X LinkedIn More