I Introduction
Relaying communication, which is an efficient way to improve the quality of service of wireless communication systems, has been investigated extensively. Practical field tests under the long term evolution (LTE) systems have shown that the relay nodes can eliminate the coverage holes of the macro base stations[1], as well as enhance the outdoor to indoor signal strengths [2]. However, most of the existing works about the relaying communication only considered the single user scenarios [3, 4], i.e., a source node communicate with a destination node via a relay. However, in the design of the fifth generation (5G) wireless communication systems, the volume of users is envisioned to improve 100 times compared to that of LTE systems [5, 6]. Hence, it is urgent to investigate the multi-user relay systems.
In the multi-user systems, the user scheduling schemes are crucial to the system performances. For this topic, in [7], the authors proposed the Max-link selection scheme and analyzed the average achievable rate with the consideration of the independent and identically distributed (i.i.d.) fading channels. To model the distance disparities between different users to the relay node, in [8, 9, 10], the authors have proposed two multi-user scheduling schemes and analyzed the system performances for the two-way full-duplex (FD) relay systems under the independent but not identically distributed (i.ni.d.) fading environment. However, the results revealed that the system performances were limited by the worse one of the - and - links of the selected users. In this case, the potentials of the good links could not be fully exploited. In addition, these works did not consider the buffer at the relay node[11], which led to the fixed transmission mode, i.e., the source transmission phase was always followed by the relay transmission phase.
Thereafter, the buffer was considered in the multi-user relay systems [12, 13]. However, the multiple access channels were considered rather than the multi-user scheduling schemes. In [14], the authors have proposed a multi-user scheduling scheme for the buffer aided multi-user relay system, in which the relay node could achieve the adaptive link selection. In [15], the authors have investigated the system performance of three different multi-user scheduling schemes, i.e., Max-Min, Max-Max and Max link selection schemes, for the multi-relay systems. However, even equipped with buffers, the disparities of the qualities of different links have not been solved. As a consequence, the system performance was always restricted by the weaker links.
From the existing works about the multi-user relay systems, we observe that how to solve the disparities between different links remains unsolved. In this paper, we are dedicated to design an optimal multi-user scheduling scheme from the system throughput view for the FD multi-user relay systems. To solve this problem, we first formulate the throughput maximization problem as a binary integer optimization problem, which is known as an NP-hard problem. By relaxing the binary variables, we obtain the Karush-Kuhn-Tucker (KKT) optimal conditions, based on which, we further obtain the optimal decision functions and optimal weighted factors of different links. To verify the proposed scheme, numerical simulations are conducted. The results indicate that the proposed scheme not only solve the disparities between the
- and - links, but also that between different -(-) links. In addition, the superiorities of the proposed scheme over the traditional schemes are revealed.Ii System Model
In this section, we elaborate on the physical-layer channel mode, specific CSI requirements and basic transmission scheme, respectively.
Ii-a Channel Model
As shown in the Fig.1, we consider a multi-user buffer aided FD relay system. The multiple users are pre-paired, i.e., exclusively sends messages to . We assume that the direct link between and does not exist due to the strong fading caused by the large separation, penetration loss of buildings and strong shadowing effects. The relay node has the capability to work in the FD mode and is equipped with a large buffer, which is divided into sub-buffers from to . The bit messages from the source are first stored in the buffer , and then forwarded to the destination in the subsequential time slots.
We denote the channel coefficients of the - link and - link in the t-th time slot as and , respectively. We assume that and are subject to the i.ni.d., stationary and ergodic stochastic distributions. In addition, we consider the block fading channels, i.e., the channel coefficients keep constant within one time slot but change independently between different time slots. We denote the transmit powers of the sources and the relay as and , respectively. Hence, the instantaneous signal-to-noise-ratios (SNRs) of the - and - links in the t-th time slot are given by and
, with probability density functions (pdfs)
and , respectively. Here, and denote the channel gains of the - and - links, respectively. anddenote the variances of the transmit SNRs of the source
and the relay , respectively. and denote variances the Gaussian noises at the relay node and the destination nodes, respectively. In addition, we denote the average SNRs as and . At this point, we can give the capacity expressions of the - and - links as(1) |
Ii-B CSI Requirements
To perform the optimal multi-user scheduling scheme, the knowledge of the global CSI is needed at the relay node. The global CSI can be obtained by the following steps. First, at the beginning of each time slot, all the source nodes transmit the pilot signals to the relay node , and estimates . Second, the relay node broadcasts the pilot signals to all the destinations, and each destination estimates . Finally, all the destination nodes feed back the quantized version of to the relay node. In addition, according to the system parameters, including , , and , the relay node can obtain the instantaneous channel capacities of all the links.
Ii-C Basic Transmission Scheme
In the traditional multi-user relay systems with or without buffers, there are two scheduling schemes. First, for the system without buffer, in each time slot the relay node has to select one pair of users simultaneously. For instance, is selected to send messages and is selected to receive messages in the same time slot. Second, for the system with buffer, in each time slot, the relay node always chooses the source node with maximum and the destination node with maximum . However, in this paper, we abandon these two schemes and propose an optimal user scheduling scheme. In the proposed scheme, the source node and the destination node are selected independently according to the selection criteria, which will be elaborated on in the Section III. Next, we briefly explain the basic transmission scheme.
If the source node is selected to send messages in the t-th time slot, it transmits with the instantaneous rate
(2) |
The messages will be first stored in the buffer . We use to denote the buffer state, which will change to
(3) |
If the destination node is selected to receive message in the t-th time slot, the relay node transmits with the instantaneous rate
(4) |
The messages stored in the buffer will be sent to the destination and the buffer state will change to
(5) |
Iii Optimal User Scheduling Scheme
In this section, we will first formulate the throughput maximization problem and then propose the optimal user scheduling scheme.
Iii-a Problem Formulation
In this paper, we are dedicated to design an optimal user scheduling scheme for the buffer aided relay system under the i.ni.d. fading environment. Before that, we use the binary variables and to denote the indicator of which and are selected in the t-th time slot. We have the following definition:
Definition 1.
For the source nodes
(6) |
For the destination nodes
(7) |
It is clear that
(8) |
which guarantees that only one source node and one destination node are selected simultaneously in each time slot. In addition, we assume that all the source nodes have enough backlogged messages to transmit. Thus the average transmission rate of the source is given by
(9) |
and the maximum average reception rate at the destination node is given by
(10) |
The system throughput can be explained as the sum of the average reception rates of all the destination nodes. It is given by
(11) |
Since we have considered a practical system, the buffer at the relay node has to satisfy the stationary conditions, which is given by
Lemma 1.
For a stationary buffer aided relay system, the average arrival rate and the departure rate have to satisfy
(12) |
Proof.
In order to be stationary, the length of the queue in the buffer cannot increase infinitely. However, according to the queueing theory, if , the length of the queue will approach to infinity. Hence, we have Lemma 1. ∎
In addition to the stationary condition, in order to maximize the system throughput, we have the following lemma
Lemma 2.
To maximize the throughput, the buffer at the relay node have to be at the edge of non-absorbing state, i.e.,
(13) |
Proof.
If the buffer is at the non-absorbing state, i.e., , the system throughput is limited by . Intuitively, we have two methods to improve the system throughput. One is that we can choose in more time slots to increase . The other is that we can choose other node except in more time slots to decrease . Once , cannot be increased further more according to the Lemma 1. ∎
With this lemma, we can observe that the minimal limitation in (4) can be neglected. Because according to the queuing theory, when the average arrival rate equals to the average departure rate, the average queue length can be large enough. This means the relay node always have enough messages stored in the buffer, which can also be explained as that over the infinite time horizon, there are only accountable time slots that the buffer has insufficient messages to transmit. Hence, we can simplify the system throughput as
(14) |
Now, we are ready to present the throughput maximization problem
(15) | ||||
s.t. | ||||
(16) |
where C1 ensures that every sub-buffer is at the edge of non-absorbing state. C2 and C3 guarantee that only one source and one destination node are selected during one time slot. C4 and C5 ensure that there are only two states of a source node and a destination node, i.e., selected or not selected.
We note that the original problem is a binary integer programming problem, which is NP-hard. To solve this problem, we relax the binary decision variables and to be continuous ones varying between 0 and 1, i.e., , . The problem after relaxation is denoted by ,
(17) | ||||
s.t. | ||||
(18) |
Iii-B Optimal Multi-User Scheduling Scheme
Here we present the optimal multi-user scheduling scheme.
Theorem 1.
The optimal multi-user scheduling scheme maximizing the system throughput is given by
For the source nodes:
(19) |
For the destination nodes:
(20) |
where the optimal decision functions are given by
(21) | ||||
(22) |
in which
(23) |
denotes the optimal metric function and denotes the weighted factors of the link , which satisfy
(24) |
Proof.
Please see Appendix A. ∎
Remark 1.
We note that after relaxation, the original problem converts to a
-dimensional linear programming problem over an infinite time horizon. For this problem, the optimal solution always locates at the boundary of the feasible set, i.e.,
= 0 or 1, which coincides with the original problem. Hence, the optimal solution of the problem is also the optimal solution of the original problem.Remark 2.
It is noted that this scheme is particularly suitable for the i.ni.d. fading environment. Unlike the traditional multi-user scheduling scheme, in which the system performance is limited by the worse one of the - and - links, the proposed scheme can balance the quality of the - and - links by introducing the weighted factor . For instance, we assume that the expectation of the channel gain of the first pair are and . We may set and , which is equivalent to that the - link is weakened with factor but the - link is weakened with factor . The source node will be selected in less time slots and the destination node will be selected in more time slots. By this way, the average arrival rate and the average departure rate of the buffer can be balanced.
Iv Maximum System Throughput
To obtain the maximum system throughput, we need to first obtain the , which is given by the following corollary
Corollary 1.
For the proposed optimal scheduling scheme in theorem 1, the optimal weighted factors are the solutions of the following equations
(25) |
where
(26) | ||||
(27) |
Proof.
Please see Appendix B. ∎
We can obtain the optimal weighted factor using the built-in functions of the software packages such as Matlab or Mathmetica. Then the system throughput is given by the following Theorem.
Theorem 2.
Based on the theorem 1 and the corollary 1, the system throughput can be easily obtained as
(28) |
Proof.
The system throughput can be easily obtained using the Total Probability Theorem, the details of the proof are omitted here. ∎
V Simulation Results
In this section, we present the simulation results to verify the proposed multi-user scheduling scheme. For simplicity and without loss of generality, we consider two pairs of users in the system. In the simulation, we adopt the Rayleigh fading environment with SNR expectations , , . In addition, we also present the sub-optimal method, in which we use to approximate to reduce the complexity in the simulation. As a results, the sub-optimal weighted factors will be obtained.
In the Fig. 2, we plot the optimal and sub-optimal weighted factors versus the channel variation. We set , and , and change the ratio of . The simulation results verify that the value of varies between -1 and 0. In addition, we note that with the increase of the ratio , increases from -1 to 0. Actually, this is consistent with our intuition, the larger represents that the will be selected in less time slots. Furthermore, the variation of will also affects the value of . When is very large, will approach to -1, which implies that when is selected in less time slots, then will be selected in more time slots. This insight reveals the advantages of our proposed multi-user scheduling scheme. By multiplying different weighted factors, we can adjust the selection probabilities of different nodes, and by this way, to balance the disparities of the channel qualities between different - links.
Fig. 3 plots the optimal and sub-optimal weighted factor with the variation of the ratio . We set , and . This figure shows the relationship between the variation of the weighted factor and . The results reveals that in the low regime, i.e., the - link is weaker than the - link, is close to -1, but is close to 0. This will lead to that will be selected in more time slots than . This insights reveals another advantage of the proposed scheme, i.e., the ability to balance the disparities of the channel qualities between - and -, . In addition, we note that when , i.e., and , and almost have the same value and the curves are almost completely vertical, which means any value of is optimal. In this case, - and - links have the same quality. The proposed scheme will convert to the traditional Max-Max user scheduling scheme.
Fig. 4 plots the system throughput versus the variation of the ratio . The figure shows that the proposed user scheduling scheme achieves considerable performance gain over the traditional Max-Max user scheduling scheme. The reason is that under the traditional Max-Max scheme, the system has no ability to balance the disparities of the qualities between different links. Hence, the throughput of each user pair is limited by the weaker one of the - and - links. However, the proposed scheme can schedule more time slots to the weaker links and less time slots to the stronger links. In this way, the system throughput can be improved. In addition, we note that when , i.e., and , the three different schemes have the same system throughput. This is consistent with the results in the Fig. 3. In this case, the proposed scheme converts to the traditional Max-Max scheme, which leads to the same performance.
Vi Conclusion
In this paper, we proposed an optimal multi-user scheduling scheme for the FD multi-user buffer aided relay system. The proposed scheme could solve the disparities of the qualities between different links and maximize the system throughput. To obtain this scheme, we formulated the throughput maximization problem as an binary integer optimization problem. By relaxing the binary variables and based on the KKT optimal conditions, we obtained the optimal decision functions and optimal weighted factors of different links. Simulations were conducted and the results verified the effectiveness and advantages of the proposed scheme over the traditional schemes.
Appendix A Proof of Theorem 1
We note that the problem is a 2N-dimensional linear programming problem over infinite time horizon. For this problem, the optimal solution satisfies the KKT optimal conditions. Hence, the lagrangian function can be expressed as
(29) | |||||
where , , , , , and are the Lagrange multipliers. Differentiate the function with regard to and , and set them to zero, i.e.,
(30) |
we get
(31) |
respectively.
If we let , we obtain that , , , according to the complementary slackness theorem. Substituting them into (A), we have
(32) |
Since , , we have , , where denotes the optimal decision function for the source nodes. Here, we can conclude that if , . Hitherto, we obtain the optimal scheduling scheme for the source nodes. In the similar way, if we set , we have
(33) |
where , , we have , which denotes the optimal decision function for the destination nodes. Hitherto, we have the necessary conditions of the optimal scheduling scheme for the destination nodes.
Next, we need to specify the range of the optimal weighted factors . First, in order to make the buffers at the edge of non-absorb state, the average arrival rate should equal to the average departure rate, we have
(34) |
Second, if and , the corresponding source node and will never be selected. Hence, we have . Finally, we consider a special case, i.e., i.i.d. fading environment, which means all the links have the same link quality, i.e., completely symmetric. In this case, , where is a constant. In order to maximize the system throughput, the source with the maximum , say and the destination with maximum , say will be selected. Thus, we have that and . Hence, we can conclude that .
Appendix B Proof of Corollary 1
References
- [1] J. Gan, Z. Guo, K. Sandlund, J. Liu, X. Shen, R. Fan, W. Liu, H. Wang, and G. Liu, “LTE in-band relay prototype and field measurement,” in Proc. IEEE Veh. Technol. Conf. (VTC Spring), May 2012, pp. 1–5.
- [2] Y. Qian, Z. Guo, R. Fan, H. Wang, J. Liu, Y. Yan, X. Shen, and Z. Hu, “Improving outdoor to indoor coverage by use of td-lte in-band relay,” in Proc. IEEE PIMRC, Sept. 2013, pp. 2658–2662.
- [3] C. Li, Z. Chen, Y. Wang, Y. Yao, and B. Xia, “Outage analysis of the full-duplex decode-and-forward two-way relay system,” IEEE Trans. Veh. Technol., vol. 66, no. 5, pp. 4073–4086, May 2017.
- [4] C. Li, Y. Wang, Z. Chen, Y. Yao, and B. Xia, “Performance analysis of the full-duplex enabled decode-and-forward two-way relay system,” in 2016 IEEE Int. Conf. Commun. Workshops (ICC), May 2016, pp. 559–564.
- [5] E. Hossain, M. Rasti, H. Tabassum, and A. Abdelnasser, “Evolution toward 5G multi-tier cellular wireless networks: an interference management perspective,” IEEE Trans. Wireless. Commun., vol. 21, no. 3, pp. 118–127, Jun. 2014.
- [6] K. Xiao, B. Xia, Z. Chen, J. Wang, D. Chen, and S. Ma, “On optimizing multicarrier-low-density codebook for gmac with finite alphabet inputs,” IEEE Commun. Lett., vol. 21, no. 8, pp. 1811–1814, Aug. 2017.
- [7] Y. U. Jang and Y. H. Lee, “Performance analysis of user selection for multiuser two-way amplify-and-forward relay,” IEEE Commun. Lett., vol. 14, no. 11, pp. 1086–1088, Nov. 2010.
- [8] C. Li, B. Xia, S. Shao, Z. Chen, and Y. Tang, “Multi-user scheduling of the full-duplex enabled two-way relay systems,” IEEE Trans. Wireless Commun., vol. 16, no. 2, pp. 1094–1106, Feb. 2017.
- [9] B. Xia, C. Li, and Q. Jiang, “Outage performance analysis of multi-user selection for two-way full-duplex relay systems,” IEEE Commun. Lett., vol. 21, no. 4, pp. 933–936, Apr. 2017.
- [10] C. Li, B. Xia, Q. Jiang, Y. Yao, and G. Yang, “Achievable rate of the multi-user two-way full-duplex relay system,” IEEE Trans. Veh. Technol., vol. PP, no. 99, pp. 1–1, 2018.
- [11] B. Xia, Y. Liu, C. Yang, Z. Chen, W. Xie, and Y. Zhao, “Opportunistic channel sharing in stochastic networks with dynamic traffic,” IEEE Trans. Veh. Technol., vol. 66, no. 10, pp. 9587–9591, Oct. 2017.
- [12] R. Liu, P. Popovski, and G. Wang, “On buffer-aided multiple-access relay channel,” IEEE Commun. Lett., vol. 20, no. 10, pp. 2051–2054, Oct. 2016.
- [13] Y. Li, M. C. Gursoy, and S. Velipasalar, “On the throughput of multi-source multi-destination relay networks with queueing constraints,” IEEE Trans. Wireless Commun., vol. 15, no. 8, pp. 5368–5383, Aug. 2016.
- [14] B. Zhang, C. Dong, J. Lei, M. El-Hajjar, L. L. Yang, and L. Hanzo, “Buffer-aided relaying for the multi-user uplink: outage analysis and power allocation,” IET Commun., vol. 10, no. 8, pp. 936–944, May 2016.
- [15] I. Krikidis, T. Charalambous, and J. S. Thompson, “Buffer-aided relay selection for cooperative diversity systems without delay constraints,” IEEE Trans. Wireless Commun., vol. 11, no. 5, pp. 1957–1967, May 2012.
Comments
There are no comments yet.