DOI QR코드

DOI QR Code

Optimal Power Allocation for Wireless Uplink Transmissions Using Successive Interference Cancellation

  • Wu, Liaoyuan (School of Computer and Information, Hefei University of Technology) ;
  • Wang, Yamei (School of Computer and Information, Hefei University of Technology) ;
  • Han, Jianghong (School of Computer and Information, Hefei University of Technology) ;
  • Chen, Wenqiang (School of Computer and Information, Hefei University of Technology) ;
  • Wang, Lusheng (School of Computer and Information, Hefei University of Technology)
  • Received : 2015.11.04
  • Accepted : 2016.03.26
  • Published : 2016.05.31

Abstract

Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.

Keywords

1. Introduction

To satisfy various forthcoming high-throughput and real-time applications of the mobile Internet, new multiple access techniques for wireless networking have become an important reseach direction. However, traditional multiple access schemes require users to access a single channel at different time slots. Otherwise, multiple access interference (MAI) is introduced and severely degrades the performance of the whole network [1]-[3]. Interference management techniques could be used to overcome this problem [4]. Typical ideas include interference avoidance (IA) and interference cancellation (IC) [5]. IA is achieved by certain deterministic scheduling or random access protocols. An example for deterministic scheduling is time division multiple access (TDMA); while an example for random access is carrier sensing multiple access with collision avoidance (CSMA/CA).

All of the IA schemes try to avoid overlapped usage of the same time slots by multiple users, and their upperbound performance is not nearly enough to support near-future applications of the mobile Internet [6]. With the enhancement of the signal processing capability of the physical layer, IC schemes have become quite attractive in recent years. These schemes can be categorized into parallel interference cancellation (PIC) and successive interference cancellation (SIC). SIC overcomes PIC's extremely high demands on hardware and has become a practical and efficient IC technique [7]. The idea is to simultaneously demodulate multiple signals from multiple users based on a certain iteration process [8], which can be divided into three steps. First, the received signals from multiple users are ranked from the strongest to the weakest. Second, the strongest signal can be demodulated and subtracted from the mixed received signal as long as its signal-to-interference-plus-noise ratio (SINR) is larger than a certain threshold. Third, the second strongest signal can be demodulated, and the iteration continues until all of the signals are demodulated successfully or until any signal's demodulation fails due to low SINR.

J. G. Andrews [2] provided a survey of various IC schemes and compared their methods for implementation, indicating the practicability of the SIC technique. Research on SIC has mainly focused on the computational complexity and the enhancement of successful signal detection [9]-[12]. However, existing studies have rarely focused on the power allocation (PA) to increase SIC schemes' performance on fading channels. [12] claimed that the performances of SIC on the additive white Gaussian noise (AWGN) channel and the Rayleigh fading channel could be substantially different. [9] introduced a PA scheme, but instead of PA on continuous power values, it only considered two discrete power values indicating high and low transmission power settings.

In this article, we focus on the optimization of the PA ratio of multiple users on an SIC channel and the corresponding resource allocation (RA) scheme. The contribution of this study is twofold. On the one hand, we theoretically determine the optimal PA ratio for the Rayleigh fading channel with regard to the sustainable demodulation error rate and the required SINR for successful demodulation. On the other hand, we propose a fast RA scheme using the optimal PA ratio, and compare it with random PA and the near-optimum obtained by a simulated annealing search to demonstrate its high performance.

The remainder of this article is organized as follows. In Section 2, we summarize the related works. In Section 3, we describe the system model for SIC under the Rayleigh fading channel. In Section 4, we theoretically determine the optimal PA ratio for SIC. In Section 5, various RA schemes with different PA settings are described. In Section 6, we demonstrate the performance of the scheme with optimal PA ratio in various network paradigms and various RA schemes with different PA settings. Finally, in Section 7, we draw the conclusions.

 

2. Related Work

