近年來，隨著無線網路的廣泛使用，服務品質已成為非常重要的課題。但相對於有線網路，由於無線訊號的不穩定性，在無線網路中提供穩定的服務將會比在有線網路下更加困難。目前，公平排程是已提出的一種提供服務品質的機制。在無線網路下，大部份公平排程的方法主要是解決無線訊號不穩定性的問題。然而，這些方法都只考慮藉由事後補償由於無線訊號不穩定性所損失的公平性，來提升長期的公平性。因此，在此篇論文，我們提出一個公平排程的演算法，稱之為合作式公平排程Cooperative Fair Queueing (COFQ)。其中，主要利用合作式通訊的特性去同時加強長期以及短期的公平性。此外，因為我們考慮採用頻段的再利用 (Spatial Reuse) 的概念來達成合作式通訊，所以分群機制是必須的。因此，我們針對集中式協調為基礎的合作式網路提出一個分群演算法。接著，我們提出一些方式整合分群演算法與公平排程演算法，來儘量避免各個節點之間所產生的干擾。還有，我們整合圖形理論中的著色問題，來改進我們所提出的公平排程演算法，以避免各個群體之間所引致的干擾。最後，我們以模擬來比較我們所提出的方法與目前已提出的公平排程機制---理想性無線公平排程Idealized Wireless Fair Queueing (IWFQ) 之間的效能，模擬的結果亦支持我們所提出的方法可以達到更高的效能。

In recent years, Quality of Service (QoS) has become an important issue. Due to the lack of wireless channel stability, QoS in wireless networks is more challenging than that in wireline networks. In the literature, fair scheduling is one of two mechanisms to provide quality of service. Most fair scheduling algorithms in wireless networks mainly solve the problem of wireless channel errors. However, these works only consider improving the long-term fairness by compensating for the loss of fairness due to channel errors. Therefore, in this work,
we proposed a fair scheduling algorithm, Cooperative Fair Queueing (COFQ), exploiting cooperative communication to enhance both the short-term and long-term fairness. Then we
integrate graph coloring into fair scheduling algorithm to improve performance in polling based cooperative networks. Moreover, we exploit the property of spatial reuse to achieve cooperative communication, so we think that dividing nodes into groups is needed. Hence, we propose a grouping algorithm used in polling-based cooperative networks. Then we propose three methods to integrate grouping algorithm into fair scheduling algorithm. We use simulations to compare the performance between our proposed methods and Idealized Wireless Fair Queueing (IWFQ). By simulation results, we can show that our proposed COFQ
outperforms IWFQ no matter in throughput, delay or jitter.

