Decoupling Link Scheduling Constraints in Multi-Hop Packet Radio Networks
IEEE Transactions on Computers
A new model for scheduling packet radio networks
Wireless Networks
Scheduling algorithms for packet radio networks
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Assignment methods for spatial reuse TDMA
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Neuro-Dynamic Programming
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
Gateway selection and routing in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient spatial TDMA scheduling in wireless networks
Computers and Operations Research
Efficient group multicast node scheduling schemes in multi-hop wireless networks
Computer Communications
| Hi-index | 0.01 |
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 NP-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.