The idea of SIC was first raised by T. Cover [13], and recent studies discussed its applications in various types of networks. M. Wildemeersch et al. [14] proposed an SIC-based multi-layer analytical model for heterogeneous cellular networks, which focused on the wireless channel features of randomly distributed users and access points (APs). S. Sasipriya and C. S. Ravichandran [15] suggested the integration of PIC and SIC to mitigate multi-user interference in CDMA networks. In addition, several studies that worked on SIC-based schemes in multi-hop wireless networks are available [5][16][17]. C. Jiang et al. [5] established a mixed cross-layer integer programming model and introduced a joint scheme using SIC and interference exploitation together for the improvement of the network performance. Based on that study, Y. Shi et al. [16] introduced a rapid iteration-based solution, while Q. Long et al. [17] further considered the impact of transmission rate controlling on network performance. Most of the studies on the SIC technique have focused on the uplink, but D. Hu and S. Mao [10] integrated super coding to extend SIC to downlink multicast transmissions.

There are also many studies on the performance evaluation and implementation of the SIC technique. R. Yim et al. [9] focused on the design of an SIC-based receiver using local channel information and received signal strength indication (RSSI), but the impact of unideal channel or power control on the performance of the SIC-based receiver was not discussed. R. Fa and R. C. de Lamare [11] proposed a multi-branch SIC and analysed the impact of channel modelling on the network performance. L. Yang [12] proposed multi-user diversity-aided multi-stage minimum mean-square error (MMSE) multi-user detection and analysed its performance on both AWGN and Rayleigh fading channels. A. Zanella and M. Zorzi [18] analysed the usage of SIC in heterogeneous networks. Poisson point process (PPP) was used to model the user distribution, and the impact of pathloss and Rayleigh fading on the network performance was analysed. X. Zhang and M. Haenggi [19] derived the SIC-based successful demodulation probability and the normalized throughput and analysed its performance in a scenario with pathloss and Rayleigh fading. However, the above two studies did not consider proactive PA, so they did not achieve near-optimal SIC performance like the scheme proposed in this article. R. Yim et al. [9] introduced a proactive PA method for SIC but only considered two discrete power values.

In summation, it is important to determine the optimal PA ratio of different users in an SIC channel under Rayleigh fading. An optimal PA ratio could benefit the design of an optimal SIC scheme by allocating as many users as possible in each channel, hence improving the spectral efficiency. However, none of the above existing studies provided any optimal or near-optimal solution to this issue. Therefore, our work proposes a near-optimal solution by combining theoretical and simulative results. Moreover, our scheme establishes proactive PA values based on the obtained near-optimal PA ratio, so it does not require feedback and reaction for PA adjustment.

 

3. System Model

Let us consider a scenario where an AP provides N channels for M users denoted by {UEm|m=1,2,...,M}, as shown in Fig. 1. SIC allows multiple users to be assigned to the same channel but to transmit with powers of different magnitudes. Taking Fig. 1 as an example, channels 1 and 4 contain two users each, while channels 2 and 3 contain three users each.

Fig. 1.Wireless uplink transmission scenario.

The uplink transmitting power of UEm and the pathloss from UEm to the AP are denoted by and PLm, respectively. Thus, the average receiving power at the AP can be written as [20]

Under Rayleigh fading, the instantaneous receiving power at the AP from UEm on channel n is written as

where represents the Rayleigh fading of UEm on channel n [21].

SIC ranks the users on the same channel by their instantaneous receiving power and starts the demodulation procedure from the largest to the smallest one-by-one. To simplify the notations in the system model and the derivations later, we consider that the users are ranked based on their instantaneous receiving power ascendingly. When we demodulate the signal of UEm, signals of UEl,l=m+1,...,M should be successfully demodulated and eliminated from the received mixed signal, which should not interfere with the demodulation of UEm at all. Therefore, the instantaneous SINR for the uplink transmission to the AP from UEm can be written as

where N0 represents the variance of AWGN, and

