Throughput of single-hop unslotted CDMA networks with fixed packet lengths

Author

Yin, Ming ; Li, Victor O K

Author_Institution

Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA

fYear

1988

Firstpage

715

Abstract

The authors present a recursive method to compute the joint distribution of bit errors for single-hop unslotted code-division multiple-access (CDMA) networks with deterministic packet lengths. The computational complexity of this method grows polynomially with M, the number of bits per packet, if the bit error probability equals 1 when the number of interferers exceeds a threshold. The complexity is O(M/sup 3/) for the L-channel model, which assumes that the probability of bit error is zero below the threshold L and 1 above the threshold. The throughput of the system can be improved by using a channel sensing protocol.<>

Keywords

code division multiple access; packet switching; bit error probability; channel sensing protocol; code-division multiple-access; computational complexity; fixed packet lengths; single-hop unslotted CDMA networks; throughput; Distributed computing; Interference; Multiaccess communication; Narrowband; Packet radio networks; Protocols; Random variables; Signal analysis; Spread spectrum communication; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1988. MILCOM 88, Conference record. 21st Century Military Communications - What's Possible? 1988 IEEE

Conference_Location

San Diego, CA, USA

Type

conf

DOI

10.1109/MILCOM.1988.13469

Filename

13469