On the Capacity of Multi-Channel Multi-Radio Ad Hoc Networks with Delay Constraints

Technologies of ad hoc networks have developed rapidly with the research of wireless networks in recent years. More concern has been put on estimating the network capacity instead of link capacity. To investigate how the three factors, topology of the links, ratio between the number of radios and channels, and channel switch delay influence the network capacity, this paper proposes a single-path routing algorithm based on the fast polynomial time approximation scheme (FPTAS). Two greedy algorithms are also presented here as the ways to get lower bounds of the network capacity. The result implies that the dynamic greedy algorithm achieves a much better performance due to the fact that it first estimates the near- optimal bound with graph theory, and then tries to reach it using tabu research.