On the Complexity of Wireless Uplink Scheduling with Successive Interference Cancellation

Simple item page
dc.contributor.authorMollanoori, Mohseneng
dc.contributor.authorGhaderi, Majideng
dc.date.accessioned2011-07-14T15:39:52Z
dc.date.available2011-07-14T15:39:52Z
dc.date.issued2011-07-14T15:39:52Z
dc.description.abstractIn this paper, we study the problem of uplink scheduling in wireless networks with successive interference cancellation (SIC). With SIC, concurrent transmissions, if properly scheduled, can be successfully decoded at a receiver. The scheduler decides: (i) in which time-slot, and (ii) in what order in a time-slot to decode each transmission in order to maximize the system utility. These two scheduling decisions effectively determine the rates allocated to concurrent transmissions, which in turn determine the throughput and fairness of the system. We consider two scheduling problems, namely the Maximum Throughput Scheduling and Proportional Fair Scheduling. We prove the first problem is NP-hard, while the second seemingly harder problem can be solved in polynomial time.eng
dc.description.refereedNoeng
dc.identifier.department2011-1007-19eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30627
dc.identifier.urihttp://hdl.handle.net/1880/48691
dc.language.isoengeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectWireless Uplinkeng
dc.subject.otherUplink scheduling, wireless networks, successive interference cancellationeng
dc.titleOn the Complexity of Wireless Uplink Scheduling with Successive Interference Cancellationeng
dc.typetechnical reporteng
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2011-1007-19.pdf
Size:
177.3 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Science Research & Publications