Dynamic Programming for Scheduling a Single Route in Wireless Networks

Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic analysis, structures this multi-slot scheduling problem into a polynomial number of particular single-slot sub-problems, thus isolating the hardness. We consider this hard sub-problem, under the useful topology restriction of a single route of many links. We introduced a novel interference model that allows for a dynamic programming (DP) algorithm to solve this sub-problem. The developed DP algorithm provides a solution with a provable accuracy in polynomial time. Incorporating this novel solution in a general resource scheduling framework, a multi-slot scheduling algorithm for single route networks is developed. The excellent accuracy of the algorithms is demonstrated through extensive simulations in various scenarios.