Library Header Image
LSE Research Online LSE Library Services

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

Papadaki, Katerina, Friderikos, Vasilis, Wisely, David and Aghvami, Hamid (2006) Non-independent randomized rounding for link scheduling in wireless mesh networks. In: IEEE Vehicular Technology Conference Fall, 2006-09-25 - 2006-09-28, Montreal, Canada.

Full text not available from this repository.

Identification Number: 10.1109/VTCF.2006.245


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 investigated

Item Type: Conference or Workshop Item (Paper)
Official URL:
Additional Information: © 2006 The Authors
Divisions: Management
Subjects: T Technology > T Technology (General)
Date Deposited: 09 Oct 2013 12:21
Last Modified: 20 Oct 2021 03:02

Actions (login required)

View Item View Item