Distributed Transmission Probability Control in Fading Channel with State Information

Abstract

A wireless system consisting of a finite number of heterogeneous users transmitting packets over a slotted ALOHA Rayleigh-fading channel is investigated in this paper. In this system, each user tries to minimize its number of transmission attempts while meeting the throughput demand. The user interaction in such an ALOHA network is modeled as a random access game. A novel technique to better exploit the channel state information (CSI) named adaptive CSI transmission method is proposed. Benchmarking with the no-CSI method and threshold-based CSI method, it is revealed that the proposed adaptive CSI method can yield up to 9.9% more throughput and 12.3% power reduction. Two simple yet effective guidelines on selecting among these CSI-related methods are formulated for systems with different SNRs and capture ratios. A distributed algorithm is proposed to find the optimal transmission probability. Both analytical and simulation results show that the algorithm exhibits fast convergence speed and is robustness against changes on the number of active nodes in the network.

1. Introduction

The ALOHA protocol has been attracting a lot of attentions from both academia and industry since its introduction. It has been used for various generations of mobile phone services such as GPRS and SMS [1]. In recent years, various derivatives of ALOHA protocol have been developed and considered promising for a wide spectrum of applications including wireless sensor networks [2], next generation Internet of Things (IoT) [3, 4], cognitive radio [5, 6], and smart grid [7].

The earlier works on ALOHA, for example, in [8, 9], were focused on the system-level performance, for example, the system throughput. With the evolution of telecommunication systems into distributed systems in recent years [10], the focus has been shifted from the system perspective to the user perspective. As the network might be of heterogeneous nature, a system-level approach might be insufficient to differentiate each user's goal and action. Moreover, many users in the wireless networks are power-constrained and they may prefer power conservation over throughput maximization. As such, new techniques and performance metrics should be developed to better design the network [11, 12].

In [13], MacKenzie and Wicker conducted the analysis of a slotted ALOHA from the perspective of a selfish user. It is shown that a game-theoretic approach [14] was able to provide insights into the equilibrium operating point [15, 16] and the network performance such as throughput from a decentralized perspective. Later works explore more realistic settings by incorporating the CSI into the ALOHA model to enable each node to make channel-aware decisions [10, 12, 17–19]. More sophisticated channel models were also investigated towards a more accurate characterization of the fading channel. A simple collision model had been widely assumed to model the network interaction in a random access network [10, 18, 20, 21]. It was subsequently generalized to power capture model [22] and SINR capture model [17] to better characterize the time-varying fading channels and the multipacket reception capacity [23].

Intuitively, the use of CSI should lead to power-efficient outcomes as a node can choose not to send a packet under bad channel conditions to avoid wasting energy. In [10, 12, 24], CSI is exploited to enhance the throughput performance in a collision channel. However, it was shown in [17, 25] that, for a channel model with capture effect, a threshold-based CSI method may experience Braess Paradox [26]; that is, adding extra information to the network reduces the overall performance. Consequently, the achievable throughput may be even worse than that without CSI.

This paradox does not occur all the time. In ideal cases when the signal-to-noise ratio (SNR) approaches to infinity, it will always occur and it is suggested in [17] not to use CSI in such cases. When the SNR is a finite number, the occurrence of Braess Paradox is quite intricate. Thus it is difficult to decide whether to use CSI.

In this work, this Braess Paradox has been further investigated and it has been shown that the occurrence of the paradox is purely determined by the radio capture ratio and the SNR. It has been further discovered that there exists an enhanced method on exploiting the CSI, namely, adaptive CSI method, which may result in better system-level performance. Inspired by the threshold-CSI and no-CSI methods in [17], the adaptive CSI method adopts a probabilistic rather than deterministic strategy on how to respond to the instantaneous CSI. With the adaptive CSI method, this paper presents three original contributions.

• (1)

The throughput using the proposed adaptive CSI is derived. The adaptive CSI can achieve up to 9.9% more throughput than the threshold CSI and no-CSI methods for a wide variety of systems. Moreover, it can result in up to 12.3% power reduction than the other two methods.

(2)

Two simple yet effective guidelines are generalized on selecting the aforementioned three CSI-related methods to achieve maximum throughput or power efficiency for different system parameters and thus to avoid the occurrence of Braess Paradox.

(3)

A distributed algorithm is proposed to tune the transmission probability to the optimal point. It is shown that the algorithm can guarantee fast convergence and is robust against changes on the number of active nodes in the network.

The rest of the paper is organized as follows. Section 2 formulates the problem and states the assumptions on the system. The proposed adaptive CSI is presented in Section 3. Section 4 compares the adaptive CSI with the threshold-based CSI method and no-CSI method. Guideline on the selection scheme for different systems is also derived. Section 5 compares the power efficiency for the three methods. The convergence algorithm is presented in Section 6, together with an update interval analysis. Section 7 presents the simulation results, followed by a conclusion in Section 8.

2. Problem Formulation

In the following, a wireless network where there are n nodes transmitting packets at a predetermined power level to a base station over a shared channel is considered. It is assumed that the time is slotted and the amount of information contained in a data packet is fixed and is the same for all the nodes. A data packet, with the possible acknowledgement packet, occupies one time slot. Each node contends for the channel access using the slotted probabilistic ALOHA protocol. In each time slot k, each node i transmits with a transmission probability $p_{i,k}$ . Each node is assigned with an average throughput demand ${\rho }_i$ . In this network, each node tries to minimize its overall power investment, which is equivalent to minimizing the transmission probability, while meeting the average throughput demand ${\rho }_i$ . It is assumed that all the nodes have packets buffered for transmission at any time and the essential problem for each node is to choose a transmission strategy that fulfills its goal. Moreover, all the nodes are assumed to be well synchronized.

2.1. Throughput

For the brevity of the analysis, the average throughput for node i is defined as the ratio of the number of packets that are successfully received by the base station to the total number of time slots. For example, if a node i transmits 100 packets to the base station during a 10000-slot period, of which 67 are successful, then the average throughput for node i is 0.0067.

2.2. Fading Channel and SINR Capture

Signal-to-interference-and-noise ratio (SINR) capture [17] is considered in this paper to model the fading channel. In the SINR model, node i's packet at time k will be successfully received by the base station if ${\mathrm{S}\mathrm{I}\mathrm{N}\mathrm{R}}_{i,k}>b$ [17], where b is the radio capture ratio and ${\mathrm{S}\mathrm{I}\mathrm{N}\mathrm{R}}_{i,k}$ is the SINR of node i at time slot k. ${\mathrm{S}\mathrm{I}\mathrm{N}\mathrm{R}}_{i,k}$ is given by

$$\begin{array}{cc}& {\text{SINR}}_{i,k}=\frac{B_{i,k}{\left|h_{i,k}\right|}^{\mathrm{2}}{P}_T}{{\sum }_{j\ne i}{B}_{i,k}{\left|h_{i,k}\right|}^{\mathrm{2}}{P}_T+N},\end{array}$$

(1)

where N is the average power of the additive noise at the base station and $P_T$ is the transmission power of each node. $B_{i,k}=1$ if node i transmits a packet at time slot k and $B_{i,k}=0$ otherwise. $h_{i,k}$ is the channel gain between node i and the base station at time k. The physical intuition of the SINR model can be traced back to the capture effect of a radio receiver. Only when the signal from a particular node i is at least b times stronger than the interference, then it can be amplified and successfully decoded [27].

In the sequel, it is assumed that the channel is an i.i.d Rayleigh Fading channel and ${x_{i,k}=\left|h_{i,k}\right|}^2$ are thus assumed to be an i.i.d uniformly exponential random variable, fixed within one slot and varying from one slot to another as in [17, 28]. It is further assumed that at the beginning of the time slot k, each node i is able to obtain its own instantaneous channel state information, which provides an indication of the quality of the channel. Furthermore, each node can obtain $h_{i,k}$ and thus $x_{i,k}$ from the CSI reading, as in [17].

2.3. Adaptive CSI-Based Transmission Method

In this paper, a novel method named adaptive CSI-based method is proposed. Instead of using a fixed threshold-based CSI strategy as in [17], the proposed method considers the fact that $x_{i,k}$ is exponentially distributed. A complementary function $c_i\mathrm{\hspace{0.17em}\hspace{0.17em}}(1-e^{-x_{i,k}})$ is constructed to dynamically determine the transmission probability $p_{i,k}$ with respect to the instantaneous CSI, where $c_i\in \left(\mathrm{0,1}\right)$ is a tuning factor determining the amplitude of the transmission probability. The intuition of the adaptive CSI-based transmission is that the transmission probability is made to be proportional to “how good the channel is.” This method can be defined as follows.

Definition 1.

An adaptive CSI-based transmission strategy for node i in time slot k is defined as a mapping from $x_{i,k}$ to $p_{i,k}\in \left[\mathrm{0,1}\right]$ and has the form of $p_{i,k}=c_i(1-e^{-x_{i,k}})$ . Moreover, the node i transmits a packet in slot k with a probability $p_{i,k}$ .

It can be concluded that $p_{i,k}$ is a monotonically increasing function of the channel state $x_{i,k}$ . It also immediately follows that the average transmission probability of node i is solely determined by $c_i$ and is given by

$$\begin{array}{cc}& p_i\left(c_i\right)={{\displaystyle \int }}_{\mathrm{0}}^{\infty }{c}_i\left(\mathrm{1}-e^{-x_{i,k}}\right)e^{-x_{i,k}}d{x}_{i,k}=\frac{c_i}{\mathrm{2}}.\end{array}$$

(2)

2.4. Acknowledgment Information

It is assumed in this study that an acknowledgement (ACK) packet issued from the base station is available upon each successful transmission. By recording all its ACK results for a certain period, each node can determine the average packet success rate $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ for that period. The $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ for the current period can be used to determine the game strategy. The game strategy is updated every I time slot and each node keeps a record of the ACK packets in the form of $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ between 2 consecutive update instants. The $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ will be erased to 0 upon each update and reflects only the traffic and channel conditions in the current update interval.

3. Equilibrium Analysis

3.1. Power Optimization Problem

According to the problem formulation, the local optimization problem for each node i using the adaptive CSI method can be modeled as

$$\begin{array}{cc}& \underset{p_i}{\min }\hspace{1em}{p}_i\left(c_i\right)\\ \text{subject to}\hspace{1em}{r}_i\left(p_i,{\mathit{p}}_{\mathbf{-}\mathit{i}}\right)\ge {\rho }_i,\end{array}$$

(3)

where $\mathit{p}=(p_1,p_2,\dots ,p_n)$ is the transmission probability vector, $r_i(p_i,{\mathit{p}}_{-\mathit{i}})$ is the average throughput of node i when it transmits with probability $p_i$ given that others transmit with probability ${\mathit{p}}_{-\mathit{i}}$ , where ${\mathit{p}}_{-\mathit{i}}$ represents the transmission probability vector of all nodes except node i, and ${\rho }_i$ is the throughput demand for node i.

The system can be modeled as a constrained noncooperative game. Each node acts as a selfish entity, taking actions, that is, choosing the tuning factor $c_i$ and thus the transmission probability $p_i$ [11, 17, 18], to minimize its own power investment subject to the throughput constraint.

3.2. Nash Equilibria

It is assumed that each $p_i$ takes value from $\left[\mathrm{0,1}\right]$ . A utility function can be defined as $U_i\left(p_i,{\mathit{p}}_{-\mathit{i}}\right)=\mathrm{1}-p_i$ . Higher transmission probability results in higher power investment and thus lower utility. With the utility function, the following definition on Nash equilibrium can be established.

Definition 2.

An action profile p is a constrained Nash Equilibrium point if, for all $i=\mathrm{1,2},\dots ,n$ , there exists

$$\begin{array}{cc}& r_i\left(p_i,{\mathit{p}}_{\mathbf{-}\mathit{i}}\right)\ge {\rho }_i,\\ U_i\left(p_i,{\mathit{p}}_{\mathbf{-}\mathit{i}}\right)\ge U_i\left(\widetilde{p_i},{\mathit{p}}_{\mathbf{-}\mathit{i}},\right),\\ \text{all}\left(\widetilde{p_i}\right)\in \left\{\widetilde{p_i}:r_i\left(\widetilde{p_i},{\mathit{p}}_{\mathbf{-}\mathit{i}},\right)\ge {\rho }_i\right\},\end{array}$$

