Conflict Resolution Protocols for Secure Multiple-Access Communication Systems

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.

[1]  Jeannine Mosely,et al.  An efficient contention resolution algorithm for multiple access channels , 1979 .

[2]  J. Massey.  Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[3]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[4]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[5]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[6]  J. M. Aein,et al.  Modulation techniques for multiple access to a hard-limiting satellite repeater , 1966 .

[7]  Frits C. Schoute.  Decentralized control in packet switched satellite communication , 1978 .

[8]  Mart Molle,et al.  On the capacity of infinite population multiple access protocols , 1982, IEEE Trans. Inf. Theory.

[9]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975, IEEE Trans. Commun..

[10]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[11]  N. Mehravari,et al.  Conflict resolution protocols for random multiple-access channels with binary feedback , 1982 .

[12]  Bruce E. Hajek,et al.  Information of partitions with applications to random access communications , 1982, IEEE Trans. Inf. Theory.

[13]  J. Wittman.  Categorization of Multiple-Access/Random-Access Modulation Techniques , 1967, IEEE Transactions on Communication Technology.

[14]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[15]  J. Hayes,et al.  An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..

[16]  Jean Walrand,et al.  Decentralized control in packet switched satellite communication , 1979 .

[17]  Toby Berger,et al.  The Poisson Multiple-Access Conflict Resolution Problem , 1981 .

[18]  John Ippocratis Capetanakis.  The multiple access broadcast channel : protocol and capacity considerations. , 1977 .

[19]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[20]  P. Ungar.  The cutoff point for group testing , 1960 .

[21]  M. Ferguson,et al.  On the Control, Stability, and Waiting Time in a Slotted ALOHA Random-Access System , 1975, IEEE Trans. Commun..

[22]  Bruce E. Hajek,et al.  A new upper bound to the throughput of a multi-access broadcast channel , 1982, IEEE Trans. Inf. Theory.

[23]  Nicholas Pippenger,et al.  Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.

[24]  P. Papantoni-Kazakos,et al.  A Collision Resolution Protocol for Random Access Channels with Energy Detectors , 1982, IEEE Trans. Commun..

[25]  J. Capetanakis,et al.  Generalized TDMA: The Multi-Accessing Tree Protocol , 1979, IEEE Trans. Commun..

[26]  Erol Gelenbe,et al.  Stability and Optimal Control of the Packet Switching Broadcast Channel , 1977, JACM.