Open Access

Power-efficient distributed resource allocation under goodput QoS constraints for heterogeneous networks

EURASIP Journal on Advances in Signal Processing20162016:129

Received: 1 April 2016

Accepted: 23 November 2016

Published: 1 December 2016


This work proposes a distributed resource allocation (RA) algorithm for packet bit-interleaved coded OFDM transmissions in the uplink of heterogeneous networks (HetNets), characterized by small cells deployed over a macrocell area and sharing the same band. Every user allocates its transmission resources, i.e., bits per active subcarrier, coding rate, and power per subcarrier, to minimize the power consumption while both guaranteeing a target quality of service (QoS) and accounting for the interference inflicted by other users transmitting over the same band. The QoS consists of the number of information bits delivered in error-free packets per unit of time, or goodput (GP), estimated at the transmitter by resorting to an efficient effective SNR mapping technique. First, the RA problem is solved in the point-to-point case, thus deriving an approximate yet accurate closed-form expression for the power allocation (PA). Then, the interference-limited HetNet case is examined, where the RA problem is described as a non-cooperative game, providing a solution in terms of generalized Nash equilibrium. Thanks to the closed-form of the PA, the solution analysis is based on the best response concept. Hence, sufficient conditions for existence and uniqueness of the solution are analytically derived, along with a distributed algorithm capable of reaching the game equilibrium.


Power-efficiencyGame theoryGoodput

1 Introduction

Future wireless networks are required to offer extremely enhanced capabilities including very high achievable data rates, very low latency, ultra-high reliability, and the possibility to handle very high density of devices [1]. On the other hand, since this trend dramatically contributes to the pollution related to energy consumption [2], energy-efficient wireless communications emerged as a viable design concept to reduce the CO2 emission in the next years [3]. In addition, to manage the envisioned huge demand of traffic, a very promising solution is offered by the concept of heterogeneous network (HetNet), where small-cell (SC) networks, characterized by low-cost, low-power, and low-coverage base stations (BSs), i.e., small BSs (SBSs), are massively deployed over the macrocell (MC) areas. Their adoption allows offloading the traffic of the macro network, thus increasing the offered data rate and spectrum re-usage and providing, at the same time, a more power-efficient architecture thanks to their reduced coverage [4]. Since in HetNets SCs share the same frequency bands of the MC [5], one of the main technical effort to be made is the management of the interference, either between SC and MC users (cross-tier interference) or between users in different SCs (co-tier interference). Hence, the random deployment of SCs together with the heterogeneity of these networks naturally calls for decentralized resource allocation (RA) strategies [6], where every user, independently from the other ones, maximizes its performance taking into account interference experienced on its transmission band. Indeed, distributed RA strategies only require the knowledge of local channel state information (CSI), exchanged between each user and its associated BS, thereby avoiding the waste of energy associated with centralized algorithms based instead on a huge information exchange between the users and/or the network administrator [6, 7].

1.1 Related works

Most of the works on RA in HetNets focus on the improvement of the energy efficiency (EE) as in [8], where the authors study the RA problem optimizing the EE over the downlink of an orthogonal frequency division multiplexing (OFDM) cognitive radio (CR) HetNet. A joint subcarrier allocation (SA) and power allocation (PA) solution is provided to guarantee quality of service (QoS) requirements for both secondary and primary users in the cognitive HetNet. Moreover, the authors propose a low-complexity RA algorithm in presence of imperfect CSI. In [9], authors address a joint EE RA and interference alignment problem for downlink multiple-input multiple-output (MIMO) transmissions in HetNets. The EE maximization problem is solved in order to provide time-slot allocation, PA, and beamforming. Unlike [8, 9], paper [10] analyzes RA techniques with different levels of CSI for uplink orthogonal frequency-division multiple access (OFDMA) transmissions in HetNets with one macrocell and cognitive small cells. Here, the purpose of the RA is to maximize the weighted sum of instantaneous rates of all the users, providing a joint PA and SA. Article [11] discusses possible future developments for HetNet in fifth-generation (5G) communications, where massive MIMO and mmWave technologies may be included, emphasizing that RA solutions will once again be one of the most critical issues. Besides, in this work a distributed RA problem over interference channels is tackled.

The most suited framework to study this kind of problem is identified in the theory of non-cooperative games [12], as outlined in [13, 14] about the uplink power control (PC) problem for flat and frequency-selective channels, respectively. Since then, the literature on this topic has increased more and more. Worth to be cited are [15, 16], where the energy-efficient PC problem for wireless data and code division multiple access (CDMA) networks is addressed, respectively, [17, 18], wherein the NCG framework is exploited to tackle the distributed PA problem for EE maximization in OFDM channels and MIMO HetNets, respectively, whereas in [19] the issue of dynamic RA is investigated in the context of multi-user cognitive networks, by exploiting a NCG for signal waveform design combined with sparsity constraints. In [2022], the equilibrium analysis of the NCG describing the rate maximization problem in multicarrier and MIMO channels is discussed. A minimum PA game over OFDM channels with rate constraints is proposed in [23], whereas the PA problem based on the EE maximization under rate constraints is studied for HetNets in [6]. A final interesting work is presented in [24], where the authors investigate the RA problem for device-to-device (D2D) uplink communications in MIMO cellular networks. The RA is evaluated by means of a non-cooperative game that provides a joint optimization of channel allocation, power control, and precoding of the D2D users, by maximizing the sum-rate of the cellular uplink network. The distributed RA solution in [24] is exploited in [25] for D2D communications in MIMO HetNets.

A common feature to all the above works is that they rely on the assumption of infinite-length Gaussian codebooks and thus employ the channel capacity as figure of merit. However, when dealing with real systems characterized by practical and finite-sized modulation and coding schemes and automatic repeat request (ARQ) mechanisms, such information theoretical performance metric may offer an unreliable picture of the actual link performance [26]. In this cases, a suitable performance measure is the number of information bits delivered in error-free packets per unit of time, named goodput (GP) for short [26, 27]. To our best knowledge, GP-based distributed RA strategies have been addressed so far in few works only, as in [28, 29]. In [28], a PC strategy for CDMA ad hoc networks is proposed, aiming at maximizing the GP to power ratio under transmission rate and power constraints, whereas in [29], a network utility maximization problem with GP flow variables under queues stability constraints is proposed for flat fading mobile ad-hoc networks.

1.2 Contributions

This work proposes a novel distributed RA strategy for an energy-aware communication in the uplink of OFDM-based HetNets. Assuming a packet-oriented bit-interleaved coded (BIC) OFDM transmission with practical modulation and coding formats and ARQ mechanisms, power consumption of all users is minimized, provided they meet a given QoS in terms of a target GP value. In order to allocate the transmission resources according to the available CSI, namely, bit loading (BL) vector, i.e., bits per active subcarrier, coding rate, and PA vector, the transmitter requires an estimate of GP, called expected goodput (EGP). The analytical formulation of such performance metric under frequency-selective fading channel scenarios is efficiently obtained resorting to the link performance prediction (LPP) method known as effective signal-to-noise ratio mapping (ESM) [30] and, specifically, exploiting the ESM technique proposed in [31]. Thus, the distributed RA strategy allows every user to minimize its power consumption, meeting at the same time its QoS constraint expressed in terms of target EGP, by selfishly allocating its transmission resources. Hence, in view of all the above features (especially, the EGP evaluation for BIC-OFDM systems over frequency-selective fading channels), our work brings the following competitive contributions.
  1. 1)

    As first step, the RA problem is analyzed for the point-to-point case (P2P), i.e., for a single transmitter receiver pair without interference. The optimal solution as well as an approximate yet accurate closed-form one, which is reminiscent of the water-filling solution for Gaussian signaling, is derived for the PA.

  2. 2)

    The RA problem is then extended to the the interference-limited HetNet scenario. The PA problem is solved in distributed manner as a function of the BL vector and the coding rate, by modeling it as a NCG, where players, strategy, and the utility function correspond to users, PA vector, and power consumption, respectively. Due to the QoS constraints imposed on the GP level, the set of strategies of each user depends on the strategies of the other users. This is the basic reason why the solution is the generalized Nash equilibrium (GNE) [32]. To be more specific, the GNE is described by a set of fixed-point equations based on the best response (BR) strategy of each player, wherein the BR (depending on the target EGP level) is obtained by capitalizing on the water-filling-like solution to the PA. Sufficient conditions for the feasibility of the problem, as well as for the existence and uniqueness of the GNE, are analytically derived. Additionally, some insights on the relationship between the GNE and the pareto optimal (PO) solution are provided.

  3. 3)

    A distributed RA algorithm, that allows the network to reach the equilibrium, is proposed. To support our findings, the algorithm performance is corroborated by physical layer simulations of the HetNet over realistic wireless scenarios.


Notations. Matrices are in upper case bold while column vectors are in lower case bold; [ ·]T is the transpose of a matrix or a vector; x denotes the nearest greater integer than x; × denotes the Cartesian product; calligraphic mathematical symbols, e.g., \({\mathcal {A}}\), represent sets; \(|{\mathcal {A}}|\) denotes the cardinality of the set \({\mathcal {A}}\); \({\mathcal {A}}(i)\) is the ith element of the set \({\mathcal {A}}\); \(y=[\!x]_{a}^{b}\) means y=x if a<x<b, x=a (x=b) if xa (xb); y=[ x]+ means y=x (y=0) if x>0 (x≤0); the square root of a vector x is intended as the vector including the square root entries of x; ab denotes the element-wise multiplication between a and b; and ab means a·b=0; inequalities between vectors are evaluated element-wise.

2 HetNet model

In this section, the HetNet scenario is first introduced and then the BIC-OFDM uplink channel with multiple access interference (MAI) is described.

2.1 HetNet scenario description

The HetNet scenario is depicted in Fig. 1 and is composed of Q+1 BSs, whose indexes belong to the set \({\mathcal {Q}}\triangleq \{0,\cdots,Q\}\). In particular, there is one macro base station (MBS), with index q = 0, and Q SBSs, with indexes q=1,,Q, all of them sharing the same band B. Within the network, there exist K users belonging to the set \({\mathcal {K}} \triangleq \{1,\cdots,K\}\), each of them transmitting to one of the BSs, so that, if \({\mathcal {K}}_{q}\) denotes the set of users served by BS q, then \({\mathcal {K}}={\mathcal {K}}_{1}\cup \cdots \cup {\mathcal {K}}_{Q}\), with \({\mathcal {K}}_{q}\cap {\mathcal {K}}_{r}=\emptyset \) if qr. The transmission signaling between every user and the corresponding BS is based on the OFDM format, i.e., the available bandwidth B is subdivided into N orthogonal subcarriers. Further, users within the same cell, either MC or SC, transmits over orthogonal frequencies according to the OFDMA scheme [3]. Though, since SCs and MC share the same band, the same subcarrier can be used at the same time by users served by either different SBSs or the MBS, leading to inter-cell interference (ICI). For the sake of notation, let us define the mapping \(\phi :{\mathcal {K}} \rightarrow {\mathcal {Q}}\) to univocally associate each user \(k \in {\mathcal {K}}\) to the relevant BS \(q \in {\mathcal {Q}}\), so that ϕ(k), with ϕ(k)=q, identifies the link between user k and its BS q.
Fig. 1

Example of the HetNet scenario

2.2 BIC-OFDM system description

The block diagram of the uplink between user \(k\in \mathcal {K}\) and its BS \(\phi (k)\in \mathcal {Q}\) is depicted in Fig. 2. At the transmitter side, packets coming from the upper layers (usually IP packets) are processed as follows. First, each of them is one-to-one mapped to a radio link control sub-layer protocol data unit (RLC-PDU), composed of \(U_{k}^{(\mathrm {i})}\) bits (containing the header, payload, and cyclic redundancy check). Then, the RLC-PDU is encoded producing a codeword of \(U_{k}^{(\mathrm {s})}\triangleq U_{k}^{(\mathrm {i})}/r_{k}\) coded binary symbols (CBS), where \(r_{k}\in {\mathcal D}_{r}\) is the coding rate and \({\mathcal D}_{r}\) the set of feasible coding rates. After bit-interleaving, the CBSs are Gray-mapped into S k complex-valued symbols, which are transmitted through a frame of \(L_{k} \triangleq \lceil S_{k}/N_{k} \rceil \) consecutive OFDM blocks, where \(N_{k} \triangleq | {\mathcal {N}}_{k}|\), being \({\mathcal {N}}_{k} \subseteq {\mathcal {N}} \triangleq \{1,\ldots,N\}\). The generic OFDM block, \(\forall k \in {\mathcal {K}}\), consists of the vector \(\mathbf {x}_{k} \triangleq [x_{k,1}, \cdots, x_{k,N}]^{\mathrm {T}}\), where x k,n is a \(\phantom {\dot {i}\!}2^{m_{k,n}}\)-QAM unitary-energy symbol, being \(m_{k,n}\in {\mathcal {D}}_{m}\triangleq \{2,\cdots,m_{\max }\}\) the number of bits allocated on the nth subcarrier, if \(n\in {\mathcal N}_{k}\), and x k,n =0 if \(n\notin {\mathcal N}_{k}\). In the following, we will assume, for the sake of simplicity, uniform bit loading (BL), that is, \(m_{k,n}=m_{k}\in \mathcal {D}_{m}\), \(\forall n \in \mathcal {N}_{k}\). The vector x k is element-wise multiplied by the square root of the power allocation (PA) vector \(\mathbf {p}_{k} \triangleq [p_{k,1}, \cdots, p_{k,N}]^{\mathrm {T}}\), where p k,n >0 if \(n\in {\mathcal N}_{k}\) and p k,n =0 if \(n\notin {\mathcal N}_{k}\), such that the available power limit P k is satisfied according to
$$ \sum\limits_{n\in \mathcal{N}_{k}} p_{k,n} \le P_{k}, \;\;\; \forall k \in {\mathcal{K}}. $$
Fig. 2

BIC-OFDM communication link

Subsequently, IFFT operation is performed, cyclic prefix (CP) is inserted and after the digital-to-analog conversion, the OFDM signals of all the K users active in both the MC and the SCs are each transmitted in uplink over (different) frequency-selective block-fading channels, which are assumed stationary for the whole packet transmission duration.

Focusing on the kth user’s signal at the ϕ(k)th BS, \(k \in {\mathcal {K}}\), at the FFT output, the received sample on subcarrier \(n \in \mathcal {N}_{k}\) is
$$ z_{k,n} = {\sqrt{p_{k,n}}} h_{k,\phi(k),n} x_{k,n} + I_{k,n} + w_{k,n}, $$
where h j,s,n denotes the channel coefficient between user j and BS s over subcarrier n, \(w_{k,n} \in \mathcal {N}\left (0,\sigma _{w_{k,n}}^{2}\right)\) is the zero-mean complex-valued Gaussian random variable modeling the ambient noise, and
$$ I_{k,n}\triangleq \sum\limits_{j = 1\atop j \ne k}^{K} \sqrt{p_{j,n}} h_{j,\phi(k),n} x_{j,n} $$
represents the ICI, which is described as additive colored Gaussian noise with zero mean and variance
$$ \sigma_{I_{k,n}}^{2} \triangleq \sum\limits_{j = 1 \atop j \ne k}^{K} p_{j,n} |h_{j,\phi(k),n}|^{2}, \;\;\; \forall n \in \mathcal{N}_{k}. $$
As for (3), we note that since users within the same cell \(q \in {\mathcal {Q}}\) transmit according to the OFDMA scheme, then for a given subcarrier \(n \in {\mathcal {N}}\), p k,n >0 at most for one user \(k \in {\mathcal {K}}\) such that ϕ(k)=q, whereas p i,n =0 for all the other users \(i \in {\mathcal {K}}\) such that ϕ(i)=q. Finally, the signal-to-interference-plus-noise ratio (SINR) vector evaluated for kth user link results as Γ k =p k γ k , where \({\boldsymbol {\gamma }}_{k} \triangleq [\gamma _{k,1},\cdots,\gamma _{k,N}]^{\mathrm {T}}\), with
$$ {\gamma_{k,n}} = \left\{ {\begin{array}{*{20}{c}} {\frac{|h_{k,\phi(k),n}|^{2}}{\sigma_{I_{k,n}}^{2} + \sigma_{w_{k,n}}^{2} }}&{\forall n \in {\mathcal{N}}_{k}}\\ 0&{\forall n \notin {\mathcal{N}}_{k}} \end{array}}. \right. $$

3 Performance metrics background and problem formulation

In this section, a brief description of the adopted LPP metric is first given, then the optimization problem (OP) for minimum power consumption under EGP constraint satisfaction is introduced.

3.1 LPP background

As discussed in Section 1, practical modulation and coding schemes are employed; therefore, the GP metric is more suitable in giving a reliable picture of the actual link performance. Here, in order to apply the RA algorithm at the transmitter, the key issue is to get a prediction of the GP, i.e., the EGP, which in turn depends on the estimate of the link packet error rate (PER) [28, 31].

In a frequency-selective scenario as that considered in our paper, however, the expression of the PER may be hard to derive in closed-form. An efficient solution to pursue is given by the ESM techniques [30], which rely on one-to-one mapping Γ k into the scalar \(\overline {\gamma }_{k}\), the so-called effective SNR (ESNR). Considering that a given subcarrier of every user \(k \in {\mathcal {K}}\) can be loaded with \(m \in {\mathcal {D}}_{m}\) bits, or switched-off, i.e., m=0, let us denote with \({\mathcal {D}}_{\mathbf {m}}\) the set collecting the \(|{\mathcal {D}}_{m}|\cdot 2^{N}\) possible bit allocation vectors. Hence, for a given transmission mode (TM) \(\boldsymbol {\varphi }_{k} \triangleq \{r_{k},\mathbf {m}_{k}\} \in {\mathcal {D}}_{r} \times {\mathcal {D}}_{\mathbf {m}}\), the ESNR \(\overline {\gamma }_{k}\) is such that
$$ {\text{PER}}_{\boldsymbol{\varphi}_{k}}({\boldsymbol{\Gamma}}_{k})=\Phi_{r_{k}}(\overline{\gamma}_{k}), $$

where \(\phantom {\dot {i}\!}\text {PER}_{{\boldsymbol {\varphi }}_{k}}\) and \(\phantom {\dot {i}\!}\Phi _{r_{k}}\) denote the PER of the coded BIC-OFDM system over frequency-selective channel employing TM φ k and that of the equivalent coded BPSK system over AWGN channel experiencing the ESNR \(\overline {\gamma }_{k}\), respectively. Worth of being observed, \(\Phi _{r_{k}}\), according to [33, 34], is an analytic, monotonically decreasing, and convex function in the region of interest.

Among the ESM techniques proposed in the literature, the κESM method, based on the cumulant moment generating function of the log-likelihood metrics at the input of the soft decoder, is here exploited, since it offers a competitive accuracy-versus-complexity trade-off [31]. Herein, the ESNR \(\overline {\gamma }_{k}\) is evaluated as
$$ \begin{aligned} \overline{\gamma}_{k}({\boldsymbol{\varphi}}_{k},{\mathbf{p}_{k}},{\mathbf{p}_{- k}}) \triangleq - \log \left(\! \frac{1}{{{N}_{k}{{m_{k}}} }}{\sum\limits_{n\in\mathcal{N}_{k}}\sum\limits_{\mu=1}^{\sqrt{2^{m_{k}}}/2} \alpha_{k,\mu} \; \mathrm{e}^{-\frac{p_{k,n}\gamma_{k,n}(\mathbf{p}_{-k,n})}{\psi_{k,\mu}}}} \!\right)\!, \end{aligned} $$
where \(\mathbf {p}_{-k}\triangleq [\mathbf {p}_{1}^{\mathrm {T}},\cdots,\mathbf {p}_{k-1}^{\mathrm {T}},\mathbf {p}_{k+1}^{\mathrm {T}},\cdots,\mathbf {p}_{K}^{\mathrm {T}}]^{\mathrm {T}}\) and \(\mathbf {p}_{-k,n}\triangleq [p_{1,n},\cdots,p_{k-1,n},\) p k+1,n ,,p K,n ]T collect all the PA vectors and per-subcarrier PA coefficients except those associated to user k, respectively, and α k,μ and ψ k,μ are constant values related to the modulation size adopted by the kth user. Their values are evaluated in [31] and reported in Table 1. It can be noted that the channel gain (5) has been explicitly expressed as a function of p k,n .
Table 1

Values of κESM coefficients for 4-, 16-, and 64-QAM








2 m−1 α μ


















ψ μ


















3.2 Problem formulation

Exploiting the κESM LPP method recalled in Section 3.1, the EGP metric, defined as the number of information bits delivered in error-free packets per unit of time, is expressed in (bit/OFDM block) as [31]
$$ {}\begin{aligned} \zeta_{k}({\boldsymbol{\varphi}}_{k}, \mathbf{p}_{k},\mathbf{p}_{-k}) \triangleq \breve{\zeta}_{k} r_{k} {N}_{k} m_{k} \left[ 1 - {\Phi_{r_{k}}}(\overline{\gamma}_{k}({\boldsymbol{\varphi}}_{k}, \mathbf{p}_{k},\mathbf{p}_{-k})) \right], \end{aligned} $$
with \(\breve {\zeta }_{k}\triangleq U_{k}^{(\mathrm {p})}/U_{k}^{(\mathrm {i})}\), being \(U_{k}^{(\mathrm {p})}\) the number of payload bits. Let us assume a given QoS per user in terms of a target EGP value \(\bar \zeta _{k}\). The aim is to consume the lowest power as possible, while meeting such EGP QoS constraints. Besides, due to the mutual interference, the EGP of a given user is affected by the transmission power employed by the other users. Thus, assuming the lack of a central coordinating unit, the goal of the users is to reach, in a distributed way, the optimal PA \(\mathbf {p}^{*}_{k} \triangleq [p^{*}_{k,1},\cdots,p^{*}_{k,N}]^{\mathrm {T}}\) and the optimal TM \({\boldsymbol {\varphi }}_{k}^{*}\), \(\forall k \in {\mathcal {K}}\), which satisfy the QoS constraints spending the minimum transmission power. This problem, tagged as power-efficient under guaranteed EGP OP, or PEGE for short, can thus be formalized as
$$ \forall k \in {\mathcal{K}}:\begin{array}{*{20}{c}} { \underset{{\boldsymbol{\varphi}}_{k},{\mathbf{p}_{k}}}{\min } }&{\left\{{u_{k}}({\mathbf{p}_{k}})\triangleq \sum\limits_{n=1}^{N} p_{k,n}\right\}}\\ {{\mathrm{s}}{\mathrm{.t}}{\mathrm{.}}}&{{\zeta_{k}}({\boldsymbol{\varphi}}_{k},{\mathbf{p}_{k}},{\mathbf{p}_{- k}}) \ge {{\bar \zeta }_{k}}}\\ {}&{{p_{k,n}} \ge 0, \;\;\;\forall n \in {{\mathcal{N}}_{k}},}\\ {}&{{\boldsymbol{\varphi}}_{k} \in {\mathcal{D}}_{r} \times {\mathcal{D}}_{\mathbf{m}}}&{} \end{array}. $$
A few remarks about (9) are now in order.
  1. 1)

    The OP (9), when applied to a P2P BIC-OFDM link, has not yet been taken into consideration, and so, it lacks analysis. Therefore, the above issue is first addressed in Section 4, where we derive a closed-form solution for the PA, being it useful for the subsequent case of multiple users addressed in Section 5.

  2. 2)

    In view of the QoS contraints, there exists a competition among the multiple active users allowed to transmit over the same band. Thus, the problem falls in the NCG framework, which is efficiently employed to study the strategic inter-user interactions [35]. Hence, the OP (9) can be formulated as a NCG, whose conditions of existence and uniqueness of the solution are analytically derived in Section 5, together with a distributed implementation of the RA algorithm.

  3. 3)

    The total power constraint (1) for each user is skipped in the OP (9), since its presence makes the game analysis impractical. Hence, we assume that the optimal PA, satisfying the QoS constraint, satisfies (1) as well. Nevertheless, when introducing the distributed RA algorithm in Section 5.3, such a power constraint will be restored, giving additional comments and insights on it.


4 PEGE OP in point-to-point links

Let us focus on the P2P communication link, that is \(|{\mathcal {Q}}|=1\) and \(|{\mathcal {K}}|=1\) (for this reason in the reminder of this section, the index k will be neglected in the quantities of interest). Specifically, Section 4.1 formulates the strategy to select the optimal TM and PA vector solving OP (9), whereas Section 4.2 solves the PA problem in closed-form.

4.1 Problem formulation

As for the solution of OP (9), it can be pointed out that (i) even if uniform BL is chosen for each user, the choice of the active subcarriers entails again a BL procedure, since the nth component of the BL m is m n =m if subcarrier n is active, m n =0 otherwise, as described in Section 3.1; (ii) the BL and PA problems cannot be jointly solved, in that the problem is NP-hard. Given the QoS constraint and the SINR vector γ, however, the OP can be efficiently yet suboptimally tackled relying on the following strategy: first, the optimal PA vector \(\mathbf {p}^{*}\triangleq [p_{1}^{*},\cdots,p_{N}^{*}]^{\mathrm {T}}\) is derived as a function of the generic TM φ, i.e., p p (φ), and, then, the pair TM and PA that minimizes the power consumption while satisfying the QoS constraint is selected as solution to the OP.

PA in PEGE OP for a fixed TM. Assuming a given TM φ, the optimal PA p (φ) solving OP (9) is obtained as
$$ \begin{array}{*{20}{c}} & {\mathbf{p}^{*}({\boldsymbol{\varphi}})=} { \underset{\mathbf{p}}{\text{argmin}}\left\{u(\mathbf{p})\right\}} \\ {{\mathrm{s}}{\mathrm{.t}}{\mathrm{.}}} & {\sum\limits_{n=1}^{N} \sum\limits_{\mu=1}^{\sqrt{2^{m}}/2} \alpha_{\mu}({\boldsymbol{\varphi}}) \mathrm{e}^{-\frac{p_{n}\gamma_{n}}{\psi_{\mu}({\boldsymbol{\varphi}})}} \le \kappa({\boldsymbol{\varphi}})} \\ {} & {p_{n} \ge 0} \\ \end{array}, $$
where the first constraint in (10) corresponds to the QoS constraint of (9) expressed as a function of the PA, with, in view of (7) and (8),
$$ \kappa({\boldsymbol{\varphi}}) \triangleq N m \; \mathrm{e}^{-\gamma^{*}({\boldsymbol{\varphi}})} $$
$$ \gamma^{*}({\boldsymbol{\varphi}}) \triangleq \Phi^{-1}\left(1-\bar\zeta/(\breve{\zeta}rNm)\right), $$

being constant values, both depending only on φ. From Eqs. (11)–(12), it is seen that, given the BL vector and the coding rate, the QoS constraint \(\bar \zeta \) can be equivalently expressed as a function of the target ESNR γ (φ).

Nevertheless OP (10), having a linear objective function and convex constraints, be a convex OP, due to the presence of the QoS constraint it does not present a closed-form solution. Therefore, solving (10) can be approached via conventional numerical methods [36], though at the price of a high computational load. Afterward, we propose an alternative approximate yet efficient method to get a closed-form solution of OP (10). Hence, the numerical computationally heavy solution will be only used as benchmark to test the accuracy of the proposed approximated closed-form solution.

TM selection in PEGE OP. Given the SINR γ and assuming uniform PA across the subcarriers1, first the BL procedure originally proposed in [37] is applied, with the set of feasible number of bits per subcarrier being {0,m}. As a result, we get \(|{\mathcal {D}}_{m}|\cdot N\) possible BL vectors \(\{\overline {\mathbf {m}}^{(n,m)}\}\), n=1,,N, with \(m\in {\mathcal {D}}_{m}\). As a matter of fact, \(\overline {\mathbf {m}}^{(n,m)}\) denotes the best bit allocation vector with n active subcarriers and m bits per active subcarrier. Let us denote with \({\mathcal {D}}_{\overline {\mathbf {m}}} \subset {\mathcal {D}}_{\mathbf {m}}\) the set collecting such vectors. Then, if the PA p (φ) are available for the TMs \({\boldsymbol {\varphi }}\in {\mathcal {D}}_{r} \times {\mathcal {D}}_{\mathbf {\overline m}}\), the OP (9) is solved by searching the best TM φ that both minimizes the power consumption and satisfies the QoS constraint. Formally,
$$ \begin{array}{*{20}{c}} & {{{\boldsymbol{\varphi}}^{*}} =} \; { \underset{{\boldsymbol{\varphi}}}{\text{argmin}} \left\{ {u({\mathbf{p}^{*}}({\boldsymbol{\varphi}}))} \right\}}\\ {{\mathrm{s}}{\mathrm{.t}}{\mathrm{.}}}&{\zeta ({\boldsymbol{\varphi}},{\mathbf{p}^{*}}({\boldsymbol{\varphi}})) \ge \bar \zeta,} \\ {}&{\boldsymbol{\varphi}} \in {{\mathcal{D}}_{r}} \times {\mathcal{D}}_{\overline{\mathbf{m}}}. \end{array} $$
The OP (13) can thus be solved by means of the pseudo-code outlined in Table 2. The key points of the proposed procedure are as follows. (i) For every \(m \in {\mathcal {D}}_{m}\), the set \({\mathcal {D}}_{\overline {\mathbf {m}}}\) is efficiently found exploiting the BL strategy [37], which is based on a greedy algorithm with complexity \(\mathcal {O}(N\log N)\). (ii) The best TM is obtained carrying out an exhaustive search over the possible TMs. The latter stands for the worst case condition, in that, for a given pair {r,m}, the search is halted as soon as a feasible TM is found (step 10 of Table 2), because any other TM with the same pair {r,m} would require a larger amount of transmitted power. Indeed, for a given m, \({\overline {\mathbf {m}}}^{(n+1,m)}\) would have the same active subcarriers as \({\overline {\mathbf {m}}}^{(n,m)}\) plus an additional active subcarrier chosen among the remaining Nn ones. As a consequence, the power consumption of the former case would be greater than that of the latter one. (iii) In order to maintain an affordable complexity of the overall algorithm, a closed-form expression of the PA can be derived, as illustrated in the next section.
Table 2

TM selection algorithm


Input: \({\mathcal {D}}_{\mathbf {\overline m}}\), γ


Initialize u opt=P


For \(i=1,\cdots,|{\mathcal {D}}_{m}|\)


For \(j=1,\cdots,|{\mathcal {D}}_{r}|\)


For n=1,,N


Set φ={r,m}, with \(r={\mathcal {D}}_{r}(j)\), \(m={\mathcal {D}}_{m}(i)\) and \(\mathbf {m}=\mathbf {\overline m}^{(n,m)}\)


Evaluate p (φ)


If \(\zeta ({\boldsymbol {\varphi }},\mathbf {p}^{*}({\boldsymbol {\varphi }}))\ge \bar \zeta \) and u(p (φ))<u opt


Set u opt=u(p (φ)) and φ =φ


Go To Step 4.


End If


End For


End For


End For


Output: φ , p (φ )

4.2 Closed-form solution for the PA problem

Let us now point out that the summation over μ in the QoS constraint prevents to easily obtain a closed-form solution to the PA problem. Thus, the idea we pursue is to approximate the QoS expression in (10) by introducing a scalar β such that a possible closed-form PA solution matches the optimal one earned by solving (10) via a numerical (computationally heavy) method.

Proposition 1

Approximating the left-hand side of the QoS constraint in (10) with \(\beta \sum _{n=1}^{N} {\mathrm {e}}^{-\frac {p_{n}}{\rho _{n}}}\), with \(\rho _{n}\triangleq \delta /\gamma _{n}\), \(\beta \in {\mathbb {R}}^{+}\) and \(\rho \in {\mathbb {R}}^{+}\), the OP (10) turns into
$$ \begin{array}{*{20}{c}} & {\underset{\mathbf{p}}{\min}} \; {u(\mathbf{p})} \\ \mathrm{s.t.} & {\beta \sum\limits_{n=1}^{N} \mathrm{e}^{-\frac{p_{n}}{\rho_{n}}} \le \kappa} \\ {} & {p_{n} \ge 0.} \\ \end{array} $$
So doing, the nth component of the solution p to (14) can be written in closed-form as the water-filling-like solution [ 20 ]
$$ {p_{n}^{\star}}={\rho_{n}}\left[\log \Theta -\log\frac{\rho_{n}}{\beta}\right]^{+},\;\;\; \forall n \in {\mathcal{N}}, $$

where Θ is such that p satisfies the QoS constraint in (14) with equality and represents the “water-level.”


The proof is given in Appendix A. □

Concerning the values of β and δ, by looking at the values assumed by the coefficients α μ and ψ μ for a given modulation order (Table 1), it follows that the left-hand side of the QoS constraint in (10) can be lower and upper bounded as
$$ {}\begin{aligned} \beta^{(\mathrm{l})}\sum_{n=1}^{N}\mathrm{e}^{-\frac{p_{n}\gamma_{n}}{\delta^{(\mathrm{l})}}}\le\sum_{n=1}^{N}\sum\limits_{\mu=1}^{\sqrt{2^{m}}/2} \alpha_{\mu} \mathrm{e}^{-\frac{p_{n}\gamma_{n}}{\psi_{\mu}}}\le \beta^{(\mathrm{u})} \sum_{n=1}^{N}\mathrm{e}^{-\frac{p_{n}\gamma_{n}}{\delta^{(\mathrm{u})}}}, \end{aligned} $$

where \(\delta ^{(\mathrm {l})} \triangleq \psi _{1}\), \(\beta ^{(\mathrm {l})} \triangleq \alpha _{1}\), \(\delta ^{(\mathrm {u})} \triangleq \psi _{1}\) and \(\beta ^{(\mathrm {u})} \triangleq \sum \limits _{\mu =1}^{\sqrt {2^{m}}/2} \alpha _{\mu } \). The strict equality holds for m=2, since in this case the sum over μ reduces exactly to only one term.

Denoting with p (l) and p (u) the optimal solutions (15) when the pair {β,δ} is set in Eqs. (14)–(15) to {β (l),δ (l)} and {β (u),δ (u)}, respectively, the drawback is that the solution associated to the lower bound (LB) tends to underestimate the QoS constraint and, thus, to allocate less power compared to the optimal solution. On the other hand, the solution associated to the upper bound (UB) overestimates the QoS constraint and, thus, the performance in term of EGP are always satisfied, although at the price of spending more power than the strictly required one. Hence, the idea is to find the optimal pair {β (o),δ (o)} that minimizes the mean square error (MSE) between the exact expression of the QoS constraint in (10) and the proposed expression of the QoS constraint in (14), for every modulation order.

The results depicted in Figs. 3 and 4 for the BIC-OFDM link with the setup of Table 3, employing (r,m)=(1/3,4) and (r,m)=(2/5,6), respectively, show the minimum transmitted power versus the symbol energy-to-noise power spectral density ratio E s /N 0, assuming a target EGP QoS \(\bar \zeta =0.31\) bit/s/Hz. In line with (16), the PAs obtained by employing {β (l),δ (l)} and {β (u),δ (u)} lead to values of the objective function lower and higher, respectively, than the optimal ones (in accordance with the fact that they are a lower and upper bound of the QoS constraint). Conversely, the PA performance obtained with {β (o),δ (o)} closely matches that obtained via numerical methods, while exploiting an efficient closed-form expression. The optimal values of {β (o),δ (o)} that, for every modulation order, minimize the MSE betweem the optimal and the proposed expression of the QoS constraint have been computed for E s /N 0 [ −6,30] dB and can be found in Table 4. In the case of multiple users access, such an approximation will be utilized for evaluating the QoS constraint in OP (9).
Fig. 3

Performance comparison of the proposed PA algorithms for (r,m)=(1/3,4)

Fig. 4

Performance comparison of the proposed PA algorithms for (r,m)=(2/5,6)

Table 3

BIC-OFDM link setup



Payload length \(N_{p}^{(p)}\)

1024 bits

RLC-PDU length N (i)

1056 bits

N. of active subcarriers N


FFT size


RF bandwidth/subcarrier spacing

20 MHz/15.152 kHz

Coding scheme

Parallel concatenated convolutional coding (PCCC) turbo codes \({\mathcal {D}}_{r}=\left \{\frac {1}{3},\frac {2}{5},\frac {1}{2},\frac {4}{7}\right \}\)



Available power P

33 dBm

Channel model

6-tap power profile of ITU-Pedestrian B

Table 4

Optimal values of {β (o),δ (o)} for every modulation order





β (o)




δ (o)




5 PEGE OP over multi-access interference links

We assume now that there not exist any centralized unit, and so, users coordinate among themselves in a distributed manner in order to reach a stable RA configuration. The goal is to design a distributed algorithm so that each user minimizes its power consumption, while satisfying its QoS constraint and accounting for the interference caused by the other users exploiting the same frequencies.

5.1 Game formulation

In order to derive a distributed algorithm solving OP (9), let us consider for the time being a given TM φ k per user. Then, resorting to the QoS constraint approximation adopted in (14), the PEGE OP (9) can be reformulated as
$$ \forall k \in \mathcal{K}:\begin{array}{*{20}{c}} & { \underset{\mathbf{p}_{k}}{\min} } \; {{u_{k}}(\mathbf{p}_{k})} \\ {\text{s.t.}} & {\beta_{k} \sum\limits_{n\in\mathcal{N}_{k}} \mathrm{e}^{-\frac{p_{k,n}}{\rho_{k,n}(\mathbf{p}_{-k,n})}} \le \kappa_{k},} \\ {} & { p_{k,n} \ge 0,} \end{array} $$
where κ k is evaluated \(\forall k \in {\mathcal {K}}\) via (11)-(12),
$$ \rho_{k,n}(\mathbf{p}_{-k,n}) \triangleq \frac{\delta_{k}}{\gamma_{k,n}(\mathbf{p}_{-k,n})}, $$

and β k and δ k assume values reported in Table 4. OP (17) can be solved by modeling it as a NCG [35]. Such a framework offers a powerful analytical tool that describes how rational entities interact and make appropriate choices so that they can find their own maximum utility.

Accordingly, we introduce the game \({\mathcal {G}}\triangleq \{\mathcal {K}, \mathcal {P}, \mathcal {U}\}\), described as follows:
  1. 1)

    \(\mathcal {K}\triangleq \mathcal {K}_{1}\times \cdots \times \mathcal {K}_{Q}\) is the overall set of users, i.e., players.

  2. 2)
    \(\mathcal {P}\triangleq \mathcal {P}_{1}\times \cdots \times \mathcal {P}_{K}\) is the set strategies, where the strategy of user k is its feasible PA set, defined as
    $$ {}\begin{aligned} \mathcal{P}_{k}\triangleq\left\{p_{k,n}\;|\; g_{k}(\mathbf{p}_{k},\mathbf{p}_{-k})\right. &\le 0, \;\;\; p_{k,n} \\ & \left. \ge 0, \; \forall n \in \mathcal{N}_{k} \right\}, \;\; \forall k\in \mathcal{K}, \end{aligned} $$

    with \(g_{k}(\mathbf {p}_{k},\mathbf {p}_{-k})\triangleq \sum _{n\in \mathcal {N}_{k}} \beta _{k} \mathrm {e}^{-\frac {p_{k,n}}{\rho _{k,n}(\mathbf {p}_{-k,n})}} - \kappa _{k}\).

  3. 3)

    \(\mathcal {U}\triangleq \{u_{1},\cdots,u_{K}\}\) is the set collecting the utility functions defined in (9).

By looking at the elements identifying \({\mathcal {G}}\), it worth pointing out that the QoS constraints introduce an interdependency among the strategies of the players, i.e., \({\mathcal {P}}_{k}={\mathcal {P}}_{k}(\mathbf {p}_{k},\mathbf {p}_{-k})\). In other words, the set of strategies of the generic player k depends on the other players’ strategies. The solution of game (17) is thus investigated in terms of GNE, which corresponds to the case where no player can decrease his objective function by changing unilaterally its strategy to any other feasible one [32]. Equivalently, a GNE of the game is reached when every user, given the strategy profile of the others, does not get any power decrease by unilaterally changing its own strategy, still keeping the QoS constraint satisfied. Formally, the vector \(\mathbf {p}^{*} \triangleq [ {\mathbf {p}^{*}_{1}}^{\mathrm {T}}, \cdots, {\mathbf {p}^{*}_{K}}^{\mathrm {T}} ]^{\mathrm {T}} \in {{\mathcal {P}}}\), which represents now the optimum power allocation for all the users, is a GNE [35] for game \({\mathcal {G}}\) if
$$ u_{k}\left(\mathbf{p}^{*}_{k}\right)\le u_{k}\left(\mathbf{p}'_{k}\right), \; \forall \mathbf{p}'_{k} \in {\mathcal{P}}_{k}(\mathbf{p}'_{k},\mathbf{p}^{*}_{-k}), \; \forall k \in \mathcal{K}. $$

In order to study the game equilibrium, let us point out the following remark.

Remark 1

For a given strategy p k of the other players, the solution of (17) corresponds to the solution found for the P2P link (15). Thus, in this case the solution is unique and given, capitalizing on the approximate yet accurate closed-form one, by
$$ \mathbf{p}_{k}^{*}=\text{\texttt{BR}}\left(\mathbf{p}_{-k}\right), \;\;\; \forall k \in{\mathcal{K}}, $$
where the nth component of the best response (BR) operator is defined as
$$ {}\begin{aligned} \left[{\text{\texttt{BR}}}\left(\mathbf{p}_{-k}\right)\right]_{n} \triangleq {\rho_{k,n}(\mathbf{p}_{-k,n})}\left[\log \Theta_{k}^{*} \right. & \left. - \log\frac{\rho_{k,n}(\mathbf{p}_{-k,n})}{\beta_{k}}\right]^{+}, \\ &\forall n \in {\mathcal{N}}_{k},\;\forall k \in{\mathcal{K}}, \end{aligned} $$

and \(\Theta _{k}^{*}\) is such that the optimal PA \(\mathbf {p}_{k}^{*}\) satisfies the QoS constraints with equality.

Thus, according to the definition of GNE and in view of Remark 1, the GNE of the game must satisfy the following condition.

Proposition 2

If problem (17) is feasible, i.e., if there exist a PA vector p (f)0 such that QoS constraints are met with equality, then there exists at least one PA p which is a GNE equilibrium of the game. Moreover, the GNE has to satisfy the so-called best response solution for each user, by solving the fixed-point system of equations
$$ \mathbf{p}_{k}^{*}={\text{\texttt{BR}}}\left(\mathbf{p}_{-k}^{*}\right), \;\;\; \forall k \in{\mathcal{K}}, $$

with the operator BR defined as in (22).

We remark here that the fixed-point system of Eq. (23) may lead to more than one solution, or the solution of game (17) may not exist, since there may not exist a p that satisfies all the QoS constraints of all the users at the same time. Thus, before going into details of how to solve (17), in the next section we focus on the feasibility conditions of OP (17), as well as on the existence and uniqueness of the GNE of the game describing OP (17).

5.2 GNE analysis

In order to derive sufficient conditions for the feasibility of OP (17) and the existence of at least a solution for the associated game, given the vector of required EGP values, or equivalently, the corresponding vector of optimal ESNR \({{\boldsymbol {\gamma }}}^{*} \triangleq [\gamma ^{*}_{1},\cdots,\gamma ^{*}_{K}]^{\mathrm {T}}\), with \(\gamma ^{*}_{k}\) defined in (12), let us introduce the following definitions:
$$ \mathbf{t}_{n}({\boldsymbol{\gamma}}^{*})\triangleq\left[\tilde\gamma_{1}^{*}\sigma^{2}_{1,n},\cdots,\tilde\gamma_{K}^{*}\sigma^{2}_{K,n}\right]^{\mathrm{T}}, $$
$$ \begin{aligned} {\mathbf{Z}_{n}}({{\boldsymbol{\gamma}}^{*}}) \triangleq \left[ {\begin{array}{*{20}{c}} {{{\left| {{{\bar h}_{1,\phi (1),n}}} \right|}^{2}}}&{ - \tilde\gamma_{1}^{*}{{\left| {{h_{2,\phi (1),n}}} \right|}^{2}}}& \cdots &{ - \tilde\gamma_{1}^{*}{{\left| {{h_{K,\phi (1),n}}} \right|}^{2}}}\\ { - \tilde\gamma_{2}^{*}{{\left| {{h_{1,\phi (2),n}}} \right|}^{2}}}&{{{\left| {{{\bar h}_{2,\phi (2),n}}} \right|}^{2}}}& \cdots &{ - \tilde\gamma_{2}^{*}{{\left| {{h_{K,\phi (2),n}}} \right|}^{2}}}\\ \vdots & \vdots & \ddots & \vdots \\ { - \tilde\gamma_{K}^{*}{{\left| {{h_{1,\phi (K),n}}} \right|}^{2}}}&{ - \tilde\gamma_{K}^{*}{{\left| {{h_{2,\phi (K),n}}} \right|}^{2}}}& \cdots &{{{\left| {{{\bar h}_{K,\phi (K),n}}} \right|}^{2}}} \end{array}} \right], \end{aligned} $$

where \({\bar h}_{k,\phi (k),n}\triangleq h_{k,\phi (k),n}/\delta _{k}\) and \(\tilde \gamma _{k}^{*}\triangleq \gamma ^{*}_{k} + \log \beta _{k}\), being δ k and β k constant values defined in Table 4.

Proposition 3

Given γ , a sufficient condition for the feasibility of (17) is that Z n (γ ), defined in (25), is a P-matrix.


See Appendix B. □

Capitalizing on the feasibility condition derived above, the existence of at least one GNE is guaranteed, as stated in the following proposition.

Proposition 4

Given γ and assuming that problem (17) is feasible, then there exists at least a bounded GNE for game (17). Furthermore, any GNE p , which can be equivalently expressed as \(\mathbf {p}^{*} \triangleq [ {\mathbf {q}^{*}_{1}}^{\mathrm {T}}, \cdots, {\mathbf {q}^{*}_{N}}^{\mathrm {T}} ]^{\mathrm {T}}\), with \(\mathbf {q}^{*}_{n} \triangleq \left [ {p^{*}_{1,n}}, \cdots, {p^{*}_{K,n}} \right ]^{\mathrm {T}}\), 1≤nN, is such that
$$ {\mathbf{q}^{*}_{n}} \le {\bar{\mathbf{q}}_{n}} = {\left[ {{\mathbf{Z}_{n}}({{\boldsymbol{\gamma}}^{*}})} \right]^{- 1}}\cdot{\mathbf{t}_{n}({\boldsymbol{\gamma}}^{*})}, \;\;\; \forall n, $$

where \(\bar {\mathbf {q}}_{n} \triangleq [\bar p_{1,n},\cdots,\bar p_{K,n}]^{\mathrm {T}}\).


See Appendix C. □

In order to better understand the physical meaning of the existence condition, let us first express the channel coefficient as a function of the path loss (PL) between the relevant transmitter and receiver pair, i.e., \(|{\tilde h}_{j,\phi (k),n}|^{2}\triangleq |h_{j,\phi (k),n}|^{2}L_{j,\phi (k)}\), where L j,ϕ(k) is the path loss between between user j and BS ϕ(k) and \({\tilde h}_{j,\phi (k),n}\in {\mathcal {CN}(0,1)}\). Since a sufficient condition for the matrices {Z n } to be P-matrices is that they satisfy the diagonal dominance condition [38], then the following corollary holds.

Corollary 1

Sufficient conditions for the matrices {Z n } to be P-matrices, and hence for the solution set of game (17) to be non-empty, are
$$ \sum\limits_{j = 1\atop j \ne k}^{K} {\frac{{|{{\tilde h}_{j,\phi(k),n}}{|^{2}}}}{{|{{\tilde h}_{k,\phi(k),n}}{|^{2}}}}\frac{{{L_{k,\phi(k)}}}}{{{L_{j,\phi(k)}}}} < \frac{{{\delta_{k}}}}{{\tilde\gamma_{k}^{*}}}} \;\;\; \forall n \in {\mathcal{N}}_{k},\; \forall k \in \mathcal{K}, $$

which can be derived by exploiting the definition of diagonal dominance of a matrix.

Thus, the above condition states that as long as the ratio between the interfering channel and the direct one, i.e, the direct channel between the transmitter and the receiver, is lower than a certain threshold, or, in other words, the interference is small enough, then a solution for game (17) exists. The threshold depends on the EGP constraints, expressed in terms of optimal ESNR, along with the modulation order adopted, via the coefficients δ k and β k (the latter contained in \(\tilde \gamma ^{*}_{k})\). Thus, the more distant the competing transmitters, the lower the interference and, thus, the higher the probability of having a non-empty solution set [21,23]. Further, it is worth noting that the condition formulated in (27) is in agreement with that derived in [23] with Gaussian signaling. In this latter case, indeed, δ k =1 and β k =1 as well, thus implying \(\tilde \gamma ^{*}_{k}=\gamma ^{*}_{k}\), and \(\gamma _{k}^{*}= \mathrm {e}^{R_{k}^{*}}-1\), where \(R_{k}^{*}\) is the desired rate.

Finally, we focus on the sufficient conditions for the uniqueness of the GNE. This analysis, however, is made difficult by the presence of the QoS constraints, that introduces an interdependency among the strategy sets of the users. Thus, partly inspired by [23], the derivation of the uniqueness conditions is carried out as follows: first, a change of variable is done in order to obtain an equivalent formulation of the problem as a variational inequality (VI) problem; then, the conditions of uniqueness of the solution for the original problem are derived.

Proposition 5

Given γ and under the assumption that the problem is feasible, a sufficient condition for the uniqueness of the GNE for game (17) is that the matrix V(γ ), defined in (66), is a P-matrix.


See Appendix D. □

As expected, also the uniqueness condition depends on the target ESNR γ and on the ratio among the direct and interference channels, which appears on the off-diagonal elements of V(γ ) through the parameter \(\chi _{j,k}^{(\max)}\) defined in (64). Thus, although condition of Proposition 5 is less easy to check than the one corresponding to the existence of the GNE, from (66) it can be inferred that whenever the ratio between each direct and interference channel is small, matrix V(γ ) is likely to satisfy the diagonal dominance property and thus to be a P-matrix, ensuring the uniqueness of the GNE.

5.3 Distributed algorithm

Since we are dealing with a decentralized implementation, where no signaling among different BSs is allowed, our aim is to derive a totally distributed algorithm. In fact, this allows every user to independently optimize its own PA, as well as TM, according to the perceived SINR, which entails the interference caused by the other users. Recalling Proposition 1, a natural scheme is a distributed and iterative algorithm based on the BR. In particular, at each iteration j, considering the generic user \(k \in {\mathcal {K}}\) and the PA \(\mathbf {p}^{(j-1)}_{-k}\) chosen by the other users at the previous iteration, the PA vector \(\mathbf {p}^{(j)}_{k}\) is evaluated, as function of the selected TM φ k , according to (22), \(\forall k \in {\mathcal {K}}\). This means that, to perform the update, the only information required by every user k is the SINR vector \({\boldsymbol {\gamma }}_{k}\left (\mathbf {p}^{(j-1)}_{-k}\right)\) in (5). This is measured at the serving BS and sent with a modest feedback rate requirement on the return channel. Then indeed, since every user is able to evaluate, at every iteration j, the best PA \(\mathbf {p}_{k}^{(j)}({{\boldsymbol {\varphi }}}_{k})\) as a function of the TM φ k and SINR, the selection of the best pair \(\{{{\boldsymbol {\varphi }}}_{k}^{(j)},\mathbf {p}_{k}^{(j)}\left ({{\boldsymbol {\varphi }}}_{k}^{(j)}\right)\}\) can be carried out in the same manner of Section 4.1 according to the algorithm in Table 2. This procedure is iterated for all the users until convergence is reached, and it is summarized in Table 5, where ε p denotes the required solution accuracy, N it is the maximum number of iterations, \(\mathbf {p}^{(0)}_{k}\) and \({{\boldsymbol {\varphi }}}^{(0)}_{k}\) are an initial feasible PA vector and TM, respectively, and \({\mathcal {D}}_{\mathbf {\overline m}}^{(k,j)}\) denotes the set of best BL vectors for user k at iteration j, evaluated according to the perceived interference \({\boldsymbol {\gamma }}_{k}(\mathbf {p}_{-k}^{(j)})\), \(\forall k \in {\mathcal {K}}\).
Table 5

Distributed RA algorithm


Input: \(\mathbf {p}^{(0)}_{k}\), \({{\boldsymbol {\varphi }}}^{(0)}_{k}\forall k \in \mathcal {K}\).


Initialize: j=0, ε p .




For k=1,,K


Evaluate \({\mathcal {D}}_{\overline {\mathbf {m}}}^{(k,j)}\)


Evaluate \(\mathbf {p}^{(j+1)}_{k}\) and \({{\boldsymbol {\varphi }}}^{(j+1)}_{k}\) applying Algorithm in Table 2 with


Input \({\mathcal {D}}_{\overline {\mathbf {m}}}^{(k,j)}\) and \({\boldsymbol {\gamma }}_{k}(\mathbf {p}_{-k}^{(j)})\) and evaluating the PA vector


according to (22)


End For


Set jj+1;


Until ||p (j)p (j−1)||≤ε p or j=N it


Output: \({{\boldsymbol {\varphi }}}_{k}^{*}={{\boldsymbol {\varphi }}}_{k}^{(j)}\), \(\mathbf {p}_{k}^{*}=\mathbf {p}_{k}^{(j)}\), \(\forall k \in {\mathcal {K}}\).

Remark 2

The proposed best response-based algorithm converges under the same conditions for which the GNE is unique (stated in Proposition 5), which in turn requires the condition stated in Proposition 3 in order to have a non-empty solution set. In fact the condition of convergence can be demonstrated with the same approach used to derive the uniqueness condition, simply replacing the two solutions of the GNE with two PA vectors produced by the algorithm at two consecutive iterations.

Remark 3

In the formulation of game (17), we did not consider the total power constraint per user (1). Even if this constraint is intrinsically present in wireless devices, since their power cannot grow infinitely, it makes the equilibrium analysis more involved. Then, we did not take into account this constraint in the theoretical analysis, leaving it for future research. Anyway, the following observations can be done. First, algorithm in Table 5 (as well as that for the P2P case) can easily account for constraint (1) as follows: for all \(k\in {\mathcal {K}}\), in the optimal PA expression (22), based on the water-filling like operator, the “water-level” must now be computed as \(\Lambda _{k} = \min \left \{ {\log \Theta _{k}^{*},\log \tilde \Theta _{k}^{*}} \right \}\), where \(\tilde \Theta _{k}^{*}\) is the “water-level” that, put into the water-filling expression, returns the PA vector \(\tilde {\mathbf {p}}_{k}\) that maximizes the EGP ζ k (p k ) meeting with equality the total PA constraint (1) [31]. Poorly speaking, for a given strategy p k , the best response for user k is the PA vector that meets with equality the QoS constraint if the required total PA is not greater than the maximum one, otherwise, all the power is allocated returning the highest possible value of EGP. Finally, as shown in the simulation results, practical values of the PA never reach the maximum power limit, validating the theoretical results on the equilibrium analysis done.

5.4 Relationship between GNE and PO solution

In this section, we give some insights on the relation between the GNE and the PO solution, which represents the achievable performance upper bound. Specifically, the PO solution consists in solving a multi-objective OP, where the objective function is the sum of the utility functions of every user, i.e., \(u_{\text {PO}}(\mathbf {p})=\sum _{k=1}^{K}u_{k}(\mathbf {p}_{k})\), with \(\mathbf {p} \triangleq \left [\mathbf {p}_{1}^{\mathrm {T}},\cdots,\mathbf {p}_{K}^{\mathrm {T}}\right ]^{\mathrm {T}}\), and where the set of constraints is the same than that in (17). Let us refer to this problem as PO-OP. Besides being a non-convex OP, whose solution may be very hard to find, the PO-OP requires that every user, or a centralized entity, knows, among the others, every channel coefficient h j,s,n between any user and base station in the network. Obviously, this is unlikely to be feasible in the considered HetNet. However, in order to shed light on the relationship between the PO solution and the GNE, corresponding to the PA solution (23) based on the best response, we consider here a two-user two-subcarrier case (K=2, N=2), where user 1 is in cell 1 and user 2 is in cell 2, i.e., ϕ(1)=1 and ϕ(2)=2. The simulation setup is as follows: h 1,1,1=1.821, h 1,1,2=0.329, h 1,2,1=0.104, h 1,2,2=0.221, h 2,2,1=0.821, h 2,2,2=2.629, h 2,1,1=0.319, h 2,1,2=0.097, σ w k,1/P k =0.01, \(\forall n \in {\mathcal {N}}_{k}\), \(\forall k \in {\mathcal {K}}\), (m k ,r k )=(2,1/3), and \(\forall k \in {\mathcal {K}}\). The PO solution is found solving the PO-OP with the Matlab Global Optimization Toolbox. Finally, we consider the target EGP of user 2 to be \(\bar \zeta _{2}=0.2\) (b/s/Hz), whereas we let \(\bar \zeta _{1}\) vary in the set [0.2,1] (b/s/Hz). When \(\bar \zeta _{1}=\bar \zeta _{2}\), only one GNE solution exists and is close to the PO one. Indeed, the ratio ς (GNE-PO) between the total power obtained with the GNE and PO solution, respectively, is about 0.77. When \(\bar \zeta _{1}=1\) (b/s/Hz), more power needs to be allocated by user 1, yielding a higher co-channel interference. In this case indeed 2 GNE solutions arise and ς (GNE-PO) drops down to about 0.56 in the worst case. From these observations, we can conclude that, as could be expected, the GNE is more efficient, i.e., closer to the PO, when the interference in the network is lower, whereas the more severe the interference, the less efficient the GNE solution. Nevertheless, we remark that the latter allows for a distributed solution suitable for the scenario under investigation.

6 Simulation results

In this section, the effectiveness of the proposed distributed RA algorithm is tested. The HetNet scenario taken into consideration for the simulations is composed of one MC and Q=4 SCs, with K 0=6 users connected to the MBS (coverage area of radius R MBS=200 m) and K q =3, q=1,,Q users connected (coverage area of radius R SBS=20 m) to each SBS. Figure 5 shows a snapshot of the HetNet, whereas the packet-based BIC-OFDM transmission system is summarized in Table 3. Finally, the path loss models for the SC and MC are those proposed in [39].
Fig. 5

HetNet simulated scenario

The target EGP QoS level \({\bar \zeta }\) is compared in Fig. 6 against the actual GP (AGP) obtained by applying the proposed distributed RA algorithm, for six users randomly chosen within MC, SC 1, SC 2, and SC 3. The AGP for the generic kth user is defined as
$$ {AGP}_{k} \triangleq \frac{1}{N_{\mathrm{a}}} \sum\limits_{\ell=1}^{N_{\mathrm{a}}}{\frac{U_{k}^{(\mathrm{p})} \vartheta(\ell)} {{T_{k}}(\ell)}}\;\;\; (\text{bit/s/Hz}), $$
Fig. 6

Comparison between the minimum EGP QoS level and the relevant AGP for a few users selected in MC and SCs

where 𝜗() equals 1 if the th packet is correctly decoded and 0 when it is discarded, T k () is the transmission interval of the th packet, N a is the number of trasmitted packets, set to 1000, each experiencing independent channel realizations and with the position of users randomly placed within their cells. In view of the effectiveness of the GP prediction based on the κESM model recalled in Section 3.1, it is apparent that the AGP performance meets for all the considered users, taken as example, the minimum target EGP. It can be noted that the same result holds for all the other users as well.

Figure 7 shows the total transmitted power and the EGP per user as a function of the number of the iterations of the distributed RA algorithm, obtained for a given channel realization and network geometry. As can be seen, the distributed RA algorithm guarantees fast convergence to the equilibrium point for all users of the HetNet, thus exhibiting a considerable robustness against the ICI effects.
Fig. 7

Power and EGP convergence

Furthermore, in order to shed light about the convenience of employing as more SCs as possible in the coverage area of the MC, Fig. 8 compares the average total transmitted power spent in the HetNet versus the distance from the selected users and their BS, i.e., user 1 in the SC 1 and user 1 in the MC. Two scenarios are addressed: together with the MC, we consider the presence of Q=1 SC or Q=4 SCs, being in both cases, for a fair comparison, the total number of active users in the HetNet equal to 18. Particularly, for Q=1, K 1=3 users are served within the SC 1, and the 15 remaining ones belong to the MC. Conversely, for Q=4, according to the scenario of Fig. 5, three users are connected to each SBS, and only six to the MBS. For each distance, the total power is averaged over 100 independent transmitted packets and network geometry different realizations, whereas the minimum target EGP is set to \(\bar {\zeta } =2\) bit/s/Hz. As for Fig. 8, empty and solid square marks are used for the case of Q=1 SC, whereas the curves with empty and solid circle marks refer to the case of Q=4 SCs. As expected from the working of the distributed RA algorithm, the total power spent in the HetNet grows with increasing the distance, due to the fact that the minimum target EGP has to be guaranteed while allocating the minimum power to each user. Further, when the number of SCs is increased moving from Q=1 to Q=4, the interference gets higher, though slightly enough, since the SCs are not packed together. But, more users are located closer to their BS, with the result that each one will require less power, and consequently, the total power spent within the HetNet will be lower as well. Therefore, the larger number of sparse SCs, the less power is required to meet the QoS constraints in spite of higher ICI, thus corroborating the advantages of the SC concept.
Fig. 8

Average total transmitted power of the HetNet vs. user distance from MBS or SBS

Finally, let us assess the scalability of the proposed distributed RA solution when many more BSs and users are present within the MC. To this end, Fig. 9 shows the new considered scenario called dense HetNet, which is composed by a MC with eight users and eight SCs with six users for each of them, thus notably increasing the number of users and SCs compared to the scenario considered so far. On the basis of the new dense HetNet scenario, Fig. 10 depicts the convergence of power and EGP for the same users in the same geometric position of Fig. 7. Comparing results in Fig. 7 with those in Fig. 10, we point out that the algorithm is scalable since the fast convergence to the equilibrium point is still guaranteed.
Fig. 9

Dense HetNet simulated scenario

Fig. 10

Power and EGP convergence in dense HetNet

7 Conclusions

This paper tackled the distributed RA problem, in the uplink of HetNets, aimed at minimizing the power consumption of each user under the satisfaction of a minimum GP constraint per user. The problem, tagged as PEGE OP, was faced by suitably decoupling the BL and coding rate allocation problem from the PA problem. First, the PEGE OP in P2P links was investigated and solved, obtaining in particular an approximate yet accurate closed-form expression of the PA, in a water-filling-like form, which depends on the QoS constraint. Then, we moved to the interference channel case, where the PA OP was described as a NCG. The relevant solution concept was identified in the GNE, due to QoS constraint that couples the strategies (i.e., the set of feasible PA vectors) of the players (i.e., the users in the HetNet transmitting over the same frequencies). Capitalizing on the closed-form expression for the PA, the analysis of the GNE was carried out through the BR concept, providing sufficient conditions for the existence and uniqueness of the solution. Finally, a distributed RA algorithm, which converges to the equilibrium of the game, was derived and its performance tested through extensive numerical simulations, certifying its good convergence properties, the reduction of power consumption in the HetNet, and the close match between EGP and AGP. Further line of research on this topic will be the analysis of the impact of the total power constraint on the equilibrium.

8 \thelikesection Endnote

1 The BL solution found applying the algorithm in [37] clearly depends on the initial PA taken over the subcarriers. Assuming an uniform PA, however, allows to have initially all the subcarriers being active, thus, to perform BL over all the subcarriers. This approach is suboptimal yet simple and efficient, as shown by the result obtained in [31].

9 Appendix A: Proof of Proposition 1

Since both the objective function and the constraints are convex, (14) is a convex OP. Introducing the multipliers Θ, \({\boldsymbol {\nu }}\triangleq [\nu _{1},\cdots,\nu _{N}]^{T}\) and \({\boldsymbol {\lambda }}\triangleq [\lambda _{1},\cdots,\lambda _{N}]^{T}\), the associated Lagrangian is
$$ L(\mathbf{p},\Theta,{\boldsymbol{\nu }}) = \sum_{n=1}^{N} {{p_{n}}} + \Theta \left({\beta} {\sum_{n=1}^{N} {{\mathrm{e}^{- \frac{{{p_{n}}}}{{{\rho_{n}}}}}}} - \kappa} \right) - \sum_{n=1}^{N} {{\nu_{n}} {p_{n}}} $$
and, applying the KKT conditions, we have necessary and sufficient condition for optimality, i.e.,
$$ \begin{array}{*{20}{c}} {1 - \Theta^{*}\frac{{{\beta}}}{{{\rho_{n}}}}{\mathrm{e}^{- \frac{{{ p^{*}_{n}}}}{{{\rho_{n}}}}}} - {\nu^{*}_{n}} = 0, \;\;\; \forall n \in {\mathcal{N}},} \\ {{\nu^{*}_{n}}{ p^{*}_{n}} = 0, \; \forall n\in {\mathcal{N}}, \;\;\; \Theta^{*} \left({\beta} {\sum_{n=1}^{N} {{\mathrm{e}^{- \frac{{{ p^{*}_{n}}}}{{{\rho_{n}}}}}}} - \kappa} \right)=0,} \\ { {p^{*}_{n}} \ge 0, \; \forall n \in {\mathcal{N}}, \;\; \; {\nu^{*}_{n}} \ge 0, \; \forall n \in {\mathcal{N}}, \;\;\; \Theta^{*} \ge 0,} \\ \end{array} $$

where p and {Θ ,ν } denote the optimal primal and dual variables, respectively. After some algebra, from (30) it easily follows that \(p^{*}_{n} = {\rho _{n}} \left [\log \Theta ^{*} - \log \frac {\rho _{n}}{\beta _{n}}\right ]^{+}\), where Θ is such that the QoS constraint in (14) holds with equality.

10 Appendix B: Proof of Proposition 3

Sufficient conditions for the feasibility of (17), i.e., there is a non-empty solution set, are derived considering that the QoS constraint must hold true \(\forall k \in {\mathcal {K}}\). This constraint can be equivalently rewritten as
$$ {\sum_{n\in\mathcal{N}_{k}}\left(\beta_{k} \mathrm{e}^{-\frac{p_{k,n}}{\rho_{k,n}(\mathbf{p}_{-k,n})}} - \frac{\kappa_{k}}{N_{k}}\right) \le 0} $$
so that a more stringent condition, recalling that \(\kappa _{k}=m_{k}N_{k}\mathrm {e}^{-\gamma ^{*}_{k}}\), is
$$ \beta_{k} \mathrm{e}^{-\frac{p_{k,n}}{\rho_{k,n}(\mathbf{p}_{-k,n})}} \le \mathrm{e}^{-\gamma^{*}_{k}}, \;\;\; \forall k,n. $$
Exploiting the definition of ρ k,n in (18) and defining \(\tilde \gamma ^{*}_{k} \triangleq \gamma ^{*}_{k} + \log \beta _{k} > 0\) (being β k >1), after some algebra (32) becomes
$$ p_{k,n}|\bar h_{k,\phi(k),n}|^{2}-\tilde\gamma^{*}_{k}\sum\limits_{j = 1 \atop j \ne k}^{K} p_{j,n}|h_{j,\phi(k),n}|^{2}\ge\tilde\gamma^{*}_{k}\sigma^{2}_{k,n}, \;\;\; \forall k,n. $$
The above expression can be recast into a matrix form as
$$ {\mathbf{Z}_{n}}({{\boldsymbol{\gamma}}^{*}})\cdot\mathbf{q}_{n} \ge {{\mathbf{t}_{n}}({\boldsymbol{\gamma}}^{*})}\ge\mathbf{0}, \;\;\; \forall n, $$
that is,
$$ \mathbf{q}_{n} \ge \left[{\mathbf{Z}_{n}}({{\boldsymbol{\gamma}}^{*}})\right]^{-1} \cdot {{\mathbf{t}_{n}}({\boldsymbol{\gamma}}^{*})}\ge\mathbf{0}, \;\;\; \forall n, $$

where Z n and t n are defined in (25) and (24), respectively, and \(\mathbf {q}_{n} \triangleq [ p_{1,n},\cdots, p_{K,n}]^{\mathrm {T}}\).

Looking at the expression of Z n in (25), it is a Z-matrix, since all its off-diagonal entries are negative. Then, if Z n is also a P-matrix, its inverse is nonnegative [40] and thus, since t n 0, condition (35) is satisfied, i.e., the problem is feasible since there exist at least one solution.

11 Appendix C: Proof of Proposition 4

According to the Nash existence theorem [41], given a game in strategic form with K players, each characterized by an action space \({\mathcal {P}}_{k}\) and an utility function u k , if, \(\forall k \in {\mathcal {K}}\), (i) \({\mathcal {P}}_{k}\) is non-empty, convex and compact, (ii) \(u_{k}: {\mathcal {P}} \rightarrow \mathbb {R}\) is continuous with \({\mathcal {P}} \triangleq {\mathcal {P}}_{1}\times \cdots \times {\mathcal {P}}_{K}\), and (iii) \(\forall \mathbf {p}_{-k} \in {\mathcal {P}} \backslash {\mathcal {P}}_{k}\), u k is concave on \({\mathcal {P}}_{k}\), then a Nash equilibrium exists. Conditions (ii) and (iii) and the convexity and compactness of each \({\mathcal {P}}_{k}\) easily follow by looking at their analytical expression. A sufficient condition for the non-emptiness of the sets \({\mathcal {P}}_{k}\), \(\forall k \in {\mathcal {K}}\), is given by the feasibility condition stated in Proposition 3. This proves the first part of Proposition 4.Under the feasibility condition, i.e., if Z n is a P-matrix, then there exist at least NK-sized vectors \(\mathbf {q}_{n}^{*} \triangleq [ p_{1,n}^{*},\cdots, p_{K,n}^{*}]^{\mathrm {T}}\), 1≤nN, which satisfy (26) in Appendix B and are thus the solution to OP (17). This proves the second part of Proposition 4.

12 Appendix D: Proof of Proposition 5

The KKT conditions of OP (17) are
$$ \begin{aligned} \begin{array}{*{20}{c}} {1 - \Theta_{k}\frac{{{\beta_{k}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}{\mathrm{e}^{- \frac{{{ p_{k,n}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}}} - {\nu_{k,n}} = 0, \;\;\; \forall k,n,} \\ {{\nu_{k,n}}{ p_{k,n}} = 0, \; \forall k,n, \;\;\; \Theta_{k} \left({{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \beta_{k}{\mathrm{e}^{- \frac{{{ p_{k,n}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}}}} - {\kappa_{k}}} \right)=0, \;\;\; \forall k} \\ { {p_{k,n}} \ge 0, \; \forall k,n, \;\;\; {\nu_{k,n}} \ge 0, \; \forall k,n, \;\;\; \Theta_{k} \ge 0,\;\;\; \forall k}. \\ \end{array} \end{aligned} $$
Eliminating the Lagrange multiplier {ν k,n } relevant to the nonnegativity constraint of the power coefficients and making some substitutions (36) can be equivalently rewritten as the following mixed nonlinear complementary problem (MNCP):
$$ \begin{array}{*{20}{c}} {0 \le {p_{k,n}}}& \bot &{1 - {\Theta_{k}}\frac{{{\beta_{k}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}{\mathrm{e}^{- \frac{{{p_{k,n}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}}} \ge 0} & {\forall k,n}\\ {0 \le {\Theta_{k}}}&,&{{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \beta_{k}{\mathrm{e}^{- \frac{{{p_{k,n}}}}{{{\rho_{k,n}(\mathbf{p}_{-k,n})}}}}}} = {\kappa_{k}}} & {\forall k}. \end{array} $$
Let us now introduce the variable
$$ z_{k,n}\triangleq f (p_{k,n}) = 1-\mathrm{e}^{- \frac{{{p_{k,n}}}}{{{\rho_{k,n}}}}}, $$
which is one-to-one related to p k,n , i.e., p k,n =f −1(z k,n ), and note that z k,n >0 iff p k,n >0 and z k,n =0 iff p k,n =0. Thus, upon defining \(\mathbf {z}_{-k,n}\triangleq f(\mathbf {p}_{-k,n})\), the system of Eq. (37) can be rewritten as
$$ \begin{aligned} {0 \le {z_{k,n}}} & \bot &{1 + {\Theta_{k}}\frac{{{\beta_{k}}}}{{{\rho_{k,n}(f(\mathbf{p}_{-k,n}))}}}({z_{k,n}-1}) \ge 0} & {\forall k,n}\\ {0 \le {\Theta_{k}}} &, &{{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \beta_{k}(1-z_{k,n})} = {\kappa_{k}}} & {\forall k}, \end{aligned} $$
and after some algebra and taking the logarithm of the second inequality on the first line of (39), we get
$$ {}\begin{aligned} {0 \!\le {\!z_{k,n}}} & \,\bot\, {\log\frac{{{\rho_{k,n}(f(\mathbf{p}_{-k,n}))}}}{{{\beta_{k}}}} +\! \lambda_{k} \! +\! \log{\frac{1}{1-z_{k,n}}}\! \ge 0} &\!\!\! {\forall k,n}\\ {{\lambda_{k}}\;\;{\text{free}}} &, \qquad\qquad\qquad\,\,\,{\sum\limits_{n \in {{\mathcal{N}}_{k}}} {z_{k,n}} = {\kappa^{\prime}_{k}}} & {\forall k}, \end{aligned} $$
with \(\kappa ^{\prime }_{k}= N_{k}-\kappa _{k}/\beta _{k}\). We now define the functions \(J_{k,n}({ z}_{k,n},\mathbf {z}_{-k,n})\triangleq \log \frac {{{\rho _{k,n}(\mathbf {z}_{-k,n})}}}{{{\beta _{k}}}} - \log {(1-z_{k,n})}\), assumed continuously differentiable over the set \(\prod _{k=1}^{K}[\!0,\kappa ^{\prime }_{k}]\). Then, it follows that Eq. (40) is the KKT condition of the variational inequality (VI) problem VI (U,J) [7], with \(U\triangleq \prod _{k\in \mathcal {K}} U_{k}\), \(U_{k} \triangleq \{\mathbf {z}_{k} \in \mathbb {R}^{N}: {\sum _{n \in {{\mathcal {N}}_{k}}} {z_{k,n}} = {\kappa ^{\prime }_{k}}}\}\), \(\mathbf {z}_{k}\triangleq [z_{k,1},\cdots,z_{k,N}]^{\mathrm {T}}\), \(\mathbf {J}\triangleq [\mathbf {J}_{1}^{T},\cdots,\mathbf {J}_{K}^{\mathrm {T}}]\) and \(\mathbf {J}_{k}\triangleq [J_{k,1},\cdots,J_{k,N}]^{\mathrm {T}}\).Thus, by definition, \(\mathbf {z}_{k}^{\star }\), k, is a solution of the VI (U,J), if and only if, z k U k , the following condition holds:
$$ \sum\limits_{n \in {{\mathcal{N}}_{k}}}(z_{k,n}-z^{\star}_{k,n})\left(\log\frac{{{\rho_{k,n}}}}{{{\beta_{k}}}} + \log{\frac{1}{1-z^{\star}_{k,n}}} \right) \ge 0. $$
Assume now there exist two solutions \(\{ \mathbf {p}_{k}^{(1)} \}\) (\(\{ \mathbf {z}_{k}^{(1)} \}\)) and \(\{ \mathbf {p}_{k}^{(2)} \}\) (\(\{ \mathbf {z}_{k}^{(1)} \}\)) of the GNE problem and be \(\rho ^{(i)}_{k,n} \triangleq \rho _{k,n}(\mathbf {p}^{(i)}_{-k,n})\), i=1,2. From (41), it follows that they must satisfy
$$ \sum\limits_{n \in {{\mathcal{N}}_{k}}}(z^{(2)}_{k,n}-z^{(1)}_{k,n})\left(\log\frac{{{\rho^{(1)}_{k,n}}}}{{{\beta_{k}}}} + \log{\frac{1}{1-z^{(1)}_{k,n}}} \right) \ge 0, $$
$$ \sum\limits_{n \in {{\mathcal{N}}_{k}}}(z^{(1)}_{k,n}-z^{(2)}_{k,n})\left(\log\frac{{{\rho^{(2)}_{k,n}}}}{{{\beta_{k}}}} + \log{\frac{1}{1-z^{(2)}_{k,n}}} \right) \ge 0. $$
Before proceeding further, let us introduce some definitions and inequalities that will be instrumental for the subsequent analysis:
$$ \begin{aligned} \tau_{k,n} (\mathbf{p}_{-k,n}^{(i)}) &= \tau^{(i)}_{k,n} \triangleq \frac{\rho^{(i)}_{k,n}}{|h_{k,\phi(k),n}|^{2}}\\ &= \delta_{k}\left[ \sigma^{2}_{k,n} + \sum\limits_{j = 1\atop j \ne k}^{K} {p_{j,n} |h_{j,\phi(k),n}|^{2}} \right] \;\;\; i=1,2, \end{aligned} $$
$$ \delta_{k}\sigma^{2}_{k,n} \le \tau_{k,n} (\mathbf{p}_{-k,n}^{(i)}) \le {\bar \tau}_{k,n} \triangleq \tau_{k,n} ({\bar{\mathbf{p}}}_{-k,n}) \;\;\; i=1,2, $$
$$ {}\begin{aligned} \frac{p_{k,n}^{(i)}}{\rho_{k,n}^{(i)}} & = \frac{p_{k,n}^{(i)}|h_{k,\phi(k),n}|^{2}}{\tau_{k,n}^{(i)}} \le \frac{p_{k,n}^{(i)}|h_{k,\phi(k),n}|^{2}}{\sigma_{k,n}^{2}} \le \frac{{\bar p}_{k,n}|h_{k,\phi(k),n}|^{2}}{\sigma_{k,n}^{2}} \\ & \quad \le \underset{n}{\max } \frac{{\bar p}_{k,n}|h_{k,\phi(k),n}|^{2}}{\sigma_{k,n}^{2}} \triangleq {\bar \gamma}^{(\max)}_{k} \;\;\; i=1,2, \end{aligned} $$

where \(\{{\bar {p}}_{k,n}\}\) coefficients are given by (26).

Summing (42) and (43), and after some simple algebra, we get
$$ \begin{array}{*{20}{c}} {\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(z^{(2)}_{k,n}-z^{(1)}_{k,n}\right) \left(\log\left(1-z^{(1)}_{k,n}\right) - \log \left(1-z^{(2)}_{k,n}\right) \right) \le}\\ {\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(z^{(2)}_{k,n} - z^{(1)}_{k,n} \right) \left(\log \rho^{(1)}_{k,n} - \log \rho^{(1)}_{k,n} \right).} \end{array} $$
Let us now recall the mean value theorem: if a function g is continuous on the closed interval [a,b], where a<b, and differentiable on the open interval (a, b), then there exists a point c in (a,b) such that g(b)−g(a)=g (c)(ba). Accordingly, taking g(·)= log(·), we get
$$ \begin{aligned} { \log\! \left (\! 1\! -\! z^{(1)}_{k,n}\right)\! -\! \log\! \left(\! 1\! -\! z^{(2)}_{k,n}\right) \! =\! \frac{z^{(2)}_{k,n}-z^{(1)}_{k,n}}{s_{k,n}}\!,} & {\mathrm{ e}^{-\frac{p^{(2)}_{k,n}}{\rho^{(2)}_{k,n}}} \! \le s_{k,n} \! \le \mathrm{\! e\! }^{-\frac{p^{(1)}_{k,n}}{\rho^{(1)}_{k,n}}}}\!. \end{aligned} $$
Substituting the above into (47), we get
$$ \begin{aligned} \sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(z^{(2)}_{k,n} - z^{(1)}_{k,n} \right)^{2} & \le \sum\limits_{n \in {{\mathcal{N}}_{k}}} \frac{\left(z^{(2)}_{k,n} - z^{(1)}_{k,n} \right)^{2}}{s_{k,n}} \le \sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(z^{(2)}_{k,n}-z^{(1)}_{k,n}\right)\\ &\times \left(\log \rho^{(1)}_{k,n} - \log \rho^{(2)}_{k,n} \right),\\ & \le \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} (z^{(2)}_{k,n}-z^{(1)}_{k,n})^{2}} \sqrt{ \sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\log \rho^{(1)}_{k,n} - \log \rho^{(2)}_{k,n} \right)^{2}}\!, \end{aligned} $$
where the first inequality comes from the upper bound on s k,n ≤1 (which in turn can be inferred by recalling the bound in (48) and \(\mathrm {e}^{-{p_{k,n}^{(i)}}/{\rho _{k,n}^{(i)}}}\le 1\), i,k,n), whereas the latter inequality comes from the triangle inequality. Thus, (49) implies
$$ \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} (z^{(2)}_{k,n}-z^{(1)}_{k,n})^{2}} \le \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\log \rho^{(1)}_{k,n} - \log \rho^{(2)}_{k,n} \right)^{2}}. $$
According to (38), \(z^{(2)}_{k,n}-z^{(1)}_{k,n}=\mathrm {e}^{-\frac {p_{k,n}^{(1)}}{\rho _{k,n}^{(1)}}}-\mathrm {e}^{-\frac {p_{k,n}^{(2)}}{\rho _{k,n}^{(2)}}}\), and exploiting the mean value theorem for the exponential function, we get
$$ {} \begin{aligned} {\mathrm{e}^{-\frac{p_{k,n}^{(1)}}{\rho_{k,n}^{(1)}}}\!-e^{-\frac{p_{k,n}^{(2)}}{\rho_{k,n}^{(2)}}} \,=\, \mathrm{e}^{-w_{k,n}}\left(\! \frac{p_{k,n}^{(2)}}{\rho_{k,n}^{(2)}} - \frac{p_{k,n}^{(1)}}{\rho_{k,n}^{(1)}} \!\right),} & {\frac{p_{k,n}^{(1)}}{\rho_{k,n}^{(1)}} \le w_{k,n} \!\le\! \frac{p_{k,n}^{(2)}}{\rho_{k,n}^{(2)}}}. \end{aligned} $$
Moreover, by (46), \(e^{-w_{k,n}}\ge e^{-{\bar \gamma }^{(\max)}_{k}}\), and exploiting relation (44), (50) becomes
$$ \begin{aligned} \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{p^{(2)}_{k,n}}{\rho^{(2)}_{k,n}}-\frac{p^{(1)}_{k,n}}{\rho^{(1)}_{k,n}}\right)^{2}} \le \! \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\log \tau^{(1)}_{k,n} - \log \tau^{(2)}_{k,n} \right)^{2}}. \end{aligned} $$
We now introduce the following definition
$$ {\xi_{k,n}} \triangleq (p_{k,n}^{(2)} - p_{k,n}^{(1)}){\left| {{h_{k,\phi(k),n}}} \right|^{2}} $$
and note that
$$ \begin{aligned} \frac{p^{(2)}_{k,n}}{\rho^{(2)}_{k,n}}-\frac{p^{(1)}_{k,n}}{\rho^{(1)}_{k,n}} &= \left(\frac{p^{(2)}_{k,n}}{\tau^{(2)}_{k,n}}-\frac{p^{(1)}_{k,n}}{\tau^{(1)}_{k,n}}\right) {\left| {{h_{k,\phi(k),n}}} \right|^{2}} \\ &= \frac{p^{(2)}_{k,n}-p^{(1)}_{k,n}}{\tau^{(2)}_{k,n}}{\left| {{h_{k,\phi(k),n}}} \right|^{2}}\\ & \quad +p^{(1)}_{k,n}{\left| {{h_{k,\phi(k),n}}} \right|^{2}}\left(\frac{1}{\tau^{(2)}_{k,n}}-\frac{1}{\tau^{(1)}_{k,n}}\right)\\ &=\frac{\xi_{k,n}}{\tau^{(2)}_{k,n}}-\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\tau^{(2)}_{k,n}}\frac{{\left| {{h_{k,\phi(k),n}}} \right|^{2}}p^{(1)}_{k,n}}{\tau^{(1)}_{k,n}}. \end{aligned} $$
Accordingly, by noting that, due to the triangle inequality,
$$ \begin{aligned} \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} &\sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{p^{(2)}_{k,n}}{\rho^{(2)}_{k,n}}-\frac{p^{(1)}_{k,n}}{\rho^{(1)}_{k,n}}\right)^{2}} \\ &= \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\xi_{k,n}}{\tau^{(2)}_{k,n}}-\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\tau^{(2)}_{k,n}}\frac{{\left| {{h_{k,\phi(k),n}}} \right|^{2}}p^{(1)}_{k,n}}{\tau^{(1)}_{k,n}} \right)^{2}} \\ & \ge \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\xi_{k,n}}{\tau^{(2)}_{k,n}} \right)^{2}}\\ &- { \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\tau^{(2)}_{k,n}}\frac{{\left| {{h_{k,\phi(k),n}}} \right|^{2}}p^{(1)}_{k,n}}{\tau^{(1)}_{k,n}} \right)^{2}}}, \end{aligned} $$
and that, by the mean value theorem of the logarithmic function,
$$ {}\begin{aligned} {\log \left(\tau_{k,n}^{(1)}\right) - \log \left(\tau_{k,n}^{(2)}\right) = \frac{{\tau_{k,n}^{(1)} - \tau_{k,n}^{(2)}}}{{{t_{k,n}}}},}&{\tau_{k,n}^{(1)} \le {t_{k,n}} \le \tau_{k,n}^{(2)}}\!\!\! \end{aligned}\!, $$
we can bound (52) as follows
$$ \begin{aligned} \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}}& \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\xi_{k,n}}{\tau^{(2)}_{k,n}} \right)^{2}} \\ & \le \mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\tau^{(2)}_{k,n}}\frac{{\left| {{h_{k,\phi(k),n}}} \right|^{2}}p^{(1)}_{k,n}}{\tau^{(1)}_{k,n}} \right)^{2}},\\ & + \sqrt {\sum\limits_{n \in {{\mathcal{N}}_{k}}} {{{\left({\frac{{\tau_{k,n}^{(1)} - \tau_{k,n}^{(2)}}}{{{t_{k,n}}}}} \right)}^{2},}}} \end{aligned} $$
$$ \begin{aligned} & \; \le \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\tau^{(2)}_{k,n}} \bar{\gamma}_{k}^{(\max)} \right)^{2}} & + \sqrt {\sum\limits_{n \in {{\mathcal{N}}_{k}}} {{{\left({\frac{{\tau_{k,n}^{(2)} - \tau_{k,n}^{(1)}}}{{{t_{k,n}}}}} \right)}^{2}},}} \\ \end{aligned} $$
$$\begin{array}{*{20}l} &{\quad \le \left(\bar{\gamma}_{k}^{(\max)}+1\right) \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\tau^{(2)}_{k,n}-\tau^{(1)}_{k,n}}{\delta_{k}\sigma^{2}_{k,n}} \right)^{2}} }, \end{array} $$
$$\begin{array}{*{20}l} & \quad\le \mathrm{e}^{\bar{\gamma}_{k}^{(\max)}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\sum\limits_{j = 1\atop j \ne k}^{K} { \frac {(p^{(2)}_{j,n}-p^{(1)}_{j,n})|h_{j,\phi(k),n}|^{2}}{\sigma^{2}_{k,n}} }\right)^{2}}\, \end{array} $$
where in (58) we exploited the fact that ex ≤1, x≥0 and (46), in (59) the lower bound in (45) and in (60) the bound x+1≤e x , x≥0. By exploiting the upper bound in (45), and defining
$$ \chi_{j,k,n}\triangleq \frac{{\bar {\tau}}_{j,n}}{\sigma^{2}_{k,n}}\frac{|h_{j,\phi(k),n}|^{2}}{|h_{j,\phi(j),n}|^{2}}, $$
inequality (60) can be further rearranged as
$$ \begin{aligned} {\mathrm{e}^{-{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\xi_{k,n}}{{\bar{\tau}}_{k,n}} \right)^{2}}} &{ \le \mathrm{e}^{{\bar\gamma}^{(\max)}_{k}} \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\sum\limits_{j = 1 \atop j \ne k}^{K} \chi_{j,k,n} \frac{\xi_{j,n} }{{\bar {\tau}}_{j,n}} \right)^{2}}} \end{aligned} $$
$$ \begin{aligned} \le \mathrm{e}^{{\bar\gamma}^{(\max)}_{k}} \sum\limits_{j = 1\atop j \ne k}^{K} \left(\underset{n}{\max} \chi_{j,k,n} \right) \sqrt{\sum\limits_{n \in {{\mathcal{N}}_{k}}} \left(\frac{\xi_{j,n} }{{\bar {\tau}}_{j,n}} \right)^{2}}. \end{aligned} $$
Hence, by defining
$$ \chi^{(\max)}_{j,k} \triangleq \underset{n}{\max} \left(\chi_{j,k,n} \right), $$
expression (63) can be rewritten in matrix form as
$$ \mathbf{V}\mathbf{b} \le \mathbf{0}, $$
$$ {} \begin{aligned} \mathbf{V} = \left[\! {\begin{array}{*{20}{c}} {{\mathrm{e}^{- \bar \gamma_{1}^{(\max)}}}}&{ - {\mathrm{e}^{\bar \gamma_{1}^{(\max)}}}\chi_{2,1}^{(\max)}}& \cdots &{ - {\mathrm{e}^{\bar \gamma_{1}^{(\max)}}}\chi_{K,1}^{(\max)}}\\ { - {\mathrm{e}^{\bar \gamma_{2}^{(\max)}}}\chi_{1,2}^{(\max)}}&{{\mathrm{e}^{- \bar \gamma_{2}^{(\max)}}}}& \cdots &{ - {\mathrm{e}^{\bar \gamma_{2}^{(\max)}}}\chi_{K,2}^{(\max)}}\\ \vdots & \vdots & \ddots & \vdots \\ { - {\mathrm{e}^{\bar \gamma_{K}^{(\max)}}}\chi_{1,K}^{(\max)}}&{ - {\mathrm{e}^{\bar \gamma_{K}^{(\max)}}}\chi_{2,K}^{(\max)}}& \cdots &{{\mathrm{e}^{- \bar \gamma_{K}^{(\max)}}}} \end{array}} \!\right] \end{aligned} $$
$$ \mathbf{b}\triangleq\left[\begin{array}{*{20}{c}}{\sqrt{\sum\limits_{n \in {{\mathcal{N}}_{1}}} \left(\frac{\xi_{1,n}}{{\bar{\tau}}_{1,n}} \right)^{2}}}\\{\vdots}\\{\sqrt{\sum\limits_{n \in {{\mathcal{N}}_{K}}} \left(\frac{\xi_{K,n}}{{\bar{\tau}}_{K,n}} \right)^{2}}} \end{array} \right]. $$

