Non-independent randomized rounding for link scheduling in wireless mesh networks

In this paper, a family of integer linear programs is formulated for performing collision free scheduling in Spatial-TDMA wireless mesh networks. We extend previous formulations for power aware STDMA scheduling to include discrete power transmission and multi-rate support via adaptive constellation selection. Despite the theoretical attractiveness of these (mixed) integer linear programs, STDMA scheduling problems are in general intractable (NP-hard problems). Thus, the practicality of providing optimal solutions is rather limited. To this end, we study approximation algorithms that are based on linear programming relaxation and randomized rounding. Based on these approximation algorithms we focus our study on the trade-off between optimality of the solution and feasibility. Conducted numerical investigations aim to vindicate the claim regarding the strength of randomized algorithms. In that respect the performance of the approximation algorithms under different scenarios, such as the number of active links and number of nodes in the mesh network, is investigate