(4)

where $\widetilde{p_i}$ is the transmission probability of node i such that its throughput demand can be fulfilled.

Equivalently, p is a Nash equilibrium if

$$\begin{array}{cc}& p_i\in \underset{\mathrm{0}\le \widetilde{p_i}\le \mathrm{1}}{\arg \hspace{0.17em}\min }\left\{\widetilde{p_i}:r_i\left(\widetilde{p_i},{\mathit{p}}_{\mathbf{-}\mathit{i}},\right)\ge {\rho }_i\right\}.\end{array}$$

(5)

Since $r_i(p_i,{\mathit{p}}_{-\mathit{i}})$ and $U_i\left(p_i,{\mathit{p}}_{-\mathit{i}}\right)$ are nondecreasing functions of $p_i$ under the SINR model, it immediately follows as in [17] that p is a Nash equilibrium if and only if it is a solution to the set of equations:

$$\begin{array}{cc}& r_i\left(p_i,{\mathit{p}}_{\mathbf{-}\mathit{i}}\right)={\rho }_i,i=\mathrm{1,2},\dots ,n.\end{array}$$

(6)

3.3. Existence of Nash Equilibrium

When there are $s\mathrm{\hspace{0.17em}\hspace{0.17em}}\left(s\le n\right)$ nodes using the adaptive CSI strategy to transmit a packet to the base station at the same time slot, the probability that the packet received successfully from a particular node i is given as

$$\begin{array}{l}{{\displaystyle \int }}_{\mathrm{0}}^{\infty }\cdots {{\displaystyle \int }}_{\mathrm{0}}^{\infty }{c}_{\mathrm{1}}\left(\mathrm{1}-e^{-x_{\mathrm{1}}}\right){{\displaystyle \int }}_{b{\sum }_{j\ne i}{x}_j+b\left(N/P_T\right)}^{\infty }{c}_i\left(\mathrm{1}-e^{-x_i}\right)\\ ·e^{-x_i}d{x}_i{e}^{-x_{\mathrm{1}}}d{x}_{\mathrm{1}}\cdots e^{-x_s}d{x}_s.\end{array}$$

(7)

Solving (7) yields

$$\begin{array}{cc}& e^{-b\left(N/P_T\right)}\left({\displaystyle \prod }_{\begin{array}{c}j=\mathrm{1}\\ j\ne i\end{array}}^s\frac{c_j}{\left(\mathrm{1}+b\right)\left(\mathrm{2}+b\right)}-\frac{\mathrm{1}}{\mathrm{2}}\frac{c_j}{\left(\mathrm{1}+\mathrm{2}b\right)\left(\mathrm{2}b+\mathrm{2}\right)}\right).\end{array}$$

(8)

Using (2) and denoting $x_1=(1+b)(2+b)$ and $x_2=(1+2b)(2b+2)$ for brevity, the following theorem on the average throughput of node i using the proposed adaptive CSI method can be formulated.

Theorem 3.

Under the SINR capture model with capture ratio b and i.i.d., Rayleigh fading channels between all nodes and the base station, the average throughput of node i when the transmission probability vector is $\mathit{p}=(p_1,p_2,\dots ,p_n)$ and when each node uses the adaptive CSI transmission strategy is as follows:

$$\begin{array}{l}{r}_i\left(p_i,{\mathit{p}}_{\mathbf{-}\mathit{i}}\right)=p_i\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\displaystyle \prod }_{j\in Q_{-i}}\left(\mathrm{1}-p_j\right)\\ +p_i{e}^{-b\left(N/P_T\right)}\left(\mathrm{2}{\displaystyle \prod }_{j\in Q_{-i}}\left(\frac{\mathrm{2}{p}_j}{x_{\mathrm{1}}}+\mathrm{1}-p_j\right)\right)\\ -{\displaystyle \prod }_{j\in Q_{-i}}\left(\frac{\mathrm{2}{p}_j}{x_{\mathrm{2}}}+\mathrm{1}-p_j\right),\end{array}$$

(9)

where $Q_{-i}$ is the set of all the nodes in the network except node i. The Nash equilibrium is achieved when $r_i\left(p_i,{\mathit{p}}_{-\mathit{i}}\right)={\rho }_i$ for every node i in the network.

Proof.

The theorem can be proved by Binomial theorem and is similar to Lemma 1 in [17]. Thus the details are omitted here for brevity.

From (9), the following 2 corollaries can be given.

Corollary 4. The average packet success rate of node i is given as

$$\begin{array}{l}{p}_{{\text{PSR}}_i}=\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\displaystyle \prod }_{j\in Q_{-i}}\left(\mathrm{1}-p_j\right)\\ +e^{-b\left(N/P_T\right)}\left(\mathrm{2}{\displaystyle \prod }_{j\in Q_{-i}}\left(\frac{\mathrm{2}{p}_j}{x_{\mathrm{1}}}+\mathrm{1}-p_j\right)\right)\\ -{\displaystyle \prod }_{j\in Q_{-i}}\left(\frac{\mathrm{2}{p}_j}{x_{\mathrm{2}}}+\mathrm{1}-p_j\right).\end{array}$$

(10)

Corollary 5. When all the nodes have the same throughput demand ρ, the average throughput of each node can be simplified as

$$\begin{array}{l}r=p\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{1}}\\ +p{e}^{-b\left(N/P_T\right)}\left(\mathrm{2}{\left(\frac{\mathrm{2}p}{x_{\mathrm{1}}}+\mathrm{1}-p\right)}^{n-\mathrm{1}}\right)\\ -{\left(\frac{\mathrm{2}p}{x_{\mathrm{2}}}+\mathrm{1}-p\right)}^{n-\mathrm{1}}.\end{array}$$

(11)

To determine the existence of Nash equilibrium, the derivative of r is derived as

