English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94201/94201 (100%)
造訪人次 : 81539840      線上人數 : 3281
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/107088


    題名: Network planning for Type 1 and Type 1a relay nodes in LTE-Advanced networks
    作者: 周立德;Tseng, Fan‐Hsun;Chou, Li‐Der;Chao, Han‐Chieh
    貢獻者: 資訊電機學院資訊工程學系
    關鍵詞: Algorithms;Construction costs;Evolution;Graph theory;Interference;interference coordination;linear programming;LTE‐Advanced;network planning;Networks;Relay;relay node;Wireless communication
    日期: 2016-08-25
    上傳時間: 2026-04-23 13:55:59 (UTC+8)
    出版者: Hindawi Limited;Oxford: John Wiley & Sons, Inc
    摘要: 摘要: In this paper, the planning problem of multiple evolved Node Bs (eNBs) and two types of relay nodes is defined base on linear programming. Type 1 relay nodes are placed in the center of eNB, and Type 1a relay nodes are deployed at cell edge. Three algorithms are proposed to investigate the Type 1a relay node placement and communication interference. All algorithms are designed on the basis of graph theory and analyzed in planning case and simulation results. The ultimate goal is to maximize the average throughput of all served users with minimum communication interference. Results showed that the proposed interference coordination algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates the communication interference with the highest average throughput. Most importantly, it achieves the best communication quality for next generation mobile networks. Copyright © 2015 John Wiley & Sons, Ltd. In order to maximize the average throughput of all served users with the lowest communication interference, we propose interference coordination (IC) algorithm to place evolved Node Bs (eNBs) and to deploy Type 1 and Type 1a relay nodes in the center and at the edge of eNB, respectively. Results showed that the IC algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates communication interference with the highest average throughput.
    出版者: Oxford: John Wiley & Sons, Inc
    出版日期: 2016-08-25
    出處: Wireless communications and mobile computing, 2016-08, Vol.16 (12), p.1526-1536
    版權: Copyright © 2015 John Wiley & Sons, Ltd.
    版權: Copyright © 2016 John Wiley & Sons, Ltd.
    識別號: ISSN: 1530-8669
    識別號: ISSN: 1530-8677
    識別號: EISSN: 1530-8677
    識別號: DOI: 10.1002/wcm.2611
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML20檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明