Opportunistic packet scheduling in cellular networks with base station antenna arrays

Simple item page
dc.contributor.authorRen, Tianminen_US
dc.contributor.authorLa, Richard J.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:18:26Z
dc.date.available2007-05-23T10:18:26Z
dc.date.issued2006en_US
dc.description.abstractWe study the issue of designing a downlink scheduling policy for a cellular network with base station antenna arrays. We derive an optimal scheduling policy that achieves the throughput region, which is a set of feasible arrival rate vectors that can be stabilized by some scheduling policy. Then, based on the structure of the derived optimal policy whose complexity increases exponentially with the number of users in the system, we propose two heuristic scheduling algorithms with much lower complexity. We demonstrate that our proposed algorithms perform much better than other heuristic algorithms that do not take into consideration the physical layer constraints and/or queue lengths in the sense that they have a larger throughput region than other heuristic algorithms.en_US
dc.format.extent340159 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6583
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2006-4en_US
dc.relation.ispartofseriesCSHCN; TR 2006-2en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleOpportunistic packet scheduling in cellular networks with base station antenna arraysen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2006-4.pdf
Size:
332.19 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports