Efficient Routing Algorithms for Multi-Channel Dynamic Spectrum Access Networks

This paper addresses the problem of spectrum-aware data-adaptive routing in multi-channel, single-radio (MC-SR) multi-hop dynamic spectrum access (DSA) networks. We develop a scalable and simple to implement data-adaptive routing scheme that routes varied amounts of data from a given source to a destination through fast routes. For a given amount of data, our routing scheme takes into account the capacity (per unit of time) of the links, the available spectrum, the link disruption probabilities as well as the link propagation time between nodes. We model our routing problem as a combinatorial optimization task with two objectives. Our solution methodology generates Pareto optimal paths in polynomial time as there do not exist paths in general which optimize both objectives simultaneously. We generalize our routing method for broadcasting and multicasting scenarios. To the best of our knowledge this work is the first analytical treatment of the problem of spectrum-aware routing in DSA networks.