HYBRID ROUTING AND MULTICAST SCHEDULING ALGORITHMS FOR OFDMA RELAY NETWORKS

In era of technology, Wireless communication domain growing rapidly due to user mobility & different business operator to deploy Multicast & Broadcast based applications combining video, voice & text. To compute with it; two hop Orthogonal Frequency Division Multiple Access (OFDMA) relay network are being efficiently used in combination with Multicasting which forms a promising communication model for many multiparty applications. We can achieve multiplexing gains in OFDMA network by certain multicast strategy. Grouping of relay network and cooperation between them is one way of multicast strategy. For effective use of relay network, grouping and scheduling for the same must be carried out in intelligent manner. Different scheduling algorithms have been used for different relay network to maximize the multicast flow. While using the scheduling algorithm for OFDMA relay network we have notice the problem of multicast transmission between networks when failure occurs. To solve the problem of multicast transmission when failure occurs one must use dynamic method to choose different path i.e. routing dynamically over the network. Relay network group themselves and cooperate between, also reporting for the failure

CLUSTER BASED ROUTING AND MULTICAST SCHEDULING ALGORITHMS FOR RELAY NETWORKS

The rapid development of audio and video applications such as Skype and YouTube increases people’s demands for ubiquitous high-data-rate coverage. We used Orthogonal Frequency Division Multiple Access (OFDMA) relay-enhanced cellular network, the integration of multi hop relaying with OFDMA infrastructure, has become one of the most promising solutions for next-generation wireless communications. We propose a collaborative multi-hop routing algorithm combined with clustering to improve network performance. To build the multi-hop routing with maximum achievable rate. the result shows that it balances the load of the network and deals with the change effectively of the network topology, and also improves the reliability, throughput and stability of the network efficiently

Joint relay selection and bandwidth allocation for cooperative relay network

Cooperative communication that exploits multiple relay links offers significant performance improvement in terms of coverage and capacity for mobile data subscribers in hierarchical cellular network. Since cooperative communication utilizes multiple relay links, complexity of the network is increased due to the needs for efficient resource allocation. Besides, usage of multiple relay links leads to Inter- Cell Interference (ICI). The main objective of this thesis is to develop efficient resource allocation scheme minimizes the effect of ICI in cooperative relay network. The work proposed a joint relay selection and bandwidth allocation in cooperative relay network that ensures high achievable data rate with high user satisfaction and low outage percentage. Two types of network models are considered: single cell network and multicell network. Joint Relay Selection and Bandwidth Allocation with Spatial Reuse (JReSBA_SR) and Optimized JReSBA_SR (O_JReSBA_SR) are developed for single cell network. JReSBA_SR considers link quality and user demand for resource allocation, and is equipped with spatial reuse to support higher network load. O_JReSBA_SR is an enhancement of JReSBA_SR with decision strategy based on Markov optimization. In multicell network, JReSBA with Interference Mitigation (JReSBA_IM) and Optimized JReSBA_IM (O_JReSBA_IM) are developed. JReSBA_IM deploys sectored-Fractional Frequency Reuse (sectored- FFR) partitioning concept in order to minimize the effect of ICI between adjacent cells. The performance is evaluated in terms of cell achievable rate, Outage Percentage (OP) and Satisfaction Index (SI). The result for single cell network shows that JReSBA_SR has notably improved the cell achievable rate by 35.0%, with reduced OP by 17.7% compared to non-joint scheme at the expense of slight increase in complexity at Relay Node (RN). O_JReSBA_SR has further improved the cell achievable rate by 13.9% while maintaining the outage performance with reduced complexity compared to JReSBA_SR due to the effect of optimization. The result for multicell network shows that JReSBA_IM enhances the cell achievable rate up to 65.1% and reduces OP by 35.0% as compared to benchmark scheme. Similarly, O_JReSBA_IM has significantly reduced the RN complexity of JReSBA_IM scheme, improved the cell achievable rate up to 9.3% and reduced OP by 1.3%. The proposed joint resource allocation has significantly enhanced the network performance through spatial frequency reuse, efficient, fair and optimized resource allocation. The proposed resource allocation is adaptable to variation of network load and can be used in any multihop cellular network such as Long Term Evolution-Advanced (LTE-A) network

