In the pioneer work, [13] shows that in a wireless network with n identical nodes, the per-node throughput is ฆ(ใ 1 nlogn ) assuming the random node placement and communication pattern.
It becomes ฆ(ใ1 n) assuming the optimal node placement and communication pattern. The work in [14] aims to maximize the network throughput and meanwhile to guarantee the fairness among traffic flows destinated to multiple gateways.
Both [15][16] propose LP based routing algorithms and channel assignment algorithms in multi-radio, multi-channel WMNs.
In particular, [15] solves the joint routing and channel assignment problem which intends to optimize the overall network throughput subject to the fairness constraint.