To demodulate successfully the signal of UEm, the SINR indicated by (3) should be no smaller than θ (θ>1) [19]. Thus, the spectral efficiency of UEm can be written as

Because different users have different application requirements, terminal properties, and user preferences, spectral efficiency may not reflect the actual utility directly. Based on a number of representative studies on RA [22][23], we use a sigmoidal utility function to represent the quality of service (QoS) of each user. Because the pathloss values of various users can be measured in reality, we can adjust the transmitting power to obtain the desired average receiving power so that the instantaneous receiving power involving Rayleigh fading can be set to a reasonable range to guarantee the number of users satisfying SIC conditions, hence maximizing the sum of utilities. Therefore, the optimization for the multi-user multi-channel RA problem in this article can be written as

where s(x)=(x/b)a/[1+(x/b)a] is the sigmoidal utility function, b is its mid value, and a is the variance ratio. Pmin and Pmax represent the minimum and the maximum receiving power for certain wireless networks, which are usually defined in their standards.

 

4. Optimal PA Ratio

SIC demodulates signals from the largest to the smallest. Each demodulated signal can be removed from the mixed received signal so that the smaller signals can be further demodulated without interference from larger ones. For each user, we assume that its signal can be successfully demodulated as long as the SINR is no less than θ. Because N0 is a very small value compared with the interference, it can be ignored for simplification. Therefore, to guarantee successful demodulation of the signal from UEm as well as the minimum gap between the receiving power strengths of different users, we have

where L is the number of users in channel n. To satisfy the condition in (7), if we define the average receiving power of UE1 as unit 1, the average receiving power of UE2 should be θ if we ignore the impact of AWGN and Rayleigh fading. Then because the additive power strength for these two users is (1+θ), the average receiving power of UE3 should be (1+θ)θ to guarantee the condition in (7), and so on. To sum up, we obtain the average receiving power strengths of L users in a single channel with the following ratio

Due to Rayleigh fading, the instantaneous receiving power obeys Rayleigh distribution. When the average receiving power obeys the ratio in (8), their instantaneous receiving power values do not, which makes some users' SINR values lower than θ and causes failure of demodulation. To overcome this problem, we bring in a series of anti-fading factors, i.e., δm-1, m=2,...,L, so the average receiving power values of L users in a single channel become

Therefore, the average receiving power of UE2 is adjusted as θ+δ1, that of UE3 is adjusted as (1+θ+δ1)(θ+δ2), and so on. Hence, the ratio in (8) becomes

We can see that by fixing θ, the probability for successful demodulation is determined by this series of anti-fading factors. If these factors are too small, it is not effective against fading, resulting in low capacity. By contrast, if these factors are too large, the containable number of users per channel is limited, resulting in low resource utilization. Therefore, it is a vital issue to find the optimal series of δm-1, m=2,3,...,L, which is the purpose of the following subsections.

4.1 Calculation of δ1

For the first user,

Hence,

N0 is a very small value compared with the receiving power For example, we assume that N0=-1050 dBm, θ=1.1, and obeys Rayleigh distribution with its mode equal to 1. corresponds to successful demodulation, indicating that the demodulation error rate is calculated by Therefore, we conclude that UE1 could almost always be successfully demodulated.

For UE2,

Hence,

where obey identical and independent distribution (i.i.d.), so the probability density function (PDF) of SINR(2,n) can be obtained (by Appendix A) as

The sustainable demodulation error rate of UE2 is denoted as α, and it corresponds to the probability of SINR(2,n) < θ, i.e.,

Based on the derivation in Appendix B, we obtain

4.2 Calculation of δ2

For the third user,

Based on the derivation in Appendix C, we obtain the PDF of g=(θ+δ1)x+y as

where c=(θ+δ1)2 and

