ENERGY ALLOCATION STRATEGIES FOR LLR-BASED SELECTION RELAYING IN COOPERATIVE TRANSMISSION Hyung Yun Kong, Ho Van Khuong, Seong Wook Hong,Gun Seok Kim, Vo Nguyen Quoc Bao Department of Electrical Engineering, University of Ulsan ABSTRACT Selection relaying (SR) achieves the powerful benefits of multi-antenna systems without the need for physical arrays. It is theoretically shown that when the relay measures loglikelihood ratio (LLR) instead of signal-to-noise ratio (SNR) to decide whether or not to forward the recovered symbols to the destination, the performance of SR with equal energy allocation is drastically improved. In this paper, we propose two energy allocation strategies based on long-term fading statistics without increasing implementation complexity as well as causing the loss of spectral efficiency to complete the framework for LLR-based SR and further enhance its performance.

1. INTRODUCTION The spatial diversity owing to the feasibility of deploying multiple antennas at both transmitter and receiver is an efficient solution to mitigate the fading in wireless communications. However, when wireless mobiles may not be able to support multiple antennas due to size and power limitations or other constraints in wireless networks (especially, ad-hoc or sensor networks), this diversity technique is not exploited. Moreover, mobile stations (MSs) typically operate on battery, which means their consumed energy is extremely constrained. Hence how to minimize the average transmission energy is very important. Appropriate energy allocation for all MSs is necessary to adapt channel fluctuations so as to improve communications performance. Optimum energy allocation strategies based on instantaneous fading statistics lead to some disadvantages [1]. First, they cause the loss of spectral efficiency and complexity increase because when MSs are mobile, the requirement of accurate channel state information (CSI) at all respective transmitters obtained through feedback channels may mean frequent update and an extra computation burden, which is certainly undesirable. Second, CSI can not be perfectly estimated at the receivers as well as feedback to the transmitters without any error. Noisy CSI induces inaccurate energy allocation which affects adversely the system performance. Therefore, energy

allocation based on long-term fading statistics is preferred [2]. Selection relaying (SR) is one of the simple cooperative communications protocols where the relay must make an independent decision on whether or not to decode and forward source information [3]. Different performance criterions for making decision at the relay were mentioned. In [4] we proposed log-likelihood ratio (LLR) in place of signal-to-noise ratio (SNR) and verified that LLR-based SR outperforms SNR-based SR in case of equal energy allocation. In this paper, we propose two energy allocation strategies based on long-term fading statistics without increasing implementation complexity as well as causing the loss of spectral efficiency to complete the framework for LLR-based SR and further enhance its performance. Numerical results demonstrate that these strategies provide a significant energy saving for LLR-based SR over the conventional SNR-based SR and direct transmission under any relay position subject to total energy constraint. The rest of this paper is organized as follows. Section 2 summarizes the main results in [4]. Then two energy allocation strategies are presented in Section 3. Numerical results are demonstrated in Section 4 and finally, the paper is concluded in Section 5. 2. LLR-BASED SELECTION RELAYING Consider cooperative communications in a dual-hop wireless network where information is transmitted from a source S to a destination D with the assistance of a relay R as shown in Fig. 1.

Fig. 1 Selection relaying (a) Cooperative network model, (b) First cooperation phase, (c) Second cooperation phase

All

MSs

equipped

with

Authorized licensed use limited to: Ulsan University. Downloaded on November 22, 2009 at 02:57 from IEEE Xplore. Restrictions apply.

single-antenna

tran

sceivers and sharing the same frequency band are under investigation. In addition, each MS does not transmit and lexity. Towards this end, time division multiplexing (TDM) is used for channel access. Assuming that channels between terminals experience independent slow and frequency-flat Rayleigh fading, i.e., they are constant during a N-symbol block but change independently to the next. Without loss of generality, we only illustrate the analysis for the first symbol of each block. Because of slow fading, accurate channel estimation is possible at receivers [5]. Thus, we will assume perfect CSI at all the respective receivers for coherent detection but only long-term fading statistics (particularly, the second-order moments) is known at the transmitters for energy allocation. Estimating the second-order moments at the transmitters can be easily performed by each MS. As a result, the implementation complexity due to energy allocation is negligible. Since the channel parameters vary with a frequency corresponding to the coherence time of the wireless propagation, the energies should be updated at least with the same time scale, which is of the order of hundreds of ms (according to the MS mobility). To capture the effect of path-loss on BER performance, we use the model where the variance of αij is given by λij=(dSD/dij)η with αij and dij being the path gain and the distance between transmitter i and receiver j, respectively and η being the path-loss exponent; i∈{S, R} and j∈{R, D} hereafter. For convenience of presentation, we utilize discrete-time complex equivalent base-band models to express all signals. In addition, we only consider binary phase shift keying (BPSK) modulation.

