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/67280
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor蔡志宏(Zsehong Tsai)
dc.contributor.authorShu-Fan Linen
dc.contributor.author林書帆zh_TW
dc.date.accessioned2021-06-17T01:26:19Z-
dc.date.available2018-08-30
dc.date.copyright2017-08-30
dc.date.issued2017
dc.date.submitted2017-08-07
dc.identifier.citation[1] Centralized Self-healing Routing Protocol (CSRP), http://www.chinaaet.com/article/3000011112
[2] I. F. Akyildiz and X. Wang, “A survey on wireless mesh networks,” IEEE Communications magazine 43.9 (2005): S23-S30.
[3] D. Benyamina, A. Hafid, and M. Gendreau, “Wireless mesh networks design—A survey,” IEEE Communications surveys & tutorials 14.2 (2012): 299-310.
[4] Y. Yang, J. Wang, and R. Kravets, “Designing routing metrics for mesh networks,” IEEE Workshop on Wireless Mesh Networks (WiMesh). 2005.
[5] W. Shen and Q. A. Zeng, “Cost-function-based network selection strategy in integrated wireless and mobile networks,” IEEE Transactions on Vehicular Technology 57.6 (2008): 3778-3788.
[6] Y. Chen, Mathematical modelling of end-to-end packet delay in multi-hop wireless networks and their applications to qos provisioning. Diss. UCL (University College London), 2013.
[7] K. Lee, “Performance bounds in communication networks with variable-rate links,” ACM SIGCOMM Computer Communication Review. Vol. 25. No. 4. ACM, 1995.
[8] W. Hsu and Z. Tsai, “A call admission control algorithm based on stochastic performance bound for wireless networks,” Advances in Multimedia Information Processing—PCM 2002 (2002): 319-328.
[9] M. C. Chan and T. T. Lee, “Statistical performance guarantees in large-scale cross-path packet switch,” IEEE/ACM Transactions on Networking (TON) 11.2 (2003): 325-337.
[10] F. Ciucu, A. Burchard, and J. Liebeherr, “A network service curve approach for the stochastic analysis of networks,” ACM SIGMETRICS performance evaluation review. Vol. 33. No. 1. ACM, 2005.
[11] P. Sharma and A. K. Bhardwaj, “Cost Function Evaluation of Routing Protocols in Wireless Mesh Networks,” International Journal of Computer Science & Communication, Vol. 3, No. 2, pp. 280-284, 2012.
[12] F. Ciucu and J. Liebeherr, “A case for decomposition of FIFO networks,” INFOCOM 2009, IEEE. IEEE, 2009.
[13] D. J. Kadhim, S. Q. Jobbar, W. Liu, and W. Cheng, “The Stochastic Network Calculus Methodology,” Computer and Information Science 2009. Springer Berlin Heidelberg, 2009. 169-178.
[14] G. Wang, M. Lai, F. Huang, and T. Li, “A stochastic network calculus for service performance in wireless mesh networks,” Computer Science and Education (ICCSE), 2010 5th International Conference on. IEEE, 2010.
[15] M. Fidler and A. Rizk, 'A Guide to the Stochastic Network Calculus.' IEEE Communication surveys & Tutorials, Vol. 17, No. 1, 2015.
[16] C. Curescu and S. Nadjm-Tehrani, “Time-aware utility-based resource allocation in wireless networks,” IEEE transactions on parallel and distributed systems 16.7 (2005): 624-636.
[17] QoS Class Idetifier (QCI), https://en.wikipedia.org/wiki/QoS_Class_Identifier
[18] Qualcomm, “IEEE802.11ac: The Next Evolution of Wi-Fi Standards”, QUALCOMM Incorporated, Aug. 21, 2012
[19] Quentin Docter, CompTIA IT Fundamentals Study Guide: Exam FC0-U51, Sybex, Oct. 2015
[20] 802.11ac Channel Allocation (N American), https://www.networkcomputing.com/wireless/dynamic-frequency-selection-part-3-channel-dilemma/438580919
[21] C. W. Yei, “Providing Stochastic Delay Guarantee in Personal Area Sensor Networks,” M.S. thesis, Grad. Ins. of Comm. Eng. (GICE), Nat. Taiwan Univ., Taiwan, MS, 2016..
[22] Java Modelling Tools, http://jmt.sourceforge.net/
[23] Java, https://java.com/en/
[24] Politecnico di Milano university, http://www.polimi.it/en/home/
[25] Imperial College London, https://www.imperial.ac.uk/
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/67280-
dc.description.abstract為了滿足工業級使用者需要的特殊應用,無線網狀網路在運用時須考慮服務品質、無線通道擾動的適應,以及單一節點之可用無線通道數量上限等。在此環境中,常見之服務品質要求為統計式延遲目標,而非絕對延遲時間上限。本研究假設在此無線網狀網路中,導入802.11ac,搭配多天線收發,在5GHz頻段以20MHz通道頻寬進行無線傳輸。研究目的在於為此類網狀網路找到能滿足特定統計式服務品質延遲目標的最小成本路由和無線通道配置,可為許多8k和一般無線監控設備,提供良好的傳輸環境。
為了建置合乎統計式服務品質目標之無線網狀網路,並獲得最低成本路由,本論文設計一種可滿足特定服務品質之最小成本路由演算法(QMCRA),也設計出一種U型效用函數以計算路由成本;而該效用函數由無線通道效用函數和延遲效用函數組成。對所有交通流可以用無線通道效用函數測試其不同無線通道配置,並計算其鏈路效用值。路由演算法則測試各種路徑組合、計算每個鏈路效用值,以及整體網路效用值,來獲得整體網路最低效用值及各鏈路最佳無線通道配置。最後步驟則經由檢查服務品質目標是否符合,以決定是否保留該路徑設計。
本研究利用佇列模擬軟體JMT (Java Modelling Tools),在多種交通情境下,驗證了此演算法之效能,其所試算出的路徑,並與最短路徑之設計做比較。本研究結論是此設計方法不僅可滿足特定服務品質之延遲目標,也兼具負載平衡的優點。在可連接之無線通道數量內,能合理分配單一節點連接的無線通道總數。此外,本論文所提演算法還能適應交通流源頭的突爆和無線通道的擾動所造成之無線通道短暫阻塞,使交通流之延遲分佈滿足其統計式服務品質延遲目標。
zh_TW
dc.description.abstractIn order to satisfy specific requirement for industrial users in the wireless mesh networks (WMNs), one needs to consider QoS (Quality of Service), the channel fluctuation and limitation of available wireless channels on each node. Additionally, in the industrial environment, users frequently set up QoS in the form of stochastic delay objective, instead of deterministic delay. The purpose of this research is to obtain minimum cost routing and channel allocation under specific stochastic delay objectives satisfying the targeted QoS in WMNs. Our simulation WiFi environment assumed that 802.11ac supports MU-MIMO (Multi-user Multiple-Input and Multiple-Output) and employs 20MHz channel bandwidth on the 5GHz frequency band.
In order to construct stochastic QoS objective in WMNs and to calculate a minimum cost routing for traffic flows, we design an algorithm called QoS-Based Minimum Cost Routing Algorithm (QMCRA) for WMNs, and propose a U-shaped utility function for traffic routing. For all traffic flows, the U-shaped utility function can be used to test various wireless channel allocations while calculating links’ utility. Secondly, the routing algorithm can test various route arrangements by obtaining every links’ utility and the utility sum for the overall network. The routing solution and the best wireless channel allocation is then determined by the one leading to the minimum utility sum of the network. Finally, we check the QoS objectives to determine whether to employ the obtained routing design.
The proposed algorithm was evaluated under various scenarios of several traffic flows. We employed a queue simulator, JMT (Java Modelling Tools), to verify the performance of our design when it is compared with the shortest path approach. By simulation results, we observed that the main advantage of the proposed algorithm is that it satisfied the QoS requirement with less path cost than shortest path. The other advantages are predictability of traffic burstiness and channel fluctuation, load balancing and proper channel allocation on each link. In summary, our algorithm has achieved desirable outcomes: finding a minimum cost routing solution satisfying the desired delay QoS objective.
en
dc.description.provenanceMade available in DSpace on 2021-06-17T01:26:19Z (GMT). No. of bitstreams: 1
ntu-106-R03942138-1.pdf: 3583032 bytes, checksum: e10bb97e2651dcea934fcaec5551240b (MD5)
Previous issue date: 2017
en
dc.description.tableofcontents口試委員會審定書……………………………………………………………………...#
致謝……………………………………………………………………………………....i
中文摘要……………………………………………………………………...................ii
Abstract……………………………………………………………………………........iii
圖目錄………………………………………………………………............................viii
表目錄………………………………………………………………...............................x
第一章 緒論…………………………………………………………..………..........1
1.1 無線網狀網路發展背景…………………………………………...........1
1.2 相關研究…………………………………………………….................2
1.3 研究動機與問題描述…………………………………………...............5
1.4 研究目標…………………………………………..............................6
1.5 論文章節架構………………………………………….........................6
第二章 網路環境架構與佇列數學模型………………………………………….......7
2.1 無線網狀網路運作機制…………………………………………...............7
2.2 工廠環境…………………………………………..................................7
2.3 裝置架構………………………………………….................................8
2.4 IEEE 802.11ac環境………………………………………….............................9
2.5 隨機佇列模型…………………………………………...........................10
2.5.1 隨機程序特徵…………………………………………....................11
2.5.2 交通流與通道服務容量特徵……………………………...............11
第三章 滿足服務品質之集中式最小成本路由演算法………………….........15
3.1 無線網狀網路架構…………………………………………..................15
3.1.1 無線網狀網路設計…………………………………………..........17
3.2 無線網狀網路模型設計……………………………………………………..18
3.2.1 交通流定義…………………………………………......................18
3.2.2 交通流路徑定義………………………………………….............19
3.2.3 無線通道定義…………………………………………..................21
3.3 成本函數定義………………………………………………………………..22
3.4 效用函數定義………………………………………………………………..24
3.4.1 無線通道效用函數定義……………………………………………24
3.4.2 延遲效用函數定義…………………………………………………26
3.4.3 集中式最小成本路由演算法設計………………………………27
3.4.4 無線通道分配設計…………………………………………………27
3.5 主要流程圖…………….…………………………………………………….28
3.5.1 計算路徑之通道效用值設計流程…………………………………28
3.5.2 檢查服務品質設計流程…………………………………………31
3.6 滿足服務品質之集中式最小成本路由演算法驗證………………….33
3.6.1 模擬軟體介紹………………………………………………………33
3.6.2 模擬軟體參數………………………………………………………33
3.6.3案例分析………………………………………………………………34
第四章 軟體模擬……………………………………………………………………...37
4.1 模擬方法與程序…………………………………………........……………..37
4.1.1 EBB參數量測…………………………………………........………….37
4.1.2 EBF參數量測…………………………………………........………..41
4.1.3 特定比例延遲試算………………………………………..………..44
4.1.4 軟體模擬圖…………………………………………………………45
4.2 模擬情境假設………………………………………………………………..45
4.2.1 對照組定義………………………………………….......……………46
4.2.2 模擬情境說明…………………………………….......………………48
4.3 模擬結果…………………………………………........……………………..50
4.4 小結…………………………………………........………………………..63
第五章 結論與未來研究工作………………………………………………………...65
5.1 結論…………………………………………........………………………..65
5.2 未來研究工作…………………………………………........……………..66
附錄一 重要符號定義………………………...………………………………………67
參考文獻………………………………………....……………………………………69
dc.language.isozh-TW
dc.subject無線網狀網路zh_TW
dc.subject服務品質zh_TW
dc.subject延遲目標zh_TW
dc.subject突爆zh_TW
dc.subject通道擾動zh_TW
dc.subjectburstinessen
dc.subjectQoSen
dc.subjectdelay objectiveen
dc.subjectwireless mesh networken
dc.subjectfluctuationen
dc.title無線網狀網路基於服務品質之最小成本路由演算法zh_TW
dc.titleA QoS-Based Minimum Cost Routing Algorithm for Wireless Mesh Networksen
dc.typeThesis
dc.date.schoolyear105-2
dc.description.degree碩士
dc.contributor.oralexamcommittee黎明富(Ming-Fu Li),鄭瑞光(Ray-Guang Cheng)
dc.subject.keyword無線網狀網路,服務品質,延遲目標,突爆,通道擾動,zh_TW
dc.subject.keywordwireless mesh network,QoS,delay objective,burstiness,fluctuation,en
dc.relation.page71
dc.identifier.doi10.6342/NTU201702638
dc.rights.note有償授權
dc.date.accepted2017-08-08
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-106-1.pdf
  未授權公開取用
3.5 MBAdobe 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