Because there are erf functions in fg(g), it is impossible to analytically obtain f3(s), the PDF of SINR(3,n), in the same way as f2(s), so a curve fitting method is used.We generate obeying i.i.d. Rayleigh distribution, and SINR(3,n) is obtained based on (18). Then, we use the ksdensity function in Matlab to statistically obtain the PDF histogram. Finally, curve fitting is performed to obtain the polynomial function using least-square criterion, denoted by f3'(s), which could be quite close to f3(s) when the degree of this polynomial function is large. Similar to (16), we have

We show the relationship between δ2 and the two parameters α and θ as the curves in Fig. 2. Along with the increment of θ, δ2 increases linearly. At the same time, δ2 decreases along with the increment of α. These features are the same as the relationship between δ1 and these two parameters, which inspires us to draw (the markers in Fig. 2) and compare it with the curves obtained by curve fitting above. We can see that the curves and the markers perfectly match with each other for various α and θ values. Therefore, we conclude that

Fig. 2.Analytical and curve fitting results for δ2.

4.3 Calculation of δ1, i = 3,4,5,6

For δ1, i = 3,4,5,6, using the same method as Subsection 4.2, we draw the curve fitting results and in Fig. 3. A similar conclusion is obtained, i.e.,

Fig. 3.δi (i = 1,2,...,6) with regard to α and θ.

Because each wireless networking protocol defines its maximum and minimum achievable/allowed receiving power strengths, each channel in SIC could generally contain at most six or seven users, so δ6 (corresponding to the 7th user) is complete enough to demonstrate the feature of the series of δi. Therefore, we conclude that, all of the δi should obey (22) for the SIC issue.

 

5. RA Schemes With Different PA Settings

5.1 Simulated annealing search toward the system optimality

In this subsection, we propose an idea for searching for a near-optimal PA and channel assignment solution for the SIC-based multi-user multi-channel RA problem. For each θ, the corresponding δi can be calculated based on (22), so the maximum number of containable users per channel can be obtained by combining δi and the maximum receiving power Pmax. For the sake of fairness, we try to equally allocate channels to the users during each assignment period, so a permutation of all of the users will be used to assign users to channels. If some remaining spaces in some channels are still available, a few randomly selected users will fill in these blanks, guaranteeing that no user was assigned twice in these remaining spaces. In this way, the initial state of such a combinatorial optimization issue is formed.

Because the instantaneous receiving power involves not only pathloss but also Rayleigh fading, many users in the initial state may not be successfully demodulated. Therefore, a searching procedure is required to gradually converge to the optimal solution. In this article, we choose the simulated annealing algorithm for this purpose. The detailed procedure is shown by the flowchart in Fig. 4. First, the maximum number of containable users per channel is calculated, and the initial assignment solution is generated. Then, the total cost of this initial solution is calculated, and the simulated annealing procedure is started. During simulated annealing, we change one user's assignment each time and calculate the new solution's total utility. If the total utility increases, the new solution is accepted as the best and further search continues from there. If the total utility decreases, there is a probability of obeying the Metropolis rule to accept it and to continue further search from it. Finally, when the searching time expires, the algorithm is stopped, and a near-optimal solution is obtained. Note that the utility function for calculating the total utility is performed based on the SIC technique. Once the signal of a user cannot be demodulated, the signals with lower power strengths will have to be discarded without demodulation, so their utilities should be set to zeros.

Fig. 4.Flowchart for searching toward the system optimality using simulated annealing.

5.2 Fast RA with optimal PA ratio

The above algorithm can find a near-optimal solution but takes quite a long time, so it could be used for near-optimum searching but not for practical usage in an SIC-based communication system. In this subsection, we propose a practical and efficient RA scheme to quickly achieve a good solution for PA and channel assignment for the SIC technique.

First, the average power strengths of the places in each channel are set by obeying (10) and (22). Second, the users are assigned to the places in multiple channels randomly. Once a user is assigned to a certain place in a channel, its average receiving power should be adjusted to obey the power ratio indicated by (10) and (22), as shown in Fig. 5. Finally, if some places in some channels are still available because the number of users may be less than the total number of available places, a set of randomly selected users will be assigned to the remaining places. In this way, the optimal power ratio indicated by (10) guarantees successful demodulation of most users, so the network performance could be relatively high.

