Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Communication Engineering / 電信工程學研究所
  4. Formulating and Solving the Femtocell Deployment Problem in Two-Tier Heterogeneous Networks
 
  • Details

Formulating and Solving the Femtocell Deployment Problem in Two-Tier Heterogeneous Networks

Journal
IEEE International Conference on Communications (ICC)
Pages
5053-5058
Date Issued
2012-06
Author(s)
S.-E. Wei
C.-H. Chang
Y.-E. Lin
HSUAN-JUNG SU  
HUNG-YUN HSIEH  
DOI
10.1109/ICC.2012.6364487
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871952206&doi=10.1109%2fICC.2012.6364487&partnerID=40&md5=a9feac548314f29b657aa1a041c33008
Abstract
Recently, there has been an increasing interest in the deployment and management of femto base stations (BSs) to optimize the overall system performance in macro-femto heterogeneous networks. While deployment of femto BSs is typically not as planned as that of pico BSs, given a number of femto BSs to be distributed to candidate customer sites, questions regarding the optimal deployment locations and transmission configurations still need to be answered. In this paper, we formulate a joint optimization problem involving deployment location, cell selection, and power control to maximize the number of users that can be supported for a given number of femto BSs to be deployed in the macro cell. Since the formulated problem belongs to mixed-integer non-linear programming (MINLP), we propose an anytime algorithm that can yield a desirable solution within proper time limit. Specifically, based on the concept of coalition structure generation, the algorithm decouples the problem into the cluster formation sub-problem and power control sub-problem to find the optimal cluster head (femto BS location), cluster membership (cell selection), and transmission power in an iterative fashion. Evaluation results presented in this paper show that the proposed algorithm can effectively solve the problem with better complexity-optimality tradeoffs compared to baseline approaches. © 2012 IEEE.
Other Subjects
Anytime algorithm; Cell selection; Cluster formations; Cluster head; Cluster memberships; Coalition structure; Deployment problems; Evaluation results; Formulated problems; Iterative fashion; Joint optimization; Macro cells; Mixed-integer nonlinear programming; Optimal deployment; Transmission configuration; Transmission power; Clustering algorithms; Femtocell; Heterogeneous networks; Iterative methods; Optimization; Power control; Problem solving
Type
conference paper

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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