A Perspective on Multiaccess Channels

IEEE Transactions on Information Theory

Volumn 31, Issue 2, 1985, Pages 124-142

  Gallager, Robert G ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RADIO TRANSMISSION - MULTIPLEX SYSTEMS;

CODING AND DECODING TECHNIQUES; COLLISION RESOLUTION APPROACH; COMBINED APPROACH; INFORMATION THEORETIC APPROACH; MULTIACCESS CHANNELS;

INFORMATION THEORY;

EID: 0022034656     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057022     Document Type: Article

References (56)

1. N. Abramson, “The Aloha system—Another alternative for computer communications,” in Proc. Fall Joint Computer Conf., AFIPS Conf., vol. 37, 1970.
2. R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd Int. Symp. Information Theory, Tsahkadsor, Armenian S.S.R., 1971, Hungarian Acad. Sc., pp. 23–52, 1973.
3. H. Liao, “A coding theorem for multiple access communications,” in Proc. Int. Symp. Information Theory, Asilomar, CA, 1972; also “Multiple Access Channels,” Ph.D. dissertation, Dep. Elec. Eng., Univ. of Hawaii, 1972.
4. A. El Gamal and T. M. Cover, “Multiple user information theory,” in Proc. IEEE, vol. 68, pp. 1466–1483, Dec. 1980.
5. E. C. van der Meulen, “A survey of multi-way channels in information theory, 1961-1976,” IEEE Trans. Inform. Theory, vol. IT-23, Jan. 1977.
6. I. Csiszar and J. Körner Information Theory: Coding Theorems for Discrete Memotyless Systems. New York: Academic, 1981, ch. 3.
7. “Special Issue on Spread Spectrum,” IEEE Trans. Commun., May 1982.
8. M. B. Pursley, “Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks,” Rep. T-144, Co-ordinated Science Laboratory, Univ. of Illinois, June 1984.
9. D. Slepian, and J. K. Wolf, “A coding theorem for multiple access channels with correlated sources,” Bell System Tech. J., vol. 52, pp. 1037–1076, Sept. 1973.
10. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
11. M. Bierbaum and H. M. Wallmeier, “A note on the capacity region of the multiaccess channel,” IEEE Trans. Inform. Theory, vol. IT-25, p. 484, July 1979.
12. S. Arimoto, “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” IEEE Trans. Inform. Theory, vol. IT-18, no. 1, pp. 14–20, Jan. 1972.
13. R. E. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Inform. Theory, vol. IT-18, no. 4, pp. 460–470, July 1972.
14. J. L. Massey and P. Mathys, “The collision channel without feedback,” IEEE Trans. Inform. Theory, this issue.
15. E. A. Arutyunyan, “Lower bound for the error probability of multiple-access channels,” Problemy Peredachi Informatsii, vol. 11, no. 2, pp. 23–36, Apr. 1975.
16. R. L. Peterson and D. J. Costello, “Error probability and free distance bounds for two-user tree codes on multiple access channels,” IEEE Trans. Inform. Theory vol. IT-26, pp. 658–670, Nov. 1980.
17. N. T. Gaarder and J. K. Wolf, “The capacity region of a multiple access discrete memoryless channel can increase with feedback,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 100–102, Jan. 1975.
18. L. H. Ozarow, “The capacity of the white Gaussian multiple access channel with feedback,” IT Trans. Inform. Theory, vol. IT-30, pp. 623–629, July 1984.
19. T. M. Cover, R. J. McEliece, and E. C. Posner, “Asynchronous multiple-access channel capacity,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 409–413, July 1981.
20. J. Y. N. Hui and P. A. Humblet, “ The capacity region of the totally asynchronous multiple access channel,” IEEE Trans. Inform. Theory, this issue.
21. A. R. Cohen, J. A. Heller, and A. J. Viterbi, “A new coding technique for asynchronous multiple access communication,” IEEE Trans. Commun. Tech., vol. COM-19, pp. 849–855, Oct. 1971.
22. R. C. Sommer, “High efficiency multiple access communication through a signal processing repeater,” IEEE Trans. Commun. Tech., vol. COM-16, pp. 222–232, Apr. 1968.
23. P. Narayan and D. L. Snyder, “The two-user cutoff rate for an asynchronous and a synchronous multiaccess channel are the same,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 414–419, July 1981.
24. E. Arikan, private communication.
25. J. Massey “Capacity, cutoff rate, and coding for a direct detection optical channel,” IEEE Trans. Commun., vol. COM-29, pp. 1615–4621, Nov. 1981.
26. P. Humblet, “Error exponents for a direct detection optical channel,” Rep. LIDS-P-1337, Laboratory for Information and Decision Systems, Mass. Inst. of Tech., Cambridge, MA, Oct. 1983.
27. L. G. Roberts, “Aloha packet system with and without slots and capture,” ASS Note 8, Advanced Research Projects Agency, Network Info. Ctr., Stanford Research Inst., Stanford, CA, June 1972.
28. M. Kaplan, “A sufficient condition for non-ergodicity of a Markov chain,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 470–471, July 1979.
29. B. Hajek and T. van Loon, “Decentralized dynamic control of a multiaccess broadcast channel,” IEEE Trans. Automat. Contr., vol. AC-27, pp. 559–569, June 1982.
30. M. J. Ferguson, “A Study of unslotted Aloha with arbitrary message lengths,” in Proc. 4th Data Communications Symp., Quebec, PQ, Canada, Oct. 1975, pp. 5.20, 5.25.
31. D. Sant, “Throughput of unslotted Aloha channels with arbitrary packet interarrival time distribution,” Trans. Commun., vol. COM-28, 28, pp. 1422–1425, Aug. 1980.
32. J. I. Capetanakis “The multiple access broadcast channel: Protocol and capacity considerations,” Ph.D. dissertation Dept. of Elec. Eng., Mass. Inst. of Tech., Cambridge, MA, Aug. 1977; also Abstracts Int. Symp. Information Theory, Oct. 1977, Cornell Univ., and IEEE Trans. Inform. Theory, vol. IT-25, pp. 505–515, Sept. 1979.
33. J. Hayes, “An adaptive technique for local distribution,” Bell Telephone Laboratory Tech. Memo. TM-76-3116-1, Mar. 1976; also IEEE Trans. Commun., vol. COM-26, pp. 1178–1186, Aug. 1978.
34. B. S. Tsybakov and V. A. Mikhailov, “Free synchronous packet access in a broadcast channel with feedback,” Problemy Peredachi Informatsii, vol. 14, no. 4, pp. 32–59, Oct. 1978.
35. J. L. Massey, private communication, 1977; also “Collision-resolution algorithms and random access communications,” Univ. of California, Los Angeles, rep. UCLA-ENG-8016, Apr. 1980.
36. R. G. Gallager, “Conflict resolution in random access broadcast networks,” in Proc. AFOSR Workshop Communication Theory and Applications, Provincetown, MA, Sept. 1978, pp. 74–76.
37. B. S. Tsybakov and V. A. Mikhailov, “Random multiple access of packets: Part and try algorithm,” Problemy Peredachi Informatsii, vol. 16, no. 4, pp. 65–79, Oct. 1980.
38. B. S. Tsybakov and N. B. Likhanov, “An upper bound on packet delay in a multiple access channel,” Problerny Peredachi Informatsii, vol. 18, no. 4, pp. 76–84, Oct. 1980.
39. J.-C. Huang and T. Berger, “Delay analysis of the modified 0.487 contention resolution algorithm,” IEEE Trans. Inform. Theory, this issue.
40. J. Mosely and P. Humblet, “A class of efficient contention resolution algorithms for multiple access channels,” IEEE Trans. on Commun., to be published; also Laboratory for Information and Decision Systems, Mass. Inst. of Tech., Cambridge, MA, Reps. LIDS-P71194, Mar. 1982, and LIDS-TH-918, May 1979.
41. N. D. Vvedenskaya and M. S. Pinsker, “Non-optimality of the part-and-try algorithm,” in Abstracts Int. Workshop Convolutional Codes, Multiuser Communication, Sochi, USSR, 1983, pp. 141–148.
42. N. Pippenger, “Bounds on the performance of protocols for a multiple access broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-27, Mar. 1981.
43. P. A. Humblet, “Bounds on the utilization of Aloha-like multiple access broadcast channels,” Rep. LIDS-P-1000, Laboratory for Information and Decision Systems, Mass. Inst. of Tech., Cambridge, MA, June 1980.
44. M. L. Molle, “On the capacity of infinite population multiple access protocols,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 396–401, May 1982 (submitted May 1980).
45. R. Cruz and B. Hajek, “A new upper bound to the throughput of a multiaccess broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 402–405, May 1982.
46. 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, Jan. 1981.
47. R. L. Cruz, “Protocols for multiaccess channels with continuous entry and noisy feedback,” Laboratory for Information and Decision Systems, Mass. Inst. of Tech., Cambridge, MA, Rep. LIDS-TH-1213, TH-1213, May 1982.
48. B. S. Tsybakov, “Survey of USSR contributions to random access communications,” IEEE Trans. Inform. Theory, this issue.
49. P. Mathys and P. Flajolet, “Q-ary collision resolution algorithms in random-access systems with free or blocked channel access,” IEEE Trans. Inform. Theory, this issue.
50. M. G. Hluchyj and R. G. Gallager, “Multiaccess of a slotted channel by finitely many users,” in Proc. National Telecommunications Conf., New Orleans, LA, Dec. 1981; also Laboratory for Information and Decision Systems, Mass. Inst. of Tech., Cambridge, MA, Rep. LIDS-P-1131, Aug. 1981.
51. T. Berger, N. Mehravari, D. Towsley, and J. Wolf, “Random multiple access communications and group testing,” IEEE Trans. Commun., vol. COM-32, pp. 769–779, July 1984.
52. L. Kleinrock and F. A. Tobagi, “Packet switching in radio channels: Part 1: CSMA modes and their throughput-delay characteristics,” IEEE Trans. Comrnun., vol. COM-23, pp. 1400–1416, Dec. 1975.
53. J. L. Massey, “Collision resolution algorithms and random-access. communications,” Univ. of California, Los Angeles, Rep. UCLA-ENG-8016, ENG-8016, Sect. 5.3, Apr. 1980.
54. P. A. Humblet and J. Mosely, “Efficient accessing of a multiaccess channel,” in Proc. 19th Conf. Decision and Control, Dec. 10–12, 1980, Albuquerque, NM; also Mass. Inst. Tech., Cambridge, MA, Rep. LIDS-P-1040.
55. G. Sh. Poltyrev, “Coding in an asynchronous multiple-access channel,” Problemy Peredachi Informatsii, pp. 12–21, July—Sept., 1983.
56. J. Y. N. Hui, “Throughput analysis for code division multiple accessing of the spread spectrum channel,” IEEE J. Select. Areas Commun., pp. 482–486, July 1984.