메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1260-1268

Mobility-driven scheduling in wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

DRIVEN SCHEDULING; EXTENSIVE SIMULATIONS; FAIR SCHEDULING; FAST FADING; MULTIUSER DIVERSITY; OPTIMAL STRATEGIES; POOR PERFORMANCE; PROPORTIONAL FAIR SCHEDULING; SCHEDULING POLICIES; SHARP CONTRAST; SLOW FADING; SYSTEM THROUGHPUT; USER MOBILITY; WIRELESS DATA;

EID: 70349659564     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062040     Document Type: Conference Paper
Times cited : (32)

References (29)
  • 1
    • 0003146096 scopus 로고
    • Information theory and power control in single-cell multi-user communications
    • R. Knopp and P. Humblet, "Information theory and power control in single-cell multi-user communications," in Proc. ICC '95, 1995.
    • (1995) Proc. ICC '95
    • Knopp, R.1    Humblet, P.2
  • 2
    • 0036611602 scopus 로고    scopus 로고
    • Opportunistic beamforming using dumb antennas
    • V. Viswanath, D. Tse, and R. Laroia, "Opportunistic beamforming using dumb antennas," IEEE Trans. Inf. Theory, vol. 48, pp. 1277-1294, 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , pp. 1277-1294
    • Viswanath, V.1    Tse, D.2    Laroia, R.3
  • 3
    • 70349661129 scopus 로고    scopus 로고
    • Joint scheduling and resource allocation in CDMA systems
    • Submitted for publication in IEEE Trans. Inf. Theory
    • R. Agrawal, V. G. Subramanian, and R. Berry, "Joint scheduling and resource allocation in CDMA systems," Submitted for publication in IEEE Trans. Inf. Theory, 2008.
    • (2008)
    • Agrawal, R.1    Subramanian, V.G.2    Berry, R.3
  • 5
    • 25844526594 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
    • A. Eryilmaz and R. Srikant, "Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control," in Proc. IEEE Infocom, 2005.
    • (2005) Proc. IEEE Infocom
    • Eryilmaz, A.1    Srikant, R.2
  • 6
    • 18844461997 scopus 로고    scopus 로고
    • Stable scheduling policies for fading wireless channels
    • A. Eryilmaz, R. Srikant, and J. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Netw., vol. 13, pp. 411-424, 2005.
    • (2005) IEEE/ACM Trans. Netw , vol.13 , pp. 411-424
    • Eryilmaz, A.1    Srikant, R.2    Perkins, J.3
  • 7
    • 33746640569 scopus 로고    scopus 로고
    • Resource allocation and cross-layer control in wireless networks
    • L. Georgiadis, M. Neely, and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Found. Trends Netw., vol. 1, pp. 1-144, 2006.
    • (2006) Found. Trends Netw , vol.1 , pp. 1-144
    • Georgiadis, L.1    Neely, M.2    Tassiulas, L.3
  • 8
    • 0036346745 scopus 로고    scopus 로고
    • Power and server allocation in a multi-beam satellite with time-varying channels
    • M. Neely, E. Modiano, and C. Rohrs, "Power and server allocation in a multi-beam satellite with time-varying channels," in Proc. IEEE Infocom, 2002.
    • (2002) Proc. IEEE Infocom
    • Neely, M.1    Modiano, E.2    Rohrs, C.3
  • 9
    • 11844304350 scopus 로고    scopus 로고
    • Dynamic power allocation and routing for time-varying wireless networks
    • -, "Dynamic power allocation and routing for time-varying wireless networks," IEEE J. Sel. Areas Commun., vol. 23, pp. 89-103, 2005.
    • (2005) IEEE J. Sel. Areas Commun , vol.23 , pp. 89-103
    • Neely, M.1    Modiano, E.2    Rohrs, C.3
  • 10
    • 0037444521 scopus 로고    scopus 로고
    • A framework for opportunistic scheduling in wireless networks
    • X. Liu, E. Chong, and N. Shroff, "A framework for opportunistic scheduling in wireless networks," Comp. Netw., vol. 41, pp. 451-474, 2003.
    • (2003) Comp. Netw , vol.41 , pp. 451-474
    • Liu, X.1    Chong, E.2    Shroff, N.3
  • 11
    • 0027556080 scopus 로고
    • Dynamic server allocation to parallel queues with randomly varying connectivity
    • L. Tassiulas and A. Ephremides, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Trans. Inf. Theory, vol. 39, pp. 466-478, 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , pp. 466-478
    • Tassiulas, L.1    Ephremides, A.2
  • 12
    • 0042976079 scopus 로고    scopus 로고
    • Exploiting wireless channel state information for throughput maximization
    • V. Tsibonis, L. Georgiadis, and L. Tassiulas, "Exploiting wireless channel state information for throughput maximization," in Proc. IEEE Infocom, 2003.
    • (2003) Proc. IEEE Infocom
    • Tsibonis, V.1    Georgiadis, L.2    Tassiulas, L.3
  • 13
    • 0032027247 scopus 로고    scopus 로고
    • Rate control for communication networks: Shadow prices, proportional fairness and stability
    • F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
    • (1998) J. Oper. Res. Soc , vol.49 , pp. 237-252
    • Kelly, F.1    Maulloo, A.2    Tan, D.3
  • 15
    • 25644450396 scopus 로고    scopus 로고
    • Optimal utility-based throughput allocation subject to throughput constraints
    • D. Andrews, L. Qian, and A. Stolyar, "Optimal utility-based throughput allocation subject to throughput constraints," in Proc. IEEE Infocom, 2005.
    • (2005) Proc. IEEE Infocom
    • Andrews, D.1    Qian, L.2    Stolyar, A.3
  • 16
    • 3142725821 scopus 로고    scopus 로고
    • Convergence of proportional-fair sharing algorithms under general conditions
    • H. Kushner and P. Whiting, "Convergence of proportional-fair sharing algorithms under general conditions," IEEE Trans. Wireless Commun., vol. 3, pp. 1250-1259, 2004.
    • (2004) IEEE Trans. Wireless Commun , vol.3 , pp. 1250-1259
    • Kushner, H.1    Whiting, P.2
  • 17
    • 14644410381 scopus 로고    scopus 로고
    • On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation
    • A. Stolyar, "On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation," Oper. Res., vol. 53, pp. 12-25, 2005.
    • (2005) Oper. Res , vol.53 , pp. 12-25
    • Stolyar, A.1
  • 18
    • 0034297878 scopus 로고    scopus 로고
    • Fair end-to-end window-based congestion control
    • J. Mo and J. C. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556-567, 2000.
    • (2000) IEEE/ACM Trans. Netw , vol.8 , Issue.5 , pp. 556-567
    • Mo, J.1    Walrand, J.C.2
  • 19
    • 0034230317 scopus 로고    scopus 로고
    • P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users, IEEE Commun. Mag., 38, no. 7, pp. 70-77, 2000.
    • P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, "CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users," IEEE Commun. Mag., vol. 38, no. 7, pp. 70-77, 2000.
  • 20
    • 0033720613 scopus 로고    scopus 로고
    • Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system, in IEEE VTC 2000 Spring Conf, 2000, pp. 1854-1858
    • A. Jalali, R. Padovani, and R. Pankaj, "Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system," in IEEE VTC 2000 Spring Conf., 2000, pp. 1854-1858.
    • Jalali, A.1    Padovani, R.2    Pankaj, R.3
  • 21
    • 0033701613 scopus 로고    scopus 로고
    • CDMA forward link waterfilling power control
    • J. Holtzman, "CDMA forward link waterfilling power control," in Proc. IEEE VTC 2000 Spring Conf., 2000, pp. 1663-1667.
    • (2000) Proc. IEEE VTC 2000 Spring Conf , pp. 1663-1667
    • Holtzman, J.1
  • 22
    • 0035197101 scopus 로고    scopus 로고
    • Asymptotic analysis of proportional fair algorithm
    • -, "Asymptotic analysis of proportional fair algorithm," in Proc. IEEE PIMRC 2001 Conf., 2001, pp. 33-37.
    • (2001) Proc. IEEE PIMRC 2001 Conf , pp. 33-37
  • 23
    • 23344435271 scopus 로고    scopus 로고
    • User-level performance of channel-aware scheduling algorithms in wireless data networks
    • S. Borst, "User-level performance of channel-aware scheduling algorithms in wireless data networks," IEEE/ACM Trans. on Netw., vol. 13, pp. 636-647, 2005.
    • (2005) IEEE/ACM Trans. on Netw , vol.13 , pp. 636-647
    • Borst, S.1
  • 24
    • 34648874098 scopus 로고    scopus 로고
    • Flow-level stability of channel-aware scheduling-algorithms
    • S. C. Borst and M. Jonckheere, "Flow-level stability of channel-aware scheduling-algorithms," in Proc. WiOpt 06, 2006.
    • (2006) Proc. WiOpt 06
    • Borst, S.C.1    Jonckheere, M.2
  • 25
    • 1542269140 scopus 로고    scopus 로고
    • Wireless downlink data channels: User performance and cell dimensioning
    • T. Bonald and A. Proutiere, "Wireless downlink data channels: User performance and cell dimensioning," in Proc. ACM Mobicom, 2003, pp. 339-352.
    • (2003) Proc. ACM Mobicom , pp. 339-352
    • Bonald, T.1    Proutiere, A.2
  • 26
    • 0036670170 scopus 로고    scopus 로고
    • Mobility increases the capacity of ad hoc wireless networks
    • M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, pp. 477-486, 2002.
    • (2002) IEEE/ACM Trans. Netw , vol.10 , pp. 477-486
    • Grossglauser, M.1    Tse, D.2
  • 27
    • 0003077340 scopus 로고
    • On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
    • J. Dai, "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Ann. Appl. Prob., no. 5, pp. 49-77, 1995.
    • (1995) Ann. Appl. Prob , Issue.5 , pp. 49-77
    • Dai, J.1
  • 29
    • 3142727746 scopus 로고    scopus 로고
    • On stochastic bounds for monotonic processor-sharing networks
    • T. Bonald and A. Proutiere, "On stochastic bounds for monotonic processor-sharing networks," Queueing Systems, vol. 47, pp. 81-106, 2004.
    • (2004) Queueing Systems , vol.47 , pp. 81-106
    • Bonald, T.1    Proutiere, A.2


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