Collision Resolution Algorithms for CDMA Systems

A study is made of collision resolution algorithms for code-division multiple-access systems. Both random and fixed code assignment are considered. Different codes are orthogonal. Two types of multiuser interference are considered. Either the well-known 0.487 algorithm or a windowed version of Capetanakis' collision resolution algorithm is used in resolving collisions. Throughput and delay are derived for each of the protocols considered. Computer simulations are provided to verify the validity of the analysis. >

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

[2]  Israel Cidon,et al.  Splitting protocols in presence of capture , 1985, IEEE Trans. Inf. Theory.

[3]  Toby Berger,et al.  Delay Analysis of 0.487 Contention Resolution Algorithms , 1986, IEEE Trans. Commun..

[4]  Andrew J. Viterbi,et al.  When not to spread spectrum - A sequel , 1985, IEEE Communications Magazine.

[5]  L. B. Milstein,et al.  Theory of Spread-Spectrum Communications - A Tutorial , 1982, IEEE Transactions on Communications.

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

[7]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[8]  M.B. Pursley.  The role of spread spectrum in packet radio networks , 1987, Proceedings of the IEEE.

[9]  Pierre A. Humblet.  On the Throughput of Channel Access Algorithms with Limited Sensing , 1986, IEEE Trans. Commun..

[10]  George Thomas.  Application of multiuser coding to random access protocols , 1988, IEEE Trans. Commun..

[11]  E. J. Weldon,et al.  Coding for T-user multiple-access channels , 1979, IEEE Trans. Inf. Theory.