메뉴 건너뛰기




Volumn , Issue , 2008, Pages 230-238

Dynamic rate allocation in fading multiple access channels

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE PROJECTIONS; CHANNEL CONDITIONS; CHANNEL MEASUREMENTS; COMPLEX OPTIMIZATION PROBLEM; COMPUTATIONALLY EFFICIENT; DYNAMIC RATES; GAUSSIAN MULTIPLE-ACCESS CHANNEL; GRADIENT PROJECTIONS; LOW-COMPLEXITY; MULTIPLE ACCESS CHANNELS; RATE ALLOCATION; TEMPORAL CHANNEL VARIATIONS; THROUGHPUT CAPACITIES; TRANSMISSION POWERS; TRANSMISSION RATES; UTILITY FUNCTIONS; UTILITY PERFORMANCE;

EID: 52949103704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2008.4601054     Document Type: Conference Paper
Times cited : (2)

References (23)
  • 1
    • 50249171988 scopus 로고    scopus 로고
    • Energy-efficient resource allocation in time division multiple-access over fading channels
    • Preprint
    • X. Wang and G.B. Giannakis. Energy-efficient resource allocation in time division multiple-access over fading channels. Preprint, 2005.
    • (2005)
    • Wang, X.1    Giannakis, G.B.2
  • 3
    • 0034156949 scopus 로고    scopus 로고
    • Resource allocation for multiple classes of DS-CDMA traffic
    • J.B. Kim and M.L. Honig. Resource allocation for multiple classes of DS-CDMA traffic. IEEE Transactions on Vehicular Technology, 49(2):506-519, 2000.
    • (2000) IEEE Transactions on Vehicular Technology , vol.49 , Issue.2 , pp. 506-519
    • Kim, J.B.1    Honig, M.L.2
  • 4
    • 0032201980 scopus 로고    scopus 로고
    • Multiaccess fading channels part I: Polyinatroid structure, optimal resource allocation and throughput capacities
    • D. Tse and S. Hanly. Multiaccess fading channels part I: Polyinatroid structure, optimal resource allocation and throughput capacities. IEEE Transactions on Information Theory, 44(7):2796-2815, 1998.
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.7 , pp. 2796-2815
    • Tse, D.1    Hanly, S.2
  • 5
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks
    • Miami, FL, March
    • X. Lin and N. Shroff. The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom
    • Lin, X.1    Shroff, N.2
  • 6
    • 25844526594 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length, based scheduling and congestion control
    • Miami, FL, March
    • A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length, based scheduling and congestion control. In Proceedings of IEEE Infocom, volume 3, pages 1794-1803, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom , vol.3 , pp. 1794-1803
    • Eryilmaz, A.1    Srikant, R.2
  • 7
    • 25844437987 scopus 로고    scopus 로고
    • Fairness and optimal stochastic control for heterogeneous networks
    • Miami, FL, March
    • M.J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE Infocom, pages 1723-1734, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom , pp. 1723-1734
    • Neely, M.J.1    Modiano, E.2    Li, C.3
  • 8
    • 24944508677 scopus 로고    scopus 로고
    • Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm
    • A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, 50(4):401-457, 2005.
    • (2005) Queueing Systems , vol.50 , Issue.4 , pp. 401-457
    • Stolyar, A.1
  • 9
    • 34548322743 scopus 로고    scopus 로고
    • Polynomial complexity algorithms for full utilization of multi-hop wireless networks
    • Anchorage, AL, May
    • A. Eryilmaz, A. Ozdaglar, and E. Modiano. Polynomial complexity algorithms for full utilization of multi-hop wireless networks. In Proceedings of IEEE Infocom, Anchorage, AL, May 2007.
    • (2007) Proceedings of IEEE Infocom
    • Eryilmaz, A.1    Ozdaglar, A.2    Modiano, E.3
  • 10
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE Infocom, pages 533-539, 1998.
    • (1998) Proceedings of IEEE Infocom , pp. 533-539
    • Tassiulas, L.1
  • 12
    • 51249122988 scopus 로고    scopus 로고
    • Distributed link scheduling with constant overhead
    • Technical Report
    • S. Sanghavi, L. Bui, and R. Srikant. Distributed link scheduling with constant overhead, 2007. Technical Report.
    • (2007)
    • Sanghavi, S.1    Bui, L.2    Srikant, R.3
  • 13
    • 62749192182 scopus 로고    scopus 로고
    • Performance limits of greedy maximal matching in multi-hop wireless networks
    • New Orleans LA, December
    • C. Joo, X. Lin, and N. Shroff. Performance limits of greedy maximal matching in multi-hop wireless networks. In Proceedings of IEEE Conference on Decision and Control, New Orleans LA, December 2007.
    • (2007) Proceedings of IEEE Conference on Decision and Control
    • Joo, C.1    Lin, X.2    Shroff, N.3
  • 14
    • 52949115566 scopus 로고    scopus 로고
    • Randomized algorithms for optimal control of wireless networks
    • Hamilton CA
    • A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano. Randomized algorithms for optimal control of wireless networks, 2007. ICCOPT Conference, Hamilton CA.
    • (2007) ICCOPT Conference
    • Eryilmaz, A.1    Ozdaglar, A.2    Shah, D.3    Modiano, E.4
  • 15
    • 0035188992 scopus 로고    scopus 로고
    • Optimum power and rate allocation strategies for multiple access fading channels
    • S. Vishwanath, S.A. Jafar, and A. Goldsmith. Optimum power and rate allocation strategies for multiple access fading channels. In Proceedings of IEEE VTC, 2001.
    • (2001) Proceedings of IEEE VTC
    • Vishwanath, S.1    Jafar, S.A.2    Goldsmith, A.3
  • 16
    • 50949122343 scopus 로고    scopus 로고
    • Iterative water-filling for optimal resource allocation in OFDM multiple-access and broadcast channels
    • D. Yu and J.M. Cioffi. Iterative water-filling for optimal resource allocation in OFDM multiple-access and broadcast channels. In Proceedings of IEEE GLOBECOM, 2006.
    • (2006) Proceedings of IEEE GLOBECOM
    • Yu, D.1    Cioffi, J.M.2
  • 19
    • 0031270074 scopus 로고    scopus 로고
    • Information theoretic considerations for symmetric, cellular, multiple-access fading channels part I
    • S. Shamai and A.D. Wyner. Information theoretic considerations for symmetric, cellular, multiple-access fading channels part I. IEEE Transactions on Information Theory, 43(6): 1877-1894, 1997.
    • (1997) IEEE Transactions on Information Theory , vol.43 , Issue.6 , pp. 1877-1894
    • Shamai, S.1    Wyner, A.D.2
  • 20
    • 50249143213 scopus 로고    scopus 로고
    • Resource allocation in fading multiple-access channel
    • Preprint
    • A. ParandehGheibi, A. Eryilmaz, A. Ozdaglar, and M. Medard. Resource allocation in fading multiple-access channel. Preprint, 2007.
    • (2007)
    • ParandehGheibi, A.1    Eryilmaz, A.2    Ozdaglar, A.3    Medard, M.4
  • 22
    • 52949132140 scopus 로고    scopus 로고
    • A. Nedić and D.P. Bertsekas. Convergence Rate of Incremental Subgradient Algorithms. Stochastic Optimization: Algorithms and Applications (S. Uryasev and P. M. Pardalos, Editors), Kluwer Academic Publishers, 2000.
    • A. Nedić and D.P. Bertsekas. Convergence Rate of Incremental Subgradient Algorithms. Stochastic Optimization: Algorithms and Applications (S. Uryasev and P. M. Pardalos, Editors), Kluwer Academic Publishers, 2000.
  • 23
    • 0004169893 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, London, United Kingdom
    • R. Gallager. Discrete Stochastic Processes. Kluwer Academic Publishers, London, United Kingdom, 1996.
    • (1996) Discrete Stochastic Processes
    • Gallager, R.1


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