$$\begin{array}{ll}& \frac{d{r}_{a\text{-CSI}}}{dp}=\left(\mathrm{1}-np\right)\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}\\ +e^{-b\left(N/P_T\right)}\left(\mathrm{2}{\left(\frac{\mathrm{2}p}{x_{\mathrm{1}}}+\mathrm{1}-p\right)}^{n-\mathrm{2}}\right)\\ ·\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{1}}}\right)np\right)-{\left(\frac{\mathrm{2}p}{x_{\mathrm{2}}}+\mathrm{1}-p\right)}^{n-\mathrm{2}}\\ ·\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{2}}}\right)np\right).\end{array}$$

(12)

It can be seen that $d{r}_{a\text{-}\mathrm{C}\mathrm{S}\mathrm{I}}/dp>0$ when $\mathrm{0}<p<\mathrm{1}/n$ and there exists a $p^{\ast }>\mathrm{1}/n$ such that when $\mathrm{1}/n<p<p^{\ast }$ and $d{r}_{a\text{-}\mathrm{C}\mathrm{S}\mathrm{I}}/dp>0$ and when $p>p^{\ast }$ , $d{r}_{a\text{-}\mathrm{C}\mathrm{S}\mathrm{I}}/dp<0$ . Thus, when the throughput demand is achievable (i.e., $r^{\mathrm{m}\mathrm{a}\mathrm{x}}\ge \rho$ ), there exists one (i.e., when $r^{\mathrm{m}\mathrm{a}\mathrm{x}}=\rho$ ) or two (i.e., when $r^{\mathrm{m}\mathrm{a}\mathrm{x}}>\rho$ ) Nash equilibrium points.

When there are 2 equilibrium points, the one associated with smaller transmission probability is superior to the other in terms of minimizing power investment. This immediately follows from the fact that power investment is an increasing function of transmission probability.

Moreover, simulation results show that, for heterogeneous network, there exists at least one equilibrium point given that the throughout demand is feasible.

4. Maximum Throughput Analysis

In Section 3, the Nash equilibrium of (3) is analyzed. The relationship between throughput demand and transmission probability is derived for the adaptive CSI scheme. In this section, the maximum achievable throughput of the adaptive CSI scheme is compared with the 2 other schemes in [17], namely, threshold-based CSI method and no-CSI method.

For the no-CSI method, the throughput is given by [17] as follows:

$$\begin{array}{cc}& r_{\text{no-CSI}}=e^{-b\left(N/P_T\right)}p{\left(\mathrm{1}-\frac{bp}{\mathrm{1}+b}\right)}^{n-\mathrm{1}}.\end{array}$$

(13)

It can be seen that the maximal throughput is obtained when $p=(b+1)/bn$ and the throughput when $p=(b+1)/bn$ is as follows:

$$\begin{array}{cc}& r_{\text{no-CSI}}^{\max }=e^{-b\left(N/P_T\right)}\frac{b+\mathrm{1}}{bn}{\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}.\end{array}$$

(14)

For the threshold-based CSI method, the throughput is given by [17]:

$$\begin{array}{l}{r}_{t\text{-CSI}}=e^{-b\left(N/P_T\right)}{\left(\frac{p^{b+\mathrm{1}}}{\mathrm{1}+b}+\left(\mathrm{1}-p\right)\right)}^{n-\mathrm{1}}\\ \hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}+{\left(\mathrm{1}-p\right)}^{n-\mathrm{1}}\min \left\{p-e^{-b\left(N/P_T\right)},\mathrm{0}\right\}.\end{array}$$

(15)

When $p\le e^{-b(N/P_T)}$ ,

$$\begin{array}{l}\frac{d{r}_{t\text{-CSI}}}{dp}\\ =e^{-b\left(N/P_T\right)}{\left(\frac{p^{b+\mathrm{1}}}{\mathrm{1}+b}+\left(\mathrm{1}-p\right)\right)}^{n-\mathrm{2}}\left(n-\mathrm{1}\right)\left(p^b-\mathrm{1}\right)\\ +{\left(\mathrm{1}-p\right)}^{n-\mathrm{1}}\\ -\left(n-\mathrm{1}\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}\left(p-e^{-b\left(N/P_T\right)}\right).\end{array}$$

(16)

When $p>e^{-b(N/P_T)}$ ,

$$\begin{array}{l}\frac{d{r}_{t\text{-CSI}}}{dp}\\ =e^{-b\left(N/P_T\right)}{\left(\frac{p^{b+\mathrm{1}}}{\mathrm{1}+b}+\left(\mathrm{1}-p\right)\right)}^{n-\mathrm{2}}\left(n-\mathrm{1}\right)\left(p^b-\mathrm{1}\right).\end{array}$$

(17)

It can be seen that there exists a unique solution $p=p^{\ast }$ for $d{r}_{t\text{-CSI}}/dp=\mathrm{0}$ . When $p<p^{\ast }$ , $d{r}_{t\text{-CSI}}/dp>\mathrm{0}$ and when $p>p^{\ast }$ , $d{r}_{t\text{-CSI}}/dp<\mathrm{0}$ . When $p=p^{\ast }$ , the maximum throughput is achieved. However, $p^{\ast }$ is difficult to obtain analytically due to the complexity of (16) and (17). Notice that when b is large (e.g., $b=3$ ), $p^b\approx 0$ as the transmission probability p is typically very small. Thus (16) can be approximated as

$$\begin{array}{l}\frac{d{r}_{t\text{-CSI}}}{dp}\approx \left(e^{-b\left(N/P_T\right)}\left(\mathrm{1}-n\right)+\left(\mathrm{1}-p\right)\right)\\ -\left(n-\mathrm{1}\right)\left(p-e^{-b\left(N/P_T\right)}\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}\end{array}$$

(18)

and it can be seen that $p^{\ast }=1/n$ .

Moreover, (17) can be approximated as

$$\begin{array}{cc}& \frac{d{r}_{t\text{-CSI}}}{dp}=-e^{-b\left(N/P_T\right)}{\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}\left(n-\mathrm{1}\right),\end{array}$$

(19)

where $d{r}_{t\text{-CSI}}/dp<\mathrm{0}$ given that $\mathrm{0}<p<\mathrm{1}$ .

