Computational analysis and efficient algorithms for micro and macro OFDMA scheduling

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1184-1192

  Cohen, Reuven ^a   Katzir, Liran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; MACROS; MATRIX ALGEBRA; MODULATION; SCHEDULING;

COMPUTER COMMUNICATIONS; EFFICIENT ALGORITHMS; INFOCOM;

SCHEDULING ALGORITHMS;

EID: 51349086875     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.99     Document Type: Conference Paper

References (19)

1. A. Azgin and M. Krunz. Scheduling in wireless cellular networks under probabilistic channel information. In ICCCN, pages 89-94, 2003.
2. Y. Ben-Shimol, I. Kitroser, and Y. Dinitz. Two-dimensional mapping for wireless ofdma systems. IEEE Trans. Broadcasting. 52(3):388-396, Sept 2006.
3. R. Cohen and L. Katzir. Computational analysis and efficient algorithms for micro and macro ofdma scheduling. Technical Report CS-2007-02, Technion-Israel Institute of Technology, April 2007.
4. R. Cohen and L. Katzir. A generic quantitative approach to the scheduling of synchronous packets in a shared uplink wireless channel. IEEE/ACM Trans. Netw., 15(4):932-943, 2007.
5. A. J. Goldsmith and S. G. Chua. Variable-rate variable-power MQAM for fading channel. IEEE Transactions on Communications, 45(10), Oct. 1977.
6. D. S. Hochbaum, editor. Appmximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston. MA, USA. 1997.
7. Institute of Electrical and Electronics Engineers Inc. IEEE standard for local and metropolitan area networks - part 16: Air interface for fixed broadband wireless access systems, 2004.
8. A. Israeli. D. Rawitz, and O. Sharon. On the complexity of sequential rectangle placement in ieee 802.16/wimax systems. In ESA, pages 570-581, 2007.
9. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
10. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Inf. Process, Lett., 70(0:39-45, 1999.
11. D. Kivanc, G. Li, and H. Liu. Computationally efficient bandwidth allocation and power control for OFDMA. IEEE Transactions on Wireless Communications, 2(6), Nov. 2003.
12. S. Lu. V. Bharghavan, and R. Srikant. Fair scheduling in wireless packet networks. IEEE/ACM Transactions on Networking, 7(4):473-489, 1999.
13. S. Nanda, K. Balachandran, and S. Kumar. Adaptation techniques in wireless packet data services. IEEE Communications Magazine, 38(1), Jan. 2000.
14. S. Shakkottai and R. Srikant. Scheduling real-time traffic with deadlines over a wireless channel. ACM/Baltzer Wireless Networks Journal, 8(1):13-26. Jan. 2002.
15. M. Shreedhar and G. Varghese. Efficient fair queueing using deficit round-robin. IEEE/ACM Transactions on Networking, 4(3):375-385, 1996.
16. G. Song and Y. Li. Cross-layer optimization for OFDM wireless networks part I: Theoretical framework. IEEE Transactions on Wireless Communications, 4(2), Mar. 2005.
17. D. Tse and S. Hanly. Multi-access fading channels: Part I: Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Transactions on Information Theory, 44(7):2796-2815, Nov. 1998.
18. P. Viswanath. D. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Transactions on Infonnation Theory, 48(6), June 2002.
19. I. Wong, Z. Shen, J. Andrews, and B. L. Evans. A low complexity algorithm for proportional resource allocation in OFDMA systems, IEEE International Signal Processing Systems Workshop, Oct 2004.