蜂巢式網路(Cellular Networks)中的基地台(Base Station)需要滿足不同使用者的服務需求，在每一個時程假設每一位使用者對於頻道的SNR狀況呈現I.I.D.，基地台必須選擇適當的頻道(Channel)傳輸速率。採用機會式排程(Opportunistic Scheduling)方式並依據當時情況，讓基地台規劃每一次頻道的傳輸速率，以符合大多數使用者需求，增加系統效益。
在正交分頻多工(Orthogonal Frequency Division Multiplexing)系統中，我們套用Integer Programming概念在I.I.D.環境下逼近最佳解，基地台可以依照使用者該次時程的通道狀態資訊(channel state information)，了解使用者目前可接受的最高傳輸速率為何。基於有限封包長度(finite length)，假設使用者收到足夠的編碼封包，就能夠還原訊息，完成使用者的需求。我們設計出一套演算法可讓基地台依據使用者封包的收取狀況制定優先權，優先權高的使用者群即可決定此次時程的頻道傳輸速率。
最後經由實驗模擬結果顯示，此演算法可讓整體系統在每一個時程能夠彈性地服務和選擇適當傳輸速率，另外不管是在多少人數環境底下，整體系統花費的時程以及整體系統throughput都呈現很好的效益。

We consider opportunistic scheduling for multicasting stream fragments over OFDM downlink channels in a single cell. Assume that channel states are i.i.d. and available at the base station through uplink channel feedback. Furthermore, assume that each finite length message fragment has been erasure-encoded into packets such that the user is able to decode and obtain the original fragment when receiving no less than K packets. Under such a system and assumptions, it is important for the opportunistic multicast scheduler to determine an appropriate instantaneous channel rate to achieve the shortest time required to ensure all users able to decode a sending fragment. We resort to a weighting function to divide the set of multicast users into two subsets. One subset contains users whose services are critical for system performance. The other subset contains the rest. Each channel transmission rate is then determined from the critical subset of users. We study the effect of the partition factor for dividing the set of users on the system performance through simulations.

[1] Quang Le-Dang, Tho Le-Ngoc, and Quang-Dung Ho, “Opportunistic Multicast Scheduling with Erasure-Correction Coding over Wireless Channels,” in Proc. 2010 IEEE ICC.
[2] Jianwei Huang, Vijay G. Subramanian and Rajeev Agrawal, Randall Berry, “Downlink Scheduling and Resource Allocation for OFDM Systems,” IEEE Trans. Wireless Commun., vol. 8, no.1, pp. 288-296, Jan. 2009.
[3] Quang-Dung Ho and Tho Le-Ngoc, “Adaptive Opportunistic Multicast Scheduling Over Next-Generation Wireless Networks,” Wireless Pers Commun, pp. 483-500, 2012.
[4] Wen Huang and Kwan L. Yeung, “On Maximizing the Throughput of Opportunistic Multicast in Wireless Cellular Networks with Erasure Codes,” in Proc. 2011 IEEE ICC.
[5]D.J.C. MacKay, “Fountain Codes,” IEE Proc.-Commun. vol.52, no.6, pp. 1062-1068, Dec. 2005.
[6] Stephen B. Wicker and Vijay K. Bhargava ,Reed-Solomon Codes and Their Applications, Wiley-IEEE Press, 1999.
[7] U. C. Kozat,“On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes,” in Proc. 2008 IEEE INFOCOM, pp.1193-1201.
[8] Hua Chen and John S. Baras, “A Distributed Opportunistic Scheduling Protocol for Multi-Channel Wireless Ad-Hoc Networks,” in Proc. 2012 IEEE GLOBECOM, pp. 292-297.
[9] Praveen Kumar Gopala and Hesham El Gamal,“Opportunistic Multicasting,” in Proc. the Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, Nov. 2004.
[10]Guocong Song and Ye Li, ”Utility-Based Resource Allocation and Scheduling in OFDM-Based Wireless Broadband Networks,” IEEE Commun. Mag., vol. 43, pp. 127-134, Dec. 2005.
[11]Euntaek Lim and Sehun Kim, “Transmission Rate Scheduling With Fairness Constraints in Downlink of CDMA Data Networks,” IEEE Trans. Veh. Technol., vol.54, no.1, pp. 328-337, Jan. 2005.
[12]Qi Qu and Ulas C. Kozat, “On the Opportunistic Multicasting in OFDM-based Cellular Networks,” in Proc. 2008 IEEE ICC, pp. 3708-3714.
[13]Q. Spencer and M. Haardt, “Capacity and downlink transmission algorithm for a multi-user MIMO channel,” in Proc. 36th Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, IEEE Computer Society Press, Nov. 2002.
[14]S. Sanayei and A. Nosratinia, “Opportunistic downlink transmission with limited feedback,” IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4363-4372, Nov. 2007.
[15]Jung-Tsung Tsai, “Transmission Rate Scheduling and Stopping for Time-Sensitive Multicast Stream Traffic in Cellular Networks,” IEEE Trans. Wireless Commun., vol. 13, no. 4, pp. 1754-1765 Apr. 2014.
[16]Youghe Liu and Edward Knightly, “Opportunistic Fair Scheduling over Multiple Wireless Channels,” in Proc. 2003 IEEE INFOCOM, pp. 1106-1115.
[17]Kent Wilken, Jack Liu, Mark Heffernan, “Optimal Instruction Scheduling Using Integer Programming,” in Proc. Assoc. Comput. Machinery Conf. Program. Language Design Implement. (PLDI), pp. 121-133, 2000.
[18]Miray Kas, Burcu Yargicoglu, Ibrahim Korpeoglu, and Ezhan Karasan, “A Survey on Scheduling in IEEE802.16 Mesh Mode,” IEEE Commun. Surveys Tutor., vol.12, no.2, pp. 205-221, Second Quarter 2010.
[19]Changho Suh, Seunghoon Park, and Youngkwon Cho, “Efficient Algorithm for Proportional Fairness Scheduling in Multicast OFDM Systems,” in Proc. IEEE Veh. Technol. Conf., vol.3, pp.1880-1884, Jun. 2005.
[20]Richard O. Afolabi, Aresh Dadlani, and Kiseon Kim, ”Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey,” IEEE Commun. Surveys Tutor., vol.15, no.1, pp. 240-254, First Quarter 2013.
[21] Andrea Goldsmith ,Wireless Communications, Cambridge University Press, 2005.
[22] W. Stallings ,Wireless Communications and Networks, ed., Prentice Hall PTR, 2004.
[23] Kaveh Pahlavan and Prashant Krishnamurthy ,Principles of Wireless Networks, Prentice Hall PTR, 2002.