Spreading gain control in random access direct-sequence spread spectrum data networks

Seong Jun Oh, Kimberly M. Wasserman

Research output: Contribution to conferencePaper

Abstract

In this paper, we consider a time-slotted DS-SSMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate `bursty' packet data and transmit in a random access fashion over a common broadband channel to the access point using different spreading codes. As in narrowband ALOHA systems, the performance of random access spread spectrum networks can be severely hampered due to saturation effects caused by inherent bistable behavior. We study the affect of dynamic spreading gain control on the stability and throughput properties of the network. We provide an optimal algorithm and establish a necessary and sufficient condition under which the algorithm eliminates bistability. If the condition holds, then the resulting operating point is the best possible; otherwise, the two resulting stability points are, in some sense, the best possible. In either case, the algorithm achieves high throughput.

Original languageEnglish
Pages48-52
Number of pages5
Publication statusPublished - 1997 Dec 1
Externally publishedYes
EventProceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2) - San Diego, CA, USA
Duration: 1997 Oct 121997 Oct 16

Other

OtherProceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2)
CitySan Diego, CA, USA
Period97/10/1297/10/16

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Oh, S. J., & Wasserman, K. M. (1997). Spreading gain control in random access direct-sequence spread spectrum data networks. 48-52. Paper presented at Proceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2), San Diego, CA, USA, .