Resource Allocation in OFDM Based Wireless Relay Networks ...

More documents

Recommendations

Info

3.7 Summary 3 2.8 2.6 JntOpt SubOpt SolWOP Static bits/s/Hz 2.4 2.2 2 1.8 1.6 2 4 6 8 10 12 14 16 18 20 M Figure 3.5: Throughput versus the number of users at SNR= 10 dB. number of users. To get a more insight into the performance gain achieved from tone matching, in the next example we compare JntOpt and SubOpt with SolWOP under the case when |h m,1 | > |h m,2 | . . . > |h m,K |, |˜h m,1 | < |˜h m,2 | . . . < |˜h m,K |, |g m,1 | > |g m,2 | . . . > |g m,K |, |˜g m,1 | < |˜g m,2 | . . . < |˜g m,K |, ∀m. The throughput curves versus SNR for M = 2 and M = 10 are shown in Fig. 3.6. It can be seen that JntOpt and SubOpt yield good performance. However, SolWOP exhibits much worse performance as compared to that in Fig. 3.4 because the good channel in MAP is always paired with the bad channel in BCP when no pairing strategy is adopted. 3.7 Summary In this chapter, we developed power and sub-carrier allocation algorithms for multi-user bidirectional relay networks. The objective was to maximize the total 59
3.7 Summary 1.8 1.6 1.4 JntOpt SubOpt SolWOP M=10 M=2 1.2 bits/s/Hz 1 0.8 0.6 0.4 0.2 0 2 4 6 8 10 SNR (dB) Figure 3.6: Throughput versus SNR under anti-symmetric channels for M = 2 and M = 10, respectively. throughput of the system subject to the power and the sub-carrier constraints. Due to exclusive sub-carrier allocation constraints of the OFDMA system and the one-to-one MAP to BCP tone matching policy, the formulated problem was a mixed integer programming problem. The Lagrangian theory was exploited to efficiently solve the problem. Further, a suboptimal algorithm was designed to reduce the computational complexity. The low complexity algorithm follows a stepwise approach such that only one parameter is optimized in each step. The computational complexities of different algorithms are analysed. Numerical results demonstrated that the proposed algorithms significantly outperform other candidates. 60
Page 1 and 2:
Resource Allocation in OFDM Based W
Page 3 and 4:
Dedications: To my family
Page 5 and 6:
Acknowledgment I am greatly thankfu
Page 7 and 8:
Contents 2.3.3 Proposed Low-Complex
Page 9 and 10:
Abstract The combination of relay t
Page 11 and 12:
List of Tables 3.1 Complexity compa
Page 13 and 14:
List of Figures 4.1 System model fo
Page 15 and 16:
List of Acronyms IEEE MU RS AWGN OW
Page 17 and 18:
1.1 Overview of Relay Networks wire
Page 19 and 20:
1.2 Overview of OFDM Figure 1.2: Th
Page 21 and 22:
1.3 Basics of the Optimization Theo
Page 23 and 24: 1.3 Basics of the Optimization Theo
Page 25 and 26: 1.4 Resource Allocation Problem is
Page 27 and 28: 1.5 Contribution and Organization o
Page 29 and 30: 1.5 Contribution and Organization o
Page 31 and 32: 2.1 Introduction allocated to a nod
Page 33 and 34: 2.1 Introduction The main contribut
Page 35 and 36: 2.2 System Model where h m,k denote
Page 37 and 38: 2.3 Resource Allocation Schemes opt
Page 39 and 40: 2.3 Resource Allocation Schemes ( )
Page 41 and 42: 2.3 Resource Allocation Schemes and
Page 43 and 44: 2.3 Resource Allocation Schemes tha
Page 45 and 46: 2.3 Resource Allocation Schemes 2.3
Page 47 and 48: 2.4 Generalization to Multiple Rela
Page 49 and 50: 2.4 Generalization to Multiple Rela
Page 51 and 52: 2.5 Simulation Results • OptSol/J
Page 53 and 54: 2.5 Simulation Results 0.9 0.85 0.8
Page 55 and 56: 2.6 Summary 2.6 2.4 2.2 2 Rate (bit
Page 57 and 58: 2.6 Summary 2.4 2.2 2 1.8 N=4 N=3 N
Page 59 and 60: 3.1 Introduction A new technology c
Page 61 and 62: 3.1 Introduction • Broadcast Phas
Page 63 and 64: 3.2 System Model MU MU 3 8 A 1 2 7
Page 65 and 66: 3.4 Joint Resource Allocation Schem
Page 67 and 68: 3.4 Joint Resource Allocation Schem
Page 69 and 70: 3.5 Step-Wise Low-Complexity Resour
Page 71 and 72: 3.6 Simulation Results and SNR B m,
Page 73: 3.6 Simulation Results 3 2.5 2 Uppe
Page 77 and 78: 4.1 Introduction • Non-orthogonal
Page 79 and 80: 4.3 Cooperative Non-Orthogonal Tran
Page 87 and 88: 4.4 Optimization under Orthogonal T
Page 89 and 90: 4.4 Optimization under Orthogonal T
Page 91 and 92: 4.5 Simulations Then, the over all
Page 93 and 94: 4.5 Simulations 40 30 20 Sum−ρ S
Page 95 and 96: 4.6 Summary 0.9 0.8 0.7 JPSC Pow EP
Page 97 and 98: Chapter 5 Lifetime Maximization in
Page 99 and 100: 5.1 Introduction Figure 5.2: Linear
Page 101 and 102: 5.2 System Model antenna that canno
Page 103 and 104: 5.4 Lifetime Maximization Scheme 5.
Page 105 and 106: 5.4 Lifetime Maximization Scheme wh
Page 107 and 108: 5.5 Simulation Results 150 OPT−SO
Page 109 and 110: 5.6 Summary Lifetime (S) 150 100 50
Page 111 and 112: Chapter 6 Resource Allocation in Co
Page 113 and 114: 7. Conclusions were considered for
Page 115 and 116: Bibliography [12] A. Peled, and A.
Page 117 and 118: Bibliography [36] Z. Luo and S. Zha
Page 119 and 120: Bibliography [61] D. H. N. Nguyen,
Page 121 and 122: Bibliography [84] A. Goldsmith, S.
Page 123 and 124: Bibliography [105] Y. Li, W. Wang,
Page 125 and 126:
Appendix A Derivations of Closed-Fo
Page 127:
B. Derivations of the Optimal Power
show all

Resource Allocation in OFDM Based Wireless Relay Networks ...

Create successful ePaper yourself

Delete template?

Save as template?