Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular Networks
- 1 April 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 320-330
- https://doi.org/10.1109/dyspan.2007.50
Abstract
Existing capacity constrained cellular networks that operate in fixed spectrum bands can be enhanced with capacity-on-demand services using the Coordinated Dynamic Spectrum Access (CDSA) model. In this model, a centralized spectrum broker coordinates access to spectrum in a given region and assigns short term spectrum leases to competing wireless service providers and/or end users. In contrast to existing multi-year cellular spectrum licenses that span large regions, a spectrum broker can grant spectrum leases that are for small regions (e.g.: per base station) and valid for short durations (e.g.: tens of minutes). Fast spectrum allocation algorithms are crucial to the design of scalable spectrum brokers that can provide such realtime spectrum access. In this paper, we address this challenge. Specifically, we formulate the spectrum allocation problem as two optimization problems: first with the objective of maximizing the overall demand (Max-Demand) satisfied among the various base stations and the second with the objective of minimizing the overall interference in the network (Min-Interference) when all the demands of the base stations are satisfied. We show that the optimization problems are NP-hard and design efficient algorithms to solve them. Our simulation results on sample network topologies show that our algorithms scale very well for large network sizes.Keywords
This publication has 19 references indexed in Scilit:
- A new pricing model for next generation spectrum accessPublished by Association for Computing Machinery (ACM) ,2006
- Discontiguous OFDM considerations for dynamic spectrum access in idle TV channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On spectrum sharing gamesPublished by Association for Computing Machinery (ACM) ,2004
- Dynamic spectrum allocation in composite reconfigurable wireless networksIEEE Communications Magazine, 2004
- Channel Assignment and Graph MulticoloringPublished by Wiley ,2002
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Simple heuristics for unit disk graphsNetworks, 1995
- Channel assignment for cellular radio using simulated annealingIEEE Transactions on Vehicular Technology, 1993
- Using tabu search techniques for graph coloringComputing, 1987