Scheduling algorithms for point-to-multipoint operation in IEEE 802.16 networks

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006

Volumn , Issue , 2006, Pages

  Iyengar, R ^a   Kar, K ^a   Sikdar, B ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROAD-BAND WIRELESS ACCESS SYSTEMS; CHANNEL CONDITIONS; IEEE 802.16 NETWORKS; LINEAR PROGRAMMING RELAXATION; NUMERICAL EXPERIMENTS; OPTIMAL ALLOCATION; POINT TO MULTIPOINT; RESOURCE ALLOCATION PROBLEM;

ALGORITHMS; BASE STATIONS; FREQUENCY DIVISION MULTIPLE ACCESS; LINEAR PROGRAMMING; OPTIMIZATION; ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING; RESOURCE ALLOCATION; WIRELESS NETWORKS;

PROBLEM SOLVING;

EID: 84886494140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666519     Document Type: Conference Paper

References (16)

1. The IEEE 802. 16 Working Group on Broadband Wireless Access Standards, http://grouper. ieee. org/groups/802/16/
2. Draft IEEE standard for Local and metropolitan area networks, Part 16: Air Interface for Fixed Broadband Wireless Access Systema. s
3. N. Garg, J. Konemann Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Algorithms, Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 1998
4. L. Fleischer, K. Wayne Fast and Simple Approximation Schemes for Generalized Flow, in Math. Programming 91 (2002), no. 2, pp. 215-238
5. M. Ergen, S. Coleri, P. Varaiya, QoS Aware Adaptive Resource Allocation Techniques for Fair Scheduling in OFDMA Based Broadband Wireless Access Systems, IEEE Transactions on Broadcasting, Vol: 49, Dec. 2003
6. G. Kulkarni, S. Adlakha, M. Srivastava emphSubcarrier Allocation and Bit Loading Algorithms for OFDMA based Wireless Networks, IEEE Transactions on Mobile Computing, Vol. 04, no. 6, pp. 652-662, Nov. 2005
7. Christos Papdimitriou, Kenneth Steiglitz, Combinatorial optimization: Algorithms and Complexity
8. Lisa Fleischer, Kevin Wayne, Fast and Simple Approximation Schemes for Generalized Flow, Math. Program. Ser. A (2001)
9. Murty Katta G. Linear Programming
10. N. Young Sequential and Parallel Algorithms for Mixed Covering and Packing, Proc. FOCS 2001, pp: 538
11. A. K. Ahuja, T. Magnanti, J. Orlin Network Flows-Theory, Algorithms and Applications, prentice Hall, 1993
12. M. Garey, D. Johnson Computers and Intractability W. H. Freeman, 1979
13. P. Crescenzi, V. Kann (Editors) A Compendium of NP Optimization Problems, available online at http://www. nada. kth. se/ viggo/problemlist/compendium. html
14. L. Fleischer Fast Approximation Algorithms for Fractional Covering Problems with Box Constraints, proc. 36th ACM SIAM Symposium on Discrete Algorithms (SODA), January 2004
15. N. Garg, R. Khandekar Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negativve Entries, in proc. 12th European Symposium on Algorithms (ESA), LNCS 3321, pp: 371-382, 2004
16. L. Fleischer, K. Wayne, Faster Approximation Algorithms for Generalized Network Flow, proc. ACM/SIAM Symposium on Discrete Algorithms, 1999.