Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular 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

2 Author(s)
Subramanian, A.P. ; State Univ. of New York at Stony Brook, Stony Brook ; Gupta, H.

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.

Published in:

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

Date of Conference:

17-20 April 2007