메뉴 건너뛰기




Volumn , Issue , 2006, Pages

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

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;

EID: 84886494140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666519     Document Type: Conference Paper
Times cited : (9)

References (16)
  • 4
    • 0005385492 scopus 로고    scopus 로고
    • Fast and simple approximation schemes for generalized flow
    • L. Fleischer, K. Wayne Fast and Simple Approximation Schemes for Generalized Flow, in Math. Programming 91 (2002), no. 2, pp. 215-238
    • (2002) Math. Programming , vol.91 , Issue.2 , pp. 215-238
    • Fleischer, L.1    Wayne, K.2
  • 5
    • 0345447550 scopus 로고    scopus 로고
    • Qos aware adaptive resource allocation techniques for fair scheduling in ofdma based broadband wireless access systems
    • Dec.
    • 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
    • (2003) IEEE Transactions on Broadcasting , vol.49
    • Ergen, M.1    Coleri, S.2    Varaiya, P.3
  • 6
    • 28244472248 scopus 로고    scopus 로고
    • Srivastava emphSubcarrier Allocation and Bit Loading Algorithms for OFDMA based Wireless Networks
    • Nov.
    • 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
    • (2005) IEEE Transactions on Mobile Computing , vol.4 , Issue.6 , pp. 652-662
    • Kulkarni, G.1    Adlakha M, S.2
  • 8
    • 77953518045 scopus 로고    scopus 로고
    • Fast and simple approximation schemes for generalized flow
    • Lisa Fleischer, Kevin Wayne, Fast and Simple Approximation Schemes for Generalized Flow, Math. Program. Ser. A (2001)
    • (2001) Math. Program. Ser. A
    • Fleischer, L.1    Wayne, K.2
  • 10
    • 33748598362 scopus 로고    scopus 로고
    • Sequential and parallel algorithms for mixed covering and packing
    • N. Young Sequential and Parallel Algorithms for Mixed Covering and Packing, Proc. FOCS 2001, pp: 538
    • (2001) Proc. FOCS , pp. 538
    • Young, N.1
  • 14
    • 84886555688 scopus 로고    scopus 로고
    • Fast Approximation Algorithms for Fractional Covering Problems with Box Constraints, proc
    • January
    • L. Fleischer Fast Approximation Algorithms for Fractional Covering Problems with Box Constraints, proc. 36th ACM SIAM Symposium on Discrete Algorithms (SODA), January 2004
    • (2004) 36th ACM SIAM Symposium on Discrete Algorithms (SODA)
    • Fleischer, L.1
  • 15
    • 35048902400 scopus 로고    scopus 로고
    • Fractional covering with upper bounds on the variables: Solving lps with negativve entries
    • 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
    • (2004) Proc. 12th European Symposium on Algorithms (ESA), LNCS , vol.3321 , pp. 371-382
    • Garg, N.1    Khandekar, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.