Library Header Image
LSE Research Online LSE Library Services

Joint routing and scheduling via iterative link pruning in wireless mesh networks

Papadaki, Katerina ORCID: 0000-0002-0755-1281 and Friderikos, Vasilis (2008) Joint routing and scheduling via iterative link pruning in wireless mesh networks. In: Wireless Communications and Networking Conference, 2008-03-31 - 2008-04-03, Las Vegas, United States, USA.

Full text not available from this repository.

Identification Number: 10.1109/WCNC.2008.410


A family of mathematical programs for both the un- capacitated and capacitated joint gateway selection and routing (U/C-GSR) problem in wireless mesh networks are presented. We detail a reformulation using the shortest path cost matrix (SPM) and prove that it gives the optimal solution when applied to the uncapacitated case but can lead to an arbitrary large optimality gap in the capacitated case. Furthermore, an augmented mathematical program is developed where link capacities are allowed to take values from a discrete set depending on the link distance. In this case, the multi-rate capabilities of WMNs (via, for example, adaptive modulation and coding) can be modeled. Evidence from numerical investigations shows that using the SPM formulation realistic network sizes of WMNs can be solved.

Item Type: Conference or Workshop Item (Paper)
Official URL:
Additional Information: © 2008 The Authors
Divisions: Management
Subjects: T Technology > T Technology (General)
Date Deposited: 09 Oct 2013 12:10
Last Modified: 06 Jul 2024 05:33

Actions (login required)

View Item View Item