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

Simulation of Relay modes in IEEE 802.16j Mobile Multi-hop Relay (MMR) WIMAX Networks

Two different relay modes are defined in IEEE 802.16j WIMAX standard: transparent mode and non-transparent mode. The non transparent mode is used to extend the coverage area of base stations, where low cost relay station of equal capacity as that of base station is placed at suitable position. Time taken to accept mobile stations and Bandwidth allocation are main problems in non transparent mode. In this we have studied the IEEE 802.16j standard multi hop relay WIMAX networks. We have used relay stations to extend the coverage of base stations. We have also analyzed the throughput between mobile stations with in the coverage area and outside coverage area of base stations. We have simulated the IEEE 802.16j transparent and non transparent mode multi hop WIMAX relay networks using NCTUns Too

Adaptive load balancing routing algorithms for the next generation wireless telecommunications networks

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel UniversityWith the rapid development of wireless networks, mesh networks are evolving as a new important technology, presenting a high research and commercial interest. Additionally, wireless mesh networks have a wide variety of applications, offering the ability to provide network access in both rural and urban areas with low cost of maintenance. One of the main functionalities of a wireless mesh network is load balancing routing, which is the procedure of finding the best, according to some criteria, routes that data need to follow to transfer from one node to another. Routing is one of the state-of-the-art areas of research because the current algorithms and protocols are not efficient and effective due to the diversity of the characteristics of these networks. In this thesis, two new routing algorithms have been developed for No Intra-Cell Interference (NICI) and Limited Intra-Cell Interference (LICI) networks based on WiMAX, the most advanced wireless technology ready for deployment. The algorithms created are based on the classical Dijkstra and Ford-Fulkerson algorithms and can be implemented in the cases of unicast and multicast transmission respectively.State scholarships foundation of Greece

WiMAX Scheduling Algorithm Key Issue and Design Challenges: Survey

In recent time to satisfy the growing demand of broadband wireless access by using scare Resource of bandwidth is a biggest challenge for Researchers, in this time WiMAX (Worldwide Interopretability for Microwave Access) emerged as a better solution to fulfill that demand. WiMAX provides faster internet connectivity in Urban Areas as well as remote areas also where to deploy the DSL (Digital Subscriber Line) or other wired technology is difficult task. WiMAX structure is based on IEEE 802.16 OSI standard and defines the PMP (Point to Multipoint) and Mesh modes for transmission of information. To provide authentic services for voice, data and videos WiMAX define the various QoS parameters at Media Access Control (MAC) layer. In order to meet the QoS requirement Novel scheduling approach are required. In these papers efforts are made to examine and compare the various scheduling algorithm and its design challenges to implement the effective scheduling algorithm. It also discusses the various QoS parameters associated with scheduling approaches. DOI: 10.17762/ijritcc2321-8169.15083

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

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

An improved resource allocation scheme for WiMAX using channel information

In recent years, tremendous progress has been made in wireless communication systems to provide wireless coverage to end users at different data rates. WiMAX technology provides wireless broadband access over an extended coverage area in both fixed and mobility environments. Most of the existing resource allocation schemes allocate resources based on respective service class of the incoming users’ requests. However, due to variation in channel conditions, user mobility and diverse resource requirements QoS based resource allocation either results in over or under utilization of allocated resources. Therefore, resource allocation is a challenging task in WiMAX. This research proposes an improved resource management mechanism that performs resource allocation by taking into consideration not only the user service class but also the respective channel status. Based on these two parameters, this research aims to achieve improved resource allocation in terms of resource utilization, fairness and network throughput. First, a Channel Based Resource Allocation scheme is introduced where priority in resource allocation is given to users’ requests with relatively higher service classes and better channel status. To maintain fairness in resource allocation process, a Fair Resource Allocation Based Service mechanism is developed where priority is given to users’ requests having less additional resources demand. Finally, to improve throughput of the network, a Channel Based Throughput Improvement approach is proposed which dynamically selects a threshold level of channel gain based on individual channel gain of users. During resource allocation process, users above the threshold level are selected for resource allocation such that priority is given to users with high channel gain. Different simulation scenario results reveal an overall improved resource utilization from 87% to 91% and the throughput improves up to 15% when compared to existing schemes. In conclusion the performance of resource utilization is improved if channel status is considered as an input parameter

Opportunistic Access Schemes for Multiuser OFDM Wireless Networks

International audienc

Subcarrier and Power Allocation in WiMAX

Worldwide Interoperability for Microwave Access (WiMAX) is one of the latest technologies for providing Broadband Wireless Access (BWA) in a metropolitan area. The use of orthogonal frequency division multiplexing (OFDM) transmissions has been proposed in WiMAX to mitigate the complications which are associated with frequency selective channels. In addition, the multiple access is achieved by using orthogonal frequency division multiple access (OFDMA) scheme which has several advantages such as flexible resource allocation, relatively simple transceivers, and high spectrum efficient. In OFDMA the controllable resources are the subcarriers and the allocated power per subband. Moreover, adaptive subcarrier and power allocation techniques have been selected to exploit the natural multiuser diversity. This leads to an improvement of the performance by assigning the proper subcarriers to the user according to their channel quality and the power is allocated based on water-filling algorithm. One simple method is to allocate subcarriers and powers equally likely between all users. It is well known that this method reduces the spectral efficiency of the system, hence, it is not preferred unless in some applications. In order to handle the spectral efficiency problem, in this thesis we discuss three novel resources allocation algorithms for the downlink of a multiuser OFDM system and analyze the algorithm performances based on capacity and fairness measurement. Our intensive simulations validate the algorithm performances.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format