Advertisement

Conflict Resolution Protocols for Secure Multiple-Access Communication Systems

  • Toby Berger
  • Nader Mehravari
Part of the International Centre for Mechanical Sciences book series (CISM, volume 279)

Abstract

Significant demand exists for systems which permit a large population of occasionally active communicators to exchange messages securely. In these lectures we introduce and analyze efficient algorithms for resolving conflicts over access to the transmission medium among communicators who are employing either public key cryptography or spread spectrum signaling. Our intention is to extend some recent results in the theory of random multiple-access time-slotted communication systems to make them compatible with constraints imposed by the need for secure communications.

Keywords

Time Division Multiple Access Binary Tree Search Defective Unit Maximum Achievable Throughput Random Access Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. H. Wittman, “Categorization of Multiple-Access/Random Access Modulation techniques,” IEEE Trans. Commun. Tech., Vol. COM-15, No. 5, pp. 724–725, Oct. 1967.Google Scholar
  2. [2]
    J. W. Schwartz, J. M. Aein, and J. Kaiser, “Modulation Techniques for Multiple Access to a Hard-Limiting Satellite Repeater,” Proc. IEEE, Vol. 54, pp. 763–777, May 1966.CrossRefGoogle Scholar
  3. [3]
    S. S. Lam, “A New Measure of Characterizing Data Traffic,” IEEE Trans. Commun., Vol. COM-26, No. 1, pp 137–140, Jan. 1978.Google Scholar
  4. [4]
    N. Abramson, “The ALOHA System - Another Alternative for Computer Communications,” AFIPS Conf. Proc., Vol. 37, AFIPS Press, pp. 281285, 1970.Google Scholar
  5. [5]
    L. G. Roberts, “ALOHA Packet System with and without Slots and Capture,” ARPANET Satellite System Note 8, ARPA Network Info. Ctr., Stanford Res. Inst., Stanford, CA, June 1972. Reprinted in Computer Communications Review, Vol. 5, April 1975.Google Scholar
  6. [6]
    L. Kleinrock, Queueing Systems, Vol. 2: Computer Applications, Wiley, NY, 1976.MATHGoogle Scholar
  7. [7]
    G. Fayolle, E. Gelenbe, and J. Labetoulle, “Stability and Optimal Control of the Packet Switching Broadcast Channel, ” J. of the Assoc. of Comp. Mach., Vol. 24, No. 3, pp. 375–386, July 1977.MathSciNetCrossRefMATHGoogle Scholar
  8. [8]
    M. J. Ferguson, “On the Control, Stability, and Waiting time in a Slotted ALOHA Random-Access System”, IEEE Trans. Commun., Vol. COM-23, No. 11, pp. 1306–1311, Nov. 1975.Google Scholar
  9. [9]
    S. S. Lam, and L. Kleinrock, “Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures,” IEEE Trans. Commun., Vol. COM-23, No. 9, pp. 91–94, Sept. 1975.Google Scholar
  10. [10]
    V. A. Mihailov, “A Random Access Algorithm for a Broadcast Channel,” presented in the 5th Int’l. Symposium on Info. Theory, Tbilisi, Georgia, USSR, Vol. 3, pp. 83–86, in Russian, 3–7, July, 1979.Google Scholar
  11. [11]
    B. Hajek, and T. Van Loon, “Decentralized Dynamic Control of a Multi-Access Broadcast Channel,” to appear in IEEE Trans. Auto. Control, 1982.Google Scholar
  12. [12]
    J. I. Capetanakis, “The Multiple Access Broadcast Channel: Protocol and Capacity Consideration,” Technical Report ESL-R-806, MIT, Cambridge, MA, March 1978.Google Scholar
  13. [13]
    J. I. Capetanakis, “Tree Algorithm for Packet Broadcast Channels,” IEEE Trans. Info. Theory, Vol. IT-25, No. 5, pp. 505–515, Sept. 1979.MathSciNetCrossRefGoogle Scholar
  14. [14]
    J. I. Capetanakis, “Generalized TDMA: The Multi-Accessing Tree Protocol,” IEEE Trans. Commun., Vol. COM-27, No. 10, pp. 1476–1484, Oct. 1979.Google Scholar
  15. [15]
    B. S. Tsybakov, and V. A. Mikhailov, “Slotted Multi-Access Packet-Broadcasting Feedback Channel,” in Russian, Problemy Peredachi Informatsii, Vol. 14, No. 4, pp. 32-59, Oct.-Dec. 1978. Translated as “Free Synchronous Packet Access in Broadcast Channel with Feedback,” Problems of Information Transmission, Vol. 14, No. 4, pp. 259–280, Plenum Publishing Co., NY, 1978.Google Scholar
  16. [16]
    R. G. Gallager, “Conflict Resolution in Random Access Broadcast Networks,” Proc. of the AFOSR Workshop in Communications Theory and Applications, Provincetown, MA, pp. 74–76, 17–20, Sept., 1978.Google Scholar
  17. [17]
    J. Mosely, “An Efficient Contention Resolution Algorithm for Multiple Access Chanels,” Technical Report LIDS-TH-918, MIT, Cambridge, MA, June 1979.Google Scholar
  18. [18]
    J. L. Massey, “Collision-Resolution Algorithms and Random Access Communications,” in Multi-User Communications, Edited by G. Longo, Springer-Verlag, CISM Courses and Lecture Series, No. 265, 1981.Google Scholar
  19. [19]
    T. Berger, “The Poisson Multiple Access Conflict Resolution Problem,” in Multi-User Communications, Edited by G. Longo, Springer-Verlag, CISM Courses and Lecture Series, No. 265, 1981.Google Scholar
  20. [20]
    N. Mehravari, “T’:be Straddle Algorithm for Conflict Resolution in Multiple Access Channels,” MS Thesis, School of Elect. Engr., Cornell Univ., Ithaca, NY, May 1980.Google Scholar
  21. [21]
    N. Pippenger, “Bounds on the Performance of Protocols for a Multiple Access Broadcast Channel,” IEEE Trans. Info. Theory, Vol. IT-27, No. 2, pp. 145–152, March 1981.MathSciNetGoogle Scholar
  22. [22]
    M. L. Molle, “On the Capacity of the Infinite Population Multiple-Access Protocols, IEEE Trans. on Info. Theory, Vol. IT-28, No. 3, 396–402, May 1982.MathSciNetCrossRefGoogle Scholar
  23. [23]
    R. Cruz, and B. Hajek, “A New Upper-Bound to the Throughput of a Multi-Access Broadcast Channel,” IEEE Trans. on Info. Theory, Vol. IT-28, No. 3, pp. 402–406, May 1982.Google Scholar
  24. [24]
    B. Hajek, “Information of Partitions with Applications to Random Access Communications,” Coordinated Sciences Lab. and Dept. of Elect. Engr., Univ. of Ill., Urbana, Ill., June 1980, (To appear in IEEE Trans. on Info. Theory, September, 1982.)Google Scholar
  25. [25]
    P. Humblet, private communication between J. Massey and P. Humblet, mentioned in [18].Google Scholar
  26. [26]
    V. A. Mihailov, and B. S. Tsybakov, “An Upper Bound to Capacity of Random Multiple Access System,” In Russian, Problemy Peredachi Informatsii, Vol. 17, No. 1, pp. 90–95, Jan.-Mar. 1981, Moscow, USSR. Translated as “Upperbound for the Capacity of Random Multiple Access System,” Problems of Information Transmission, Vol. 17, No. 1, pp. 63–67, Plenum Publishing Co., NY, 1981.Google Scholar
  27. [27]
    T. Berger, N. Mehravari, and G. Munson, “On Genie-Aided Upper Bounds to Multiple Access Contention Resolution Efficiency,” Proc. of 1981 Conf. on Info. Sciences and Systems, John Hopkins Univ., Baltimore, MD, 25–27, March 1981.Google Scholar
  28. [28]
    B. S. Tsybakov, “Resolution of Conflict with Known Multiplicity,” in Russian, Problemy Peridachi Informatsii, Vol. 16, No. 2, pp. 69–82, Apr.-June 1980, Moscow, USSR. Translated as “Resolution of a Conflict of Known Multiplicity,” Problems of Information Transmission, Vol. 16, No. 2, Plenum Publishing Co., NY, 1980.Google Scholar
  29. [29]
    L. Georgiadis, and P. Papantoni-Kazakos, “A Collision Resolution Protocol for Random Access Channels with Energy Detectors,” EECS Dept., Univ. of Conn., Storrs, CT, 1981. Submitted to IEEE Trans. on Commun.Google Scholar
  30. [30]
    T. Berger and N. Mehravari, “Conflict Resolution Protocols for Random Multiple Access Channel with Binary Feedback ” Proc. of Nineteenth Annual Allerton Conf. on Commun., Control, and Computing, Sept. 30-Oct. 2, 1981.Google Scholar
  31. [31]
    D. F. Towsley, and J. K. Wolf, “An Application of Group Testing to the Design of Multi-User Access Protocols,” Dept. of EE and Computer Engr., Univ. of Mass., Amherst, MA. Presented at the Nineteenth Annual Allerton Conf. on Commun., Control and Computing, Sept. 30-Oct. 2, 1981.Google Scholar
  32. [32]
    Robert Dorfman, “Detection of Defective Members of Large Populations,” Ann. Math. Stat., Vol. 14, pp. 436–440, 1943.CrossRefGoogle Scholar
  33. [33]
    Andrew Sterrett, “On the Detection of Defective Members of Large Populations,” Ann. of Math. Stat., Vol. 28, pp. 1033–1036, 1957.CrossRefMATHGoogle Scholar
  34. [34]
    Milton Sobel, and Phyllis A. Groll, “Group Testing to Eliminate Efficiently all Defectives in Binomial Sample,” BSTJ, Vol. 38, pp. 1179–1253, Sept. 1959.Google Scholar
  35. [35]
    Peter Ungar, “The Cutoff Point for Group Testing,” Commun. on Pure and Appl. Math., Vol. 13, pp 49–54, 1960.MathSciNetMATHGoogle Scholar
  36. [36]
    J. F. Hayes, “An adaptive Technique for Local Distribution,” IEEE Trans. on Commun., Vol. COM-26, No. 8, pp. 1178–1186, Aug. 1978.Google Scholar
  37. [37]
    F. C. Schoute, “Decentralized Control in Packet Switched Sattelite,” IEEE Trans. on auto Control., Vol. AC-23, No, 2, pp. 362–371, No. 5, pp. 794–796, Oct. 1979.Google Scholar
  38. [38]
    P. Varaiya, and J. Walrand, “Decentralized Control in Packet Switched Sattelite,” IEEE Trans. on Auto. Control, Vol. AC-24, No. 5, pp. 794–796, Oct. 1970.Google Scholar
  39. [39]
    T. Berger, “Studies in Multiterminal Communication, Information and Decision Theory,” Research proposal submitted to the National Science Foundation, School of Electrical Engineering, Cornell Univ., Ithaca, NY, June 1979.Google Scholar
  40. [40]
    N. Pippenger, Private Communication between N. Pippenger and T. Berger, February 1979.Google Scholar
  41. [41]
    N. Mehravari, Random Multiple-Access Communication with Binary Feedback, Ph.D. Thesis, School of Elect. Engr., Cornell Univ. August, 1982.Google Scholar

Copyright information

© Springer-Verlag Wien 1983

Authors and Affiliations

  • Toby Berger
    • 1
  • Nader Mehravari
    • 1
  1. 1.School of Electrical EngineeringCornell UniversityIthacaUSA

Personalised recommendations