在無線網路中, 資源如何有效且公平的分配是一項重要的議題。
有鑑於 IEEE 802.16 的標準中,
並未具體指定使用何種排程 (Scheduling) 方法來讓基地台 (Base Station, BS) 分配頻寬給用戶台 (Subscriber Station, SS),
本論文針對此不足, 在考量 IEEE 802.16 網路特性下,
提出二個同時兼顧服務品質 (Quality of Service, QoS) 與公平性 (Fairness) 的新排程機制。
這兩個排程機制可依照各個連線 (Connection) 的 QoS 參數與吞吐量 (Throughput) 來公平地決定該連線的優先權與可分配資源數量,
以同時提升 QoS 與公平性。
透過模擬結果顯示, 本論文所提出的排程機制於吞吐量、平均封包延遲及公平性上均可優於文獻上相近之排程機制。

In a wireless network, how to allocate resources efficiently and fairly is an important issue.
Since there are no specified scheduling mechanisms to let the base station (BS) allocate bandwidth to the subscriber station (SS) in the IEEE 802.16 standard,
we propose two new scheduling mechanisms considering the nature of IEEE 802.16,
quality of service (QoS), and fairness in this thesis.
Our proposed scheduling mechanisms can fairly determine priorities of connections and the amount of resource to be allocated according to the QoS parameters and throughput of connections so that both QoS and fairness can be enhanced.
Through simulations, we show that our proposed scheduling mechanisms can outperform the closely related mechanisms in the literature in terms of throughput, average packet delay, and fairness.

[1] IEEE 802.16-2004, “IEEE standard for local and metropolitan area networks -
Part 16: Air interface for fixed broadband wireless access systems,” 2004.
[2] IEEE 802.16e-2005, “IEEE standard for local and metropolitan area networks
Part 16: Air interface for fixed and mobile broadband wireless access systems
amendment 2: physical and medium access control layers for combined fixed
and mobile operation in licensed bands and corrigendum 1,” 2006.
[3] J. G. Andrews, A. Ghosh, and R. Muhamed, Fundamentals of WiMAX Under-
standing Broadband Wireless Networking. Prentice Hall, 2007.
[4] M. Andrews, “Probabilistic end-to-end delay bounds for earliest deadline first
scheduling,” in Proc. IEEE INFOCOM ’00, 2000, pp. 603–612.
[5] M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, P. Whiting, and R. Vi-
jayakumar, “Providing quality of service over a shared wireless link,” IEEE
Commun. Mag., vol. 39, no. 2, pp. 150–154, Feb 2001.
[6] A. Belghith and L. Nuaymi, “Design and implementation of a QoS-included
WiMAX module for NS-2 simulator,” in Proc. ICST ’08, 2008.
[7] J. Chen, W. Jiao, and H. Wang, “A service flow management strategy for IEEE
802.16 broadband wireless access systems in TDD mode,” in Proc. IEEE ICC
’05, May 2005, pp. 3422–3426.
[8] C. Cicconetti, A. Erta, L. Lenzini, and E. Mingozzi, “Performance evaluation
of the IEEE 802.16 MAC for QoS support,” IEEE Trans. Mobile Computing,
vol. 6, no. 1, pp. 26–38, Jan. 2007.
[9] P. Dhrona, N. Abu Ali, and H. Hassanein, “A performance study of scheduling
algorithms in point-to-multipoint WiMAX networks,” in Proc. IEEE LCN ’08,
Oct. 2008, pp. 843–850.
[10] J. M. Holtzman and Qualcom Inc., “Asymptotic analysis of proportional fair
algorithm,” in Proc. IEEE PIMRC ’01, 2001, pp. 33–37.
[11] R. K. Jain, D. W. Chiu, and W. R. Hawe, “A quantitative measure of fairness
and discrimination for resource allocation in shared systems,” DEC Research
Report TR-301, Sep. 1984.
[12] M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, “Weighted round-robin
cell multiplexing in a general-purpose ATM switch chip,” IEEE Selected Areas
in Communications, vol. 9, no. 8, pp. 1265–1279, Oct. 1991.
[13] H. Kim and Y. Han, “A proportional fair scheduling for multicarrier transmis-
sion systems,” in Proc. IEEE VTC ’04, Sep. 2004, pp. 210–212.
[14] E. Laias, I. Awan, and P. M. Chan, “An integrated uplink scheduler in IEEE
802.16,” in Proc. IEEE EMS ’08, Sep. 2008, pp. 518–523.
[15] J. Lakkakorpi, A. Sayenko, and J. Moilanen, “Comparison of different schedul-
ing algorithms for WiMAX base station: Deficit round-robin vs. proportional
fair vs. weighted deficit round-robin,” in Proc. IEEE WCNC ’08, April 2008,
pp. 1991–1996.
[16] J. Lin, C. Chou, and C. Liu, “Performance evaluation for scheduling algorithms
in WiMAX network,” in Proc. IEEE AINAW ’08, March 2008, pp. 68–74.
[17] H. Safa, H. Artail, M. Karam, R. Soudan, and S. Khayat, “New scheduling ar-
chitecture for IEEE 802.16 wireless metropolitan area network,” in Proc. IEEE
ACS ’07, May 2007, pp. 203–210.
[18] A. Sayenko, O. Alanen, and T. H‥ am‥ al‥ ainen, “Scheduling solution for the IEEE
802.16 base station,” Init. J. Computer and Telecommunications Networking,
vol. 52, no. 1, pp. 96–115, 2008.
[19] V. Sharma and N. Vamaney, “The uniformly-fair deficit round-robin (UF-DRR)
scheduler for improved QoS guarantees in IEEE 802.16 WiMAX networks,” in
Proc. IEEE MILCOM ’07, Oct. 2007, pp. 1–7.
[20] M. Shreedhar and G. Varghese, “Efficient fair queueing using deficit round
robin,” IEEE/ACM Trans. Networking, vol. 25, no. 4, pp. 375–385, Jun. 1996.
[21] C. So-In, R. Jain, and A. K. Tamimi, “Scheduling in IEEE 802.16e mobile
WiMAX networks key issues and a survey,” IEEE Selected Areas in Communi-
cations, vol. 27, no. 2, pp. 156–171, Feb. 2009.
[22] D. Stiliadis and A. Varma, “Latency-rate servers: a general model for analysis
of trafficscheduling algorithms,” IEEE/ACM Trans. Networking, vol. 6, pp. 611
- 624, Oct. 1998.
[23] K. Wongthavarawat and A. Ganz, “Packet scheduling for QoS support in IEEE
802.16 broadband wireless access systems,” Init. J. Communication Systems,
vol. 16, no. 1, pp. 81–96, 2003.
[24] Y. Zhang and K. B. Letaief, “Multiuser subcarrier and bit allocation along with
adaptive cell selection for OFDM transmission,” in Proc. IEEE ICC ’02, 2002,
pp. 861–865.
[25] “The Network Simulator - ns-2.” from http://www.isi.edu/nsnam/ns/.
[26] “The National Institute of Standards and Technology.” from
http://www.nist.gov/.