On stability of DS-CDMA data networks with code combining

Author

Vijayakumar, Rajiv ; Wasserman, Kimberly M.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

fYear

2000

fDate

2000

Firstpage

408

Abstract

An equation is derived whose solution(s) yield the number of transmitting mobiles in the equilibrium state(s) for a DS-CDMA network employing code combining (CC). Numerical results for a simple form of CC show that while there may exist multiple equilibria, these are typically clustered together, and do not cause a significant degradation in throughput. The results also show that CC is capable of eliminating bistability, and of having a single equilibrium state at which the throughput is slightly better than that at the desirable equilibrium state for the corresponding DS-CDMA network employing automatic repeat request

Keywords

access protocols; automatic repeat request; code division multiple access; data communication; land mobile radio; packet radio networks; spread spectrum communication; stability; ARQ; DS-CDMA packet data network; automatic repeat request; bistability elimination; code combining; direct-sequence code division multiple access; equilibrium state; link layer protocol; network stability; point-to-point links; throughput; transmitting mobiles; Access protocols; Automatic repeat request; Base stations; Degradation; Equations; Matched filters; Multiaccess communication; Power control; Stability; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866706

Filename

866706