Robust Round Weighting with Traffic Uncertainty in Wireless Mesh Networks
Résumé
Wireless Mesh Networks have attracted attention because of the advantages of these broadband access networks. The Round Weighting Problem has been addressed as an effective relaxation of the joint routing and scheduling in the case of steady state operating networks. We propose a new robust model considering traffic demand uncertainty, efficiently solved by column generation, and quantify the price of robustness, i.e., the additional cost to pay in order to obtain a feasible solution for the robust scheme. Results show that the robust approach has the potential to outperform existing methods.