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

Qualitative Investigation of the Performance of Real-Time Application of IEEE 802.16e standard WiMAX Relay Networks

The ability of an application to adapt its behavior to changing network conditions depends on the available bandwidth, throughput, delay and packet loss in a network path. These are of major importance in congestion control, streaming applications, quality of service verification, relay selection and many other areas in WiMAX relay stations. Mobile WiMAX, which is based on the IEEE 802.16e standard, provides support for and enables full mobility to users. In an effort to optimize and enhance the overall network throughput, this paper will propose a mobile relay framework. WiMAX is based on the IEEE 802.16e standard, and can support various types of handovers, while allowing for full mobility from the user endpoint. Different methodologies were used to compare different aspects of WiMAX relay stations including throughput, delay, SNR and network load. OPNET modular was used to develop and measure these set of network performance metrics. To accurately measure and evaluate the aforementioned network parameters we employed techniques that were able to process large amounts of data, this aided in provision of much more informed recommendations as to the type of relay station modes that should be installed engender enhanced, improved and optimal Quality of Service (QoS) within the network perimeter. This paper measured the overall network throughput, delay, SNR and network load of relay networks comprising mainly of multimedia applications. Keywords: WiMAX, QoS, Relay Station, Simulation, Topology, Throughput, Delay, Packet Los

Practical design of optimal wireless metropolitan area networks: model and algorithms for OFDMA networks

A thesis submitted to the University of Bedfordshire, in partial fulfilment of the requirements for the degree of Ph.D.This thesis contributes to the study of the planning and optimisation of wireless metropolitan area networks, in particular to the access network design of OFDMAbased systems, where different parameters like base station position, antenna tilt and azimuth need to be configured during the early stages of the network life. A practical view for the solution of this problem is presented by means of the development of a novel design framework and the use of multicriteria optimisation. A further consideration of relaying and cooperative communications in the context of the design of this kind of networks is done, an area little researched. With the emergence of new technologies and services, it is very important to accurately identify the factors that affect the design of the wireless access network and define how to take them into account to achieve optimally performing and cost-efficient networks. The new features and flexibility of OFDMA networks seem particularly suited to the provision of different broadband services to metropolitan areas. However, until now, most existing efforts have been focused on the basic access capability networks. This thesis presents a way to deal with the trade-offs generated during the OFDMA access network design, and presents a service-oriented optimization framework that offers a new perspective for this process with consideration of the technical and economic factors. The introduction of relay stations in wireless metropolitan area networks will bring numerous advantages such as coverage extension and capacity enhancement due to the deployment of new cells and the reduction of distance between transmitter and receiver. However, the network designers will also face new challenges with the use of relay stations, since they involve a new source of interference and a complicated air interface; and this need to be carefully evaluated during the network design process. Contrary to the well known procedure of cellular network design over regular or hexagonal scenarios, the wireless network planning and optimization process aims to deal with the non-uniform characteristics of realistic scenarios, where the existence of hotspots, different channel characteristics for the users, or different service requirements will determine the final design of the wireless network. This thesis is structured in three main blocks covering important gaps in the existing literature in planning (efficient simulation) and optimisation. The formulation and ideas proposed in the former case can still be evaluated over regular scenarios, for the sake of simplicity, while the study of latter case needs to be done over specific scenarios that will be described when appropriate. Nevertheless, comments and conclusions are extrapolated to more general cases throughout this work. After an introduction and a description of the related work, this thesis first focuses on the study of models and algorithms for classical point-to-multipoint networks on Chapter 3, where the optimisation framework is proposed. Based on the framework, this work: - Identifies the technology-specific physical factors that affect most importantly the network system level simulation, planning and optimization process. - It demonstrates how to simplify the problem and translate it into a formal optimization routine with consideration of economic factors. - It provides the network provider, a detailed and clear description of different scenarios during the design process so that the most suitable solution can be found. Existing works on this area do not provide such a comprehensive framework. In Chapter 4: - The impact of the relay configuration on the network planning process is analysed. - A new simple and flexible scheme to integrate multihop communications in the Mobile WiMAX frame structure is proposed and evaluated. - Efficient capacity calculations that allow intensive system level simulations in a multihop environment are introduced. In Chapter 5: - An analysis of the optimisation procedure with the addition of relay stations and the derived higher complexity of the process is done. - A frequency plan procedure not found in the existing literature is proposed, which combines it with the use of the necessary frame fragmentation of in-band relay communications and cooperative procedures. - A novel joint two-step process for network planning and optimisation is proposed. Finally, conclusions and open issues are exposed

