Clique-Based Utility Maximization in Wireless Mesh Networks-Algorithm, Simulation, and Mathematical Analysis

Compared with cellular networks, wireless mesh networks (WMNs) need more careful design for resource allocation. To this end, we develop a clique-based proportional fair scheduling (CBPFS) algorithm for WMNs. Furthermore, we obtain a closed-form model to quantify the throughput of connection links and traffic flows in multi-hop transmissions. We use the derived analytical framework to estimate the throughput of CBPFS and compared it with simulations. It is the first time a mathematical model is developed to quantify the throughput of links and end-to-end flows in a multi-hop network where links are proportionally fair scheduled.