receive signal at the same time to mitigate implementation comp (4) y =α E a '+ n At the end of the second phase, D combines the received signals from both phases based on maximum ratio combining (MRC) and then detects the transmitted signal a as follows (5) a = sign(Re( E α y + E α y )) In the rest of this section, we only summarize the main results in [4] to facilitate in addressing the proposed energy allocation strategies in Section 3. For SNR-based SR, the condition to forward a′ in the second phase is (erfinv(1 − 2 P )) (6) α ≥ = Tα RD

S

R

∗ SD

RD

SD

R

∗ RD

RD

2

2

eT

SR

ES

where erfinv(.) is the inverse error function. For LLR-based SR, forwarding a′ in the second phase only takes place if   1 (7) Λ ≥ ln − 1 = Λ  

P  eT

0

where Λ is the LLR of the received signal given by

Λ = 4 y R ES

y at R which is and ln(⋅) denotes natural logarithm. SR

2.2. BER expressions Let λx = 1/(ESλSD), λy = 1/(ERλRD), λq = 1/λSR, β= ESλSR and as the average bit error rate (BER) of SNR denote P e _ C − SR

based SR and

Pe _ P − SR

are given by [4]

as that of LLR based SR. These BERs

[

Pe _ C − SR = Pe _ SD Pr α SR

2.1. Selection Relaying description

RD

2

[

] (

)

< Tα + Pe1 1 − PC − SR + Pe 2 PC − SR

]

(

)

Pe _ P − SR = Pe _ SD Pr Λ < Λ 0 + Pe1 1 − PP − SR + Pe 2 PP − SR

Selection relaying consists of two phases. In the first phase, S broadcasts a BPSK-modulated symbol a and so, the signals received at R and D are given by (1) y =α E a+n SR

SR

S

SR

(2)

y SD = α SD E S a + nSD

where yij denotes a signal received at MS j from MS i, nij is a zero-mean unit-variance complex additive noise sample at MS j, Ei is the average symbol energy (ASE) of MS i. Now R processes the received signal according to the SR protocol [4]. That means it checks whether the received instantaneous BER is below a threshold BER, PeT. If this is the case, R detects and forwards the restored symbol a′ to D in the second phase. Otherwise, it keeps silent. The original symbol a is recovered by maximum likelihood (ML) decoding as (3) a' = sign( y ) where sign(.) is a signum function and y = Re(α y ) with Re(.) is the real part. Assuming that R assists S in data transmission, the signal that D receives from R in the second phase is of the form R

R

∗ SR

SR

(8) (9)

Note that PeT is related to Tα and Λ0 in (6) and (7), respectively. Therefore, (8) and (9) are also functions of PeT. In addition, the optimum thresholds PeT-opt that minimizes BER conditioned on any pair (ES, ER) for both SNR-based SR and LLR-based SR are of the same form, given by PeT −opt =

Pe _ SD

(10)

Pe 2 − Pe1

3. ENERGY ALLOCATION STRATEGIES For a fair comparison in terms of energy consumption between cooperative communications and direct transmission, it is essential that the total consumed energy of the cooperative system must be equal to that of corresponding direct transmission system. Therefore, we have ES+ER=E where E is total transmit energy of the system which is also the transmit energy of the source in case of direct transmission. In [4], the performance of SR with equal energy allocation (ES=ER=0.5E) was presented. In this section, we propose two energy allocation strategies to further improve its performance.

Authorized licensed use limited to: Ulsan University. Downloaded on November 22, 2009 at 02:57 from IEEE Xplore. Restrictions apply.

Let ES=δE where 0<δ<1 is energy sharing factor for cooperation. Then ER=(1-δ)E and thus given a set of parameters (E, λSR, λRD, λSD), (8) and (9) are functions of δ and PeT. Consequently, minimizing BER in (8) and (9) is equivalent to choosing jointly the appropriate values of δ and PeT. In other words, optimum energy allocation for S and R in the sense of minimizing the BER is to solve the following optimum problem Minimize P subject to 0< δ <1 and PeT > 0 (11) or P = P . where P = P

After selecting ES and ER, the threshold PeT is calculated from (10). It is obvious that this strategy is simpler than the best-effort energy allocation strategy because it doesn’t perform the exhaustive search for δ but it is only effective at high SNR at which R can decode successfully, leading to the spatial diversity at D. 4. NUMERICAL RESULTS