Fig. 5.RA with optimal PA ratio, i.e., fixed power ratio for places in each channel.

5.3 RA with random PA

To compare with the above-proposed optimal PA scheme, we also consider a scheme with random PA, i.e., without a predefined power ratio like (10). In this case, channel assignment should not be completely random. Otherwise, the probability to successfully demodulate the users in each channel would be too low. Therefore, we consider a simple heuristic channel adjustment idea as follows.

The users with small average receiving power strengths should be assigned to the left-most places in the above scheme. Meanwhile, the users with high average receiving power strengths should be assigned to the right-most places. For each channel, the selected users between the one with the maximum power and the one with the minimum power obey almost arithmetic sequence. In this way, we try the best to demodulate successfully the signals of users as many as possible.

 

6. Numerical Results

6.1 Application of our proposal on WLAN, BAN, and VAN

In this subsection, we apply the proposed PA scheme in Section 4 for wireless local area network (WLAN), body area network (BAN), and vehicular ad hoc network (VAN). WLAN is widely used everywhere in the world. One of its latest standard is [24]. BAN is a new paradigm of wireless sensor network techniques and has quite wide applications in various domains [25]. One of its latest standard is IEEE 802.15.6 for on-body and around-body short-distance wireless communications [26]. VAN is the vehicular communication network for intelligent transportation system and one of its latest standards is IEEE 802.11p [27]. We refer to these standards for the typical power setting parameters of these networks and obtain Table 1 below.

Table 1.Parameters for various wireless network protocols

In the following simulations, the ratio of average receiving powers is set as (10), and δi are set as (22). Different network standards define the maximum and the minimum receiving power strengths, given by Pmax and Pmin below. To simplify the expression, let the mininum receiving power of each channel being unit 1 and the maximum receiving power and the number of containable users L obey (1+θ+δ)L-2 (θ+δ)≤Pmax/Pmin. Therefore, the maximum number of containable users per channel can be obtained, which will guide the design of the channel assignment. Because the minimum receiving power is set to unit 1 as mentioned above, all of the receiving powers are equal to or larger than this magnitude. Therefore, we set AWGN to 0.00001, which is a value small enough to be unsubstantial in the calculation of the SINR. Moreover, the scale parameter of Rayleigh distribution σ is set to 1, the mid value b of the sigmoidal utility function is 3, and its variance ratio a is 2. To obtain smooth curves, we perform 500,000 rounds of simulations and take the average to draw the curves in the following figures. We analyse the impact of α and θ on the network performance, i.e., the number of successfully demodulated users and the total utility.

Fig. 6 shows the impact of α and θ on the total utility in WLAN. For any given θ, with the increment of α, the trend of the total utility is to first increase dramatically and then dcrease slowly. For θ=1.1, the total utility is maximized at α=0.021, so we obtain the optimal δ=6.4106 based on (22). Similarly, for θ=2, 3, the optimal δ=8.8265 and 15.0093, respectively. The optimal δ obtained in this way will be used in the following simulations.

Fig. 6.Total utility vs. α and θ for WLAN.

maximum receiving power δ for the maximization of the containable users with different α and θ in WLAN, BAN, and VAN. As explained before, each channel has a maximum receiving power Pmax. For a given θ, the optimal δ should correspond to the user with the maximum receiving power setting to a value close to Pmax. When θ increases, the overall trend of the optimal δ is to increase, while it decreases slightly at some parts of θ and then jumps to a much higher value. The reason is revealed by (10) and explained as follows: to guarantee the same number of containable users and to avoid exceeding Pmax, when θ increases, δ must correspondingly decrease. However, when δ cannot be decreased anymore, the maximum number of containable users has to decrease by 1, corresponding to the jumps of the optimal δ to a higher value at some points.