Combining (18) and (19), it can be shown that $p^{\ast }=\mathrm{m}\mathrm{i}\mathrm{n}\left\{\right.1/n,e^{-b(N/P_T)}\left.\right\}$ . In practical systems, it is almost certain that $1/n<e^{-b(N/P_T)}$ . Thus, it is sufficient to discuss the case $p^{\ast }=1/n$ only.

When $1/n<e^{-b(N/P_T)}$ , the maximum throughput of the threshold-based CSI is given by

$$\begin{array}{l}{r}_{t\text{-CSI}}^{\max }=e^{-b\left(N/P_T\right)}{\left(\frac{n^{-\left(b+\mathrm{1}\right)}}{\mathrm{1}+b}+\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)\right)}^{n-\mathrm{1}}\\ \hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}+{\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}\left(\frac{\mathrm{1}}{n}-e^{-b\left(N/P_T\right)}\right).\end{array}$$

(20)

For the proposed adaptive CSI method, similar to the threshold-based CSI method, when b is large (e.g., $b=3$ ), $1/x_1\approx 1/x_2\approx 0$ , (12) can be approximated as

$$\begin{array}{l}\frac{d{r}_{a\text{-CSI}}}{dp}\approx \left(\mathrm{1}-np\right)\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}\\ \hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}+e^{-b\left(N/P_T\right)}\left(\mathrm{1}-np\right){\left(\mathrm{1}-p\right)}^{n-\mathrm{2}}.\end{array}$$

(21)

The unique solution such that $d{r}_{a\text{-CSI}}/dp=0$ is $p^{\ast }=1/n$ and the maximum throughput is given by

$$\begin{array}{l}{r}_{a\text{-CSI}}^{\max }=\frac{\mathrm{1}}{n}\left(e^{-b\left(N/P_T\right)}-e^{-\mathrm{2}b\left(N/P_T\right)}\right){\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}+\frac{\mathrm{1}}{n}\\ ·e^{-b\left(N/P_T\right)}\left(\mathrm{2}{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{1}}}\right)\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}\right)\\ -{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{2}}}\right)\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}.\end{array}$$

(22)

Comparing (22) with (14) and (20), the following theorem on the maximum throughput can be established.

Theorem 6.

Given a capture ratio b and the network size n, when

$$\begin{array}{cc}& m_l\left(b,n\right)<SNR<m_h\left(b,n\right).\end{array}$$

(23)

the adaptive CSI method results in higher maximum throughput than the no-CSI method and the threshold-based CSI method, where

$$\begin{array}{cc}& SNR=\frac{P_T}{N},\\ m_l\left(b,n\right)=\frac{-b}{\ln \left(\left(-\left(a_{\mathrm{1}}-a_{\mathrm{2}}-a_{\mathrm{2}}/n-a_{\mathrm{3}}/n\right)-\sqrt{{\left(a_{\mathrm{1}}-a_{\mathrm{2}}-a_{\mathrm{2}}/n-a_{\mathrm{3}}/n\right)}^{\mathrm{2}}-\mathrm{4}{\left(a_{\mathrm{2}}/n\right)}^{\mathrm{2}}}\right)/\left(\mathrm{2}n/a_{\mathrm{2}}\right)\right)},\\ m_h\left(b,n\right)=\frac{-b}{\ln \left(\left(a_3-a_2/b\right)/a_2\right)},\\ a_{\mathrm{1}}={\left(\frac{n^{-\left(b+\mathrm{1}\right)}}{\mathrm{1}+b}+\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)\right)}^{n-\mathrm{1}},\\ a_{\mathrm{2}}={\left(\mathrm{1}-\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}},\\ a_{\mathrm{3}}=\mathrm{2}{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{1}}}\right)\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}-{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{2}}}\right)\frac{\mathrm{1}}{n}\right)}^{n-\mathrm{1}}.\end{array}$$

(24)

Proof.

The proof can be completed by enforcing $r_{a\text{-CSI}}^{\max }>r_{t\text{-CSI}}^{\max }$ and $r_{a\text{-CSI}}^{\max }>r_{\text{no-CSI}}^{\max }$ with proper algebraic manipulations. The details are omitted for brevity.

It also follows that when $\mathrm{S}\mathrm{N}\mathrm{R}\le m_l\left(b,n\right)$ , the threshold-based CSI method yields higher maximum throughput; when $\mathrm{S}\mathrm{N}\mathrm{R}\ge m_h\left(b,n\right)$ , it suffices to use the no-CSI method. The intuition is that when the channel is in general good enough, there is no need to confine the transmission to the “good” slots; when the channel is bad, the transmission should not be conducted at those bad slots at all; when the channel state is in between, there exists a wide gap where the CSI should be exploited in the proposed way.

Using (14), (20), and (22), the maximum throughput of each method under different capture ratios b and network sizes n can be obtained. Figure 1 compares the maximum throughput of the three methods. It is shown that there exists a red region in terms of SNR and capture ratio where the proposed adaptive CSI results in the highest throughput among the three methods. This improvement in throughput can be up to 9.9% as compared with the highest throughput that can be achieved by the no-CSI and threshold-based CSI methods.

Figure 1

Maximum throughput with different SNRs (dB) and capture ratios.

5. Power Efficiency Analysis

Given the same transmission probability p (i.e., the same power investment) and using (11)–(13), the adaptive CSI method outperforms the no-CSI method when $r_{a\text{-CSI}}>r_{\text{no-CSI}}$ . Solving the inequality for SNR yields

$$\begin{array}{cc}& \text{SNR}<t_h\left(b,n,p\right),\end{array}$$

(25)

where

$$\begin{array}{cc}& t_h\left(b,n,p\right)=\frac{-b}{\ln \left(\left(\mathrm{2}{\left(\left(\mathrm{2}p/x_{\mathrm{1}}\right)+\mathrm{1}-p\right)}^{n-\mathrm{1}}-{\left(\left(\mathrm{2}p/x_{\mathrm{2}}\right)+\mathrm{1}-p\right)}^{n-\mathrm{1}}+{\left(\mathrm{1}-p\right)}^{n-\mathrm{1}}-{\left(\mathrm{1}-\left(bp/\left(\mathrm{1}+b\right)\right)\right)}^{n-\mathrm{1}}\right)/{\left(\mathrm{1}-p\right)}^{n-\mathrm{1}}\right)}.\end{array}$$

(26)

Similar comparisons can be made between (11) and (15). Solving the inequality $r_{a\text{-CSI}}>r_{t\text{-CSI}}$ for SNR yields

$$\begin{array}{cc}& \text{SNR}>t_l\left(b,n,p\right),\end{array}$$

(27)

where

$$\begin{array}{cc}& t_l\left(b,n,p\right)=\frac{-b}{\ln \left(\left(-\left(a_1^{\prime }-a_2^{\prime }-a_2^{\prime }p-a_3^{\prime }p\right)-\sqrt{{\left(a_1^{\prime }-a_2^{\prime }-a_2^{\prime }p-a_3^{\prime }p\right)}^{\mathrm{2}}-\mathrm{4}{\left(a_2^{\prime }p\right)}^2}\right)/\left(\mathrm{2}/\left(a_2^{\prime }p\right)\right)\right)},\\ a_1^{\prime }={\left(\frac{p^{b+\mathrm{1}}}{\mathrm{1}+b}+\left(\mathrm{1}-p\right)\right)}^{n-\mathrm{1}},\\ a_2^{\prime }={\left(\mathrm{1}-p\right)}^{n-\mathrm{1}},\\ a_3^{\prime }=\mathrm{2}{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{1}}}\right)p\right)}^{n-\mathrm{1}}-{\left(\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{2}}{x_{\mathrm{2}}}\right)p\right)}^{n-\mathrm{1}}.\end{array}$$

(28)

Combining (25) and (27), the following theorem can be formulated.

Theorem 7.

Given a capture ratio b, the network size n, and a fixed power investment in terms of transmission probability p, the power investment of each node can be minimized using the adaptive CSI method when the SNR satisfies both (25) and (27). When $SNR\le t_l\left(b,n,p\right)$ , the threshold-based CSI method is more power-efficient than the others. When $SNR\ge t_h\left(b,n,p\right)$ , a node should use no-CSI method for power efficiency.

It should be noted that the intersection of (25) and (27) may be an empty SNR set for a given $\left(b,n,p\right)$ . It means that, under such circumstances, either no-CSI or threshold-based CSI is superior to the others.

As an illustrative example, Figure 2 shows the throughputs of the three methods for a given power investment (i.e., transmission probability) $p=0.05$ and $n=10$ . Figure 2 shows that, using the adaptive CSI, the power investment can be minimized for a wide variety of systems with different SNRs and capture ratios. For this particular example, the power reduction can go up to 9.3%. Figure 3 traverses through all the possible power investment schemes, it can be found that the power reduction can go up to 12.3%.

Figure 2

Throughput comparison for a given transmission probability $\mathit{p}=\mathit{0}.\mathit{05}$ .

Figure 3

Power reduction for different power investment schemes.

6. Convergence Analysis

6.1. ACK-Based Game Strategy

In Section 3, the Nash equilibrium is derived for the adaptive CSI method. In this section, an ACK-based algorithm is proposed for each node to find the power-efficient Nash equilibrium in a distributed manner.

Each node i in the network updates the transmission probability $p_i$ synchronously every I time slot and each node transmits with this probability for the current update interval. For node i, the new transmission probability for the $t+1$ th update is determined by

$$\begin{array}{cc}& p_i^{\left(t+\mathrm{1}\right)}=\frac{{\rho }_i}{{{p_{\text{PSR}}}_i}^{\left(t\right)}},\end{array}$$

(29)

where ${{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t)}$ is the packet success rate for node i from the tth update to the $t+1$ th update (the tth update interval). ${{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t)}$ can be obtained from ACK information.

In particular, the initial transmission probability $p_i^{(1)}$ can be any value smaller than the Nash equilibrium point. In practice, each node can start with $p_i^{(1)}={\rho }_i$ for simplicity and fast convergence.

The following theorem shows each node will converge to the Nash equilibrium using the strategy in (29). It is assumed that the throughput demand profile $\mathit{\rho }$ is feasible.

Theorem 8.

Using the ACK-based strategy in (29), the transmission probability of each node in the network asymptotically converges to the power-efficient Nash equilibrium point of the game (3).

Proof.

 

Case 1. First consider the case where the number of nodes in the network is fixed. For this scenario, the following should be satisfied.

• (i)

The sequence of the transmission probability of any node $i\mathrm{\hspace{0.17em}\hspace{0.17em}}(p_i^{(1)},p_i^{(2)},\dots ,p_i^{\left(t\right)},p_i^{(t+1)})$ is increasing.

(ii)

Any two arbitrary entries $p_i$ and $p_k$ in the transmission probability vector p asymptotically follow $p_i/p_k=({\rho }_i/p_{{\mathrm{P}\mathrm{S}\mathrm{R}}_i})/({\rho }_k/p_{{\mathrm{P}\mathrm{S}\mathrm{R}}_k})$ regardless of their initial values.

(iii)

The actual throughput of node i at any update interval t will not exceed its corresponding throughput demand.

Factor (i) must be satisfied because only when the sequence of the transmission probability increases, then it is possible that it converges to the equilibrium point. Factor (ii) must be met because, at the equilibrium point, according to (9) and Corollary 4, $p_i/p_k=p_i{p}_{{\mathrm{P}\mathrm{S}\mathrm{R}}_i}/p_k{p}_{{\mathrm{P}\mathrm{S}\mathrm{R}}_k}$ and thus factor (ii) must follow. Factor (iii) guarantees that the transmission probability will not go to the region where the actual throughput is larger than what is required and thus it can avoid converging to the unfavorable energy-inefficient equilibrium point.

