AN RU SCHEDULING ALGORITHM FOR OFDMA ON A MESH NETWORK

Liu, Alan

Permalink

https://hdl.handle.net/2142/124882 Copy

Description

Title

AN RU SCHEDULING ALGORITHM FOR OFDMA ON A MESH NETWORK

Author(s)

Liu, Alan

Issue Date

2022-05-01

Keyword(s)

WiFi, OFDMA, Mesh networking

Abstract

Orthogonal Frequency Division Multiple Access (OFDMA) was introduced in the latest WiFi standard, IEEE 802.11ax, or WiFi 6, to improve the efficiency of a WLAN network. While OFDMA is well-defined for a single-hop WLAN topology, it is not very well defined for a multi-hop mesh network topology. The main problem when defining OFDMA for a mesh network is Resource Unit (RU) scheduling. When a group of subcarriers in a channel are allocated to a single user, that group of subcarriers is called an RU. This project explores different implementations of RU scheduling algorithms for a mesh network and attempts to define an RU scheduling algorithm to achieve fairness, which is defined by the similarity of the throughput of the first hop compared with that of the second and third hops, while also trying to achieve the lowest possible average latency between packets. Ns3, a network simulator, is then used to simulate OFDMA algorithms on a tree topology, which is used to model mesh networks. Specifying OFDMA for a mesh network is useful since mesh networks are a far cheaper alternative for internet infrastructure than wired networks, so improving the traffic flow in a mesh network for targeted applications like VoIP and video streaming would greatly improve the cost efficiency of internet access in a large building.

Type of Resource

text

Language

eng

Owning Collections