Optimal Relay Station Placement in Broadband Wireless Access Networks

With the development of IEEE 802.16j multihop relay protocol, the requirement to enhance the network capacity in a wireless network has been met e ectively. In this thesis, we study the capacity enhancement problem for a broadband wireless access network which is achieved by optimal placement of Relay Stations (RSs) along with the presence of a Base Station (BS) and multiple Candidate Positions (CPs). We present a mixed integer programming formulation for the crucial task of RS placement. Weighted objective is also explored to include preferential RS placement. The proposed formulations are solved in a matter of seconds. It is observed that with preferential RS placement, the same demand can be met with 73% fewer RSs with a slight, 6%, decrease in the overall network capacity. Moving forward, the objective is broadened to combine and include joint BS and RS placements for a given network. This model formulation provides better overall capacity than combined capacities of RS placement formulations. Maximin objective is introduced to distribute the excess bandwidth to all subscriber stations (SS) rather than assigning it to only one SS. With this approach, bandwidth allocated to each SS is increases by an average of 35.18%

Network Planning for IEEE 802.16j Relay Networks

In this chapter, a problem formulation for determining the optimal node location for base stations (BSs) and relay stations (RSs) in relay-based 802.16 networks is developed. A number of techniques are proposed to solve the resulting integer programming (IP) problem—these are compared in terms of the time taken to find a solution and the quality of the solution obtained. Finally, there is some analysis of the impact of the ratio of BS/RS costs on the solutions obtained. Three techniques are studied to solve the IP problem: (1) a standard branch and bound mechanism, (2) an approach in which state space reduction techniques are applied in advance of the branch and bound algorithm, and (3) a clustering approach in which the problem is divided into a number of subproblems which are solved separately, followed by a final overall optimization step. These different approaches were used to solve the problem. The results show that the more basic approach can be used to solve problems for small metropolitan areas; the state space reduction technique reduces the time taken to find a solution by about 50 percent. Finally, the clustering approach can be used to find solutions of approximately equivalent quality in about 30 percent of the time required in the first case. After scalability tests were performed, some rudimentary experiments were performed in which the ratio of BS/RS cost was varied. The initial results show that for the scenarios studied, reducing the RS costs results in more RSs in the solution, while also decreasing the power required to communicate from the mobile device to its closest infrastructure node (BS or RS)

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

Heuristic algorithms for wireless mesh network planning

x, 131 leaves : ill. ; 29 cmTechnologies like IEEE 802.16j wireless mesh networks are drawing increasing attention of the research community. Mesh networks are economically viable and may extend services such as Internet to remote locations. This thesis takes interest into a planning problem in IEEE 802.16j networks, where we need to establish minimum cost relay and base stations to cover the bandwidth demand of wireless clients. A special feature of this planning problem is that any node in this network can send data to at most one node towards the next hop, thus traffic flow is unsplittable from source to destination. We study different integer programming formulations of the problem. We propose four types of heuristic algorithms that uses greedy, local search, variable neighborhood search and Lagrangian relaxation based approaches for the problem. We evaluate the algorithms on database of network instances of 500-5000 nodes, some of which are randomly generated network instances, while other network instances are generated over geometric distribution. Our experiments show that the proposed algorithms produce satisfactory result compared to benchmarks produced by generalized optimization problem solver software