Distributed power control and spreading gain allocation in CDMA data networks

Seong-Jun Oh, Tava Lennon Olsen, Kimberly M. Wasserman

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

42 Citations (Scopus)

Abstract

We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists of K base stations and M wireless data users. The data streams generated by the users are treated as best-effort traffic, in the sense that there are no pre-specified constraints on the quality of the radio channels. We are interested in designing a distributed algorithm that achieves maximal (or near-maximal in some reasonable sense) aggregate throughput, subject to peak power constraints. We provide an algorithm where base stations coordinate in a distributed fashion to control the powers and spreading gains of the users, and show that it converges to a Nash equilibrium point. In general, there may be multiple equilibrium points; however, certain structural properties of the throughput expression can be exploited to significantly trim the search space and induce an ordering on the users in each cell. The numerical results indicate that with these modifications, the algorithm frequently converges in just a few iterations to the throughput maximizing (globally optimal) power and spreading gain allocation.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages379-385
Number of pages7
Volume2
Publication statusPublished - 2000
Externally publishedYes
Event19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' - Tel Aviv, Isr
Duration: 2000 Mar 262000 Mar 30

Other

Other19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications'
CityTel Aviv, Isr
Period00/3/2600/3/30

Fingerprint

Power control
Code division multiple access
Throughput
Base stations
Parallel algorithms
Resource allocation
Structural properties

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Oh, S-J., Olsen, T. L., & Wasserman, K. M. (2000). Distributed power control and spreading gain allocation in CDMA data networks. In Proceedings - IEEE INFOCOM (Vol. 2, pp. 379-385). IEEE.

Distributed power control and spreading gain allocation in CDMA data networks. / Oh, Seong-Jun; Olsen, Tava Lennon; Wasserman, Kimberly M.

Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 2000. p. 379-385.

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

Oh, S-J, Olsen, TL & Wasserman, KM 2000, Distributed power control and spreading gain allocation in CDMA data networks. in Proceedings - IEEE INFOCOM. vol. 2, IEEE, pp. 379-385, 19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications', Tel Aviv, Isr, 00/3/26.
Oh S-J, Olsen TL, Wasserman KM. Distributed power control and spreading gain allocation in CDMA data networks. In Proceedings - IEEE INFOCOM. Vol. 2. IEEE. 2000. p. 379-385
Oh, Seong-Jun ; Olsen, Tava Lennon ; Wasserman, Kimberly M. / Distributed power control and spreading gain allocation in CDMA data networks. Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 2000. pp. 379-385
@inproceedings{728d6f4a05a342d3b02549b988136ee6,
title = "Distributed power control and spreading gain allocation in CDMA data networks",
abstract = "We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists of K base stations and M wireless data users. The data streams generated by the users are treated as best-effort traffic, in the sense that there are no pre-specified constraints on the quality of the radio channels. We are interested in designing a distributed algorithm that achieves maximal (or near-maximal in some reasonable sense) aggregate throughput, subject to peak power constraints. We provide an algorithm where base stations coordinate in a distributed fashion to control the powers and spreading gains of the users, and show that it converges to a Nash equilibrium point. In general, there may be multiple equilibrium points; however, certain structural properties of the throughput expression can be exploited to significantly trim the search space and induce an ordering on the users in each cell. The numerical results indicate that with these modifications, the algorithm frequently converges in just a few iterations to the throughput maximizing (globally optimal) power and spreading gain allocation.",
author = "Seong-Jun Oh and Olsen, {Tava Lennon} and Wasserman, {Kimberly M.}",
year = "2000",
language = "English",
volume = "2",
pages = "379--385",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - Distributed power control and spreading gain allocation in CDMA data networks

AU - Oh, Seong-Jun

AU - Olsen, Tava Lennon

AU - Wasserman, Kimberly M.

PY - 2000

Y1 - 2000

N2 - We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists of K base stations and M wireless data users. The data streams generated by the users are treated as best-effort traffic, in the sense that there are no pre-specified constraints on the quality of the radio channels. We are interested in designing a distributed algorithm that achieves maximal (or near-maximal in some reasonable sense) aggregate throughput, subject to peak power constraints. We provide an algorithm where base stations coordinate in a distributed fashion to control the powers and spreading gains of the users, and show that it converges to a Nash equilibrium point. In general, there may be multiple equilibrium points; however, certain structural properties of the throughput expression can be exploited to significantly trim the search space and induce an ordering on the users in each cell. The numerical results indicate that with these modifications, the algorithm frequently converges in just a few iterations to the throughput maximizing (globally optimal) power and spreading gain allocation.

AB - We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists of K base stations and M wireless data users. The data streams generated by the users are treated as best-effort traffic, in the sense that there are no pre-specified constraints on the quality of the radio channels. We are interested in designing a distributed algorithm that achieves maximal (or near-maximal in some reasonable sense) aggregate throughput, subject to peak power constraints. We provide an algorithm where base stations coordinate in a distributed fashion to control the powers and spreading gains of the users, and show that it converges to a Nash equilibrium point. In general, there may be multiple equilibrium points; however, certain structural properties of the throughput expression can be exploited to significantly trim the search space and induce an ordering on the users in each cell. The numerical results indicate that with these modifications, the algorithm frequently converges in just a few iterations to the throughput maximizing (globally optimal) power and spreading gain allocation.

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

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

M3 - Conference contribution

AN - SCOPUS:0033884535

VL - 2

SP - 379

EP - 385

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -