Collision-Resolution Algorithms and Random-Access Communications

  • James L. Massey
Part of the International Centre for Mechanical Sciences book series (CISM, volume 265)


Communications engineers have a long acquaintance with the “multiple-access” problem, i.e., the problem of providing the means whereby many senders of information can share a common communications resource. The “classical” solution has been to do some form of multiplexing (e.g., time-division multiplexing (TDM) or frequency-division multiplexing (FDM) in order to parcel out the resource equitably among the senders.) A fixed division of the resources, however, becomes inefficient when the requirements of the users vary with time. The classical “fix” for the multiplexing solution is to add some form of demand-assignment so that the particular division of resources can be adapted to meet the changing requirements. Such demand-assigned multiplexing techniques have proved their worth in a myriad of multiple-access applications.


Feedback Channel Channel Error Empty Slot Transmission Slot Arrival Epoch 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. Abramson, “The ALOHA system — another alternative for computer communications”. AFIPS Conf. Proc., Fall Joint Comp. Conf., vol. 37, pp. 281–285, 1970.Google Scholar
  2. [2]
    L.G. Roberts, “ALOHA packet system with and without slots and capture”, ASS Note 8, ARPA Network Infor. Ctr., Stanford Res. Inst., Stanford, CA, June 1972.Google Scholar
  3. [3]
    J.I. Capetanakis, “The multiple access broadcast channel: protocol and capacity considerations”, Ph.D. Thesis, Course VI, Mass. Inst. Tech., Cambridge, MA, August 1977; orally presented at IEEE Int. Symp. Info. Th., Ithaca, NY, October 10–14, 1977.Google Scholar
  4. [4]
    J.I. Capetanakis, “Tree algorithms for packet broadcast channels”, IEEE Trans. Info. Th., vol. IY-25, pp. 505–515, September 1979.CrossRefMATHMathSciNetGoogle Scholar
  5. [5]
    J.I. Capetanakis, “Generalized TDMA: The multi-accessing tree protocol”, IEEE Trans. Comm., vol. COM-27, pp. 1476–1484, October 1979.ADSCrossRefGoogle Scholar
  6. [6]
    R.G. Gallager, Private Communication, January 1978.Google Scholar
  7. [7]
    B.S. Tsybakov and V.A. Mihailov, “Slotted multiaccess packet-broadcasting feedback channel”, Problemy Peredachi Informatsii, vol. 14, pp. 32–59, October-December 1978.MATHGoogle Scholar
  8. [8]
    A.J. Viterbi and J.K. Omura, Principles of Digital Communication and Coding, New York, McGraw-Hill, 1979, pp. 40–42.MATHGoogle Scholar
  9. [9]
    R.G. Gallager, “Conflict resolution in random access broadcast networks”, preliminary manuscript, 1979.Google Scholar
  10. [10]
    J. Mosely, “An efficient contention resolution algorithm for multiple access channels”, Tech. Rpt. HDS-TH-918, Lab. Info. Dec. Sys., Mass. Inst. of Tech., Cambridge, MA, June 1979.Google Scholar
  11. [11]
    N. Pippenger, “Bounds on the performance of protocols for a multi-access broadcast channel”, Res. Rpt. 7742 (#33525), IBM Res. Ctr., Yorktown Heights, NY, June 28, 1979.Google Scholar
  12. [12]
    P. Humblet, Private Communication, November 1979.Google Scholar
  13. [13]
    M. Molle, “On the capacity of infinite population multiple access protocols”, submitted to IEEE Trans. Info. Th., April 1980.Google Scholar
  14. [14]
    L. Kleinrock and F.A. Tobagi, “Packet switching in radio channels: Parity I — Carrier sense multiple-access modes and their throughput-delay characteristics”, IEEE Trans. Comm., vol. COM-23, pp. 1400–1416, December 1975.CrossRefMATHGoogle Scholar
  15. [15]
    L.G. Roberts, “Dynamic allocation of satellite capacity through packet reservations”, Proc. Nat. Comp. Conf., pp. 711–716, 1973.Google Scholar
  16. [16]
    J.F. Hayes, “An adaptive technique for local distribution”, IEEE Trans. Cornm., vol. COM-26, pp. 1178–1186, August 1978.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 1981

Authors and Affiliations

  • James L. Massey
    • 1
  1. 1.University of California, Los AngelesLos AngelesUSA

Personalised recommendations