Traffic Sensitive and Traffic Load Aware Path Selection Algorithm For MMR WIMAX Networks

The recent developments in the broadband wireless access (BWA) communication systems have introduced several major changes to the existing systems. Legacy IEEE 802.16j is one such amendment to the existing IEEE 802.16 WiMAX family. The key modification introduced by 802.16j system is the concept of relay station (RS), which may be used to enhance the system coverage or to make system throughput optimal. The end terminals, subscriber stations (SS) are unchanged in the standard. The overall change pertinent to the system has raised many unresolved issues related to RS and multi-hop relay base station (MR-BS). The selection of path from a SS to MR-BS via a RS is also one of the issues, need to be addressed. The path selection of a SS in both uplink and downlink directions is left open in the standard. It is very significant to satisfy the traffics of stringent quality of service (QoS) requirements and to appropriately manage the resources of a cell under different circumstances. This paper proposes a path selection algorithm to achieve the aforementioned qualities in the network. The path selection metrics include traffic load of the transparent relay station and traffic sensitivity factor of the SS. An extensive simulation work discusses the performance evaluation of the proposed work using QualNet simulator

Relay Technologies in IEEE 802.16j Mobile Multi-hop Relay (MMR) Networks

IEEE 802.16 standard is created to compete with cable access networks. In the beginning end users are immobile and have a line of sight with base station, now it moved to mobile non line of sight (NLOS) with the new standard IEEE 802.16e and IEEE 802.16j. The new IEEE 802.16j standard which is an amendment to IEEE 802.16e is mobile multi hop relay (MMR) specification for wireless networks. This paper discusses relay modes, relay transmission schemes and relay pairing schemes of IEEE 802.16j. Relay technologies such as transparent relay modes, non transparent relay mode, relay pairing schemes such as centralized relay pairing schemes, distributed relay pairing scheme, characterises of relay based networks such as throughput enhancement, capacity increase, cost reduction , relay techniques such as time domain frequency domain relay techniques and relay placement are also discussed in this paper. The paper also discusses about integration of IEEE 802.16j with IEEE 802.11. Keywords: IEEE 802.16j, Relay pairing schemes, relay techniques, Relay modes, WIMAX, NCTUns, et

Adaptive frame structure and OFDMA resource allocation in mobile multi-hop relay networks

The objective of this thesis research is to optimize network throughput and fairness, and enhance bandwidth utilization in wireless mobile multi-hop relay (MMR) networks. To enhance bandwidth utilization, we propose an adaptive OFDMA frame structure which is used by the base station and the non-transparent relay stations. To optimize throughput and fairness, we develop an adaptive OFDMA allocation algorithm by using the proposed adaptive OFDMA frame. The effectiveness of the proposed schemes has been verified by numeric simulations. Providing ubiquitous coverage with wireless metropolitan area networks (WMANs) can be costly, especially in sparsely populated areas. In this scenario, cheaper relay stations (RSs) can be used to provide coverage instead of expensive base stations (BSs). The RS extends the coverage area of traditional BSs. This sort of network is known as a wireless MMR network. This thesis focuses on MMR networks that use orthogonal frequency division multiple access (OFDMA) and time division duplex (TDD) as a multiple access scheme and a duplex communication technique (e.g., WiMAX). The use of OFDMA resources (e.g., OFDMA symbols and subcarriers) and how they are shared in current schemes can reduce system capacity and network throughput in certain scenarios. To increase the capacity of the MMR network, we propose a new protocol that uses an adaptive OFDMA frame structure for BSs and RSs. We also propose adaptive OFDMA resource allocation for subscriber stations (SSs) within a BS or RS. We derive the maximum OFDMA resources that RSs can be assigned and synchronize access zones and relay zones between a superior station and its subordinate RSs. This is bounded by three properties defined in this thesis: a data relay property, a maximum balance property, and a relay zone limitation property. Finally, we propose max-min and proportional fairness schemes that use the proposed adaptive frame structure. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. We evaluate our scheme using simulations and numerical analysis. Results show that our technique improves resource allocation in wireless MMR networks. Further, in asymmetric distributions of SSs between access zones and relay zones, the proposed OFDMA allocation scheme performs two times better than the non-adaptive allocation scheme in terms of average max-min fairness and 70% better in terms of average throughput.Ph.D.Committee Chair: Dr. John A. Copeland; Committee Member: Dr. George F. Riley; Committee Member: Dr. Henry L. Owen; Committee Member: Dr. Mary Ann Ingram; Committee Member: Dr. Patrick Trayno

A Scalable QoS Scheduling Architecture For WiMAX Multi-Hop Relay Networks.

WiMAX Mobile Multi-hop Relay (MMR) network has been introduced to increase the capacity and extend the coverage area of a single WiMAX Base Station (BS) by the use of a Relay Station (RS)

Network Formation Games Among Relay Stations in Next Generation Wireless Networks

The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \emph{structure} and \emph{dynamics} of the network. We formulate a network formation game among the RSs whereby each RS aims to maximize a cross-layer utility function that takes into account the benefit from cooperative transmission, in terms of reduced bit error rate, and the costs in terms of the delay due to multi-hop transmission. For forming the tree structure, a distributed myopic algorithm is devised. Using the proposed algorithm, each RS can individually select the path that connects it to the BS through other RSs while optimizing its utility. We show the convergence of the algorithm into a Nash tree network, and we study how the RSs can adapt the network's topology to environmental changes such as mobility or the deployment of new mobile stations. Simulation results show that the proposed algorithm presents significant gains in terms of average utility per mobile station which is at least 17.1% better relatively to the case with no RSs and reaches up to 40.3% improvement compared to a nearest neighbor algorithm (for a network with 10 RSs). The results also show that the average number of hops does not exceed 3 even for a network with up to 25 RSs.Comment: IEEE Transactions on Communications, vol. 59, no. 9, pp. 2528-2542, September 201

Multilevel Downlink Relay Queue Aware And Loss Recovery Scheduling For Media Transmission In Wireless Cellular Networks

In this document, we study the result of multi hop relaying on the throughput of the downstream channel in cellular networks. In particular, we contrast the throughput of the multi hop method through that of the conventional cellular system, representing the feasible throughput development by the multi hop relaying under transitive transmission considerations. We moreover propose a hybrid control plan for the multi hop communicate, in which we activist the use of in cooperation, the straight transmission and the transitive multi hop relaying. Our study illustrates that the majority of the throughput gain can be obtained with the related of a transitive relaying scheme. Important throughput improvement could be moreover obtained by operating the simultaneous relaying transmission in conjunction with the non simultaneous transmission. We also disagree here that the multi hop relaying technology can be developed for mitigating injustice in qualityof- service (QoS), which arrive due to the location-dependent signal quality. Our outcomes demonstrate that the multi hop system can provide more even QoS over the cell district. The multi hop cellular system design can also be used as a selfconfiguring network mechanism that efficiently contains variability of traffic distribution. We have studied the throughput development for the consistent, as well as for the non uniform traffic distribution, and we conclude that the utilization of transitive relaying in cellular networks would be relatively robust to alter in the actual traffic distribution