e

e _ C − SR

e

e _ P − SR

e

3.1. Best-effort energy allocation strategy The expression of P in terms of parameters δ and PeT is too complicated to jointly optimize both δ and PeT for solving the optimum problem in (11). Therefore, we propose a bestBER searching strategy that separately optimizes the parameters δ and PeT as follows. First, find the optimum threshold PeT-opt conditioned on δ which is given by (10). Then substituting PeT-opt into (8) and (9), we obtain the BER expression P that is only a single-variable function of δ. Finally, compute P for every possible value of δ and select the one that minimizes the BER. We consider δ corresponding to the minimum BER as a solution of (11). In the numerical results illustrated in Section 4, we limit the range of δ to [0.01, 0.99] with incremental step ∆δ=0.01 to avoid an exhaustive search. Thus, the found δ which offers the smallest BER is not the optimum δ. We only call this value the best δ and denote it as δb. Moreover, since δb is a constant with respect to a given set (E, λSR, λRD, λSD), the proposed energy allocation for S and R shows that it is extremely simple and causes no bandwidth loss. This comes from the fact that the transmission energies of S and R are only updated at least with the same time scale as the coherence time of the wireless propagation which is of the order of hundreds of ms (according to the MS mobility), and there is no requirement of instantaneous CSI αij at the transmitters which is usually estimated at the receivers and sent through feedback channels. e

e

e

We consider a network geometry where R is located on the straight line between S and D. The direct path length S-D is normalized to be 1. We also denote d as the distance between S and R. In all presented results, the path-loss exponent η=3 is under investigation. Since the noise variances at R and D are assumed to be 1, the axis of all figures represents the total signal-to-noise ratio SNR that is defined as E (the total transmitted energy). For notation convenience, we denote transmission schemes as shown in Table 1. Figures 2-4 compare BER performances of SR with different energy allocation strategies for some typical values of d∈{0.4, 0.6, 0.8} and direct transmission. Based on δS=1/(1+λSD /λRD), we calculate the corresponding values of δS∈{0.822, 0.94, 0.992} that are independent of SNR while the values of δb given in Table 2 increase with respect to SNR. It is observed that both δS and δb increase with d. This is reasonable because when R is far away from S, the S-R path loss is large. Therefore S should transmit with higher energy to compensate for this path loss increase. Then R can decode successfully, leading to spatial diversity at D. It is also seen that δb of SNR-based SR is always larger than that of LLR-based SR. Table 1. Notations of transmission schemes.

Table 2. Values δb corresponding to each SNR

3.2. Simple energy allocation strategy This simple energy allocation strategy is based on the observation in [6] that when R decodes successfully the signal from S, the MRC at D is optimum in the sense of minimizing the BER if and only if the average energies that D receives from S and R are the same. That means (12) λ E =λ E E a  = Ξ α E a ′  or Ξ α 2



SD

S

2





RD

R



SD

S

RD

R

where Ξ(⋅) is the expectation operator. Combining (12) with the constraint ES+ER=E, we can allocate the energies for S and R as ES=E/(1+λSD /λRD) and ER=ESλSD/λRD. In this case, δ is denoted as δS=1/(1+λSD /λRD).

Authorized licensed use limited to: Ulsan University. Downloaded on November 22, 2009 at 02:57 from IEEE Xplore. Restrictions apply.

in [6] that when the paths which are maximum-ratio combined are symmetric (i.e. ESλSD=ERλRD), the MRC achieves the best performance. However, P2 (or C2) can be inferior to P1 (or C1) at low values of SNR and a certain value of d. For example in case of d=0.4, P2 is worse than P1 for SNR of less than 25dB and C2 is inferior to C1 for SNR of less than 15dB.

d=0.4

-1

10

-2

10

-3

BER

10

-4

10

DT C1-δ=0.5

-5

C2-δS=0.822

10

5. CONCLUSION

C3 P1-δ=0.5

-6

10

P2-δS=0.822 P3

-7

10

5

10

15

20

25

30

SNR (dB)

Fig. 2 BER performance with energy allocation strategies with d=0.4 d=0.6

-1

10

-2

10

-3

BER

10

-4

10

DT C1-δ=0.5 C2-δS=0.94

-5

10

C3

ACKNOWLEDGMENT

P1-δ=0.5

-6

P2-δS=0.94

10

P3 -7

10

