Abstract
In this paper, we consider the complex field network coded relay assisted communication (CFNC-RAC) channel. Although CFNC-RAC is spectrally efficient, its bit error rate performance is degraded by multi-access interference, which can be improved by appropriately allocating the user and relay powers. Since the fairness is an important factor for a practical multi-user communication system, we have proposed a rate-optimal fair power adaptation (ROFPA) technique in this work. The proposed ROFPA policy not only aims to maximize the average achievable sum-rate of CFNC-RAC under the use of the decode and forward relaying but also intends to satisfy the average rate-fairness restriction while taking the total power constraint and the network topology into account. We formulate the ROFPA as a non-convex optimization program and then derive an analytical solution for it. Extensive performance evaluation and numerical simulations validate that ROFPA method can provide significant sum-rate with considerable user fairness when compared to symbol-error-rate optimized (SER-OPT) policy proposed by Eritmen et al. (Wirel Netw, 2015. doi:10.1007/s11276-015-0924-1).
Similar content being viewed by others
Notes
Channel power gain of a communication link is defined as the multiplication of the square of the fading gain by the path-loss coefficient of that link.
References
Goldsmith, A. (2005). Wireless communications (1st ed.). Cambridge UK: Cambridge University Press.
Tse, D., & Viswanath, P. (2005). Fundamentals of wireless communication (1st ed.). Cambridge UK: Cambridge University Press.
Cover, T. M., & Gamal, A. E. (1979). Capacity theorems for the relay channel. IEEE Transactions on Information Theory, 25(5), 572–584.
Host-Madsen, A., & Zhang, J. (2005). Capacity bounds and power allocation for wireless relay channels. IEEE Transactions on Information Theory, 51(6), 2020–2040.
Ahlswede, R., Cai, N., Li, S. Y. R., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on Information Theory, 46(4), 1204–1216.
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.
Hasna, M. O., & Alouini, M. S. (2003). End-to-end performance of transmission systems with relays over Rayleigh fading channels. IEEE Transactions on Wireless Communications, 2(6), 1126–1131.
Anghel, P. A., & Kaveh, M. (2004). Exact symbol error probability of a cooperative network in a Rayleigh-fading environment. IEEE Transactions on Wireless Communications, 3(5), 1416–1421.
Ikki, S., & Ahmed, M. H. (2007). Performance analysis of cooperative diversity wireless networks over Nakagami-m fading channel. IEEE Communications Letters, 11(4), 334–336.
Beaulieu, N. C., & Hu, J. (2006). A closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels. IEEE Communications Letters, 10(12), 813–815.
Li, Y., Vucetic, B., Zhou, Z., & Dohler, M. (2007). Distributed adaptive power allocation for wireless relay networks. IEEE Transactions on Wireless Communications, 6(3), 948–958.
Chen, M., Serbetli, S., & Yener, A. (2008). Distributed power allocation for parallel relay networks. IEEE Transactions on Wireless Communications, 7(2), 552–561.
Deng, X., & Haimovich, A. M. (2005). Power allocation for cooperative relaying in wireless networks. IEEE Communications Letters, 9(11), 994–996.
Madsen, A. H., & Zhang, J. (2005). Capacity bounds and power allocation for wireless relay channels. IEEE Transactions on Information Theory, 51(6), 2020–2040.
Liang, Y., & Veeravalli, V. (2005). Gaussian orthogonal relay channel: optimal resource allocation and capacity. IEEE Transactions on Information Theory, 51(9), 3284–3289.
Zhao, Y., Adve, R. S., & Lim, T. J. (2007). Improving amplify-and-forward relay networks: optimal power allocation versus selection. IEEE Transactions on Wireless Communications, 6(8), 3114–3123.
Chen, Y., Kishore, S., Li, J. (2006). Wireless diversity through network coding. In Proceedings of wireless communication networking conference, vol. 3, pp. 1681–1686.
Katti, S., Rahul, H., Hu, W., Katabi, D., M´edard, M., & Crowcroft, J. (2006). XORs in the air: Practical wireless network coding. In Proceedings ACM SIGCOMM, Pisa, Italy, pp. 243–254.
Li, S. Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371–381.
Zhang, S., & Liew, S. C. (2009). Channel coding and decoding in a relay system operated with physical layer network coding. IEEE Journal on Selected Areas in Communications, 27(5), 788–796.
Zhang, S., Liew, S. C., & Lam, P. P. (2006). Hot topic: Physical layer network coding for the two-way relay channels. In Proceedings of 12th MobiCom, Los Angeles, CA, USA, pp. 358–365.
Wang, T., & Giannakis, G. B. (2008). Complex field network coding for multiuser cooperative communications. IEEE Journal on Selected Areas in Communications, 26(3), 561–571.
Eritmen, K., & Keskinoz, M. (2015). Symbol-error rate optimized complex field network coding for wireless communications. Wireless Networks. doi:10.1007/s11276-015-0924-1.
Guo, Z., Wang, B., Xie, P., Zeng, W., & Cui, J. (2009). Efficient error recovery with network coding in underwater sensor networks. Ad Hoc Networks, 7(4), 791–802.
Bhat, U., & Duman, T. M. (2012). Decoding strategies at the relay with physical-layer network coding. IEEE Transactions on Wireless Communications, 11(12), 4503–4513.
Liew, S. C., Zhang, S., & Lu, L. (2013). Physical-layer network coding: Tutorial, survey, and beyond. Physical Commun., 6, 4–42.
Lu, L., Wang, T., Liew, S. C., & Zhang, S. (2013). Implementation of physical-layer network coding. Physical Communications, 6, 74–87.
Mohammed, A. H., Dai, B., Huang, B., Azhar, M., Xu, G., Qin, P., & Yu, S. (2013). A survey and tutorial of wireless relay network protocols based on network coding. Journal of Network and Computer Applications, 36(2), 593–610.
Mazumdar, R., Mason, L., & Douligeris, C. (1991). Fairness in the network optimal flow control: Optimality of product forms. IEEE Transactions on Communications, 39(5), 775–782.
Bertsekas, D., & Gallager, R. (1992). Data networks (2nd ed.). Upper Saddle River, NJ: Prentice Hall Inc.
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of Operational Research Society, 49(3), 237–252.
Lee, J. & Jindal, N. (2006). Symmetric capacity of MIMO downlink channels. In Proceedings of ISIT 2006, Seattle USA, pp. 1031-1035, .
Zaidi, A. A., Khormuji, M. N., Yao, S., & Skoglund, M. (2009) Optimized analog network coding strategies for the white Gaussian multiple-access relay channel. IEEE ITW, Taormina, Italy, pp. 460–464.
Wang, S., Song, Q., Wang, X., & Jamalipour, A. (2011). Rate and power adaptation for analog network coding. IEEE Transactions on Vehicular Technology, 60(5), 2302–2313.
Dhaka, K., Mallik, R. K., & Schober, R. (2011) Performance analysis of a multi-hop communication system with decode-and-forward relaying. In Proceedings of IEEE International Conference on Communications, pp. 1–6.
Farhadi, G., & Beaulieu, N. (2009). On the ergodic capacity of multi-hop wireless relaying systems. IEEE Transaction on Wireless Communications, 8(5), 2286–2291.
Nosratinia, A., Hunter, T. E., & Hedayat, A. (2004). Cooperative communication in wireless networks. IEEE Communications Magazine, 42(10), 74–80.
Akyildiz, I. F., Estevez, D. M. G., & Reyes, E. C. (2010). The evolution to 4G cellular systems: LTE-Advanced. Physical Communication, 3(4), 217–244.
Boyd, S., & Vandenberghe, I. (2004). Convex optimization (1st ed.). Cambridge, UK: Cambridge University Press.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of monotonicity of the objective in partition 1
Within this partition, the following inequalities hold
Therefore, the objective function and the fairness constraint in Eq. (19) can be re-written as:
The users powers for this partition can be determined using the total power constraint and fairness constraint as:
The derivative of the objective function with respect to α becomes:
After some manipulations, the derivative in Eq. (34) can be put into the following form
Since γ 1 < g r and γ 2 < g r hold, A in Eq. (35) is clearly positive. To prove the positivity of B and C, we need to use the result of the following claim.
Claim
For γ 1 < g r and γ 2 < g r , (g r (γ 1 + γ 2) − 2γ 1 γ 2) is strictly greater than zero.
Proof
Assume γ 1 ≤ γ 2 is true. Then this implies 2γ 1 ≤ γ 1 + γ 2, and since γ 2 < g r , g r (γ 1 + γ 2) > 2γ 1 γ 2 holds. By proceeding similarly for the case of γ 2 ≤ γ 1, we end up with the same result.
Therefore, the coefficients B and C in Eq. (35) are also strictly positive, and w 0(P 1, P 2, α) is an increasing function of α.
Appendix 2: Proof of monotonicity of the objective in partition 2
For this interval, the objective function is w 0(P 1, P 2, α) = γ 1 P 1 + γ 2 P 2 + g r α(P 1 + P 2) since the value of α is less than α 0, at which sum-rate bounds at the relay and destination become the same under fairness constraint. The value of α 0 is determined as follows.
Assume g 1 − γ 1 ≤ g 2 − γ 2. Then the following inequalities are valid:
Therefore, the fairness constraint becomes
Hence, the following expression is valid at α = α 0.
By combining Eq. (37) with Eq. (38), α 0 should satisfy
The positive root of this equation can be found as:
For g 2 − γ 2 ≤ g 1 − γ 1, we end up with the same quadratic relation as in Eq. (39), and therefore, the same root in Eq. (40) is obtained.
After finding the value of α 0, we are now ready to show the monotonicity of the objective function over this interval.
For g 1 − γ 1 ≤ g 2 − γ 2, the user powers can be derived as:
By using Eq. (41), the derivative of the objective function can be determined as:
After some manipulations, Eq. (42) can be put into the following form:
It is clear that A, B > 0 because of γ 1 < g r and γ 2 < g r . The positivity of the coefficient C is not obvious at first glance. After some manipulations, C can be obtained as:
Each term in Eq. (44) is positive, so is the coefficient C. For g 2 − γ 2 ≤ g 1 − γ 1, the fairness constraint becomes w 5(P 1, P 2, α) = γ 1 P 1 + g r αP 1 − g 2 P 2 = 0, and we perform the same analysis as we did in the case of g 1 − γ 1 ≤ g 2 − γ 2. Then the user powers can be obtained as:
Hence, the derivative of the objective function can be derived as:
Hence, we have shown that the objective function is an increasing function of the variable α within Partition 2.
Appendix 3: Proof of monotonicity of the objective in partition 3
In this interval, the objective function becomes w 0(P 1, P 2, α) = g 1 P 1 + g 2 P 2. For g 1 − γ 1 ≤ g 2 − γ 2, the fairness constraint and user powers are the same as in Eqs. (37) and (41), respectively. Hence, the derivative of the objective function can be written as:
It is obvious that A, B < 0, and therefore, the polynomial Aα 2 + Bα + C does not have any real positive root when C ≤ 0. Hence, the positive root of Aα 2 + Bα + C may exist only when C > 0 (i.e. (g 1 − g 2)(g r − g 2 − γ 2) > 0), for which the root can be derived as:
Since A < 0, the sign of the derivative in Eq. (47) is positive for α ≤ α 1. Otherwise, it is negative. Hence, when there exists a real positive \(\alpha_{1} \in [\alpha_{0} ,\frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}]\), the objective function is an increasing function for α ∊ [α 0, α 1] and is decreasing monotonically over \([\alpha_{1} ,\frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}]\). Therefore, when such α 1 does not exist, the objective function decreases monotonically. The existence of a real positive α 1, which is greater than α 0, requires the following conditions (assuming g 1 − γ 1 ≤ g 2 − γ 2) to be met:
For g 2 − γ 2 ≤ g 1 − γ 1, the fairness constraint is w 5(P 1, P 2, α) = γ 1 P 1 + g r αP 1 − g 2 P 2 = 0, where user powers are stated in Eq. (41). The derivative of the objective function can be derived as:
The real positive root of Aα 2 + Bα + C exists only when (g 2 − g 1)(g r − g 1 − γ 1) > 0, for which the root can be expressed as:
Again, when there exists a real positive \(\alpha_{1} \in [\alpha_{0} ,\frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}]\), the objective function is an increasing function over the interval [α 0, α 1] and decreases monotonically over \([\alpha_{1} ,\frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}]\). Such α 1, which is greater than α 0 and less than \(\frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}\), does exist only when the following conditions are satisfied:
Appendix 4: Proof of monotonicity of the objective in partition 4
When \(\alpha \ge \frac{{\hbox{max} \left( {g_{1} - \gamma_{1} ,g_{2} - \gamma_{2} } \right)}}{{g_{r} }}\) is valid, the objective function and fairness constraint can be expressed as:
Using these constraints, the user powers can be written as:
The derivative of objective function w 0(P 1, P 2, α)can be given as:
Hence, the objective function in Eq. (53) decreases monotonically over Partition 4.
Appendix 5: Justification of the negligibility of the cross-term
In the previous section, we assumed that the cross-term \(P_{1} P_{2} \left( {\sqrt {\gamma_{2} } - \sqrt {\gamma_{1} } } \right)^{2}\) is negligible compared to P 1 + P 2 and came up with analytical results for Eq. (19). In this section, we shall justify this assumption over each of these partitions.It is clear that the cross-term gets close to zero for all segments for γ 2 ≈ γ 1 due to its third component (i.e., \((\sqrt {\gamma_{2} } - \sqrt {\gamma_{1} } )^{2}\)). We shall show below that the cross-term becomes approximately zero for γ 1 ≪ γ 2 or γ 1 ≫ γ 2 due to fact that the multiplication of user powers P 1 P 2 is almost zero for these values of γ 1 and γ 2.Over the Partition 1, the multiplication of user powers can be written as:
The first and second term in the RHS of Eq. (56) get close to zero for γ 1 ≫ γ 2 andγ 2 ≫ γ 1, respectively.Over the Partitions 2 and 3, the multiplication of user powers can be expressed as:
Note that the following inequality holds for these partitions:
Also, the conditions of γ 1 ≤ g 1 and γ 2 ≤ g 2 are always valid. Hence, the expressions in Eq. (57) are bounded above as follows:
A similar analysis performed for Partition 1 reveals that the first and second terms in the RHS of Eq. (59) get close to zero for γ 1 ≫ γ 2 and γ 2 ≫ γ 1, respectively.
For the Partition 4, adding or removing does not change the objective since it is independent from the cross-term. Hence, we can do our calculations as if there is no cross-term
In short, these analyses show that ignoring the cross-term can be accurately justified for most of the time. Also, our simulations show that the numerical difference between the optimal solution for Eq. (18) and that for Eq. (19) is negligibly small. Therefore, our analytical results can be considered as accurate and consistent with the true optimal solution of Eq. (18), which is numerically found.
Rights and permissions
About this article
Cite this article
Eritmen, K., Keskinoz, M. Rate-optimal fair power allocation in complex field network coded relay communications. Wireless Netw 22, 1251–1267 (2016). https://doi.org/10.1007/s11276-015-1031-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-015-1031-z