[1] A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing
algorithm,” in Proc. of ACM SIGCOMM, pp. 1–12, 1989.
[2] A. Parekh and R. Gallager, “A generalized processor sharing approach to flow control
in integrated services network: The single node case,” IEEE/ACM Trans. Networking,
vol. 1, pp. 344–357, June 1993.
[3] J. C. R. Bennett and H. Zhang, “WF2Q: Worst-case fair weighted fair queueing,” in
Proc. of IEEE INFOCOM, pp. 120–128, 1996.
[4] P. Goyal, H. M. Vin, and H. Cheng, “Start-time fair queueing: A scheduling algorithm
for integrated services packet switching networks,” IEEE/ACM Trans. Networking,
vol. 5, Oct. 1997.
[5] S. Golestani, “A self-clocked fair queueing scheme for broadband applications,” in
Proc. of IEEE INFOCOM, pp. 636–646, August 1994.
[6] S. Lu, V. Bharghavan, and R. Srikant, “Fair scheduling in wireless packet networks,”
IEEE/ACM Trans. Networking, vol. 7, pp. 473–489, Aug. 1999.
[7] T. Eugene, “Packet fair networks queueing algorithms for wireless with locationdependent
errors,” in Proc. of IEEE INFOCOM, pp. 1103–1111, Mar. 1998.
[8] P. Ramanathan and P. Agrawal, “Adapting packet fair queueing algorithms to wireless
networks,” in Proc. of MobiCom, pp. 1–9, 1998.
[9] J. Laneman, D. Tse, and G.Wornell, “Cooperative diversity in wireless networks: Efficient
protocols and outage behavior,” IEEE Trans. Inform. Theory, vol. 50, pp. 3062–
3080, Dec. 2004.
[10] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversitypart I: System
description and User cooperation diversitypart II: Implementation aspects and performance
analysis,” IEEE Trans. Commun., vol. 51, Nov. 2003.
[11] A. Scaglione and Y.-W. Hong, “Opportunistic large arrays: Cooperative transmission
in wireless multi-hop ad hoc networks for the reach back channel,” IEEE Trans. Signal
Processing, vol. 51, Aug. 2003.
[12] J. Gronkvist, “Novel assignment strategies for spatial reuse TDMA in wireless ad hoc
networks,” Springer Wireless Networks, vol. 12, April 2006.
[13] P. Djukic and S. Valaee, “Link scheduling for minimumdelay in spatial re-use TDMA,”
in Proc. of IEEE INFOCOM, 2007.
[14] T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New
York: McGraw-Hill, 1990.
[15] D. W. Matula, G. Marble, and J. F. Issacson, “Graph coloring algorithms,” Graph
Theroy and Computing. New York: Academic, 1972.
[16] A. Wigderson, “Improving the performance guarantee for approximation graph coloring,”
J. ACM, vol. 30, pp. 729–735, Oct. 1983.
[17] S. Ramanathan and E. L. Lloyd, “Scheduling algorithms for multihop radio networks,”
IEEE/ACM Trans. Networking, vol. 1, April 1993.
[18] H. Luo, P. Medvedev, J. Cheng, and S. Lu, “A self-coordinating approach to distributed
fair queueing in ad hoc wireless networks,” in Proc. of IEEE INFOCOM, vol. 3,
pp. 1370–1379, April 2001.
[19] H.-L. Chao and W. Liao, “Fair scheduling in mobile ad hoc networks with channel
errors,” IEEE Trans. Wireless Commun., vol. 4, pp. 1254–1263, May 2005.
[20] H.-L. Chao and W. Liao, “Fair scheduling with QoS support in ad hoc wireless networks,”
IEEE Trans. Wireless Commun., vol. 3, pp. 2119–2128, Nov. 2004.
[21] C. Prohazka, “Decoupling link scheduling constraints in multihop packet radio networks,”
IEEE Trans. Computers, vol. 38, pp. 455–456, March 1989.
[22] H. Spath, Cluster dissection and analysis. London, U.K.: Ellis Horwood, 1985.
[23] M. Pandit, L. Srivastava, and J. Sharma, “Contingency ranking for voltage collapse
using parallel self-organizing hierarchical neural network,” Int. J. Elect. Power Energy
Syst., vol. 23, pp. 369–379, 2001.
[24] L. Dias, J. P. Costa, and J. N. Climaco, “A parallel approach to the analytic hierarchy
process decision support tool,” Comput. Syst. Eng., vol. 6, pp. 431–436, 1995.
[25] D. W. Matula, “k-Components, clusters and slicings in graphs,” SIAM J. Appl. Math,
vol. 22, no. 3, pp. 459–480, 1972.
[26] Z. Wu and R. Leahy, “An optimal graph theoretic approach to data clustering: theory
and its application to image segmentation,” IEEE Trans. Pattern Analysis Machine
Intelligence, vol. 15, no. 11, pp. 1101–1113, 1993.
[27] E. Hartuv, R. Shamir, “A clustering algorithm based on graph connectivity,” Information
Processing Letters, vol. 76, pp. 175–181, 2000.
[28] R. S. Michalski and R. Stepp, “Learning from observation,” Machine Learning: An
Artificial Intelligency Approach, pp. 163–190, 1983.
[29] D.W.Matula, “Determining edge connectivity in O(nm),” in Proc. of IEEE Symposium
on Foundations of Computer Science, pp. 249–251, 1987.
[30] H. Nagamochi and T. Ibaraki, “Computing edge connectivity in multigraphs and capacitated
graphs,” SIAM J. Discrete Math., pp. 54–66, 1992.
[31] D. Karger, “Minimum cuts in near-linear time,” in Proc. of STOC, 1996.
[32] “The Network Simulator - ns-2.” http://www.isi.edu/nsnam/ns/.
[33] M. Zorzi, R. R. Rao, and L. B.Milstein, “On the accuracy of a firstorderMarkovModel
for data transmission on fading channels,” in Proc. of IEEE ICUPC, pp. 211–215, Nov.
1995.