Throughput of wireless Mesh network with joint routing,channel assignment and scheduling

The joint optimization problem of maximizing throughput of multi-interface multi-channel random mesh network was addressed.The problem was formulated into a linear programming(LP) problem by analyzing the constraint models of routing,channel assignment and scheduling on the premise of proportional fairness.Low complexity algorithms were further proposed to derive lower and upper capacity bounds.Simulation results show that the lower/upper bound ratios were all above 85% under different number of available channels,interfaces and gateways in a 25-node random network.Then capacity laws with respect to all the factors were further studied.One interface can utilize several channels and edge effect on capacity grows less as gateway number grows.