메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Energy-conserving scheduling in multi-hop wireless networks with time-varying channels

Author keywords

Energy efficiency; Multi hop wireless networks; Performance analysis; Scheduling algorithms; Stochastic network optimization

Indexed keywords

BACK PRESSURES; BASIC PRINCIPLES; CONSUMED ENERGY; DYNAMIC LINKS; ENERGY CONSUMPTION; ENERGY-CONSERVING; ENERGY-CONSTRAINED; GLOBAL MINIMA; LINK WEIGHTS; MINIMUM ENERGY; MULTIHOP WIRELESS NETWORK; OPTIMALITY; PERFORMANCE ANALYSIS; SCHEDULING SCHEMES; STOCHASTIC NETWORK OPTIMIZATION; STOCHASTIC NETWORKS; STOCHASTIC TRAFFIC; THEORETICAL RESULT; TIME VARYING CHANNEL; TIME-VARYING CHANNEL CONDITIONS; VIABLE SOLUTIONS;

EID: 77953312114     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462092     Document Type: Conference Paper
Times cited : (6)

References (22)
  • 2
    • 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," IEEE INFOCOM, 2005.
    • (2005) IEEE INFOCOM
    • Eryilmaz, A.1    Srikant, R.2
  • 3
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on cross-layer rate control in wireless networks
    • X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer rate control in wireless networks," IEEE INFOCOM, 2005.
    • (2005) IEEE INFOCOM
    • Lin, X.1    Shroff, N.2
  • 4
    • 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, vol. 50, pp. 401-457, 2005.
    • (2005) Queueing Systems , vol.50 , pp. 401-457
    • Stolyar, A.1
  • 5
    • 34548317470 scopus 로고    scopus 로고
    • Low-complexity distributed scheduling algorithms for wireless networks
    • A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," IEEE INFOCOM, 2007.
    • (2007) IEEE INFOCOM
    • Gupta, A.1    Lin, X.2    Srikant, R.3
  • 6
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37, pp. 1936-1949, 1992.
    • (1992) IEEE Transactions on Automatic Control , vol.37 , pp. 1936-1949
    • Tassiulas, L.1    Ephremides, A.2
  • 10
    • 70349658649 scopus 로고    scopus 로고
    • Diffq: Practical differential backlog congestion control for wireless networks
    • A. Warrier, S. Janakiraman, and I. Rhee, "Diffq: Practical differential backlog congestion control for wireless networks," IEEE INFOCOM, 2009.
    • (2009) IEEE INFOCOM
    • Warrier, A.1    Janakiraman, S.2    Rhee, I.3
  • 11
    • 33746909107 scopus 로고    scopus 로고
    • Energy optimal control for time varying wireless networks
    • July
    • M. J. Neely, "Energy optimal control for time varying wireless networks," IEEE Transactions on Information Theory, vol. 52, pp. 2915-2934, July 2006.
    • (2006) IEEE Transactions on Information Theory , vol.52 , pp. 2915-2934
    • Neely, M.J.1
  • 14
    • 57949116203 scopus 로고    scopus 로고
    • Maximizing throughput in wireless networks via gossiping
    • E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," ACM SIGMETRICS, 2006.
    • (2006) ACM SIGMETRICS
    • Modiano, E.1    Shah, D.2    Zussman, G.3
  • 17
    • 34247604121 scopus 로고    scopus 로고
    • Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks
    • X. Wu, R. Srikant, and J. Perkins, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," IEEE Transactions on Mobile Computing, 2007.
    • (2007) IEEE Transactions on Mobile Computing
    • Wu, X.1    Srikant, R.2    Perkins, J.3
  • 20
    • 51349140934 scopus 로고    scopus 로고
    • Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks
    • C. Joo, X. Lin, and N. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks," IEEE INFOCOM, 2008.
    • (2008) IEEE INFOCOM
    • Joo, C.1    Lin, X.2    Shroff, N.3
  • 21
    • 48549100459 scopus 로고    scopus 로고
    • Dynamic distributed scheduling in random access networks
    • A. Stolyar, "Dynamic distributed scheduling in random access networks," Journal of Applied Probability, vol. 45, pp. 297-313, 2008.
    • (2008) Journal of Applied Probability , vol.45 , pp. 297-313
    • Stolyar, A.1


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