TY - GEN
T1 - Performance of wireless CDMA networks under optimal link-layer adaptation
AU - Muqattash, Alaa
AU - Krunz, Marwan
PY - 2007
Y1 - 2007
N2 - In this paper, we determine the maximum achievable "performance" of a wireless CDMA network that employs a conventional matched filter receiver and that operates under optimal link-layer adaptation where each user individually achieves the Shannon capacity. The derived bounds serve as benchmarks against which adaptive CDMA systems can be compared. We focus on two optimization criteria: minimizing the maximum service time and maximizing the sum of users rates (i.e., network throughput). We show that the problem of joint optimization of the transmission powers and rates so as to minimize the maximum service time can be formulated as a generalized geometric program (GGP), which can be transformed into a nonlinear convex problem and solved optimally and efficiently. When the goal is to maximize the sum of the rates, we show that the problem can be approximated as a GGP. Our derivation methodologies are applicable to both ad hoc and cellular networks. Numerical results are provided to show how well variable-rate, variable-power adaptation schemes perform relative to the performance bounds derived in this paper.
AB - In this paper, we determine the maximum achievable "performance" of a wireless CDMA network that employs a conventional matched filter receiver and that operates under optimal link-layer adaptation where each user individually achieves the Shannon capacity. The derived bounds serve as benchmarks against which adaptive CDMA systems can be compared. We focus on two optimization criteria: minimizing the maximum service time and maximizing the sum of users rates (i.e., network throughput). We show that the problem of joint optimization of the transmission powers and rates so as to minimize the maximum service time can be formulated as a generalized geometric program (GGP), which can be transformed into a nonlinear convex problem and solved optimally and efficiently. When the goal is to maximize the sum of the rates, we show that the problem can be approximated as a GGP. Our derivation methodologies are applicable to both ad hoc and cellular networks. Numerical results are provided to show how well variable-rate, variable-power adaptation schemes perform relative to the performance bounds derived in this paper.
KW - Ad hoc
KW - Adaptive transmission
KW - CDMA
KW - Cellular
KW - Geometric programming
KW - Joint rate/power control
UR - http://www.scopus.com/inward/record.url?scp=34548301981&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548301981&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2007.199
DO - 10.1109/INFCOM.2007.199
M3 - Conference contribution
AN - SCOPUS:34548301981
SN - 1424410479
SN - 9781424410477
T3 - Proceedings - IEEE INFOCOM
SP - 1703
EP - 1711
BT - Proceedings - IEEE INFOCOM 2007
T2 - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Y2 - 6 May 2007 through 12 May 2007
ER -