메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 1217-1220

Efficient wireless multicast protocol with orthogonal CTS modulation supporting video conferencing

Author keywords

[No Author keywords available]

Indexed keywords

MULTICAST WITH ORTHORGONAL CTS (MOCTS) PROTOCOL; RECEIVING NODES; SIMULATION RESULTS; WIRELESS MULTICAST PROTOCOL;

EID: 34247643958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICME.2006.262756     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 1
    • 34247569934 scopus 로고    scopus 로고
    • ANSI/IEEE Standard 802.11, In 1999 Edition.
    • ANSI/IEEE Standard 802.11, In 1999 Edition.
  • 2
    • 0020748122 scopus 로고
    • Analysis and Stability Consideration in a Reservation Multiaccess System
    • W. Szapnkowski "Analysis and Stability Consideration in a Reservation Multiaccess System", IEEE Trans. on Comm, Vol. 31, No. 5, 1983.
    • (1983) IEEE Trans. on Comm , vol.31 , Issue.5
    • Szapnkowski, W.1
  • 4
    • 0031208689 scopus 로고    scopus 로고
    • Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol
    • Aug
    • H. Chhaya and S. Gupta, "Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol", Wireless Networks, vol.3, no.3, Aug 1997.
    • (1997) Wireless Networks , vol.3 , Issue.3
    • Chhaya, H.1    Gupta, S.2
  • 5
    • 0842288490 scopus 로고    scopus 로고
    • S-REMiT: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks
    • B. Wang and S. K. S. Gupta, "S-REMiT: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks," In IEEE GLOBECOM'03, pp.3519-3524.
    • IEEE GLOBECOM'03 , pp. 3519-3524
    • Wang, B.1    Gupta, S.K.S.2
  • 6
    • 0003147681 scopus 로고
    • The computation of nearly minimal Steiner trees in graphs
    • V. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs, Int. J. Math., vol. 14, no. 1, pp. 1523, 1983.
    • (1983) Int. J. Math , vol.14 , Issue.1 , pp. 1523
    • Rayward-Smith, V.1
  • 7
    • 0020202833 scopus 로고
    • Distributed computation on graphs: Shortest path algorithms
    • Nov
    • K. Chandy and J. Misra, "Distributed computation on graphs: Shortest path algorithms," Communications of the ACM, vol. 25, no. 11, pp. 833 837, Nov. 1982.
    • (1982) Communications of the ACM , vol.25 , Issue.11 , pp. 833-837
    • Chandy, K.1    Misra, J.2
  • 8
    • 0027303605 scopus 로고
    • How bad is naive multicast routing?, in
    • M. Doar and I. Leslie, How bad is naive multicast routing?, in Proc. IEEE INFOCOM, 1993, pp. 8289.
    • (1993) Proc. IEEE INFOCOM , pp. 8289
    • Doar, M.1    Leslie, I.2
  • 9
    • 0035482658 scopus 로고    scopus 로고
    • CTMS: A Novel Constrained Tree Migration Scheme for Multicast Services in Generic Wireless Systems
    • OCTOBER
    • K. Chen, N. Huang, and B. Li, "CTMS: A Novel Constrained Tree Migration Scheme for Multicast Services in Generic Wireless Systems", IEEE J. ON Selected Areas in Comm, vol.19, no. 10, OCTOBER 2001, pp1998-2005.
    • (2001) IEEE J. ON Selected Areas in Comm , vol.19 , Issue.10 , pp. 1998-2005
    • Chen, K.1    Huang, N.2    Li, B.3
  • 10
    • 0032650390 scopus 로고    scopus 로고
    • Reliable Multicast in Multi access, Wireless LANs
    • J. Kuri and S.K. Kasera, "Reliable Multicast in Multi access, Wireless LANs," In IEEE INFOCOM 99, 1999.
    • (1999) In IEEE INFOCOM , vol.99
    • Kuri, J.1    Kasera, S.K.2


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