中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/107249
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81671795      Online Users : 2664
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/107249


    Title: Set cover problem of coverage planning in LTE-Advanced relay networks
    Authors: 周立德;Tseng, Fan-Hsun
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Algorithms;Communication;Computer simulation;Construction costs;Covering;Demand;Heuristic;Linear programming;Matlab;Networks;Noise;Partnerships;Simulation;Site selection;Wireless communication;Wireless networks
    Date: 2014-01-01
    Issue Date: 2026-04-23 14:02:34 (UTC+8)
    Publisher: Academy of Taiwan Information Systems Research;New Taipei City: Academy of Taiwan Information Systems Research
    Abstract: 摘要: Various mobile devices are developing rapidly in contemporary society, such as smart phones and tablet PCs. Users are able to acquire different multimedia services through wireless communication anytime and anywhere. However, the increased demand also gives rise to a problem of insufficient bandwidth. Therefore, a fourth generation mobile telecommunications (4G) technology was proposed and widely investigated. One of the popular technologies is Long Term Evolution Advanced (LTE-Advanced), which was proposed by the Third Generation Project Partnership (3GPP). The Evolved Node B (eNB) and Relay Node (RN) are the major components in an LTE-Advanced network. How best to deploy these two components to extend network coverage and expand performance is a vital issue. In this paper, we utilize an integer linear programming model (ILP) to formulate the coverage problem, and refer to a well-known problem called the Set Cover problem. Then we propose a heuristic algorithm named as the Set Covering algorithm to solve it. The ultimate object is achieving the highest network coverage and capacity with the least uncovered mobile user. In the simulation result, we use MATLAB to simulate a network deployment, and evaluate the planning results. According to the simulation results, we accomplished better network capacity and a higher number of covered users.
    出版者: New Taipei City: Academy of Taiwan Information Systems Research
    出版日期: 2014-12
    出處: International Journal of Electronic Commerce Studies, 2014-12, Vol.5 (2), p.181-198
    資源來源: 華藝電子期刊(CEPS)
    版權: Copyright Academy of Taiwan Information Systems Research 2014
    識別號: ISSN: 2073-9729
    識別號: ISSN: 2410-8588
    識別號: EISSN: 2410-8588
    識別號: DOI: 10.7903/ijecs.1159
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML21View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - 隱私權政策聲明