Fig. 8 shows the maximum number of containable users for different δ values. Consider an ideal case where only the pathloss is used to model the channel, the optimal δ is obtained as explained above, so the maximum number of containable users for this ideal case in Fig. 8 also jumps at corresponding θ values as in Fig. 7. When Rayleigh fading is taken into account, it is quite possible that some users cannot be successfully demodulated. Therefore, we need to check one-by-one from the strongest to the weakest receiving power to determine the number of users this channel could support, hence obtaining the three smooth curves with Rayleigh fading in Fig. 8. We can see that with the increment of θ, the maximum number of containable users gradually decreases. Meanwhile, by comparing the three networks, the BAN parameters lead to a large number of containable users.

Fig. 7.Optimal δ for the maximum containable users.

Fig. 8.Maximum containable users.

For Fig. 9 and Fig. 10, we change the objective function into the total utility of all of the successfully demodulated users and show the changes of the optimal δ values and the total utility, respectively. The overall trends of the curves in these figures are the same as those in Fig. 7 and Fig. 8. Meanwhile, BAN parameters still lead to better network performance than the other two network settings. With Rayleigh fading, many users may not be able to be demodulated, so the total utility decreases dramatically. Moreover, we should notice that the optimal δ values in Fig. 9 are larger than those in Fig. 7 on average. Larger δ values lead to fewer containable users, indicating that with the total utility as its objective, the maximum number of containable users shown in Fig. 8 is not necessarily achieved.

Fig. 9.Optimal δ for the maximum total utility.

Fig. 10.Maximum total utility.

6.2 Performance evaluation of RA schemes with different PA settings

In this subsection, we compare the performance of the proposed optimal PA scheme with both the random and near-optimal solution obtained by simulated annealing search in the WLAN scenario. The three schemes have been described in Section 5. Simulation parameters are set as in the previous subsection. For simulated annealing, the initial temperature is set to 100, the temperature decreasing rate is 0.99, and the stopping temperature is 0.01.

Fig. 11 shows the total utilities of different schemes. We can see that the proposed efficient RA scheme with optimal PA achieves a close performance to the near-optimum obtained by simulated annealing search and much higher than the scheme with random PA. Fig. 12 compares the Jain's fairness values of these schemes. The trends of these curves are the same as those of the curves in Fig. 11, indicating the high performance of the proposed scheme.

Fig. 11.Comparison of the total utility.

Fig. 12.Comparison of the Jain's fairness index.

Note that, along with the increment of θ, all of the curves tend to decrease. According to (5), one reason is that the probability of successful demodulation decreases. The other reason is the increment of δ along with the increase of θ, which may decrease the maximum number of containable users per channel. The change of the maximum number of containable users per channel results in jumps at some points for the near-optimal curves. Note that there is a small augmentation of the curve for the proposed scheme around θ=2.5. The reason for this augmentation is that when the maximum number of containable users decreases to 1 at each jump point, the probability of successful demodulation increases, which may sometimes lead to a small performance augmentation, such as θ=2.5 in Fig. 11.

 

7. Conclusion

SIC technique has been widely studied, but its PA in fading channels has not been solved. In this article, we focused on the optimization of the allocated power for SIC-based RA schemes. The optimal PA ratio of a set of users using a single SIC channel was analytically obtained. An RA scheme using this optimal PA ratio was proposed. Simulations showed that this scheme achieved a performance close to the near-optimum obtained by simulated annealing search and much higher than the scheme with random PA. Our future work is to extend the proposed scheme to other scenarios, such as Rician fading channels and log-normal shadowing.

