Accession Number:

ADA393005

Title:

Dynamic Spectrum Allocation Algorithms

Descriptive Note:

Final rept. 1 Dec 1999-30 Nov 2000

Corporate Author:

PITTSBURGH UNIV PA

Personal Author(s):

Report Date:

2000-11-30

Pagination or Media Count:

9.0

Abstract:

The setting for the spectrum allocation problems that we are currently considering consists of n tasks i.e. flight tests. Each task has a bandwidth requirement, and a length. Thus each test can be thought of as a rectangle, with the vertical height of the rectangle being the bandwidth requirement. The scheduling space is a larger rectangle space, with height equal to the total spectrum available and length equal to the time period to be scheduled e.g. a day. In order to avoid interference, two tasks must be placed in such a way that they do not overlap in this space. Additionally we assume that for each task there is a range of times at which it may be scheduled e.g. it may be specified that a task should be scheduled between 10AM and 3PM, and an optional integer benefitpriority for the schedule in our tests to date, all jobs have had equal priorities.

Subject Categories:

  • Operations Research
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE