메뉴 건너뛰기




Volumn 6, Issue , 2005, Pages 3597-3601

A robust high-throughput tree algorithm using successive interference cancellation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR ANALYSIS; FADING (RADIO); SIGNAL INTERFERENCE; TELECOMMUNICATION NETWORKS;

EID: 33846567121     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1578442     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 3
    • 25844506727 scopus 로고    scopus 로고
    • SICTA: A 0.693 contention tree algorithm using successive interference cancellation
    • Miami, FL, March 13-17, to appear
    • Y. Yu and G. B. Giannakis, "SICTA: A 0.693 contention tree algorithm using successive interference cancellation,", Proc. of INFOCOM Conf., Miami, FL, March 13-17, 2005 (to appear).
    • (2005) Proc. of INFOCOM Conf
    • Yu, Y.1    Giannakis, G.B.2
  • 4
    • 33846641287 scopus 로고    scopus 로고
    • High-throughput random access using successive interference cancellation in a tree algorithm
    • submitted
    • Y. Yu and G. B. Giannakis, "High-throughput random access using successive interference cancellation in a tree algorithm," IEEE Transactions on Information Theory, submitted, 2005.
    • (2005) IEEE Transactions on Information Theory
    • Yu, Y.1    Giannakis, G.B.2
  • 5
    • 0030654527 scopus 로고    scopus 로고
    • Collision avoidance and resolution multiple access: First-success protocols
    • Montreal, Canada, June
    • R. Garces and J. Garcia-Luna-Aceves, "Collision avoidance and resolution multiple access: first-success protocols," Proc. of IEEE ICC Conf., Montreal, Canada, vol. 2, pp. 699-703, June 1997.
    • (1997) Proc. of IEEE ICC Conf , vol.2 , pp. 699-703
    • Garces, R.1    Garcia-Luna-Aceves, J.2
  • 6
    • 0018522043 scopus 로고
    • Tree algorithm for packet broadcast channels
    • Sept
    • J. I. Capetanakis, "Tree algorithm for packet broadcast channels," IEEE Transactions on Information Theory, vol. 25, No. 5, pp. 505-515, Sept. 1979.
    • (1979) IEEE Transactions on Information Theory , vol.25 , Issue.5 , pp. 505-515
    • Capetanakis, J.I.1
  • 7
    • 0003117026 scopus 로고
    • Tree algorithm for packet broadcast channels
    • Oct.-Dec
    • B. S. Tsybakov and V. A. Mikhailov, "Tree algorithm for packet broadcast channels," Problemy Peredachi Informatsii, vol. 14, No. 4, pp. 32-59, Oct.-Dec. 1978.
    • (1978) Problemy Peredachi Informatsii , vol.14 , Issue.4 , pp. 32-59
    • Tsybakov, B.S.1    Mikhailov, V.A.2
  • 8
    • 0002876117 scopus 로고
    • Collision resolution algorithm and random access communications
    • Multiuser Communication Systems, ed. G. Longo, Spriger, New York
    • J. L. Massey, Collision resolution algorithm and random access communications. Multiuser Communication Systems 265, ed. G. Longo, CISM Course and Lecture Notes, Spriger, New York, 1981.
    • (1981) CISM Course and Lecture Notes , vol.265
    • Massey, J.L.1
  • 9
    • 0003794137 scopus 로고
    • 2nd ed, Prentice Hall, Upper Saddle River, NJ
    • D. Bertsekas and R. Gallager, Data Networks, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 1992.
    • (1992) Data Networks
    • Bertsekas, D.1    Gallager, R.2


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