While Factor (ii) immediately follows from the game strategy and Corollary 4, and it can be met starting from the second update, factor (i) can be proved by induction. It has been assumed that $p_i^{(1)}$ is not greater than ${\rho }_i$ . Thus, $p_i^{(2)}=\rho /{{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(1)}>p_i^{(1)}$ . Assuming that $p_i^{(2)}<p_i^{(3)}<\dots p_i^{(t-1)}<p_i^{(t)}$ , one needs to prove that $p_i^{(t)}<p_i^{(t+1)}$ holds.

Recall that ${p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i$ is a decreasing function of $p_j$ , $\forall p_j\in {\mathit{p}}_{-\mathit{i}}$ . As $p_j^{(t-1)}<p_j^{(t)}$ , ${{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t)}>{{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t+1)}$ , it thus follows that $p_i^{(t)}<p_i^{(t+1)}$ .

As for the proof of (iii), since ${{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t+1)}<{{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t)}$ , it follows that $r_i^{(t+\mathrm{1})}=p_i^{(t+\mathrm{1})}{{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t+1)}<p_i^{(t+\mathrm{1})}{{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}_i}^{(t)}\text{.}$   Thus $r_i^{(t+\mathrm{1})}<{\rho }_i$ according to (29).

Combining (i) and (iii), the transmission probability $p_i$ of node i will increase monotonically and is always smaller (yet getting closer) to the equilibrium point. Meanwhile, factor (ii) ensures that for each update $p_i$ and the transmission probability of any other node k will “move” up in an appropriate step and thus they asymptotically converge to the equilibrium point at the same time.

Case 2. Next consider the case when there are newly joined nodes during the network operation. In this case, a new equilibrium point must be sought and the new equilibrium probability is expected to be greater than the previous one as more packet transmissions are expected. This situation can be viewed as a special case of case 1. The convergence can be achieved as long as the new throughput demand is feasible.

Case 3. Finally the case where there are nodes dissociating from the network or stopping transmitting data during the network operation is examined. Contrary to case 2, the new equilibrium probability of each node should be smaller than the previous one as there is less traffic in the network. For this case, which is similar to case 1, the following guidelines must be met.

• (i)

The sequence of the transmission probability of any node i deceases over time after the nodes leave the network.

(ii)

Any two arbitrary entries $p_i$ and $p_k$ in the transmission probability vector p asymptotically follow $p_i/p_k=({\rho }_i/p_{{\mathrm{P}\mathrm{S}\mathrm{R}}_i})/({\rho }_k/p_{{\mathrm{P}\mathrm{S}\mathrm{R}}_k})$ regardless of their values at the time the nodes leave the network.

The rationales and proofs are similar to case 1 and omitted for brevity. In this case, $p_i$ will decrease. Thus it will not converge to the energy-inefficient equilibrium point, which is always greater than the value of $p_i$ at the time the nodes leave the network.

This completes the proof of Theorem 8.

Remark 9.

This proposed ACK-based updating strategy can also apply to threshold-based CSI and no-CSI methods. The proofs are very similar and are omitted.

Remark 10.

Through simulations, it is observed that the condition that the initial transmission probability $p_i^{(1)}$ should be any value smaller than the Nash equilibrium point can be relaxed. Even for initial transmission probabilities greater than the equilibrium point, each node can still adjust the probability to the optimum using the proposed algorithm. The simulations also show that the transmission probability vector can always converge to the equilibrium point with negligible errors within 3 updates.

6.2. Update Interval Analysis

For the proposed algorithm, the update interval I is a key parameter that can affect its performance. There exists a tradeoff: frequent updates allow each node to respond promptly to the traffic condition. However, a short update interval may result in a high randomness in calculating the $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ and thus the transmission probability of each node may deviate from the optimal point.

A statistical characterization of the packet transmission is given here in order to provide a guideline on choosing the update interval that allows timely update while reducing the randomness to a desired level.

Each packet transmission is considered i.i.d with success probability $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ , where $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ can be obtained from (10). In other words, each packet transmission can be seen as a Bernoulli trial. If we take m consecutive transmissions, the number of successes out of m transmissions follows binomial distribution $B\mathrm{\hspace{0.17em}\hspace{0.17em}}(m,p_{\mathrm{P}\mathrm{S}\mathrm{R}})$ . Furthermore, when $m{p}_{\mathrm{P}\mathrm{S}\mathrm{R}}>5$ and $m(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})>5$ , the binomial distribution can be approximated using the corresponding normal distribution $N(m{p}_{\mathrm{P}\mathrm{S}\mathrm{R}},mp(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}}))$ [29].

Accordingly, the $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ for m consecutive transmissions is also a random variable following normal distribution $N(p_{\mathrm{P}\mathrm{S}\mathrm{R}},p_{\mathrm{P}\mathrm{S}\mathrm{R}}(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})/m)$ . Denote each set of m consecutive transmissions as a minimal unit. For w consecutive minimal units, the sample mean of PSR is also approximately normally distributed with mean $\stackrel{-}{x}=p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ and standard deviation $\sigma =\sqrt{p_{\mathrm{P}\mathrm{S}\mathrm{R}}(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})/mw}$ .

The standard deviation of the sample mean, σ, can be used to characterize the significance of the randomness and show how “steady” is the $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ obtained. It can be shown that a larger w, which translates to a larger update interval, will bring about smaller standard deviation of the $p_{\mathrm{P}\mathrm{S}\mathrm{R}}$ and vice versa.

Given a standard deviation requirement, say T, the minimal sample size $w_{\mathrm{o}\mathrm{p}\mathrm{t}}$ can be readily computed as $w_{\mathrm{o}\mathrm{p}\mathrm{t}}=p_{\mathrm{P}\mathrm{S}\mathrm{R}}(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})/m{T}^2$ . Subsequently, as the update interval $I=mw/p_i$ , the optimal update interval can be computed as $I_{\mathrm{o}\mathrm{p}\mathrm{t}}=⌈p_{\mathrm{P}\mathrm{S}\mathrm{R}}(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})/T^2{p}_i⌉=⌈{p_{\mathrm{P}\mathrm{S}\mathrm{R}}}^2(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})/T^2{\rho }_i⌉$ .

It can be concluded that if the imposed standard deviation requirement is the same for every node, the node with the lowest throughput, say node i, will require the largest update interval. Assuming that all nodes update their transmission probabilities synchronously, the update interval will depend on node i, that is,

