Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Communication Engineering / 電信工程學研究所
  4. Multi-Relay Assignment Algorithms in Cooperative Cellular Networks
 
  • Details

Multi-Relay Assignment Algorithms in Cooperative Cellular Networks

Date Issued
2012
Date
2012
Author(s)
Tang, Ming-Fu
URI
http://ntur.lib.ntu.edu.tw//handle/246246/252554
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.
Subjects
Cooperative communiaction
Cellular networks
Multi-relay assignment
Hungarian algorithm
Power efficiency
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-101-R99942120-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):736efe174648a05bef5215d102e46eed

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science