By Topic

Efficient Routing Algorithms for Multi-Channel Dynamic Spectrum Access Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pal, R. ; Univ. of California, Davis

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.

Published in:

New Frontiers in Dynamic Spectrum Access Networks, 2007. DySPAN 2007. 2nd IEEE International Symposium on

Date of Conference:

17-20 April 2007