Skip to main content

Advertisement

Log in

Decoupled Power Allocation Through Pricing on a CDMA Reverse Link Shared by Energy-Constrained and Energy-Sufficient Data Terminals

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

We perform market-oriented management of the reverse link of a CDMA cell populated by data terminals, each with its own data rate, channel gain, willingness to pay (wtp), and link-layer configuration, and with energy supplies that are limited for some, and inexhaustible for others. For both types of energy budgets, appropriate performance indices are specified. Notably, our solution is “decoupled” in that a terminal can choose optimally, irrespective from choices made by the others, because it pays in proportion to its fraction of the total power at the receiver, which directly determines its signal-to-interference ratio (SIR), and hence its performance. By contrast, in other similarly-sounding schemes terminals’ optimal choices are interdependent, which leads to “games of strategy”, and their practical and theoretical complications. We study two situations: pricing for maximal (i) network revenue, and (ii) social benefit. The socially-optimal price is common to all terminals of a given energy class, and an energy-constrained terminal pays in proportion to the square of its power fraction. By contrast, the revenue-maximising network sets for each terminal an individual price that drives the terminal to the “revenue per Watt” maximiser. The network price is higher, and drives each terminal to consume less. Distinguishing features of our model are: (i) the simultaneous consideration of both limited and unlimited energy supplies, (ii) the performance metrics utilised (one for each type of energy supply), (iii) the generality of our physical model, which can lead to an optimal link-layer configuration, and (iv) our pricing of the received power fraction which yields a “decoupled” solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Alpcan T, Basar T, Srikant R, Altman E (2002) CDMA uplink power control as a noncooperative game. Wirel Netw 8(6):659–670. doi:10.1023/A:1020375225649

    Article  MATH  Google Scholar 

  2. Athey S (2001) Single crossing properties and the existence of pure strategy equilibria in games of incomplete information. Econometrica 69(4):861–889. doi:10.1111/1468-0262.00223

    Article  MathSciNet  MATH  Google Scholar 

  3. Clearwater SH (ed) (1996) Market-based control: a paradigm for distributed resource allocation. World Scientific, Singapore

    Google Scholar 

  4. Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266–288. doi:10.1287/opre.5.2.266

    Article  MathSciNet  Google Scholar 

  5. Dubey P (1986) Inefficiency of Nash equilibria. Math Oper Res 11(1):1–8. doi:10.1287/moor.11.1.1

    Article  MathSciNet  MATH  Google Scholar 

  6. Feng N, Mau SC, Mandayam N (2004) Pricing and power control for joint network-centric and user-centric radio resource management. IEEE Trans Commun 52(9):1547–1557. doi:10.1109/TCOMM.2004.833191

    Article  Google Scholar 

  7. Goodman DJ, Mandayam N (2000) Power control for wireless data. IEEE Pers Commun 7(2):48–54. doi:10.1109/98.839331

    Article  Google Scholar 

  8. Hanly SV, Tse DN (1999) Power control and capacity of spread spectrum wireless networks. Automatica 35(12):1987–2012. doi:10.1016/S0005-1098(99)00133-8

    Article  MathSciNet  MATH  Google Scholar 

  9. Karush W (1939) Minima of functions of several variables with inequalities as side constraints. Master’s thesis, University of Chicago

  10. Koskie S, Gajic Z (2005) A Nash game algorithm for SIR-based power control in 3G wireless CDMA networks. IEEE/ACM Trans Netw 13(5):1017–1026. doi:10.1109/TNET.2005.857068

    Article  Google Scholar 

  11. Kuhn HW, Tucker HW (1951) Nonlinear programming. In: Proc. second berkeley symp. on math. statist. and prob., pp 481–492

  12. MacKenzie A, Wicker S (2001) Game theory and the design of self-configuring, adaptive wireless networks. IEEE Commun Mag 39(11):126 –131. doi:10.1109/35.965370

    Article  Google Scholar 

  13. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons, New York, NY, USA

    MATH  Google Scholar 

  14. Meshkati F, Goldsmith AJ, Poor HV, Schwartz SC (2007) A game-theoretic approach to energy-efficient modulation in CDMA networks with delay QoS constraints. IEEE J Sel Areas Commun 25(6):1069–1078. doi:10.1109/JSAC.2007.070802

    Article  Google Scholar 

  15. Meshkati F, Poor H, Schwartz S, Mandayam N (2005) An energy-efficient approach to power control and receiver design in wireless data networks. IEEE Trans Commun 53(11):1885–1894. doi:10.1109/TCOMM.2005.858695

    Article  Google Scholar 

  16. Rodriguez V (2003) An analytical foundation for resource management in wireless communication. In: Global telecommunications conf., vol 2. IEEE, pp 898–902. doi:10.1109/GLOCOM.2003.1258369

  17. Rodriguez V (2004) A robust and tractable analytical foundation for radio resource management: centralized and decentralized optimizations involving data and media communication. Ph.D. thesis, Polytechnic University, Brooklyn, New York

  18. Rodriguez V, Jondral F, Mathar R (2009) Power allocation for social benefit on a CDMA reverse link shared by energy-constrained and energy-sufficient data terminals. In: 6th IEEE international symp. on wireless communication systems, pp. 56–60. doi:10.1109/ISWCS.2009.5285243

  19. Rodriguez V, Jondral F, Mathar R (2009) Power allocation through revenue-maximising pricing on a CDMA reverse link shared by energy-constrained and energy-sufficient heterogeneous data terminals. In: IEEE 69th vehicular technology conf., pp 1–6. doi:10.1109/VETECS.2009.5073811

  20. Rodriguez V, Mathar R (2010) Generalised link-layer adaptation with higher-layer criteria for energy-constrained and energy-sufficient data terminals. In: 7th IEEE international symp. on wireless communication systems, pp 927–931. doi:10.1109/ISWCS.2010.5624336

  21. Rodriguez V, Mathar R (2010) Simple decentralised market-oriented allocation of sub-channels and power for access-point to terminal multi-carrier communication. In: Conference on information sciences and systems (CISS). Princeton, NJ. doi:10.1109/CISS.2010.5464778

  22. Saraydar CU, Mandayam NB, Goodman DJ (2002) Efficient power control via pricing in wireless data networks. IEEE Trans Commun 50(2):291–303. doi:10.1109/26.983324

    Article  Google Scholar 

  23. Sung CW, Wong WS (2003) A noncooperative power control game for multirate CDMA data networks. IEEE Trans Wirel Commun 2(1):186–194. doi:10.1109/TWC.2002.806394

    Article  Google Scholar 

  24. Varian HR (1992) Microeconomic analysis, 3rd edn. W.W. Norton & Co., New York

    Google Scholar 

  25. Xiao M, Shroff NB, Chong EK (2003) A utility-based power-control scheme in wireless cellular systems. IEEE/ACM Trans Netw 11(2):210–221. doi:10.1109/TNET.2003.810314

    Article  Google Scholar 

Download references

Acknowledgements

Most of the basic research reported herein was performed at the Universität Karlsruhe (now Karlsruher Institut für Technologie) with the financial support of the European Commission through the PULSERS II project. Important additional work was done at RWTH Aachen with the support of the Deutsche Forschungsgemeinschaft (DFG), through the UMIC project. The preparation of the final revised manuscript was supported by the Communication Networks (ComNets) Chair at RWTH Aachen.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Virgilio Rodriguez.

Appendix: Mathematical issues

Appendix: Mathematical issues

In the analysis we assume that certain functions involving an S-curve or the derivative of an S-curve retain the S-shape, or the “single-peakedness” of the derivative (see Fig. 1).

Definition 9.1

\(S:\Re_{+}\rightarrow[0,Y]\), is an S-curve with unique inflexion at x f if (i) S(0) = 0, S is (ii) continuously differentiable, (iii) strictly increasing, (iv) convex over [0,x f ) and concave over (x f , ∞ ), and (v) surjective.

Remark A.1

In Definition A.1, S is strictly increasing and also surjective (for each y ∈ [0, Y] there is an \(x\in\Re_{+}\) such that f(x) = y). Therefore, S must approach Y asymptotically as x goes to infinity (i. e. , this follows from the definition).

Definition 9.2

A function \(h:\Re_{+}\rightarrow[0,Y]\) is single-peaked over \(\Re_{+}\) if h is continuous, surjective and has a global maximum at X ∈ (0, ∞ ) (that is, h(X) = Y, \(0\leq x_{1}<x_{2}\leq X\implies h(x_{2})>h(x_{1})\) and \(X\leq x_{1}<x_{2}\implies h(x_{2})<h(x_{1})\)).

Remark A.2

In Definition A.2, h is strictly increasing up to x = X and strictly decreasing thereafter. Since h is also surjective, it must approach 0 asymptotically as x goes to infinity.

Remark A.3

Definition A.2 is closely related to strict quasi-concavity. However, a strictly monotonic function satisfies strict quasi-concavity, but does not satisfy Definition A.2. For example, a function whose graph exhibits over the interval of interest the familiar “bell shape” of the Gaussian curve (as shown in Figs. 1 and 10, for example) is both strictly quasi-concave and single-peaked. On the other hand, the S-curve itself is strictly quasi-concave (since it is strictly increasing) but does not satisfy Definition A.2 (its “peak” occurs at infinity).

The specific assumptions are:

Assumption 1

If S satisfies Definition A.1, then the composite function s(z): = S(g(z)) with g(z) = Γz/(1 − z), Γ ≥ 1 and z ∈ [0,1) also satisfies Definition A.1.

Assumption 2

If S satisfies Definition A.1, then each of the following functions satisfies Definition A.2: (i)xS′(x), and for Γ ≥ 1(ii) (x/Γ + 1)2S′(x), (iii) x(x/Γ + 1)S′(x) and (iv) \(x\mathcal{B}'(x)\) where \(\mathcal{B}(x):=S(x)/x\) with \(\mathcal{B}(0):=\lim_{x\downarrow0}\mathcal{B}(x)\equiv S'(0)\).

Remark A.4

By Lemma 4.2, if S satisfies Definition A.1 then \(\mathcal{B}(x)\) satisfies Definition A.2 (i. e. , this is a proved statement, not an assumption).

