請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/45934
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蔡志宏(Zse-Hong Tsai) | |
dc.contributor.author | Wen-Hsin Wang | en |
dc.contributor.author | 王文新 | zh_TW |
dc.date.accessioned | 2021-06-15T04:49:14Z | - |
dc.date.available | 2011-08-06 | |
dc.date.copyright | 2010-08-06 | |
dc.date.issued | 2010 | |
dc.date.submitted | 2010-08-02 | |
dc.identifier.citation | [1] L. Wan, W. Ma, Z. Guo. “A Cross-layer Packet Scheduling and Subchannel Allocation Scheme in 802.16e OFDMA System, ” IEEE WCNC 2007, pp.1867-1872.
[2] R. Cohen L. Katzir. “Computational analysis and efficient algorithms. for micro and macro ofdma scheduling,” IEEE INFOCOM, pp. 511-519, 2008 . [3] Y. Cui, T. Gu, W. Hu. « An Algorithm for the Constrained Two-Dimensional Rectangular Multiple Identical Large Object Placement Problem,” Optimization Methods and Software. 2008. [4] Y. Cui, T. Gu, W. Hu. Simplest optimal guillotine cutting patterns for strips of identical circles. Journal of Combinatorial Optimization. 2008. [5] Y. Cui. “An exact algorithm for generating homogeneous two-segment cutting patterns,” Engineering Optimization. 2007. [6] M. C. Necker, M. Kohn, A. Reifert, J. Scharf, J. Sommer. “Optimized Frame Packing for OFDMA Systems,” Vehicular Technology Conference, pp. 1483 – 1488, 2008. [7] K. Wongthavarawat and A. Ganz, “Packet scheduling for QoS support in IEEE 802.16 broadband wireless access systems,” International Journal of Communication Systems, vol. 16, no. 1, pp. 81–96, February 2003. [8] H. Lee, T. Kwon, and D.-H. Cho, “An efficient uplink scheduling algorithm for VoIP services in IEEE 802.16 BWA systems,” in Proc. IEEE VTC 2004-Fall, Los Angeles, CA, September 2004. [9] C.S. Chang, Stability, “Queue length and delay of deterministic and stochastic queueing networks,” IEEE/ACM Trans. Auto. Control 39, 5, 1994, pp. 913–931. [10] R.L. Cruz, “A calculus for network delay, Part II: Network analysis,” IEEE Trans. Inform. Theory 37, 1, 1991, pp. 132–141. [11] R.L. Cruz, “Quality of service management in integrated services networks,” in Proc. the 1st Semi-Annual Research Review, CWC, USCD,1996. [12] J.-Y. Le Boudec, P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, Springer-Verlag, 2001. [13] J. Kurose, “On computing per-session performance bounds in high speed multi-hop computer networks,” in Proc. ACM Sigmetrics and Performance, 1992. [14] E.W. Knightly,” Second moment resource allocation in multi-service networks,” in Proc. ACM SIGMETRICS’97, 1997, pp. 181–191. [15] R. L. Cruz, “A Calculus for Network Delay, Part 1: Network Elements in Isolation,” IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 114-131, Jan. 1991. [16] K. Lee, “Performance Bounds in Communication Networks with Variable-rate Links,” AMC SIGCOMM’95, 1995, pp. 129-136. [17] R. Sinha, C. Papadopoulos, and J. Heidemann ”Internet Packet Size Distribution: Some Observations,” Technical Report ISI-TR-2007-643, USC Information Sciences Institute, May, 2007. [18] C. Hoene, A. Günther, A. Wolisz, “Measuring the Impact of Slow User Motion on Packet Loss and Delay over IEEE 802.11b Wireless Links,” in Proc. of Workshop on Wireless Local Networks, Octorber,2003. [19] L. Zheng, D. Xu, “Characteristics of network delay and delay jitter and its effect on voice over IP (VoIP),” ICC 2001, vol.1, pp. 122-126. [20] S. Das, E. Lee, K. Basu, and S. Sen, “Performance Optimization of VoIP Calls over Wireless Links Using H.323 Protocol,” IEEE Trans. Computers, vol. 52, no. 6, pp. 742-752, June 2003. [21] V. Fodor , I. Chatzidrossos, “Playback delay in mesh-based Peer-to-Peer systems with random packet forwarding and transmission capacity limitations,” International Journal of Internet Protocol Technology, v.3 n.4, pp.257-265, December 2008. [22] Y. Liu, “On the minimum delay Peer-to-Peer video streaming: how real-time can it be?” MM’07, September 23–28, 2007. [23] WiMAX Forum, www.wimaxforum.org.tw/ [24] S. Parkvall, D. Astely, “The evolution of LTE towards IMF-Advanced,” Journal of Communications, Vol.4, NO.3, April 2009. [25] Erik Dahlman, Stefan Parkvall, Johan Skold, Per Beming, “3G Evolution – HSPA and LTE for Mobile Broadband”, 2nd ed., Academinc Press, 2008. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/45934 | - |
dc.description.abstract | 正交分頻多工存取(OFDMA)已經成為一個在無線通訊系統上非常受歡迎的技術,如IEEE 802.16e標準而OFDMA的框架結構在近年來則引發了一系列的研究趨勢。在IEEE 802.16e標準,每一次我們傳送給一個特定用戶的突發性資料訊框必須是由子通道和時間槽所形成的二維矩形訊框。如果太多的使用者資料積壓在同一時間,這樣一來並非全部的使用者資料都會在下一個訊框中被傳送出去,反而還會造成而外的延遲發生。換句話說,該系統應有效的在OFDMA技術下對這些使用者資料作訊框排程,以確保延遲的上限和維持較高的吞吐量。儘管先前的研究已經在解決在OFDMA突發性資料訊框的封包排程,而我們提出了新的下行訊框分配演算法讓其在使用基因演算法及貨板裝載演算法的情況下決定在OFDMA技術下可傳輸的最大訊息量。因外,我們考慮了在正交分頻多工存取無線系統下不同應用的服務品質所需。為了這個目的,我們將結合服務品質和分配演算法並且將其變得更為可行。而我們的實驗結果將會證明,當我們使用交配次數大於5次的基因演算法,我們可以充分使用至少86%位於正交分頻多工存取無線系統訊框中的時槽。此外,如果我們遇到過多的封包湧入緩衝區時,我們可以減少基因演算法的交配次數已利於減少系統的運算量。另外,我們採取隨機網路模型估測封包的延誤時間。對照於決定型網路模型,我們的隨機網路摸型可以更精準地估測到封包的延誤時間。 | zh_TW |
dc.description.abstract | Orthogonal Frequency Division Multiple Access (OFDMA) has become a very popular technique in wireless communication systems such as the IEEE 802.16e and the OFDMA frame structure has triggered a series of research trends in recent years. In the IEEE 802.16e standard, every burst we transmitted to a particular user must be a rectangle in a two-dimensional frame constructed by sub-channel and time slot. If too many bursts are backlogged at the same time, not all bursts can be sent in the next frame and additional delay occurs. In other words, the system should arrange the burst transmitted in an OFDMA frame efficiently in order to assure limit delay and maintain high throughput. Although there are previous works in resolving the packet scheduling of OFDMA bursts, we proposed a new downlink map allocated algorithm to decide the maximum information bits which can be transmitted in one OFDMA frame by using the technique of genetic algorithm and heuristic pallet loading algorithm. Furthermore, we consider various QoS requirements for different applications in OFDMA wireless communication systems. For this purpose, we combine QoS and allocation algorithm to make the proposed design more practical. The simulation results show that we can allocate at least 86% of slots in an OFDMA frame when the number of genetic generations is more than 5. Moreover, we can execute less times in genetic algorithm to reduce the computational time when there are too many packets in the buffer. In addition, we successfully adopt the stochastic-network-server model to estimate the resulting packet delay. Comparing with deterministic-network-server model, our stochastic-network-server model can provide predictions more explicitly about its probabilistic behavior of packet delay in any threshold. | en |
dc.description.provenance | Made available in DSpace on 2021-06-15T04:49:14Z (GMT). No. of bitstreams: 1 ntu-99-R96942121-1.pdf: 1800971 bytes, checksum: b9663ef01895831d91353282cdbf0518 (MD5) Previous issue date: 2010 | en |
dc.description.tableofcontents | 口試委員會審定書i
誌謝 i Abstract ii 摘要 iv Contents v Chapter 1 Introduction 1 1.1 Motivation and Background 1 1.2 Related Works 2 1.3 Problem Description and Research Goal 4 1.4 Organization of the Thesis 5 Chapter 2 System Architecture and Algorithm 6 2.1 System Architecture 6 2.1.1 QoS Scheduler 7 2.1.2 Downlink Map Allocator 8 2.1.3 Modulation Decision and OFDMA Modulation 10 2.2 Downlink Map Allocated Algorithm 13 2.2.1 Rule of Pallet Loading Algorithm 14 2.2.2 Operation of the Genetic Algorithm 20 Chapter 3 Packet Delay and System Performance Analysis 25 3.1 Analysis of the Deterministic-Network-Server Model 25 3.1.1 Characterization of Traffic Stream and Server 25 3.1.2 Upper Bound of Packet Delay 26 3.2 Analysis of the Stochastic-Network-Server Model 28 3.2.1 Assumption of the Stochastic Server Model 29 3.2.2 System State and Notations 30 3.2.3 Calculation of Transition Matrix 32 3.2.4 Packet Delay Analysis 36 Chapter 4 Simulation Results and Performance Comparison 40 4.1 Assumptions and Parameters of the Simulation 40 4.2 Downlink map Allocated Algorithm Performance Analysis 42 4.3 Verification of Deterministic-Network-Server Model 53 4.4 Verification of Stochastic-Network-Server Model 57 4.5 Comparison of Different Models 62 Chapter 5 Conclusions 64 5.1 Conclusions 64 5.2 Future works 65 References 69 | |
dc.language.iso | en | |
dc.title | 考慮服務品質與訊框分配之OFDMA排程演算法 | zh_TW |
dc.title | QoS Consideration and Frame Allocation Algorithm for OFDMA Scheduling | en |
dc.type | Thesis | |
dc.date.schoolyear | 98-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 李揚漢,孫雅麗,林宗男,謝宏昀 | |
dc.subject.keyword | 服務品質,正交分頻多工存取,排程, | zh_TW |
dc.subject.keyword | QoS,OFDMA,Scheduling,802.16e, | en |
dc.relation.page | 72 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2010-08-03 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-99-1.pdf 目前未授權公開取用 | 1.76 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。