Library Header Image
LSE Research Online LSE Library Services

Approximate dynamic programming for link scheduling in wireless mesh networks

Papadaki, Katerina ORCID: 0000-0002-0755-1281 and Friderikos, Vasilis (2008) Approximate dynamic programming for link scheduling in wireless mesh networks. Computers and Operations Research, 35 (12). pp. 3848-3859. ISSN 0305-0548

Full text not available from this repository.
Identification Number: 10.1016/j.cor.2007.02.010


In this paper a novel interference-based formulation and solution methodology for the problem of link scheduling in wireless mesh networks is proposed. Traditionally, this problem has been formulated as a deterministic integer program, which has been shown to be -hard. The proposed formulation is based on dynamic programming and allows greater flexibility since dynamic and stochastic components of the problem can be embedded into the optimization framework. By temporal decomposition we reduce the size of the integer program and using approximate dynamic programming (ADP) methods we tackle the curse of dimensionality. The numerical results reveal that the proposed algorithm outperforms well-known heuristics under different network topologies. Finally, the proposed ADP methodology can be used not only as an upper bound but also as a generic framework where different heuristics can be integrated.

Item Type: Article
Official URL:
Additional Information: © 2007 Elsevier Ltd
Divisions: Management
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 07 Dec 2009 17:29
Last Modified: 16 May 2024 00:45

Actions (login required)

View Item View Item