請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63746
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 林宗男(Tsung-Nan Lin) | |
dc.contributor.author | Ming-Fu Tang | en |
dc.contributor.author | 唐明甫 | zh_TW |
dc.date.accessioned | 2021-06-16T17:18:03Z | - |
dc.date.available | 2012-08-20 | |
dc.date.copyright | 2012-08-20 | |
dc.date.issued | 2012 | |
dc.date.submitted | 2012-08-17 | |
dc.identifier.citation | [1] E. C. van der Muelen, “Three-terminal communication channels,” Advances Applied Probability, vol. 3, pp. 120 – 154, 1971.
[2] H. Sato, “Information transmission through a channel with relay,” The Aloha System. University of Hawaii, Honolulu, Tech. Rep. B76-7, Mar 1971. [3] T. Cover and A. Gamal, “Capacity theorems for the relay channel,” Information Theory, IEEE Transactions on, vol. 25, no. 5, pp. 572 – 584, sep 1979. [4] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity. part i. system description,” Communications, IEEE Transactions on, vol. 51, no. 11, pp. 1927 – 1938, nov. 2003. [5] ——, “User cooperation diversity. part ii. implementation aspects and performance analysis,” Communications, IEEE Transactions on, vol. 51, no. 11, pp. 1939 – 1948, nov. 2003. [6] J. Laneman, D. Tse, and G. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” Information Theory, IEEE Transactions on, vol. 50, no. 12, pp. 3062 – 3080, dec. 2004. [7] B. Rankov and A. Wittneben, “Spectral efficient protocols for half-duplex fading relay channels,” Selected Areas in Communications, IEEE Journal on, vol. 25, no. 2, pp. 379 –389, february 2007. [8] S. Sanayei and A. Nosratinia, “Antenna selection in mimo systems,” Communications Magazine, IEEE, vol. 42, no. 10, pp. 68 – 73, oct. 2004. [9] A. Molisch and M. Win, “Mimo systems with antenna selection,” Microwave Magazine, IEEE, vol. 5, no. 1, pp. 46 – 56, mar 2004. [10] Yang Yang and Honglin Hu and Jing Xu and Guoqiang Mao, “Relay technologies for WiMax and LTE-advanced mobile systems,” Communications Magazine, IEEE, vol. 47, no. 10, pp. 100 –105, october 2009. [11] A. Ghosh, R. Ratasuk, B. Mondal, N. Mangalvedhe, and T. Thomas, “LTE-advanced: next-generation wireless broadband technology [Invited Paper],”Wireless Communications, IEEE, vol. 17, no. 3, pp. 10 –22, june 2010. [12] K. Loa, C.-C. Wu, S.-T. Sheu, Y. Yuan, M. Chion, D. Huo, and L. Xu, “IMT-advanced relay standards [WiMAX/LTE Update],” Communications Magazine, IEEE, vol. 48, no. 8, pp. 40 –48, august 2010. [13] K. T. T. Steven W. Peters, Ali Y. Panah and J. Robert W. Heath, “Relay Architectures for 3GPP LTE-Advanced,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, p. 14, 2009. [14] G. T. 36.814, “Evolved Universal Terrestrial Radio Access (E-UTRA); Further Advancements for E-UTRA Physical Layer Aspects.” [15] G. T. 36.806, “Evolved Universal Terrestrial Radio Access E-UTRA; Relay Architectures for E-UTRA (LTE-Advanced).” [16] G. R3-093149, “Comprehensive Comparison Among Type-I Relay Alternatives,” Inst. Info. Industry, Coiler, RAN3 : No.66, Jeju, Korea, Nov. 2009. [17] G. R1-101825, “Backhaul UL Subframe Allocation in TDD LTE-A Relay ,”ZTE, RAN1 : No.60bis, Beijing, China, Apr. 2010. [18] G. T. 36.913, “ Requirements for Further Advancements for Evolved Universal Terrestrial Radio Access (E-UTRA),” vol. v. 8.0.1, Mar. 2009. [19] G. doc. R1-060385, “Cubic Metric in 3GPP-LTE,” Denver, CO, Feb 13-17, 2006. [20] G. T. 36.814, “Requirements for Further Advancements for E-UTRA,” vol. v. 1.5.2, Dec. 2009. [21] G. T. 25.814, “Requirements for Further Advancements for Evolved Universal Terrestrial Radio Access (E-UTRA),” vol. v. 7.1.0, Sep. 2006. [22] G. T. 36.814, “Further Advancements for E-UTRA : Physical Layer Aspects,” Tech. Spec.n Group Radio Acces Network Rel. 9, vol. v. 1.2.1, June 2009. [23] H. Halabian, I. Lambadaris, C.-H. Lung, and A. Srinivasan, “Throughput-optimal relay selection in multiuser cooperative relaying networks,” in MILITARY COMMUNICATIONS CONFERENCE, 2010 - MILCOM 2010, 31 2010-nov. 3 2010, pp. 507 –512. [24] S. Kadloor and R. Adve, “Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks,” in Communications, 2009. ICC ’09. IEEE International Conference on, june 2009, pp. 1 –5. [25] J. Xu, S. Zhou, and Z. Niu, “Interference-aware Relay Selection for Multiple Source-Destination Cooperative Networks,” in Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on, oct. 2009, pp. 338 –341. [26] S. Sharma, Y. Shi, Y. Hou, and S. Kompella, “An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks,” Networking, IEEE/ACM Transactions on, vol. 19, no. 3, pp. 879 –892, june 2011. [27] X. Zhang, A. Ghrayeb, and M. Hasna, “On Relay Assignment in Network-Coded Cooperative Systems,” Wireless Communications, IEEE Transactions on, vol. 10, no. 3, pp. 868 –876, march 2011. [28] J. Cai, X. Shen, J. Mark, and A. Alfa, “Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks,” Wireless Communications, IEEE Transactions on, vol. 7, no. 4, pp. 1348 –1357, april 2008. [29] D. C. R. Jain, W. Hawe, “A Quantitive Measure of Fairness and Discrimincation for Resource Allocation in Shared Computer Systems,” DEC-TR-301, 1984. [30] J. Liu, N. Shroff, and H. Sherali, “Optimal power allocation in multi-relay mimo cooperative networks: Theory and algorithms,” Selected Areas in Communications, IEEE Journal on, vol. 30, no. 2, pp. 331 –340, february 2012. [31] J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Neural Networks, 1995. Proceedings., IEEE International Conference on, vol. 4, nov/dec 1995, pp. 1942 –1948 vol.4. [32] 3GPP, “LTE-A Simulation Methodology and Assumptions,” vol. R1-082610, July 2008. [33] L. Rong, S. Elayoubi, and O. Haddada, “Impact of Relays on LTE-Advanced Performance,” in Communications (ICC), 2010 IEEE International Conference on, may 2010, pp. 1 –6. [34] A. Bou Saleh, S. Redana, B. Raaf, T. Riihonen, J. Hamalainen, and R.Wichman, “Performance of amplify-and-forward and decode-and-forward relays in lte-advanced,” in Vehicular Technology Conference Fall (VTC 2009-Fall), 2009 IEEE 70th, sept. 2009, pp. 1 –5. [35] Z. Ma, Y. Zhang, K. Zheng, W. Wang, and M. Wu, “Performance of 3GPP LTE-Advanced networks with Type I relay nodes,” in Communications and Networking in China (CHINACOM), 2010 5th International ICST Conference on, aug. 2010, pp. 1 –5.40 | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63746 | - |
dc.description.abstract | 合作式通訊為增進蜂巢式網路之空間多樣性(spatial diversity)以及覆蓋率(coverage area)之著名技術。於合作式通訊中,接力點(relay node)將幫助使用者終端裝置(user equipment)向目標傳輸資訊。接力點分配(relay assignment)即是將合適的接力點分配給使用者以達到系統效能的最大化。而以往的接力點分配研究成果皆於匹配(matching)架構下完成,其意義為每一位使用者只能與至多一個接力點連結。因在任一瞬間閒置的使用者皆可被雇用為接力點,匹配架構之系統效能顯然不為最佳解。若在多個接力點可同時服務一位使用者的架構下,雖消耗更多傳輸功率,但系統之總容量(aggregate capacity)可望更有效率地提升。對多接力點分配問題而言,為了最大化系統總容量,在給定的迴圈數裡面,粒子群最佳化(particle swarm optimization)可獲得近似以暴力演算法(exhausted search algorithm)所求得之全局最佳解(global optimal)。隨著使用者與接力點的數量增加,暴力法求解所需要的演算複雜度(computational complexity)呈現指數成長。相對地,當迴圈數目增加,粒子群最佳化所得之解將逼近全局最佳解。而當使用者與接力點數目增加時,獲得此解亦得付出指數成長之粒子與迴圈數量。因此,本論文旨在探討如何開發出在演算複雜度上有效率之多接力點分配演算法。剩餘接力點分配演算法(residual relay node assignment)因此提出以求得線性成長演算複雜度之多接力點分配解。根據在LTE-Advanced通訊系統環境下的模擬結果顯示,隨著接力點數量增加,使用此論文提出之演算法之多接力點支援系統效能可被更有效率地提升。 | zh_TW |
dc.description.abstract | Cooperative communication is a well-known technique to exploit the spatial diversity and extend the coverage area in cellular networks. In cooperative communication, the relay node (RN) can help user equipment (UE) to transmit its information to the destination. Relay assignment is to assign the proper RNs to the UEs in order to optimize the system performance. The traditional research works on relay assignment are with matching architecture, which yields that each UE can only be matched with single RN. This is obviously a suboptimal solution since the free UEs can be deployed as RNs. With multi-relay assignment architecture described in this work, the aggregate capacity of overall system can be power-efficiently raised at the price of power consumption on originally leisure RNs. For multi-relay assignment problem, to maximize the aggregate capacity or instantaneous information rate, the particle swarm optimization (PSO) is introduced to obtain a close-global optimal solution with given number of iteration instead of exhausted search algorithm, which is with computational complexity of exponential growth as the number of RNs increases when tackling the problem of maximizing the aggregate capacity. As the number of iteration grows, the local-optimally solution of PSO converges to the globally optimum. However, the number of particle and iteration required by PSO to converge to the global optimal solution grows exponentially when the number of RN increases. Therefore, this work aim at finding a computationally efficient algorithm to coordinate a better tradeoff between computational complexity and aggregate instantaneous information rate of each UE. The residual RN assignment algorithm is therefore proposed. The simulation results have shown that as the number of RN increases, the multiple relay-assisted system with the multi-relay assignment algorithm proposed in this work can be power-efficiently raised. The topology is in LTE-Advanced cellular networks. Simulation results have shown that PSO and RRNA provides great performance enhancement comparing with the optimal solution of single-relay assignment with efficient power consumption. Meanwhile, the fairness index is improved in such a resource allocation problem. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T17:18:03Z (GMT). No. of bitstreams: 1 ntu-101-R99942120-1.pdf: 1105015 bytes, checksum: 9c8904114f702cfcc6ad61371d64a5ff (MD5) Previous issue date: 2012 | en |
dc.description.tableofcontents | List of Figures iii
List of Tables v 1 Introduction 1 2 Background Information 5 2.1 Relay Technology in LTE-A . . . . . . . . . . . . . . 5 2.1.1 Layer 1 Relay . . . . . . . . . . . . . . . . . . . 6 2.1.2 Layer 2 Relay . . . . . . . . . . . . . . . . . . . 7 2.1.3 Layer 3 Relay . . . . . . . . . . . . . . . . . . . 8 2.2 Related Works on Single-Relay Assignment . . . . . . 10 3 System Model 13 3.1 System Model . . . . . . . . . . . . . . . . . . . . 13 3.2 Communication Protocol and Signaling Scheme . . . . . 17 4 Problem Formulation 21 4.1 Single-Relay Assignment Problem . . . . . . . . . . . 21 4.1.1 Problem Formulation . . . . . . . . . . . . . . . . 21 4.1.2 Hungarian Algorithm . . . . . . . . . . . . . . . . 24 4.2 Multiple-Relay Assignment Problem . . . . . . . . . . 26 5 Assignment Algorithm 29 5.1 Particle Swarm Optimization (PSO) . . . . . . . . . . 29 5.2 Proposed Algorithm . . . . . . . . . . . . . . . . . 32 5.2.1 Preprocessing Phase . . . . . . . . . . . . . . . . 32 5.2.2 Residual Relay Node Assignment (RRNA) . . . . . . . 33 6 Simulation Result 38 6.1 Topology and Parameter Settings . . . . . . . . . . . 38 6.2 Simulation Results. . . . . . . . . . . . . . . . . . 40 6.2.1 Average Aggregate Instantaneous Information Rate . 41 6.2.2 Average Power Efficiency . . . . . . . . . . . . . 42 6.2.3 Fairness Index . . . . . . . . . . . . . . . . . . 43 7 Conclusion 47 Bibliography 49 | |
dc.language.iso | en | |
dc.title | 合作式蜂巢網路中之多接力點分配演算法研究 | zh_TW |
dc.title | Multi-Relay Assignment Algorithms in Cooperative Cellular Networks | en |
dc.type | Thesis | |
dc.date.schoolyear | 100-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 蔡子傑,廖婉君,陳俊良 | |
dc.subject.keyword | 合作式通訊,蜂巢式網路,多接力點分配,LTE-Advanced,匈牙利演算法,功率效益, | zh_TW |
dc.subject.keyword | Cooperative communiaction,Cellular networks,Multi-relay assignment,LTE-Advanced,Hungarian algorithm,Power efficiency, | en |
dc.relation.page | 52 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2012-08-18 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-101-1.pdf 目前未授權公開取用 | 1.08 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。