This paper proposes two energy allocation strategies based on long-term fading statistics to complete the framework for LLR-based selection relaying. These strategies represent the trade-off between the performance and computation burden. However, both provide a significant energy saving compared to direct transmission as well as the conventional SNR-based SR. Since LLR-based SR with the best-effort energy allocation strategy is extremely energy-efficient, it should be considered as a promising technical solution for ad hoc networking to satisfy the stringent energy constraint and extend the coverage area as well.

5

10

15

20

25

30

SNR (dB)

Fig. 3 BER performance with energy allocation strategies with d=0.6

This research was supported by the BK21 Research Fund of Korea. This work was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea Government (MOST) (No. R01-2007-000-20400-0)

d=0.8

-1

10

6. REFERENCES

-2

10

-3

BER

10

-4

DT

10

C1-δ=0.5 C2-δS=0.992

-5

10

C3 P1-δ=0.5 P2-δS=0.992

-6

10

P3 -7

10

5

10

15

20

25

30

SNR (dB)

Fig. 4 BER performance with energy allocation strategies with d=0.8

Figures 2-4 show that best-effort energy allocation strategy P3 (or C3) provides the best performance. Specifically, in comparison with equal energy allocation P1 (or C1) at target BER of 10-5, P3 (or C3) can save the energy of approximately 0.5, 1.5, and 2.5 dB (or 1, 2, and 3dB) for d=0.4, 0.6 and 0.8 respectively. Additionally, P3 significantly outperforms direct transmission with energy gain of about 12.5dB at target BER of 10-3 and any value of d. Due to the diversity order of P3 higher than that of DT, P3 keeps better than DT as SNR increases. Also in Figs. 2-4, we observe that simple energy allocation strategy P2 (or C2) performs better than P1 (or C1) and worse than P3 (or C3). At high values of SNR, it reaches the performance of P3 (or C3). This is consistent with an observation from the results

[1] Z. Jingmei, S. Chunju, and W.Y.Z. Ping, “Performance of a two-hop cellular system with different power allocation schemes,” VTC2004-Fall, vol. 6, pp. 4538-4542, 26-29 Sept. 2004. [2] J. Luo, R. S. Blum, L. Cimini, L. Greenstein, and A. Haimovich, “Power allocation in a transmit diversity system with mean channel gain information,” IEEE Commun. Letters, vol. 9, no. 7, pp. 616618, July 2005. [3] J. N. Laneman, D.N.C. Tse, and G.W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. on Inform. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004. [4] H.V. Khuong and H.Y. Kong, “LLR-based Decode-andForward Protocol for Relay Networks and Closed-form BER Expressions,” IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E89A, No. 6, pp. 1832-1841, June 2006. [5] A. Stefanov and E. Erkip, “Cooperative coding for wireless networks,” IEEE Trans. on Commun., vol. 52, no. 9, pp. 14701476, Sept. 2004. [6] H.Y. Kong and H.V. Khuong, “Closed-form BER expressions for performance of Alamouti STC,” JKIPS (Journal of Korea Information Processing Society) Trans. on Commu., vol. 12-C, no. 5, pp. 673-678, Oct. 2005.

Authorized licensed use limited to: Ulsan University. Downloaded on November 22, 2009 at 02:57 from IEEE Xplore. Restrictions apply.

Energy Allocation Strategies for LLR-Based Selection ...

multiple antennas at both transmitter and receiver is an efficient solution to ... Downloaded on November 22, 2009 at 02:57 from IEEE Xplore. Restrictions apply.

190KB Sizes 1 Downloads 172 Views

Recommend Documents

Fair Beamwidth Selection and Resource Allocation for ...
†School of ECE, College of Engineering, University of Tehran, Iran. ‡School of ... promising technology for supporting extremely high data rates in the next generation .... devices begin with finding the best sector-level beams through a sequence

Page 1 of 13 FPA Journal - Dynamic Allocation Strategies for ...
consumption to ensure continued survival of savings. .... Such high returns seem aggressive on a forward-looking basis and would result in an upward bias in the ... The portfolios were assumed to be held in tax-deferred accounts and any tax ...

Dynamic Allocation Strategies for Distribution Portfolios ...
ables into account. Literature .... savings. Yet while it is certainly advanta- geous to create decision rules, since mar- kets and clients ..... Such high returns seem aggressive on a forward-look- ing basis and would result in an upward bias in the

Reduced Complexity Power Allocation Strategies for ...
Abstract—We consider wireless multiple-input–multiple-output. (MIMO) systems ..... allocation algorithm, we propose some novel allocation tech- niques that are ...

