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 c...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