Uplink scheduling algorithms for the rtPS traffic class for IEEE 80216 networks

Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2008.Thesis (Master's) -- Bilkent University, 2008.Includes bibliographical references leaves 83-86.IEEE 802.16 MAC provides extensive bandwidth allocation and QoS mechanisms for various types of applications. However, the scheduling mechanisms for the uplink and downlink are unspecified by the IEEE 802.16 standard and are thus left open for vendors’ own implementations. Ensuring QoS requirements at the MAC level for different users with different QoS requirements and traffic profiles is also another challenging problem in the area. The standard defines five different scheduling services one of them being the real-time Polling Service (rtPS). In this thesis, we propose an uplink scheduler to be implemented on the WiMAX Base Station (BS) for rtPS type connections. We propose that the base station maintains a leaky bucket for each rtPS connection to police and schedule rtPS traffic for uplink traffic management. There are two scheduling algorithms defined in this study: one is based on a simpler round robin scheme using leaky buckets for QoS management, whereas the other one uses again leaky buckets for QoS management but also a proportional fair scheme for potential throughput improvement in case of varying channel conditions. The proposed two schedulers are studied via simulations using MATLAB to demonstrate their performance in terms of throughput, fairness and delay. We show that the leaky bucket based scheduler ensures the QoS commitments of each user in terms of a minimum bandwidth guarantee whereas the proportional fair algorithm is shown to opportunistically take advantage of varying channel conditions.Ertürk, Mustafa CenkM.S

Packet scheduling in satellite LTE networks employing MIMO technology.

Doctor of Philosophy in Electronic Engineering. University of KwaZulu-Natal, Durban 2014.Rapid growth in the number of mobile users and ongoing demand for different types of telecommunication services from mobile networks, have driven the need for new technologies that provide high data rates and satisfy their respective Quality of Service (QoS) requirements, irrespective of their location. The satellite component will play a vital role in these new technologies, since the terrestrial component is not able to provide global coverage due to economic and technical limitations. This has led to the emergence of Satellite Long Term Evolution (LTE) networks which employ Multiple-In Multiple-Out (MIMO) technology. In order to achieve the set QoS targets, required data rates and fairness among various users with different traffic demands in the satellite LTE network, it is crucial to design an effective scheduling and a sub-channel allocation scheme that will provide an optimal balance of all these requirements. It is against this background that this study investigates packet scheduling in satellite LTE networks employing MIMO technology. One of the main foci of this study is to propose new cross-layer based packet scheduling schemes, tagged Queue Aware Fair (QAF) and Channel Based Queue Sensitive (CBQS) scheduling schemes. The proposed schemes are designed to improve both fairness and network throughput without compromising users’ QoS demands, as they provide a good trade-off between throughput, QoS demands and fairness. They also improve the performance of the network in comparison with other scheduling schemes. The comparison is determined through simulations. Due to the fact that recent schedulers provide a trade-off among major performance indices, a new performance index to evaluate the overall performance of each scheduler is derived. This index is tagged the Scheduling Performance Metric (SPM). The study also investigates the impact of the long propagation delay and different effective isotropic radiated powers on the performance of the satellite LTE network. The results show that both have a significant impact on network performance. In order to actualize an optimal scheduling scheme for the satellite LTE network, the scheduling problem is formulated as an optimization function and an optimal solution is obtained using Karush-Kuhn-Tucker multipliers. The obtained Near Optimal Scheduling Scheme (NOSS), whose aim is to maximize the network throughput without compromising users’ QoS demands and fairness, provides better throughput and spectral efficiency performance than other schedulers. The comparison is determined through simulations. Based on the new SPM, the proposed NOSS1 and NOSS2 outperform other schedulers. A stability analysis is also presented to determine whether or not the proposed scheduler will provide a stable network. A fluid limit technique is used for the stability analysis. Finally, a sub-channel allocation scheme is proposed, with the aim of providing a better sub-channel or Physical Resource Block (PRB) allocation method, tagged the Utility Auction Based (UAB) subchannel allocation scheme that will improve the system performance of the satellite LTE network. The results show that the proposed method performs better than the other scheme. The comparison is obtained through simulations