$$\begin{array}{cc}& I_{\text{net}}=⌈\frac{{p_{\text{PSR}}}^{\mathrm{2}}\left(\mathrm{1}-p_{\text{PSR}}\right)}{T^{\mathrm{2}}{\rho }_i}⌉.\end{array}$$

(30)

Determining the update interval online in an adaptive manner will theoretically lead to optimal results. By doing this, however, node i will have to broadcast the new update interval to the rest, which introduces additional traffic overheads and more power investment. Alternatively, the update interval can be fixed offline assuming the worst-case scenario that ${p_{\mathrm{P}\mathrm{S}\mathrm{R}}}^2(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})$ is maximum. It can be shown that when $p_{\mathrm{P}\mathrm{S}\mathrm{R}}=2/3$ , ${p_{\mathrm{P}\mathrm{S}\mathrm{R}}}^2(1-p_{\mathrm{P}\mathrm{S}\mathrm{R}})$ is at its peak $4/27$ . As such, (30) can then be approximated as

$$\begin{array}{cc}& I_{\text{net}}\approx ⌈\frac{\mathrm{4}}{\mathrm{27}{T}^{\mathrm{2}}{\rho }_i}⌉.\end{array}$$

(31)

7. Simulation Results

In this section, various Monte Carlo simulation results are presented to validate the proposed distributed convergence algorithm. A scenario where there are n nodes transmitting fixed-length packets to a base station in a probabilistic manner is considered. Each transmission, with the possible acknowledgement, takes up one time slot. The update interval is determined using (31) with a standard deviation requirement of 0.04.

The applicability of the convergence algorithm for different CSI-based methods is first evaluated. In this case the capture ratio is $b=3$ and the SNR is 10. The network size is $n=10$ . The convergence algorithm is used for all the three methods. Different throughput demands ranging from 0.005 per node to 0.04 per node have been evaluated. Each set of simulation is run for 10 times and the transmission probability of each node at equilibrium is recorded.

Figure 4 shows the actual throughput and transmission probability of both the simulation and the theoretical analysis. The simulation results match quite well with the theoretical ones for all the three methods, indicating that the proposed ACK-based convergence algorithm can achieve accurate results.

Figure 4

Comparisons between the simulation results and the theoretical analysis (Sim: simulations and Anal: analytical derivations).

Figure 5 examines the accuracy of the convergence algorithm for different heterogeneous networks in detail. Such a network consists of 5 classes of nodes, with a throughput demand of 0.002, 0.004, 0.006, 0.008, and 0.01, respectively. The capture ratio is $b=5$ and the SNR is 50. Simulations have been conducted for the networks with different number of nodes per class, ranging from 1 to 4. Each set of simulation is repeated 10 times. It can be shown that nodes are able to meet the throughout demand regardless of the number of nodes in the network, with only an average error of 1.1% and a standard deviation of no more than 0.1% of its throughput demand. The transmission probability increases as the number of nodes increases. This is because more frequent transmissions are needed to compensate for the higher packet loss rate due to the increment of the number of nodes in the network.

Figure 5

Throughput and transmission probability for heterogeneous networks (□: transmission probability; Δ: actual throughput; ∗: throughput demand).

As an illustrative example, Figure 6 presents the convergence speed for a heterogeneous network with 5 nodes and a capture ratio of 5 and a SNR of 50. The throughput demand is set to be 0.01, 0.02, 0.03, 0.04, and 0.05 for each node, respectively. It is observed that each node can reach the equilibrium point from the 3rd update instant and is stable subsequently with negligible deviations after 2 updates.

Figure 6

Performance of the convergence algorithm.

Lastly, the robustness of the algorithm against changes on the number of nodes in the network is examined. The capture ratio and the SNR are the same in the previous simulations. In the following study 10 nodes are evaluated, each with a throughput demand of $0.001i$ , where i is the node ID labeled from 1 to 10. At Phase I (from 1st to 7th update intervals), only the first 5 nodes transmit packets. At Phase II (from the 7th to the 10th update intervals), two more nodes, namely, Node 6 and Node 7, are active in the network. At Phase III (from the 10th to the 13th update intervals), all nodes actively perform transmissions. At Phase IV, Nodes 6–10 leave the network while Nodes 1–5 remain active in the network.

Figure 7 plots the transmission probability versus the update interval. It can be observed that both groups of node adapt well with the changes and the new equilibrium points can be reestablished in a distributed manner. Table 1 shows the actual throughput at the equilibrium. It is assumed that the equilibrium can be established one update interval later after each change on the number of nodes. The results show that each node matches well with its corresponding throughput demand, with an average relative error of 1.26%. Compared with the case that there is no change on the number of nodes (e.g., Figure 5, with average error of 1.1%), the error is still insignificant, indicating that the proposed algorithm works well with such changes.

Table 1

Actual throughput with changes on the number of nodes.

Node	Actual throughput	Relative error (%)
1	0.000977	$$-\mathit{2.2}8$$
2	0.002002	$$\mathit{0.113}$$
3	0.003128	$$\mathit{4.25}$$
4	0.004033	$$\mathit{0.82}6$$
5	0.004906	$$-\mathit{1.8}8$$
6	0.006056	$$\mathit{0.93}3$$
7	0.006973	$$-\mathit{0.38}9$$
8	0.008054	$$\mathit{0.68}0$$
9	0.009002	$$\mathit{0.017}8$$
10	0.010336	$$\mathit{3.36}$$

Figure 7

Transmission probability with changes on the number of nodes.

8. Conclusion

A new method to exploit the channel state information (CSI), namely, adaptive CSI, has been presented. The throughput performance of the proposed adaptive CSI method has been analyzed and compared with the threshold-based CSI and the no-CSI method. It is shown that the proposed method is able to achieve up to 9.9% throughput improvement and 12.3% power reduction for a wide variety of systems as compared to the other two approaches. Two guidelines have been derived on selecting these three methods under different system scenarios. The proposed method can be readily implemented in a distributed manner with the use of the acknowledgement packets issued by the base station. Both the analytical and simulation results show that this distributed implementation is able to guarantee fast convergence and is robustness against changes on the number of nodes in the network.