Gap based scheduling algorithm with relay selection and resource allocation in cooperative OFDMA networks

In order to meet requirements for wireless networks, nowadays the radio interface of several standards is enhanced with advanced technologies such as OFDMA and extension technology such as relay. When we combine these two approaches which are considered the most promising transmission technology for the next generation wireless communications, the scheduling problem becomes more crucial and challenging. In this paper we propose a Gap- based scheduling algorithm that aims to maximizing the overall system capacity while selecting the most suitable relay station under fairness constraint among both users and relay stations. This scheduling algorithm considers the channel state information and the unbalanced rate capacity of the two hops links.