References

  1. N. Kumaratharan and P. Dananjayan, “Performance improvement in detection and estimation of MC-CDMA systems over MIMO channels,” Computers and Electrical Engineering, vol. 36, no. 1, pp. 224–233, Jan. 2010. Article (CrossRef Link). https://doi.org/10.1016/j.compeleceng.2009.08.008
  2. J. G. Andrews, “Interference cancellation for cellular systems: a contemporary overview,” IEEE Wireless Commun., vol. 12, no. 2, pp. 19–29, April 2005. Article (CrossRef Link). https://doi.org/10.1109/MWC.2005.1421925
  3. J. Zhang, X. Yang, Q. Yao, X. Ge, M. Jo, and G. Mao, “Cooperative energy efficiency modeling and performance analysis in co-channel interference cellular networks,” The Computer Journal, vol. 56, no.8, pp. 1010–1019, Aug. 2013. Article (CrossRef Link). https://doi.org/10.1093/comjnl/bxs130
  4. D. T. Ngo, L. B. Le, T. Le-Ngoc, E. Hossain, and D. I. Kim, “Distributed interference management in two-tier CDMA femtocell networks,” IEEE Trans. Wireless Commun., vol. 11, no. 3, pp. 979–989, March 2012. Article (CrossRef Link). https://doi.org/10.1109/TWC.2012.012712.110073
  5. C. Jiang, Y. Shi, Y. T. Hou, W. Lou, S. Kompella, and S. F. Midkiff, "Squeezing the most out of interference: an optimization framework for joint interference exploitation and avoidance," in Proc. of IEEE InfoCom, pp. 424-432, March 2012. Article (CrossRef Link).
  6. D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Chapter 6, Cambridge Univ. Press, Sept. 2004. Article (CrossRef Link).
  7. N. I. Miridakis and D. D. Vergados, “A survey on the successive interference cancellation performance for single-antenna and multiple-antenna OFDM systems,” IEEE Commun. Surv. Tut. vol. 15, no. 1, pp. 312–315, Feb. 2013. Article (CrossRef Link). https://doi.org/10.1109/SURV.2012.030512.00103
  8. D. Warrier and U. Madhow, "On the capacity of cellular CDMA with successive decoding and controlled power disparities," in Proc. of IEEE VTC Spring, pp. 1873-1877, May 1998. Article (CrossRef Link).
  9. R. Yim, N. B. Mehta, A. F. Molisch, and J. Zhang, “Dual power multiple access with multipacket reception using local CSI,” IEEE Trans. Wireless Commun., vol. 8, no. 8, pp. 4078–4088, Aug. 2009. Article (CrossRef Link). https://doi.org/10.1109/TWC.2009.080425
  10. D. Hu and S. Mao, "Multicast in femtocell networks: a successive interference cancellation approach," in Proc. of IEEE GlobeCom, pp. 1-6, Dec. 2011. Article (CrossRef Link).
  11. R. Fa and R. C. de Lamare, “Multi-branch successive interference cancellation for MIMO spatial multiplexing systems: design, analysis and adaptive implementation,” IET Commun., vol. 5, no. 4, pp. 484–494, March 2011. Article (CrossRef Link). https://doi.org/10.1049/iet-com.2009.0843
  12. Lie-Liang Yang, “Receiver multiuser diversity aided multi-stage minimum mean-square error detection for heavily loaded DS-CDMA and SDMA systems,” IEEE Trans. Commun., vol. 58, no. 12, pp. 3397–3404, Dec. 2010. Article (CrossRef Link). https://doi.org/10.1109/TCOMM.2010.091710.090263
  13. T. Cover, “Broadcast channels,” IEEE Trans. Inf. Theory, vol. 18, no. 1, pp. 2–14, Jan. 1972. Article (CrossRef Link). https://doi.org/10.1109/TIT.1972.1054727
  14. M. Wildemeersch, T. Q. S. Quek, M. Kountouris, A. Rabbachin, and C. H. Slump, “Successive interference cancellation in heterogeneous networks,” IEEE Trans. Commun., vol. 62, no. 12, pp. 4440–4453, Dec. 2014. Article (CrossRef Link). https://doi.org/10.1109/TCOMM.2014.2370056
  15. S. Sasipriya and C. S. Ravichandran, “Performance analysis of overloaded CDMA system under imperfect synchronization using parallel/successive interference cancellation,” Telecom. Sys., vol. 56, no. 4, pp. 509–518, Aug. 2014. Article (CrossRef Link). https://doi.org/10.1007/s11235-013-9762-6
  16. Y. Shi, Y. T. Hou, J. Liu, and S. Kompella, "How to correctly use the protocol interference model for multi-hop wireless networks," in Proc. of ACM MobiHoc, pp. 239-248, May 2009. Article (CrossRef Link).
  17. Q. Long, J. He, and C. Assi, “Understanding the benefits of successive interference cancellation in multi-rate multi-hop wireless networks,” IEEE Trans. Commun., vol. 62, no. 7, pp. 2465–2477, July 2014. Article (CrossRef Link). https://doi.org/10.1109/TCOMM.2014.2315612
  18. A. Zanella and M. Zorzi, “Theoretical analysis of the capture probability in wireless systems with multiple packet reception capabilities,” IEEE Trans. Commun., vol. 60, no. 4, pp. 1058–1071, April 2012. Article (CrossRef Link). https://doi.org/10.1109/TCOMM.2012.021712.100782
  19. X. Zhang and M. Haenggi, “The performance of successive interference cancellation in random wireless networks,” IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 6368–6388, Oct. 2014. Article (CrossRef Link). https://doi.org/10.1109/TIT.2014.2341248
  20. T. S. Rappaport, Wireless Communications: Principles and Practice, Chapter 3, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 2001. Article (CrossRef Link).
  21. B. Sklar, “Rayleigh fading channels in mobile digital communication systems characterization,” IEEE Commun. Mag., vol. 35, no. 7, pp. 90–100, 1997. Article (CrossRef Link). https://doi.org/10.1109/35.601747
  22. Q. T. Nguyen-Vuong, Y. Ghamri-Doudane, and N. Agoulmine, "On utility models for access network selection in wireless heterogeneous networks," in Proc. of IEEE Network Operations and Manage. Symp. (NOMS), pp. 144-151, April 2008. Article (CrossRef Link).
  23. L. Wang and G. S. Kuo, “Mathematical modeling for network selection in heterogeneous wireless networks - a tutorial,” IEEE Commun. Surv. Tut., vol. 15, no. 1, pp. 271–293, First Quarter 2013. Article (CrossRef Link). https://doi.org/10.1109/SURV.2012.010912.00044
  24. IEEE Standard, Telecommunications and information exchange between systems local and metropolitan area networks specific requirements part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications amendment 5: television white spaces (TVWS) operation. IEEE Computer Society, 2013. Article (CrossRef Link).
  25. L. Wang, C. Goursaud, N. Nikaein, L. Cottatellucci, and J.-M. Gorce, “Cooperative scheduling for coexisting body area networks,” IEEE Trans. Wireless Commun., vol. 12, no. 1, pp. 123–133, January 2013. Article (CrossRef Link). https://doi.org/10.1109/TWC.2012.120412.112073
  26. IEEE Standard, Local and metropolitan area networks part 15.6: wireless body area networks. IEEE Computer Society, 2012. Article (CrossRef Link).
  27. IEEE Standard, Telecommunications and information exchange between systems local and metropolitan area networks specific requirements part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications amendment 6: wireless access in vehicular environments. IEEE Computer Society, 2010. Article (CrossRef Link)

Cited by

  1. Optimized Power Allocation and Relay Location Selection in Cooperative Relay Networks vol.2017, pp.None, 2016, https://doi.org/10.1155/2017/9727360
  2. Error-detection-coding-aided iterative hard decision interference cancellation for MIMO systems with HARQ vol.12, pp.3, 2016, https://doi.org/10.3837/tiis.2018.03.002