The latest IEEE 802.11 amendments provide support to directional communications in the Millimeter Wave spectrum and, thanks to the wide bandwidth available at such frequencies, makes it possible to wirelessly approach several emergent use cases, such as virtual and augmented reality, telepresence, and remote control of industrial facilities. However, these applications require stringent Quality of Service, that only contention-free scheduling algorithms can guarantee. In this paper, we propose an end-to-end framework for the joint admission control and scheduling of periodic traffic streams over mmWave Wireless Local Area Networks based on Network Simulator 3, a popular full-stack open-source network simulator. Moreover, we design a baseline algorithm to handle scheduling requests, and we evaluate its performance with a full-stack perspective. The algorithm is tested in three scenarios, where we investigated different configurations and features to highlight the differences and trade-offs between contention-based and contention-free access strategies.
A Simulation Framework for Contention-Free Scheduling on WiGig
Matteo Drago;Tommy Azzino;Mattia Lecci;Andrea Zanella;Michele Zorzi
2021
Abstract
The latest IEEE 802.11 amendments provide support to directional communications in the Millimeter Wave spectrum and, thanks to the wide bandwidth available at such frequencies, makes it possible to wirelessly approach several emergent use cases, such as virtual and augmented reality, telepresence, and remote control of industrial facilities. However, these applications require stringent Quality of Service, that only contention-free scheduling algorithms can guarantee. In this paper, we propose an end-to-end framework for the joint admission control and scheduling of periodic traffic streams over mmWave Wireless Local Area Networks based on Network Simulator 3, a popular full-stack open-source network simulator. Moreover, we design a baseline algorithm to handle scheduling requests, and we evaluate its performance with a full-stack perspective. The algorithm is tested in three scenarios, where we investigated different configurations and features to highlight the differences and trade-offs between contention-based and contention-free access strategies.File | Dimensione | Formato | |
---|---|---|---|
2105.11865.pdf
accesso aperto
Tipologia:
Preprint (submitted version)
Licenza:
Accesso libero
Dimensione
134.76 kB
Formato
Adobe PDF
|
134.76 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.