<?xml version='1.0' encoding='utf-8'?>
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="3.7" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
  <titleInfo>
    <title>SPECTRUM ALLOCATIONS ALGORITHMS IN WIRELESS NETWORKS</title>
  </titleInfo>
  <name>
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/cre">creator</roleTerm>
    </role>
    <namePart>Xu, Ping</namePart>
  </name>
  <name authority="wikidata" authorityURI="https://www.wikidata.org" valueURI="https://www.wikidata.org/wiki/Q102079629">
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/ths">advisor</roleTerm>
    </role>
    <namePart>Li, Xiang-Yang</namePart>
  </name>
  <abstract>All wireless devices rely on access to the radio frequency spectrum, which has been chronically regulated by static spectrum allocation policies. With the recent fast growing of spectrum-based services and devices, the remaining spectrum available for future wireless services is being exhausted, known as the spectrum scarcity problem. The current fixed spectrum allocation scheme leads to significant spectrum white spaces (including spectral, temporal, and geographic), where many allocated spectrum blocks are used only in certain geographical areas and/or in brief periods of time. In this work, we design and analyze variant spectrum allocation algorithms for better spectrum utilization and study some fundamental performance bounds for networks with opportunistic spectrum utilization. We first propose spectrum allocation algorithms for offline model, in which all spectrum requests are known when allocation decision is made. Then we also addresse the problems in online model, where allocation decision should be made when only a few spectrum requests are known. In the online model, we focus on two different cases. The first one assumes no statistic of future spectrum requests are known, and the second one assumes some statistic is known or can be learned. For all these models, we design efficient spectrum allocation methods and analytically prove most of them are asymptotically optimal. Our extensive simulation results also verify our theoretical conclusion.</abstract>
  <note type="provenance">Submitted by Dana Lamparello (dlampare@iit.edu) on 2011-11-30T22:23:42Z No. of bitstreams: 2 Ping Xu_10422395.pdf: 738327 bytes, checksum: 9032a5fcb6f9210353e4943904a612e7 (MD5) Advisor's signature.pdf: 268870 bytes, checksum: d196e2a9f6dcdb8213dbeedf0b4e74e1 (MD5)</note>
  <note type="provenance">Made available in DSpace on 2011-11-30T22:23:42Z (GMT). No. of bitstreams: 2 Ping Xu_10422395.pdf: 738327 bytes, checksum: 9032a5fcb6f9210353e4943904a612e7 (MD5) Advisor's signature.pdf: 268870 bytes, checksum: d196e2a9f6dcdb8213dbeedf0b4e74e1 (MD5) Previous issue date: 2011-05</note>
  <note type="thesis">Ph.D. in Computer Science, May 2011</note>
  <originInfo>
    <dateCaptured>2011-04-26</dateCaptured>
  </originInfo>
  <originInfo>
    <dateCreated keyDate="yes">2011-05</dateCreated>
  </originInfo>
  <identifier type="hdl">http://hdl.handle.net/10560/2351</identifier>
  <language>
    <languageTerm type="code" authority="rfc3066">en</languageTerm>
  </language>
  <typeOfResource authority="aat" valueURI="http://vocab.getty.edu/page/aat/300028029">Dissertation</typeOfResource>
  <physicalDescription>
    <digitalOrigin>born digital</digitalOrigin>
    <internetMediaType>application/pdf</internetMediaType>
  </physicalDescription>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.org">In Copyright</accessCondition>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.orgURI">http://rightsstatements.org/page/InC/1.0/</accessCondition>
  <accessCondition type="restrictionOnAccess">Restricted Access</accessCondition>
  <name type="corporate">
    <namePart>CS / Computer Science</namePart>
    <affiliation>Illinois Institute of Technology</affiliation>
    <role>
      <roleTerm type="text">Affiliated department</roleTerm>
    </role>
  </name>
</mods>