optimal flexible spectrum partitioning for multihop wireless networks with software defined radios
We investigate the problem of scheduling and flexible spectrum access in multi-hop networks with software defined radios. We present a primal-dual decomposition to provide an exact solution for this complex optimization problem. We show that obtaining the optimal solution is computationally not feasible. Thus, we first relax the SINR constraint and use a simplified graph-based interference model. Second, we use a simulated annealing (SA) approach for solving the dual sub-problem. Our SA approach is then augmented with a feasibility check so that only SINR-feasible schedules are passed back to the primal.
scheduling cross-layer design dynamic spectrum allocation