Optimal Flexible Spectrum Access in Wireless Networks with Software Defined Radios

  • Authors:
  • M. F. Uddin;H. M.K. Al-Azemi;C. Assi

  • Affiliations:
  • ECE Dept., Concordia Univ., Montreal, QC, Canada;-;-

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

We investigate the problem of flexible spectrum access in multihop wireless networks. We assume radios that are capable of transmitting on channels of contiguous frequency bands and which do not require any sophisticated processing. Because these radios can flexibly configure their transmissions anywhere in the available frequency band, the spectrum becomes vulnerable to fragmentation and interference. We consider the joint problem of routing, link scheduling and spectrum allocation where scheduling feasibility is considered under the physical interference (SINR) constraint. We present a primal-dual decomposition for this complex optimization problem based on column generation. We show that obtaining the optimal solution to this problem is computationally not feasible, except for very small networks. We thus adopt a two-fold method to circumvent the complexity while yielding practical solutions. First, we relax the SINR constraint and use a simplified graph-based model for the interference. Second, we use a simulated annealing (SA) approach to solve the dual subproblem. Our SA approach however is augmented with an SINR feasibility check. Our results confirm that the primal-dual decomposition method using SA substantially reduces the computation time and achieves near optimal solutions. The results also reveal that substantial improvement in network performance is obtained with flexible spectrum assignment which results from its capability of better managing the interference in the network.