Transmission Time Minimization Algorithms in Multihop Wireless Networks with Multiple Channels

We propose and evaluate the performance of communication algorithms for the transmission time minimization problem on multihop wireless networks modelled by directed graphs with multiple channels. We derive a lower bound for the minimum transmission time so that our heuristic solutions can be compared with optimal schedules. We present one randomized routing algorithm and nine heuristic transmission scheduling algorithms and demonstrate by extensive simulations on random multihop wireless networks that all these transmission scheduling algorithms have average-case performance reasonably close to that of optimal schedules.