A code switching technique for distributed spread spectrum packet radio networks
Abstract
A protocol for the use of spreading codes in a spread spectrum packet radio network is presented. Throughput results for a single-hop homogeneous network in heavy traffic are given. With the protocol, each terminal is assigned two unique spreading codes: one that the terminal uses to monitor the channel when it is idle, and a different code that the terminal switches to after transmitting an initial addressing header, which is transmitted on the destination's monitoring code. Limiting throughput results are obtained. Under the assumption of exponentially distributed packet lengths a limiting throughput per terminal pair corresponding to a utilization of .3431 for a system with an infinite number of users and infinite bandwidth is obtained.
- Publication:
-
ICC 1985; International Conference on Communications
- Pub Date:
- 1985
- Bibcode:
- 1985icc..conf.1093S
- Keywords:
-
- Communication Networks;
- Distributed Parameter Systems;
- Packet Switching;
- Protocol (Computers);
- Radio Communication;
- Spread Spectrum Transmission;
- Markov Chains;
- Partitions (Mathematics);
- Probability Distribution Functions;
- Turing Machines;
- Communications and Radar