메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1603-1607

Upper bound for the capacity of multiple access protocols on multipacket reception channels

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION CHANNELS; MULTIACCESS; MULTIPACKET RECEPTION; MULTIPLE ACCESS PROTOCOLS; SIMULTANEOUS TRANSMISSION; UPPER BOUND;

EID: 84867537715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283545     Document Type: Conference Paper
Times cited : (5)

References (24)
  • 2
    • 0024048385 scopus 로고
    • Stability properties of slotted ALOHA with multipacket reception capability
    • S. Ghez, S. Verdú, and S. C. Schwartz, "Stability properties of slotted ALOHA with multipacket reception capability," IEEE Trans. Autom. Control, vol. 33, no. 7, pp. 640-649, 1988.
    • (1988) IEEE Trans. Autom. Control , vol.33 , Issue.7 , pp. 640-649
    • Ghez, S.1    Verdú, S.2    Schwartz, S.C.3
  • 3
    • 0024768480 scopus 로고
    • Optimal decentralized control in the random-access multipacket channel
    • -, "Optimal decentralized control in the random-access multipacket channel," IEEE Trans. Autom. Control, vol. 34, no. 11, pp. 1153-1163, 1989.
    • (1989) IEEE Trans. Autom. Control , vol.34 , Issue.11 , pp. 1153-1163
    • Ghez, S.1    Verdú, S.2    Schwartz, S.C.3
  • 4
    • 0035508076 scopus 로고    scopus 로고
    • Multipacket reception in random access wireless networks: From signal processing to optimal medium access control
    • L. Tong, Q. Zhao, and G. Mergen, "Multipacket reception in random access wireless networks: From signal processing to optimal medium access control," IEEE Commun. Mag., vol. 39, no. 11, pp. 108-112, 2001.
    • (2001) IEEE Commun. Mag. , vol.39 , Issue.11 , pp. 108-112
    • Tong, L.1    Zhao, Q.2    Mergen, G.3
  • 5
    • 0002431508 scopus 로고
    • The ALOHA System - Another alternative for computer communications
    • Proc. 1970 Fall Joint Computer Conf., Montvale, NJ: AFIPS Press
    • N. Abramson, "The ALOHA System - Another alternative for computer communications," in Proc. 1970 Fall Joint Computer Conf., AFIPS Conf. Proc., vol. 37. Montvale, NJ: AFIPS Press, 1970, pp. 281-285.
    • (1970) AFIPS Conf. Proc. , vol.37 , pp. 281-285
    • Abramson, N.1
  • 6
    • 0002544335 scopus 로고
    • Aloha packet system with and without slots and capture
    • L. Roberts, "Aloha packet system with and without slots and capture," Computer Comm. Review, no. 2, pp. 28-42, 1975.
    • (1975) Computer Comm. Review , Issue.2 , pp. 28-42
    • Roberts, L.1
  • 7
    • 0018522043 scopus 로고
    • Tree algorithms for packet broadcast channels
    • J. I. Capetanakis, "Tree algorithms for packet broadcast channels," IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 505-515, 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.25 , Issue.5 , pp. 505-515
    • Capetanakis, J.I.1
  • 10
    • 0003834698 scopus 로고
    • Random multiple packet access: Part-and-try algorithm
    • translated from Russian
    • B. S. Tsybakov and V. A. Mikhailov, "Random multiple packet access: Part-and-try algorithm," Problemy Peredachi Informatsii, vol. 16, no. 4, pp. 65-79, 1980, (translated from Russian).
    • (1980) Problemy Peredachi Informatsii , vol.16 , Issue.4 , pp. 65-79
    • Tsybakov, B.S.1    Mikhailov, V.A.2
  • 11
    • 0041373881 scopus 로고
    • Some tools for the study of channel-sharing
    • Multi-user Communication Systems, ser. G. Longo, Ed. New York: Springer-Verlag
    • G. Ruget, "Some tools for the study of channel-sharing," in Multi-user Communication Systems, ser. CISM Courses and Lectrues, G. Longo, Ed. New York: Springer-Verlag, 1981, vol. 265, pp. 201-231.
    • (1981) CISM Courses and Lectrues , vol.265 , pp. 201-231
    • Ruget, G.1
  • 12
    • 0022011593 scopus 로고
    • A class of efficient contention resolution algorithms for multiple access
    • J. Moseley and P. A. Humblet, "A class of efficient contention resolution algorithms for multiple access," IEEE Trans. Commun., vol. 33, no. 2, pp. 145-151, 1985.
    • (1985) IEEE Trans. Commun. , vol.33 , Issue.2 , pp. 145-151
    • Moseley, J.1    Humblet, P.A.2
  • 13
    • 0019539629 scopus 로고
    • Bounds on the performance of protocols for a multipleaccess broadcast channel
    • N. Pippenger, "Bounds on the performance of protocols for a multipleaccess broadcast channel," IEEE Trans. Inf. Theory, vol. 33, no. 2, pp. 145-151, 1981.
    • (1981) IEEE Trans. Inf. Theory , vol.33 , Issue.2 , pp. 145-151
    • Pippenger, N.1
  • 14
    • 0020128060 scopus 로고
    • On the capacity of infinite population multiple-access protocols
    • M. L. Molle, "On the capacity of infinite population multiple-access protocols," IEEE Trans. Inf. Theory, vol. 28, no. 3, pp. 396-401, 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.28 , Issue.3 , pp. 396-401
    • Molle, M.L.1
  • 15
    • 0020128168 scopus 로고
    • A new upper bound to the throughput of a multi-access broadcast channel
    • R. Cruz and B. Hajek, "A new upper bound to the throughput of a multi-access broadcast channel," IEEE Trans. Inf. Theory, vol. 28, no. 3, pp. 396-401, 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.28 , Issue.3 , pp. 396-401
    • Cruz, R.1    Hajek, B.2
  • 16
    • 0042316471 scopus 로고
    • Upper bound for the capacity of a random multiple access system
    • translated from Russian
    • V. A. Mikhailov and B. S. Tsybakov, "Upper bound for the capacity of a random multiple access system," Problemy Peredachi Informatsii, vol. 17, no. 1, pp. 90-95, 1981, (translated from Russian).
    • (1981) Problemy Peredachi Informatsii , vol.17 , Issue.1 , pp. 90-95
    • Mikhailov, V.A.1    Tsybakov, B.S.2
  • 17
    • 0004841892 scopus 로고
    • Improved upper bound for the capacity of the random-access channel
    • translated from Russian
    • Z. Zhang and T. Berger, "Improved upper bound for the capacity of the random-access channel," Problemy Peredachi Informatsii, vol. 21, no. 4, pp. 83-87, 1985, (translated from Russian).
    • (1985) Problemy Peredachi Informatsii , vol.21 , Issue.4 , pp. 83-87
    • Zhang, Z.1    Berger, T.2
  • 18
    • 0242372587 scopus 로고
    • Upper bound on the capacity of a random multiple-access system
    • translated from Russian
    • B. S. Tsybakov and N. B. Likhanov, "Upper bound on the capacity of a random multiple-access system," Problemy Peredachi Informatsii, vol. 23, no. 3, pp. 83-87, 1980, (translated from Russian).
    • (1980) Problemy Peredachi Informatsii , vol.23 , Issue.3 , pp. 83-87
    • Tsybakov, B.S.1    Likhanov, N.B.2
  • 19
    • 0025431874 scopus 로고
    • Random-access communication with multiple reception
    • N. Mehravari, "Random-access communication with multiple reception," IEEE Trans. Inf. Theory, vol. 36, no. 3, pp. 614-622, 1990.
    • (1990) IEEE Trans. Inf. Theory , vol.36 , Issue.3 , pp. 614-622
    • Mehravari, N.1
  • 20
    • 84855465035 scopus 로고
    • Bounds for packet transmission rate in a random multiple access system
    • translated from Russian
    • B. S. Tsybakov, V. A. Mikhailov, and N. B. Likanov, "Bounds for packet transmission rate in a random multiple access system," Problemy Peredachi Informatsii, vol. 19, no. 1, pp. 61-81, 1983, (translated from Russian).
    • (1983) Problemy Peredachi Informatsii , vol.19 , Issue.1 , pp. 61-81
    • Tsybakov, B.S.1    Mikhailov, V.A.2    Likanov, N.B.3
  • 21
    • 84961955685 scopus 로고    scopus 로고
    • On the capacity of infinite population multiple access protocols with multipacket reception capability
    • D. S. Chan and T. Berger, "On the capacity of infinite population multiple access protocols with multipacket reception capability," in Proc. Allerton Conf. on Comm., Control, and Computing, Sep. 2005, pp. 124-133.
    • Proc. Allerton Conf. on Comm., Control, and Computing, Sep. 2005 , pp. 124-133
    • Chan, D.S.1    Berger, T.2
  • 22
    • 85032751837 scopus 로고    scopus 로고
    • Signal processing in random access: A cross-layer perspective
    • L. Tong, V. Naware, and P. Venkitasubramaniam, "Signal processing in random access: A cross-layer perspective," IEEE Signal Process. Mag., vol. 21, no. 9, pp. 29-39, 2004.
    • (2004) IEEE Signal Process. Mag. , vol.21 , Issue.9 , pp. 29-39
    • Tong, L.1    Naware, V.2    Venkitasubramaniam, P.3
  • 23
    • 0000861722 scopus 로고
    • A proof of queueing formula L = λW
    • J. Little, "A proof of queueing formula L = λW," Oper. Res. J., vol. 18, pp. 172-174, 1961.
    • (1961) Oper. Res. J. , vol.18 , pp. 172-174
    • Little, J.1
  • 24
    • 84867521368 scopus 로고    scopus 로고
    • Capacity of infinite population multiple access protocols on multipacket reception channels
    • to be submitted to
    • D. S. Chan and T. Berger, "Capacity of infinite population multiple access protocols on multipacket reception channels," to be submitted to IEEE Trans. Inf. Theory.
    • IEEE Trans. Inf. Theory
    • Chan, D.S.1    Berger, T.2


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