Interference Avoidance in Cooperative Networks by Grouping and Scheduling

• Main Authors: Jui-Yi Chen, 陳叡儀
• Other Authors: Jyh-Cheng Chen
• Format: Others
• Language: en_US
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/57779718909132775214

碩士 === 國立清華大學 === 通訊工程研究所 === 96 === 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.