메뉴 건너뛰기




Volumn , Issue , 2009, Pages 5-7

Approaching throughput-optimality in a distributed CSMA algorithm: Collisions and stability

Author keywords

CSMA; Distributed scheduling; Markov chain; Maximum throughput

Indexed keywords

CARRIER COMMUNICATION; CARRIER SENSE MULTIPLE ACCESS; MARKOV PROCESSES; THROUGHPUT;

EID: 84960935317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1540358.1540361     Document Type: Conference Paper
Times cited : (13)

References (7)
  • 4
    • 25844448717 scopus 로고    scopus 로고
    • Throughput modeling and fairness issues in CSMA/CA based ad-hoc networks
    • Miami, Mar
    • X. Wang, K. Kar, "Throughput Modeling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks", Proceedings of IEEE Infocom 2005, Miami, Mar. 2005.
    • (2005) Proceedings of IEEE Infocom 2005
    • Wang, X.1    Kar, K.2
  • 6
    • 70349292665 scopus 로고    scopus 로고
    • Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks
    • Feb.
    • J. Ni, R. Srikant, "Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks", in Proc. of Information Theory and Applications Workshop, Feb. 2009.
    • (2009) Proc. of Information Theory and Applications Workshop
    • Ni, J.1    Srikant, R.2


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