<?xml version="1.0"?>
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" version="3.7" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
  <titleInfo>
    <title>Process to Allocate Channels in a Sectorized Cellular Network</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>Nguyen, Vincent Ahndzung</namePart>
  </name>
  <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>Wan, Peng-jun</namePart>
  </name>
  <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>Frieder, Ophir</namePart>
  </name>
  <abstract>The invention disclosed is a process to allocate channels in a sectorized cellular network. A system of allocating cellular frequencies (channels) to the sectors among the cells within a tile is disclosed which maximizes channel set usage within the tile while avoiding co-channel interference between cells. According to the present system, no infrastructure rebuild is required. The disclosed approach further supports all currently used cellular technology. By alternating and rotating the channel assignments across sectors, what is a seemingly locally poor algorithm utilizing additional local channels is actually a globally good algorithm which is efficient in terms of the total number of channels used owing to short reuse distance and low number of cell types.</abstract>
  <note type="provenance">Submitted by Aric Ahrens (ahrens@iit.edu) on 2012-05-02T17:42:56Z No. of bitstreams: 1 8165591.pdf: 157106 bytes, checksum: 3797509672b816ffdea6f807fa5f5f0a (MD5)</note>
  <note type="provenance">Made available in DSpace on 2012-05-02T17:42:56Z (GMT). No. of bitstreams: 1 8165591.pdf: 157106 bytes, checksum: 3797509672b816ffdea6f807fa5f5f0a (MD5) Previous issue date: 2012-04-24</note>
  <note type="funding">Illinois Institute of Technology</note>
  <originInfo>
    <dateCaptured>2012-05-02</dateCaptured>
  </originInfo>
  <originInfo>
    <dateCreated keyDate="yes">2012-04-24</dateCreated>
  </originInfo>
  <identifier type="pn">8,165,591</identifier>
  <identifier type="hdl">http://hdl.handle.net/10560/2735</identifier>
  <language>
    <languageTerm type="code" authority="rfc3066">en</languageTerm>
  </language>
  <abstract>United States Patent</abstract>
  <typeOfResource authority="gmgpc" valueURI="http://id.loc.gov/vocabulary/graphicMaterials/tgm007520">Patent</typeOfResource>
  <physicalDescription>
    <digitalOrigin>reformatted digital</digitalOrigin>
    <internetMediaType>application/pdf</internetMediaType>
  </physicalDescription>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.org">No Copyright - United States</accessCondition>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.orgURI">http://rightsstatements.org/page/NoC-US/1.0/</accessCondition>
  <accessCondition type="restrictionOnAccess">Open Access</accessCondition>
</mods>
