Delay bounded packet scheduling of bursty traffic over wireless channels
dc.citation.bibtexName | article | en_US |
dc.citation.firstpage | 125 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.journalTitle | IEEE Transactions on Information Theory | en_US |
dc.citation.lastpage | 144 | en_US |
dc.citation.volumeNumber | 50 | en_US |
dc.contributor.author | Rajan, Dinesh | en_US |
dc.contributor.author | Sabharwal, Ashutosh | en_US |
dc.contributor.author | Aazhang, Behnaam | en_US |
dc.contributor.org | Center for Multimedia Communications (http://cmc.rice.edu/) | en_US |
dc.date.accessioned | 2007-10-31T00:59:18Z | en_US |
dc.date.available | 2007-10-31T00:59:18Z | en_US |
dc.date.issued | 2004-01-01 | en_US |
dc.date.modified | 2004-05-17 | en_US |
dc.date.submitted | 2001-11-29 | en_US |
dc.description | Journal Paper | en_US |
dc.description.abstract | In this paper, we study minimal power transmission of bursty sources over wireless channels with constraints on mean queuing delay. The power minimizing schedulers adapt power and rate of transmission based on the queue and channel state. We show that packet scheduling based on queue state can be used to trade queuing delay with transmission power, even on additive white Gaussian noise channels. Our extensive simulations show that small increases in average delay can lead to substantial savings in transmission power, thereby providing another avenue for mobile devices to save on battery power. We propose a low-complexity scheduler that has near optimal performance. We also construct a variable rate QAM based transmission scheme to show the benefits of the proposed formulation in a practical communication system. Power optimal schedulers with absolute packet delay constraints are also studied and their performance is evaluated via simulations. | en_US |
dc.description.sponsorship | Nokia | en_US |
dc.identifier.citation | D. Rajan, A. Sabharwal and B. Aazhang, "Delay bounded packet scheduling of bursty traffic over wireless channels," <i>IEEE Transactions on Information Theory,</i> vol. 50, no. 1, 2004. | en_US |
dc.identifier.doi | http://dx.doi.org/10.1109/TIT.2003.821989 | en_US |
dc.identifier.uri | https://hdl.handle.net/1911/20228 | en_US |
dc.language.iso | eng | en_US |
dc.subject | Traffic regulation | en_US |
dc.subject | packet scheduling | en_US |
dc.subject | wireless channels | en_US |
dc.subject | randomized policies | en_US |
dc.subject | power control | en_US |
dc.subject | queuing delay | en_US |
dc.subject.keyword | Traffic regulation | en_US |
dc.subject.keyword | packet scheduling | en_US |
dc.subject.keyword | wireless channels | en_US |
dc.subject.keyword | randomized policies | en_US |
dc.subject.keyword | power control | en_US |
dc.subject.keyword | queuing delay | en_US |
dc.title | Delay bounded packet scheduling of bursty traffic over wireless channels | en_US |
dc.type | Journal article | en_US |
dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Raj2001Nov1Delaybound.PDF
- Size:
- 448.48 KB
- Format:
- Adobe Portable Document Format