Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/39444
Title: 考慮服務品質限制、整合語音與資料傳輸及頻寬切割之WCDMA基地台架設演算法
A QoS and FDMA Constrained Base Station Deployment Algorithm in Voice/Data Integrated WCDMA Systems
Authors: Ming-Li Lin
林明立
Advisor: 林永松(Yeong-Sung Lin)
Keyword: 容量管理,數學最佳化,服務品質,第三代行動通訊系統,基地台架設,寬頻分工多重擷取系統(WCDMA),拉格蘭氏鬆弛法,
Optimization,Mathematical Programming,Lagrangian Relaxation Method,3rd Generation Wireless System,Quality of Service,WCDMA,Base Station Deployment Algorithm,
Publication Year : 2004
Degree: 碩士
Abstract: 無論是使用者或是電信業者都迫切地期待著第三代行動通訊的來臨,而本論文的目的在於提供電信業者一有效率的基地台架設演算法使其在知道使用者分佈的情況下得到最大利潤。
在WCDMA系統中,容量限制以訊雜比(signal-to-interference ratio, SIR)為主要依據,而本篇論文以能量為資源,加入頻寬切割之要素,依此設計出一基地台架設演算法,並讓電信業者能規劃出適當的頻寬切割方式。本論文針對WCDMA的系統,同時考慮上下行系統容量限制、漂亮地設計出此非線性問題並採用拉格蘭氏鬆弛法處理此一複雜問題而得到一令人滿意的結果。
The diffusion and demand of mobile communication services are still growing rapidly nowadays. Users are no longer satisfied with merely speeches but eager to communicate with each other by multimedia services. That’s the reason why the approach to the base station deployment optimization problem is so urgent and important.
Many researches have been pronounced to solve the deployment problem. We combined the most important issues, such as downlink SIR constraint, uplink SIR constraint, soft handover, sectorization, and power control, frequency assignment into consideration.
We developed a mathematical programming model to describe this joint design problem. It turns out to be a non-linear non-convex mixed integer programming problem. A set of heuristic solution procedures based on Lagrangian relaxation methods is proposed to solve the complicated problem.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/39444
Fulltext Rights: 有償授權
Appears in Collections:資訊管理學系

Files in This Item:
File SizeFormat 
ntu-93-1.pdf
  Restricted Access
324.84 kBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved