메뉴 건너뛰기




Volumn , Issue , 2011, Pages 3056-3064

Exploiting channel memory for joint estimation and scheduling in downlink networks

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL MEMORY; CLOSED FORM; DOWNLINK SCHEDULING; IMPERFECT CHANNEL STATE INFORMATION; INDEX POLICIES; INDEXABILITY; JOINT ESTIMATION; MARKOV CHANNELS; MULTIUSER SCHEDULING; NEAR-OPTIMAL PERFORMANCE; NUMERICAL EXPERIMENTS; OPPORTUNISTIC SCHEDULING; OPTIMALITY; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PERFORMANCE GAIN; RATE ADAPTATION; RESTLESS MULTI-ARMED BANDIT; SCHEDULING PROBLEM; TWO STAGE; USER SCHEDULING; WHITTLE'S INDEX POLICY;

EID: 79960866015     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935149     Document Type: Conference Paper
Times cited : (26)

References (23)
  • 1
    • 0003146096 scopus 로고
    • Information capacity and power control in single cell multiuser communications
    • R. Knopp, P. A. Humblet, "Information capacity and power control in single cell multiuser communications," IEEE ICC, 1995.
    • (1995) IEEE ICC
    • Knopp, R.1    Humblet, P.A.2
  • 3
    • 0031146993 scopus 로고    scopus 로고
    • Scheduling and performance limits of networks with constantly changing topology
    • L. Tassiulas, "Scheduling and performance limits of networks with constantly changing topology," IEEE Trans. on Inform. Theory, 1997.
    • (1997) IEEE Trans. on Inform. Theory
    • Tassiulas, L.1
  • 4
    • 33749999391 scopus 로고    scopus 로고
    • Dynamic power allocation and routing for time varying wireless networks
    • M. Neely, E. Modiano, C. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE JSAC, 2005.
    • (2005) IEEE JSAC
    • Neely, M.1    Modiano, E.2    Rohrs, C.3
  • 5
    • 0242277885 scopus 로고    scopus 로고
    • Scheduling for multiple flows sharing a timevarying channel: The exponential rule
    • S. Shakkottai, A. Stolyar, "Scheduling for multiple flows sharing a timevarying channel: the exponential rule," Analy. Meth. App. Prob., 2002.
    • (2002) Analy. Meth. App. Prob.
    • Shakkottai, S.1    Stolyar, A.2
  • 6
    • 37549069277 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length based scheduling and congestion control
    • A. Eryilmaz, R. Srikant, "Fair Resource Allocation in Wireless Networks using Queue-length based Scheduling and Congestion Control," IEEE/ACM Trans. on Networking, 2007.
    • (2007) IEEE/ACM Trans. on Networking
    • Eryilmaz, A.1    Srikant, R.2
  • 8
    • 70349675405 scopus 로고    scopus 로고
    • Distributed opportunistic scheduling with two-level channel probing
    • C. Thejaswi, J. Zhang, S. Pun, V. H. Poor, "Distributed Opportunistic Scheduling with Two-Level Channel Probing," IEEE INFOCOM, 2009.
    • (2009) IEEE INFOCOM
    • Thejaswi, C.1    Zhang, J.2    Pun, S.3    Poor, V.H.4
  • 9
    • 85008042438 scopus 로고    scopus 로고
    • Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policies
    • L. A. Johnston, V. Krishnamurthy, "Opportunistic file transfer over a fading channel: a POMDP search theory formulation with optimal threshold policies," IEEE Trans. on Wireless Comm., 2006.
    • (2006) IEEE Trans. on Wireless Comm.
    • Johnston, L.A.1    Krishnamurthy, V.2
  • 12
    • 0001043843 scopus 로고
    • Restless bandits: Activity allocation in a changing world
    • P. Whittle, "Restless Bandits: Activity Allocation in a Changing World," Journal of Applied Probability, 1988.
    • (1988) Journal of Applied Probability
    • Whittle, P.1
  • 16
    • 79960863854 scopus 로고    scopus 로고
    • Multiuser scheduling in a markov-modeled downlink using randomly delayed ARQ feedback
    • S. Murugesan, P. Schniter, N. B. Shroff, "Multiuser Scheduling in a Markov-modeled Downlink using Randomly Delayed ARQ Feedback," arXiv preprint:1002.3312, 2010.
    • (2010) ArXiv preprint:1002.3312
    • Murugesan, S.1    Schniter, P.2    Shroff, N.B.3
  • 18
    • 77958597180 scopus 로고    scopus 로고
    • Indexability of restless bandit problems and optimality of whittle's index for dynamic multichannel access
    • K. Liu and Q. Zhao "Indexability of Restless Bandit Problems and Optimality of Whittle's Index for Dynamic Multichannel Access," IEEE Trans. on Inform. Theory, 2010.
    • (2010) IEEE Trans. on Inform. Theory
    • Liu, K.1    Zhao, Q.2


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