下載電子全文宣告This thesis is authorized to indicate not accessible
You can not download at the moment.
Your IP address is 126.96.36.199
The defense date of the thesis is 2014-02-12
The current date is 2019-04-25
This thesis will be accessible at off-campus not accessible
URN etd-0212114-131621 Statistics This thesis had been viewed 980 times. Download 0 times. Author Yueh-Chin Chen Author's Email Address No Public. Department Computer Science and Enginerring Year 2013 Semester 1 Degree Master Type of Document Master's Thesis Language English Page Count 32 Title Study of LTE Wireless Network Scheduling Keyword HUIPAD LTE QoS Urgency Leven Urgency Leven QoS LTE HUIPAD Abstract User demands for wireless transmission and quality reception have spurred an unprecedented evolution in wireless communication. Development of a new generation of 4G communication system with Long Term Evolution (LTE) is highly favored. LTE provides Quality of Service (QoS) quick connect with high mobility and safety of multimedia services. At present, there are many research papers exploring the challenge of LTE scheduling algorithm. In the scheduling of the LTE network, multiplexing mechanism is a combination of data from different multiple logical channels transmitted in the same transmission channel for an efficient transmission. Especially in the multiplexing mechanism technology can effectively save the network bandwidth of source end and reduce extra network processing costs. In the many-to-many date transmission, we may encounter priority scheduling problems. For example, the same of data type of Qos transmitted from different source ends may have different emergency demands. This paper is based on the LTE network system, which utilizes Urgency Index (UI) of Urgency Leven and the scheduling algorithm of the Proportional Average Delay (PAD) to provide a better solution to the demand problem. Therefore, we call it the UI and PAD (HUIPAD). The resulting data of the simulation reveals that the proposed modification of the HUIPAD scheduling method can reduce the average packet waiting time in the waiting queue for the user. Advisor Committee Chia-Sheng Tsai - advisor
Files Date of Defense 2014-01-20 Date of Submission 2014-02-12