It can be noted that V is a Z-matrix. Then, if V is a P-matrix, it must have a nonnegative inverse, implying b=0. If b=0, then the equilibrium is unique. This proves Proposition 4.



This work has been partially supported by the PRA 2016 research project 5GIOTTO funded by the University of Pisa.

Competing interests

The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

Department of Information Engineering, University of Pisa, Pisa, Italy
Wireless Systems Engineering and Research (WISER) S.r.l., Livorno, Italy


  1. Ericsson, 5G Radio Access - Capabilities and technologies. Ericsson White Paper, 1–10 (2016).
  2. The Climate Group and Global e-Sustainability Initiative (GeSI), 2008. SMART 2020: enabling the low carbon economy in the information age. Accessed 2008.
  3. X Sun, S Wang, Resource allocation scheme for energy saving in heterogeneous networks. Wirel. Commun. IEEE Trans. 14(8), 4407–4416 (2015).View ArticleGoogle Scholar
  4. J Hoydis, M Kobayashi, M Debbah, Green small-cell networks. Veh. Technol. Mag. IEEE. 6(1), 37–43 (2011).View ArticleGoogle Scholar
  5. N Saquib, E Hossain, LB Le, DI Kim, Interference management in OFDMA femtocell networks: issues and approaches. Wirel. Commun. IEEE. 19(3), 86–95 (2012).View ArticleGoogle Scholar
  6. G Bacci, EV Belmega, P Mertikopoulos, L Sanguinetti, Energy-aware competitive power allocation for heterogeneous networks under QoS constraints. IEEE Trans. Wirel. Commun. 14(9), 4728–4742 (2015).View ArticleGoogle Scholar
  7. G Scutari, D Palomar, F Facchinei, J-S Pang, Convex optimization, game theory, and variational inequality theory. IEEE Signal Process. Mag. 27(3), 35–49 (2010).View ArticleGoogle Scholar
  8. J Chen, Y Zhou, Y Kuo, Energy-efficiency resource allocation for cognitive heterogeneous networks with imperfect channel state information. IET Commun. 10(11), 1312–1319 (2016).View ArticleGoogle Scholar
  9. J Ding, L Jiang, C He, Joint energy-efficient resource allocation and interference alignment for hetnets. IET Commun. 10(9), 1104–1110 (2016).View ArticleGoogle Scholar
  10. N Mokari, F Alavi, S Parsaeefard, T Le-Ngoc, Limited-feedback resource allocation in heterogeneous cellular networks. IEEE Trans. Veh. Technol. 65(4), 2509–2521 (2016).View ArticleGoogle Scholar
  11. TE Bogale, LB Le, Massive mimo and mmwave for 5g wireless hetnet: potential benefits and challenges. IEEE Veh. Technol. Mag. 11(1), 64–75 (2016).View ArticleGoogle Scholar
  12. D Fudenberg, J Tirole, Game Theory (MIT Press, Cambridge, 1991).MATHGoogle Scholar
  13. H Ji, C-Y Huang, Non-cooperative uplink power control in cellular radio systems. Wirel. Netw. 4(3), 233–240 (1998).View ArticleGoogle Scholar
  14. W Yu, G Ginis, JM Cioffi, Distributed multiuser power control for digital subscriber lines. IEEE J. Sel. Areas Commun. 20(5), 1105–1115 (2002).View ArticleGoogle Scholar
  15. CU Saraydar, NB Mandayam, DJ Goodman, Efficient power control via pricing in wireless data networks. Trans. Commun. IEEE. 50(2), 291–303 (2002).View ArticleGoogle Scholar
  16. F Meshkati, SC Poor, HV Schwartz, NB Mandayam, An energy-efficient approach to power control and receiver design in wireless data networks. Trans. Commun. IEEE. 53(11), 1885–1894 (2005).View ArticleGoogle Scholar
  17. G Miao, N Himayat, GY Li, S Talwar, Distributed interference-aware energy-efficient power optimization. IEEE Trans. Wirel. Commun. 10(4), 1323–1333 (2011).View ArticleGoogle Scholar
  18. Y Kwon, T Hwang, X Wang, Energy-efficient transmit power control for multi-tier MIMO HetNets. IEEE J. Sel. Areas Commun. 33(10), 2070–2086 (2015).View ArticleGoogle Scholar
  19. Z Tian, G Leus, V Lottici, Joint dynamic resource allocation and waveform adaptation for cognitive networks. IEEE J. Selected Areas Commun. 29(2), 443–454 (2011).View ArticleGoogle Scholar
  20. G Scutari, DP Palomar, S Barbarossa, Optimal linear precoding strategies for wideband non-cooperative systems based on game theory—Part I: Nash equilibria. IEEE Trans. Signal Process. 56(3), 1230–1249 (2008).MathSciNetView ArticleGoogle Scholar
  21. G Scutari, DP Palomar, S Barbarossa, Optimal linear precoding strategies for wideband non-cooperative systems based on game theory—Part II: algorithms. IEEE Trans. Signal Process. 56(3), 1250–1267 (2008).MathSciNetView ArticleGoogle Scholar
  22. G Scutari, DP Palomar, S Barbarossa, Competitive design of multiuser MIMO systems based on game theory: a unified view. IEEE J. Sel. Areas Commun. 26(7), 1089–1103 (2008).MathSciNetView ArticleGoogle Scholar
  23. J-S Pang, G Scutari, F Facchinei, C Wang, Distributed power allocation with rate constraints in Gaussian parallel interference channels. IEEE Trans. Inf. Theory. 54(8), 3471–3489 (2008).MathSciNetView ArticleMATHGoogle Scholar
  24. W Zhong, Y Fang, S Jin, KK Wong, S Zhong, Z Qian, Joint resource allocation for device-to-device communications underlaying uplink mimo cellular networks. IEEE J. Sel. Areas Commun. 33(1), 41–54 (2015).View ArticleGoogle Scholar
  25. W Zhong, B Fang, Z Qian, Game theoretic resource allocation for d2d mimo heterogeneous networks. Wireless Pers. Commun. 84:, 273–285 (2015).View ArticleGoogle Scholar
  26. L Xiao, M Johansson, SP Boyd, Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Commun. 52(7), 1136–1144 (2004).View ArticleGoogle Scholar
  27. D Qiao, S Choi, KG Shin, Goodput analysis and link adaptation for IEEE 802.11a wireless LANs. IEEE Trans. Mobile Comput. 1(4), 278–292 (2002).View ArticleGoogle Scholar
  28. T Kastrinogiannis, V Karyotis, S Papavassiliou, in Sarnoff Symposium, 2008 IEEE, Princeton, NJ, USA. An opportunistic combined power and rate allocation approach in cdma ad hoc networks (IEEENew Jersey, 2008), pp. 1–5.View ArticleGoogle Scholar
  29. A Giovanidis, S Stanczak, Stability and distributed power control in manets with per hop retransmissions. IEEE Trans. Commun. 59(6), 1632–1643 (2011).View ArticleGoogle Scholar
  30. YW Blankenship, PJ Sartori, BK Classon, V Desai, KL Baum, in IEEE 60th Vehicular Tech. Conf., 2004. VTC2004-Fall, Los Angeles, USA, 6. Link error prediction methods for multicarrier systems (IEEELos Angeles, 2004), pp. 4175–4179.View ArticleGoogle Scholar
  31. I Stupia, V Lottici, F Giannetti, L Vandendorpe, Link resource adaptation for multiantenna bit-interleaved coded multicarrier systems. IEEE Trans. Signal Process. 60(7), 3644–3656 (2012).MathSciNetView ArticleGoogle Scholar
  32. F Facchinei, C Kanzow, Generalized Nash equilibrium problems. 4OR. 5(3), 173–210 (2007).MathSciNetView ArticleMATHGoogle Scholar
  33. L Song, NB Mandayam, Hierarchical SIR and rate control on the forward link for CDMA data users under delay and error constraints. J. Sel. Areas Commun. 19(10), 1871–1882 (2001).View ArticleGoogle Scholar
  34. H Seo, BG Lee, Optimal transmission power for single- and multi-hop links in wireless packet networks with ARQ capability. IEEE Trans. Commun. 55(5), 996–1006 (2007).View ArticleGoogle Scholar
  35. MJ Osborne, A Rubinstein, A Course in Game Theory (The MIT Press, Cambridge, 1994).MATHGoogle Scholar
  36. S Boyd, L Vandenberghe, Convex Optimization (Cambridge Univ. Press, Cambridge, 2004).View ArticleMATHGoogle Scholar
  37. I Stupia, F Giannetti, V Lottici, R Andreotti, L Vandendorpe, AN D’Andrea, in Future Network and Mobile Summit (FUNEMS): 16-18 June 2010; Florence, Italy. A greedy algorithm for goodput-oriented amc in turbo-coded ofdm, (2010), pp. 1–8.Google Scholar
  38. RA Horn, Matrix Analysis. (CR Johnson, ed.) (Cambridge University Press, New York, 1986).Google Scholar
  39. G Calcev, D Chizhik, B Goransson, S Howard, H Huang, A Kogiantis, AF Molisch, AL Moustakas, D Reed, H Xu, A wideband spatial channel model for system-wide simulations. IEEE Trans. Veh. Technol. 56(2), 389–403 (2007).View ArticleGoogle Scholar
  40. (RW Cottle, J-S Pang, RE Stone, eds.), The Linear Complementarity Problem (SIAM, Academic Press, Philadelphia, 2009).MATHGoogle Scholar
  41. C Dutang, Existence theorems for generalized Nash equilibrium problems: an analysis of assumptions. HAL archives-ouvertes (2013).


© The Author(s) 2016