Responsive image
博碩士論文 etd-0920120-102613 詳細資訊
Title page for etd-0920120-102613
論文名稱
Title
在MTC網路使用背包演算法的即時性封包排程機制
A Real-Time Packet Scheduling Mechanism Using Knapsack Algorithms for MTC Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
75
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2020-10-06
繳交日期
Date of Submission
2020-10-20
關鍵字
Keywords
MTC、DRX、即時性封包、封包遺失率、系統傳輸率
MTC, packet loss ratio, real-time packets, DRX, system throughput
統計
Statistics
本論文已被瀏覽 234 次,被下載 2
The thesis/dissertation has been browsed 234 times, has been downloaded 2 times.
中文摘要
3GPP (Third Generation Partnership Project)所提出的非連續接收(Discontinuous Reception, DRX)機制無法在機器型態通訊(Machine Type Communications, MTC)的網路環境下解決即時性(Real-Time)封包從基地台傳送給機器的問題,因此本論文提出一個即時封包排程演算法(RTPSA),在DRX中,一個機器的狀態被分為三種,分別為醒來接收狀態、短睡狀態、長睡狀態,在RTPSA中,我們將緩衝區分為四種,分別為傳送緩衝區、等待緩衝區、短睡緩衝區、長睡緩衝區。傳送緩衝區的目的是儲存機器處於醒來接收狀態的封包,等待緩衝區是暫存被喚醒的機器的封包以便根據緩衝區內封包的時間限制 (Time Constraint)來做排程。RTPSA首先會根據一個機器目前處於短睡或長睡的狀態將這個機器的封包放入短睡或長睡緩衝區,假如一個短睡或長睡的機器被喚醒時,RTPSA會將它的封包從短睡或長睡放入等待緩衝區,當等待緩衝區的封包超過傳送緩衝區的容量時,RTPSA會將等待緩衝區的封包根據封包的時效性從近排到遠,再將排序過後的封包根據傳送緩衝區的容量移入傳送緩衝區,其目的是為了避免封包還未傳送前就因時效性中止而被丟棄。我們使用Network Simulator version 3 (NS-3)來模擬所提出的RTPSA,在模擬過程中,我們改變機器的數目、機器睡眠時間的長短、封包產生的時間間隔、封包大小來證明RTPSA能夠有效降低即時性封包的遺失率、提高系統傳輸率並顯著改善即時性封包的佇列長度。
Abstract
Discontinuous Reception (DRX) mechanism proposed by 3GPP (Third Generation Partnership Project) cannot solve the problem of real-time packets transmitted from a base-station to a machine. Therefore, this thesis endeavors to solve the real-time packet problems in Machine-Type Communication (MTC) networks. In MTC networks, we propose a real-time packet scheduling algorithm (RTPSA). In DRX, the state of a machine is divided into three types, namely, active state, short-sleep State, and long-sleep state. Accordingly, in RTPSA, we design four types of buffers for the machines, namely, the transmission buffer, the waiting buffer, the short-sleep buffer, and the long-sleep buffer. The purpose of the transmission buffer is to store the packets that a machine is in the active state, and the purpose of the waiting buffer is to temporarily store the packets of an awakened machine. First, RTPSA will place the packets of a machine into the short-sleep or long-sleep buffer according to the state of a machine. If a short-sleep or a long-sleep machine is awakened, RTPSA will move its packets to the waiting buffer. When the packets in the waiting buffer exceed the capacity of the transmission buffer, RTPSA will do the packet resequencing according to their time constraints. Packet resequencing in the waiting buffer can avoid the possible packet loss due to the exceeded time constraints. We use network simulator version 3 (NS-3) to simulate the proposed RTPSA. In the simulation, we vary the number of machines, the lengths of sleeping time, and the intervals of packet generation, to demonstrate that the proposed RTPSA can effectively reduce the loss ratio and queuing lengths of real-time packets and significantly improve the system throughput.
目次 Table of Contents
論文審定書 i
致謝 ii
摘要 iii
Abstract iv
目錄 v
圖目錄 vii
表目錄 viii
第一章 導論 1
1.1研究動機 1
1.2研究方法 2
1.3章節介紹 3
第二章 MTC網路與封包即時性 4
2.1 MTC的網路架構 4
2.2 ODFMA Frame 6
2.3 DRX機制 9
2.3.1 DRX的模式與狀態 9
2.3.2 DRX的運作方式 10
2.4 排程演算法 11
2.5系統傳輸率 15
2.6相關研究 16
第三章 在MTC網路下的即時封包排程演算法 21
3.1遞迴睡眠機制 21
3.1.1 eNodeB運作的流程 21
3.1.2 Machine運作的流程 24
3.2 修改的背包模組 26
第四章 模擬與結果 30
4.1 NS-3模擬拓樸 30
4.2 增加與修改NS-3的模組 31
4.2.1 Traffic Generator 32
4.2.2 eNodeB的Buffer 34
4.2.3 eNodeB傳送 38
4.2.4 M-Knapsack模組 39
4.2.5 DRX機制 42
4.3 模擬參數的設定 45
4.4 模擬結果與討論 46
4.4.1 改變machines的數目 46
4.4.2 改變封包產生的時間間隔 48
4.4.3 改變封包的大小 51
第五章 結論與未來工作 55
5.1結論 55
5.2遭遇的困難 56
5.3未來工作 56
Reference 57
Acronyms 62
Index 64
參考文獻 References
[1] “Service requirements for Machine-Type Communications (MTC),” France, 3GPP TS 22.368, ver. 14.0.1, Oct. 2017.
[2] “Dynamically variable rate QoS requirements,” France, 3GPP TSGS1#4(99)529, Jul. 1999.
[3] S. Srikanth, P. A. M. Pandian, and X. Fernando, “Orthogonal Frequency Division Multiple Access in WiMAX and LTE: A Comparison,” IEEE Access, Vol. 50, pp. 153-161, Sep. 2012.
[4] S.Uygungelen, Z.Bharucha, and H.Taoka, “Control Region Protection in LTE-A Networks,” 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC), Australia, pp. 1-6, Sep. 2012
[5] “LTE: Evolved Universal Terrestrial Radio Access (E-UTRA), LTE Physical Layer, General Description,” France, 3GPP TS 36.201, ver. 10.0.0, Jan. 2011.
[6] “3rd Generation Partnership Project, Technical Specification Group Radio Access Network, Evolved Universal Terrestrial Radio Access (E-UTRA), Multiplexing and Channel Coding,” France, 3GPP TS 36.212, ver. 12.4.0, Mar. 2015.
[7] “Universal Communications Identifier (UCI); Results of a Detailed Study into the Technical Areas for Identification Harmonization; Recommendations on the UCI for NGN,” France, ETSI EG 203 072, ver. 1.1.1, Nov. 2003.
[8] “LTE: Evolved Universal Terrestrial Radio Access (E-UTRA), Medium Access Control (MAC) Protocol Specification,” France, 3GPP TS 36.321, ver. 8.3.0, Nov. 2008.
[9] “LTE: Evolved Universal Terrestrial Radio Access (E-UTRA), Radio Resource Control (RRC), Protocol Specification,” France, 3GPP TS 36.331, ver. 15.3.0, Oct.2018.
[10] 劉真君, “在LTE-MTC網路使用遞迴睡眠週期與主動叫醒的省電機制,” 國立中山大學電機系碩士論文, 2018年7月.
[11] M. Koyuncu and H. AL-Fayyadh, “Comparison of Scheduling Algorithms for Multimedia Applications in IPv4 and IPv6,” 2015 9th International Conference on Application of Information and Communication Technologies (AICT), Russia, pp. 1-5, Nov. 2015.
[12] A. Proskochylo, M. Zriakhov, and A. Akulynichev, “The Effects of Queueing Algorithms on QoS for Real-Time Traffic in Process of Load Balancing,” 2018 International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T), Ukraine, pp. 1-6, Oct. 2018.
[13] T. Balogh and M. Medvecký, “Performance Evaluation of WFQ, WF2Q+ and WRR Queue Scheduling Algorithms,” 2011 34th International Conference on Telecommunications and Signal Processing (TSP), Hungary, pp. 1-5, Aug. 2011.
[14] S. Noda and Katsunori Yamaoka, “Approach to Optimal WRR Weight Assignment Method in Delay-Limited Environment,” 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC), USA, pp. 1-6, Jan. 2016
[15] N. Ferdosian, M. Othman, B. M. Ali, and K. Y. Lun, “Multi-Targeted Downlink Scheduling for Overload-States in LTE Networks: Proportional Fractional Knapsack Algorithm With Gaussian Weights,” IEEE Access, Vol. 5, pp. 3016-3027, Feb. 2017.
[16] 蔡文能, “Greedy Algorithm, Dynamic Programming Algorithm,” 交通大學資訊工程學系, May. 2003.
[17] “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Feasibility Study for OFDM for UTRAN Enhancement,” France, 3GPP TR 25.892, Mar. 2004.
[18] 徐明煒, “改善無線串流服務:訊框丟棄與封包遺失原因之區分演算法,” 國立臺灣大學資訊工程學研究所碩士論文, 2004年7月.
[19] Ying-Dar Lin, Ren-Hung Hwang, and Fred Baker,” Computer Networks : An Open Source Approach”, Jan. 2011.
[20] W. Stallings, “Computer Networking With Internet Protocols And Technology,” Jan. 2006.
[21] M. Tabassum, K. M. Tikoicina, and E.Huda, “Comparative Analysis of Queuing Algorithms and QoS Effects on the IoT Networks Traffic,” 2018 8th IEEE International Conference on Control System, Computing and Engineering (ICCSCE), Malaysia, pp. 1-5, Nov. 2018.
[22] H. B. Rekhissa, C. Belleudy, and P. Bessaguet, “Power Efficient Packet Scheduling for M2M Devices over LTE/LTE-A Technologies,” 2019 IEEE 24th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), Cyprus, pp. 1-4, Sep. 2019.
[23] K. Kaewmongkol, A. Jansang, and A. Phonphoem, “Delay-aware with Resource Block Management Scheduling Algorithm in LTE,” 2015 International Computer Science and Engineering Conference (ICSEC), Thailand, pp. 1-6, Nov. 2015.
[24] D. Nguyen, H. Nguyen, and É. Renault, “Performance Evaluation of E-MQS Scheduler with Mobility in LTE Heterogeneous Network,” 2017 IEEE International Conference on Communications (ICC), France, pp. 1-6, May 2017.
[25] Y. Z. Bekele and Y. Choi, “Scheduling for Machine Type Communications in LTE Systems,” 2018 International Conference on Information and Communication Technology Convergence (ICTC), South Korea, pp. 1-3, Nov. 2018.
[26] W. U. Rehman, T. Salam, A. Almogren, K. Haseeb, I. U. Din, and Safdar Hussain Bouk, “Improved Resource Allocation in 5G MTC Networks,” IEEE Access, Vol. 8, pp. 49187-49197, Feb. 2020.
[27] H. Haci and A. Abdelbari, “A Novel Scheduling Scheme for Ultra-Dense Networks,” 2019 International Symposium on Networks, Computers and Communications (ISNCC), Turkey, pp. 1-6, Nov. 2019.
[28] M. Li and H. Chen, “Energy-Efficient Traffic Regulation and Scheduling for Video Streaming Services Over LTE-A Networks,” IEEE Access, Vol. 18, pp. 334-347, May 2018.
[29] C. Ramesh and K. Gangatharan, “Scheduling Aware DRX Cycle Activation in LTE System,” 2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC), USA, pp. 1-2, Jan. 2017.
[30] J. Liang, C. Hsu, J. Chen, K. Wu, and Y. Tseng, “Three-Stage DRX Scheduling for Joint Downlink Transmission in C-RAN,” IEEE Wireless Communications Letters, Vol. 9, pp. 129-133, Sep. 2018.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:開放下載的時間 available 2025-10-20

您的 IP(校外) 位址是 18.118.126.241
現在時間是 2024-05-11
論文校外開放下載的時間是 2025-10-20

Your IP address is 18.118.126.241
The current date is 2024-05-11
This thesis will be available to you on 2025-10-20.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code