A hand-shake protocol for spread spectrum multiple access networks

A receiver-based protocol for spread-spectrum multiple-access networks is proposed and analyzed. This scheme is based on a handshake procedure before any formal transmission of data packets. The protocol is collision-free during data transmission and can limit the number of simultaneous transmissions. The system is modeled as a two-dimensional Markov chain from which the throughput can be determined. Numerical results are presented and compared with those for other protocols. With a minislotted channel, the handshaking time is reasonably short, and it is shown that the performance can be significantly improved when the average packet length is not too small. Moreover, very high throughput can still be maintained, even when the offered traffic is high. The proposed protocol can be applied in multipoint to point situations as well as in multihop radio networks with a central station in each hop