메뉴 건너뛰기




Volumn 20, Issue 6, 2016, Pages 1183-1186

Approaching Optimal Centralized Scheduling with CSMA-Based Random Access over Fading Channels

Author keywords

CSMA; distributed algorithm; fading channels; Max Weight scheduling; queue stability

Indexed keywords

CARRIER COMMUNICATION; CARRIER SENSE MULTIPLE ACCESS; COMPLEX NETWORKS; FADING CHANNELS; PARALLEL ALGORITHMS; SCHEDULING;

EID: 84976501390     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2016.2547951     Document Type: Article
Times cited : (4)

References (11)
  • 1
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • Dec
    • L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
    • (1992) IEEE Trans. Autom. Control , vol.37 , Issue.12 , pp. 1936-1948
    • Tassiulas, L.1    Ephremides, A.2
  • 2
    • 64549087215 scopus 로고    scopus 로고
    • A CSMA distributed algorithm for throughput and utility maximization in wireless networks
    • L. Jiang and J. Walrand, "A CSMA distributed algorithm for throughput and utility maximization in wireless networks," in Proc. 46th Annu. Allerton Conf. Commun. Control Comput., 2008, pp. 1511-1519.
    • (2008) Proc. 46th Annu. Allerton Conf. Commun. Control Comput , pp. 1511-1519
    • Jiang, L.1    Walrand, J.2
  • 3
    • 77953303098 scopus 로고    scopus 로고
    • Q-CSMA: Queue length-based csma/ca algorithms for achieving maximum throughput and low delay in wireless networks
    • J. Ni, B. Tan, and R. Sarikant, "Q-CSMA: Queue length-based csma/ca algorithms for achieving maximum throughput and low delay in wireless networks," in Proc. IEEE INFOCOM, 2010, pp. 1-5.
    • (2010) Proc. IEEE INFOCOM , pp. 1-5
    • Ni, J.1    Tan, B.2    Sarikant, R.3
  • 4
    • 70449650505 scopus 로고    scopus 로고
    • Network adiabatic theorem: An efficient randomized protocol for contention resolution
    • S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: An efficient randomized protocol for contention resolution," in Proc. ACM Sigmetrics, 2009, pp. 133-144.
    • (2009) Proc. ACM Sigmetrics , pp. 133-144
    • Rajagopalan, S.1    Shah, D.2    Shin, J.3
  • 6
    • 84881373452 scopus 로고    scopus 로고
    • Optimal distributed scheduling under timevarying conditions: A fast-csma algorithm with applications
    • Jul
    • B. Li and A. Eryilmaz, "Optimal distributed scheduling under timevarying conditions: A fast-csma algorithm with applications," IEEE Trans. Wireless Commun., vol. 12, no. 7, pp. 3278-3288, Jul. 2013.
    • (2013) IEEE Trans. Wireless Commun , vol.12 , Issue.7 , pp. 3278-3288
    • Li, B.1    Eryilmaz, A.2
  • 7
    • 85027921027 scopus 로고    scopus 로고
    • Achieving optimal throughput utility and low delay with csma-like algorithms: A virtual multichannel approach
    • Apr
    • P. Huang and X. Lin, "Achieving optimal throughput utility and low delay with csma-like algorithms: A virtual multichannel approach," IEEE/ACM Trans. Netw., vol. 23, no. 2, pp. 505-518, Apr. 2015.
    • (2015) IEEE/ACM Trans. Netw , vol.23 , Issue.2 , pp. 505-518
    • Huang, P.1    Lin, X.2
  • 8
    • 84976470921 scopus 로고    scopus 로고
    • An opportunistic backoff scheme for dense ieee 802.11 wlans
    • Future Wireless Local Area Netw
    • M. Karaca, Z. Zhang, and B. Landfeldt, "An opportunistic backoff scheme for dense ieee 802.11 wlans," in Proc. Globecom-WS Enabling Technol. Future Wireless Local Area Netw., 2015.
    • (2015) Proc. Globecom-WS Enabling Technol
    • Karaca, M.1    Zhang, Z.2    Landfeldt, B.3
  • 10
    • 0041438376 scopus 로고    scopus 로고
    • Kalman filter estimation of the number of competing terminals in an ieee 802.11 network
    • G. Bianchi and I. Tinnirello, "Kalman filter estimation of the number of competing terminals in an ieee 802.11 network," in Proc. IEEE Comput. Commun. (INFOCOM), 2003, pp. 844-852.
    • (2003) Proc. IEEE Comput. Commun. (INFOCOM) , pp. 844-852
    • Bianchi, G.1    Tinnirello, I.2
  • 11
    • 18844461997 scopus 로고    scopus 로고
    • Stable scheduling policies for fading wireless channels
    • Apr
    • A. Eryilmaz, R. Srikant, and J. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 411-424, Apr. 2005.
    • (2005) IEEE/ACM Trans. Netw , vol.13 , Issue.2 , pp. 411-424
    • Eryilmaz, A.1    Srikant, R.2    Perkins, J.3


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