Dec 2015 Report on Site Selection Strategies For Enterprise Data ...
Dec 2015 Report on Site Selection Strategies For Enterprise Data Centers.pdf. Dec 2015 Report on Site Selection Strategies For Enterprise Data Centers.pdf.

Exploring Pattern Selection Strategies for Fast Neural ...
data [1], Bangla handwritten numerals [2] and the Shuttle data from the UCI machine learning repository [3]. Keywords-fast pattern selection; neural networks; machine learning;. I. INTRODUCTION. In the last few decades, the popularity of different ne

Energy Efficient Virtual Machine Allocation in the Cloud
10 vm.Database. 8. 8. 2. 6. 16 virtual machine. From the remaining hosts, it finds the one that would result in using ... mentioned above, the website is hosted entirely on a set of .... Unsurprisingly, the Watts per Core policy did the best from an 

Fair Energy Resource Allocation by Minority Game ... - Semantic Scholar
resource from electrical power-grid and renewable energy resource from solar .... Solar PV panel [1] to harvest solar energy with dependence between the ...

Fair Energy Resource Allocation by Minority Game ...
resource from electrical power-grid and renewable energy resource from ... solar photovoltaic (PV) has been installed globally in 2010 [2][3]. Thus, there is an ...

Energy Efficient Virtual Machine Allocation in the Cloud
Energy Efficient Virtual Machine Allocation in the Cloud. An Analysis of Cloud Allocation Policies. Ryan Jansen. University of Notre Dame. Center for Research ...

Strategies for the exploration of free energy landscapes: unity in ...
Jul 1, 2017 - Computer simulations play an important role in the study of ... Available online 3 June 2017 .... transformation processes - it could be called the science of change - ...... dynamics/temperature-accelerated MD [44–46] the temperature

Energy-Aware Path Selection in Mobile Wireless ...
addition, the assumptions of [5], [8], e.g., congestion-free .... Illustration of a path selection based on the angle θ around i, β represents the ..... Tutorials, vol. 7, no.

Energy-Aware Path Selection in Mobile Wireless Sensor Networks: A ...
Energy-Aware Path Selection in Mobile Wireless Sensor .... Next, we illustrate the credit-based approach: a node is ... R is considered as a virtual credit of.

MARKS ALLOCATION
MARKS FOR EXCEL test (calc payment due) - GROUP 1D. FORMAT. 10. 10. 5. 5. 5. 5. 5. 45. MARKAH stdno. time. TIMEMARK weightage Overall % TOTAL ...

Wang_Xiaowei_ICC11_Power and subcarrier allocation for physical ...
Wang_Xiaowei_ICC11_Power and subcarrier allocation for physical layer security in OFDMA networks.pdf. Wang_Xiaowei_ICC11_Power and subcarrier ...

DREAM: Dynamic Resource Allocation for Software-defined ...
1. INTRODUCTION. Today's data center and enterprise networks require expensive .... services have a large number of tenants; for example, 3 million do-.

A Method for Distributed Optimization for Task Allocation
the graph that underlies the network of information exchange. A case study involving ... firefighting, disaster management, and multi-robot cooperation. [1-3].

Computation Offloading Strategies based on Energy ...
are accurately known in advance or predicted, see, e.g. [9],. [15]. In contrast, enforcing a dynamic decision mechanism makes possible to adapt to different operating ..... Applications, and Services, pp.49-62, San Francisco, CA, USA, 15-18. June 201

Kin Selection, Multi-Level Selection, and Model Selection
In particular, it can appear to vindicate the kinds of fallacious inferences ..... comparison between GKST and WKST can be seen as a statistical inference problem ...

Dynamic Memory Allocation
int main(void). { int* ptr = malloc(sizeof(int)); if (ptr == NULL). { printf("Error -- out of memory.\n"); return 1;. } *ptr = GetInt(); printf("You entered %d.\n", *ptr); free(ptr);.

Allocation of energy inputs among the end-uses in the ...
Keywords: Energy; Allocation; End-use; Petroleum industry; United states. 1. Introduction ...... 2005, from /http://iac.rutgers.edu/technicaldocs/dbman_82.phpS.

Operational Amplifier Selection Guide for ... - Linear Technology
Performance – Design Note 3. George Erdi. 10/87/3_conv. L, LT, LTC ... application requires large source resistors, the LT1028's relatively high current noise will ...

Feature Selection for SVMs
в AT&T Research Laboratories, Red Bank, USA. ttt. Royal Holloway .... results have been limited to linear kernels [3, 7] or linear probabilistic models [8]. Our.