Below we formally describe some more primitive technical properties for the concerned S-curve that lead to the assumptions above. These properties have the “single crossing” form; i.e., the value of certain function crosses the origin exactly once, a notion that has proved quite useful in certain contexts, such as economics and game theory [2]. In the present work, a strong version of this notion is formalised as follows:

Definition 9.3

A function \(f:D\rightarrow\Re\) with \(D\subset\Re\) satisfies the unique-crossing from above condition (UCC) over D′ ⊂ D if \(\exists t_{0}\in D'\) such that f(t 0) = 0 and \(\forall t\in D'\quad t<t_{0}\implies f(t)>0\text{ and }t>t_{0}\implies f(t)<0\).

Lemma A.1

Consider the composite function S(g(z)), where \(S:\Re_{+}\rightarrow[0,d]\), is an S-curve with inflexion at x f , and \(g:[a,b]\rightarrow\Re_{+}\), with 0 ≤ a < b, is a strictly increasing convex function such that limzbg(z) = ∞. (i) If the function [g′(z)]2S′′(g(z)) + g′′(z)S′(g(z)) satisfies the UCC over [a,b], then: (ia) the composite function s(z): = S(g(z)) satisfies Definition A.1, and (ib) its inflexion abscissa z f is such that g(z f ) > x f .

(ii) With g(z) = Γz/(1 − z), Γ ≥ 1 and \(\mathcal{I}=[0,1)\) , conclusions (ia) and (ib) follow if the function (x + Γ)S′′(x) + 2S′(x) satisfies the UCC over the domain \(\Re_{+}\) .

Proof

  1. (ia)

    We only show below that the composite function has, under the hypothesis, the curvature properties required by Definition A.1; that it also has the other properties can also be shown.

    The second derivative of S(g(z)) is [g′(z)]2 S′′(g(z)) + g′′(z)S′(g(z)).

    g′′(z)S′(g(z)) is always positive because by hypothesis g′′ is positive (convexity).

    [g′(z)]2 S′′(g(z)) has the sign of S′′; i.e. it is positive in [0,x f ) and negative in (x f , ∞ ).

    Thus, the composite function starts out convex (its second derivative starts out positive).

    If [g′(z)]2 S′′(g(z)) + g′′(z)S′(g(z)) satisfies the UCC, then the composite function has exactly one inflexion point \(z_{f}^{c}\).

    The fact that s asymptotically goes to d as z goes to b is immediate.

  2. (ib)

    \(z_{f}^{c}\) must satisfy \(g(z_{f}^{c})>x_{f}\) so that S′′(g(z f )) be negative.

  3. (ii)

    If g(z) = Γz/(1 − z) then g′(z) = Γ/(1 − z)2 and g′′(z) = 2Γ/(1 − z)3. Considering these expressions, the second derivative of the composite function becomes:

    $$ \frac{\Gamma^{2}}{(1-z)^{4}}S''(g(z))+\frac{2\Gamma}{(1-z)^{3}}S'(g(z))$$

    which has the same sign as ΓS′′(g(z)) + 2(1 − z)S′(g(z)).

    With x: = Γz/(1 − z), z = x/(x + Γ) and 1 − z = Γ/(x + Γ).

    Therefore, the second derivative has the sign of (x + Γ)S′′(x) + 2S′(x). The thesis follows from part (i) of this proof.□

The next result involves the bell shape exhibited by the graph of S′.

Lemma A.2

Consider the function h(t) = g(t)S′(t) where \(S:\Re_{+}\rightarrow[0,d]\) is an S-curve with inflexion at t f , and \(g:\Re_{+}\rightarrow\Re_{+}\) is a strictly increasing continuously differentiable function. Furthermore, limt→ ∞ h(t) = 0. If g′(t)S′(t) + g(t)S′′(t) satisfies the UCC at t0 ∈ (0, ∞ ) then h satisfies Definition A.2, and has its maximal value at t0 > t f .

Proof

The derivative h′(t) = g′(t)S′(t) + g(t)S′′(t). The first term is always positive, and the second term has the sign of S′′ which is positive for t < t f . Therefore, h starts out increasing.

If h′ satisfies the UCC at t 0 then h reaches a global maximum at t 0.

t0 > t f because h′(t0) = 0 implies that g(t0)S′′(t0) < 0.□

Remark A.5

If in Lemma A.2 g(t) = t, then the function that must satisfy the UCC reduces to S′(t) + tS′′(t), or, equivalently, 1 + tS′′(t)/S′(t); that is, tS′′(t)/S′(t) must uniquely cross from above the horizontal line at ordinate negative 1. Division by S′(t) is possible because S′(t) > 0 ∀ t ∈ (0, ∞ ).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rodriguez, V., Jondral, F. & Mathar, R. Decoupled Power Allocation Through Pricing on a CDMA Reverse Link Shared by Energy-Constrained and Energy-Sufficient Data Terminals. Mobile Netw Appl 16, 640–660 (2011). https://doi.org/10.1007/s11036-011-0300-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-011-0300-z

Keywords

Navigation