Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28649
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor蔡志宏
dc.contributor.authorPei-Shu Huangen
dc.contributor.author黃珮書zh_TW
dc.date.accessioned2021-06-13T00:15:39Z-
dc.date.available2007-07-30
dc.date.copyright2007-07-30
dc.date.issued2007
dc.date.submitted2007-07-26
dc.identifier.citation[1] J. Huschke and P. Leaves, “Dynamic spectrum allocation algorithm including results of DSA performance simulations,” Information Society Technologies DRiVE Deliverable D09, 2003.
[2] K.I. Aardal, S.P.M.van Hoesel, A.M.C.A Koster, C.Mannino, and A.Sassano,“Models and solution techniques for frequency assignment problems,” 4OR, 2003
[3] M. Buddhikot, et. al, “DIMSUMnet: New directions in wireless networking using coordinated dynamic spectrum access,” IEEE WoWMoM’05, Taormina, Italy, June 2005.
[4] M. Buddhikot and K. Ryan, “Spectrum management in coordinated dynamic spectrum access based cellular networks,” IEEE DySPAN’05, Nov. 2005, Baltimore, USA.
[5] V. Rodriguez, K. Moessner, and R. Tafazolli, “Market-driven dynamic spectrum allocation: Optimal end-user pricing and admission control for CDMA,” The 14th IST Mobile and Wireless Communications Summit, Dresden, Germany, June 2005.
[6] V. Rodriguez, K. Moessner, and R. Tafazolli, “Auction driven dynamic spectrum allocation: Optimal bidding, pricing and service priorities for multi-rate, multi-class CDMA,” The 16th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’05), Berlin, Germany, September 2005.
[7] C. W. Sung, and W.S. Wong, “Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint,” IEEE Transactions on Vehicular Technology, vol.46, no.3, August 1997.
[8] M. Zhang, and T. P. Yum, “The nonuniform compact pattern allocation algorithm for cellular mobile systems,” IEEE Transaction on Vehicular Technology, vol.40, no.2, May 1991.
[9] J. Arthur Zoellner, and C. Lyle Beall, “A breakthrough in spectrum conserving frequency assignment technology,” IEEE Transactions on Electromagnetic Compatibility, vol. emc-19 no.3, August 1977.
[10] R. Battiti, A. Bertossi, and D. Cavallaro,”A randomized Saturation Degree Heuristic for Channel Assignment in Cellular Radio Networks,” IEEE Transactions to Vehicular Technology, vol.50, no.2, March 2001.
[11] W. Klotz, “Graph Coloring Algorithms,”Technical Report Mathematik-Bericht 2002/5, TU Clausthal, 2002.
[12] A.I. Giortzis, and L.F. Turner “Application of mathematical programming to the fixed channel assignment problem in mobile radio networks,” IEEE Proceedings- Communications vol.144, no.4, August 1997.
[13] K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, and B. Jansen, “A branch-and-cut algorithm for the frequency assignment problem,” Research Memorandum 96/011, Maastricht University.
[14] K.I. Aardal, C. Hurkens, J.K. Lenstra, and S. Tiourine, “Algorithms for radio link frequency assignment: the CALMA project,” Operation Research vol.50, no.6, November-December 2002.
[15] K.N. Sivarajan, R. J. McEliece, and J. W. Ketchum, “Channel assignment in cellular radio,” in Proc. 39th IEEE Vehicular Technology Conference ,1989.
[16] M.J. Marcus, “Real time spectrum markets and interruptible spectrum,” New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005, 2005 First IEEE International Symposium on.
[17] M. Sirbu, and J. Peha, ”Spectrum sharing through dynamic channel assignment for open access to personal communications services,” Proc. of IEEE Intl. Communications Conference (ICC), June 1995.
[18] D.L. Robinson, A.K. Shukla, J. Burns, and A. Atefi,“Resource trading for spectrum aggregation and management”, New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005, 2005 First IEEE International Symposium on.
[19] D. Grandblaise, L. Elicegui, N. Motte, and D. Bourse, ”Evolution of spectrum management in SDR context spectrum sharing between operators”, WWRF WG3-SDR.
[20] P. Demestichas, G. Dimitrakopoulos, D. Bourse, and K.El Khaxen, “Dynamic planning and management of reconfigurable systems,” New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005, 2005 First IEEE International Symposium on.
[21] G. Li amd H. Liu, “Downlink radio resource allocation for multi-cell OFDMA system,” Wireless Communications, IEEE Transactions on, vol.5, December 2003.
[22] W. K. Hale, “Frequency Assignment: Theory and Applications,” Proceeding of the IEEE, vol.68, no.12, December 1980.
[23] Office of Communications Website, http://www.ofcom.org.uk/, “Opportunities to free up public sector spectrum for new uses.” Jul, 2007.
[24] Spectrum Trading Associates Website, http://www.spectrade.co.uk/.
[25] Federal Communications Commission Website, “”http://www.fcc.gov/”, Wireless Telecommunications Bureau.
[26] FCC, “Promoting Efficient Use of Spectrum Through Elimination of Barriers to the Development of Secondary Markets”, Report and Order and Further Notice of Proposed Rulemaking, 18 FCC Rcd 20604(2003), Erratum, 18 FCC Rcd 24817(003).
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28649-
dc.description.abstract現今的無線通訊應用越來越多,但我們可以使用的頻譜資源卻是有限的。由於頻譜資源的稀少和珍貴,若是我們可以善加利用頻譜,則能提供更多無線應用服務給使用者。因此,我們提出頻譜分享的觀念。由於不同的無線網路業者的使用客戶會隨著時間和空間的不同而改變,若網路業者將暫時不需要的頻譜借給其他網路業者,則頻譜資源可以得到有效的利用。在本論文中,我們提出一個架構讓多個網路業者可以分享他們的頻譜資源。在此架構中,仲裁者(Arbiter)負責管理共有的頻譜資源,網路業者的經紀人(Broker)負責規劃頻譜的分配,並且跟仲裁者進行溝通以得到需要的共有頻譜資源。基地台頻譜資源管理者(Base_Station_Radio_Resource_Manager)需要偵測蜂巢(cell)內使用客戶的交通流量以利評估在各個區域需要多少頻譜資源。我們提出一個簡單的貪婪演算法來規畫頻譜分配,此演算法可以在有限的時間內得到足夠好的答案。在分配共有資源時,我們提出信用機制(credit mechanism)來解決多個網路業者競爭資源的情形。除此之外,我們所設計經紀人和仲裁者之間的溝通模式是有效且簡單的,即使業者不知道其他業者的資訊,依然藉由溝通而調整頻譜分配,讓所有蜂巢內的頻譜需求都被滿足。在兩個網路業者分享頻譜資源的情形下,我們跑的模擬結果顯示,共有資源可以被有效地高度使用,業者們所提供的服務品質(QoS)也因此提升。zh_TW
dc.description.abstractWhile more and more wireless applications and devices are developed, the demand of spectrum has been increasing rapidly. However, the spectrum resource of a popular band is often limited. If multiple network operators share the spectrum in an effective way, the radio resource should be better utilized. We have thus proposed an architecture for multiple networks to partially share the spectrum, in which an Arbiter is recommended to centrally manage the shared band of the spectrum, a Broker is used to handle requests for the shared spectrum after making a plan of frequency assignment, and the Base_Station_Radio_Resource_Manager is made to be responsible of the prediction of regional demand. We have developed a credit mechanism in such architecture for the Arbiter to distribute the shared radio resource among networks, and a greedy algorithm for Brokers to make a plan of frequency assignment within limited time. Moreover, the recommended form of negotiation between Arbiter and Brokers is simple and effective. Although Brokers do not need to know any information of other networks, they can still adjust their frequency assignments to improve the network performance. In a 2 networks scenario, the results show that the shared resource can be highly utilized so that the performance of both networks with spectrum sharing is better than that without spectrum sharing.en
dc.description.provenanceMade available in DSpace on 2021-06-13T00:15:39Z (GMT). No. of bitstreams: 1
ntu-96-R94942057-1.pdf: 433579 bytes, checksum: 8682ef6d75da550a3afa402671ca625b (MD5)
Previous issue date: 2007
en
dc.description.tableofcontentsChapter 1 Introduction………………………………………1
1.1 Motivation and Background………………………1
1.2 Related Works………………………………………2
1.3 Problem Description and Goal…………………3
1.4 Organization of the Thesis……………………4
Chapter 2 System Architecture and Algorithms…………5
2.1 System Architecture and Components…………5
2.2 Operation of the Base Station Radio Resource Manager………14
2.3 Operation of the Broker………………………15
2.3.1 Spectrum Allocation Problem and Algorithm…17
2.3.2 Adjustment of Spectrum Demand ……………25
2.3.3 Generation of List_of_demanded_frequency……26
2.4 Operation of the Arbiter…………………………27
2.4.1 Centralized Spectrum Allocation Algorithm…29
2.4.2 Retrieve of the Shared Frequencies…………31
2.4.3 Distribution of the Unused Shared Frequencies…32
2.5 Centralized Spectrum Allocation Scheme…………33
Chapter 3 Simulation Result and Performance Analysis……35
3.1 Experiment Environment……………………………35
3.2 Spatial Frequency Assignment……………………37
3.3 Temporal Frequency Assignment……………………49
3.4 The Comparison of Centralized and Distributed Schemes…………56
Chapter 4 Conclusions……………………………58
4.1 Conclusions………………………………………58
4.2 Future Works……………………………………58
References……………………………………………60
dc.language.isoen
dc.subject頻譜分享zh_TW
dc.subject動態分配頻譜zh_TW
dc.subject無線通訊zh_TW
dc.subjectwireless networken
dc.subjectdynamic spectrum allocationen
dc.subjectspectrum sharingen
dc.title動態分配頻譜:於多個無線系統環境中之頻譜的分配zh_TW
dc.titleDynamic Spectrum Allocation: Spectrum Sharing in a Multiple Wireless Networks Environmenten
dc.typeThesis
dc.date.schoolyear95-2
dc.description.degree碩士
dc.contributor.oralexamcommittee許獻聰,馮輝文,李揚漢,林宗男
dc.subject.keyword動態分配頻譜,頻譜分享,無線通訊,zh_TW
dc.subject.keyworddynamic spectrum allocation,spectrum sharing,wireless network,en
dc.relation.page63
dc.rights.note有償授權
dc.date.accepted2007-07-27
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-96-1.pdf
  未授權公開取用
423.42 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
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