Adaptive resource management for DS-CDMA networks subject to energy constraints

Seong-Jun Oh, Kimberly M. Wasserman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, 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 effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages556-563
Number of pages8
Volume2
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA
Duration: 1998 Mar 291998 Apr 2

Other

OtherProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3)
CitySan Francisco, CA, USA
Period98/3/2998/4/2

Fingerprint

Code division multiple access
Throughput
Gain control

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Oh, S-J., & Wasserman, K. M. (1998). Adaptive resource management for DS-CDMA networks subject to energy constraints. In Proceedings - IEEE INFOCOM (Vol. 2, pp. 556-563). IEEE.

Adaptive resource management for DS-CDMA networks subject to energy constraints. / Oh, Seong-Jun; Wasserman, Kimberly M.

Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 1998. p. 556-563.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oh, S-J & Wasserman, KM 1998, Adaptive resource management for DS-CDMA networks subject to energy constraints. in Proceedings - IEEE INFOCOM. vol. 2, IEEE, pp. 556-563, Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3), San Francisco, CA, USA, 98/3/29.
Oh S-J, Wasserman KM. Adaptive resource management for DS-CDMA networks subject to energy constraints. In Proceedings - IEEE INFOCOM. Vol. 2. IEEE. 1998. p. 556-563
Oh, Seong-Jun ; Wasserman, Kimberly M. / Adaptive resource management for DS-CDMA networks subject to energy constraints. Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 1998. pp. 556-563
@inproceedings{7312a2041dd94ad79311b8fede057b93,
title = "Adaptive resource management for DS-CDMA networks subject to energy constraints",
abstract = "In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, 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 effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.",
author = "Seong-Jun Oh and Wasserman, {Kimberly M.}",
year = "1998",
language = "English",
volume = "2",
pages = "556--563",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - Adaptive resource management for DS-CDMA networks subject to energy constraints

AU - Oh, Seong-Jun

AU - Wasserman, Kimberly M.

PY - 1998

Y1 - 1998

N2 - In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, 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 effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

AB - In this paper, we consider a time-slotted DS-CDMA network consisting of a single radio access point and a finite number of mobile wireless terminals. The terminals generate non-real-time packet data and transmit, subject to constraints on the average energy consumed per packet transmission, 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 effect of dynamic spreading gain control on the stability and throughput properties of the network. We first impose no energy constraints and provide an optimal (throughput maximizing) algorithm under which (i) the asymptotically optimal retransmission probability is equal to one, and (ii) the optimal spreading gain increases linearly as the MAI level increases, or equivalently, the transmission rate decreases inverse linearly as the MAI level increases. We also obtain a simple closed-form expression for the asymptotic throughput as the number of backlogged terminals becomes large. We then impose energy constraints and modify the optimal algorithm by controlling both the spreading gain and retransmission probability of the terminals. The resulting algorithm may or may not eliminate bistability; however, in either case, it achieves high throughput.

UR - http://www.scopus.com/inward/record.url?scp=0031675089&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031675089&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 556

EP - 563

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -