IEEE 802.16J-Relay Fortified Aeromacs Networks; Benefits and Challenges

Aeronautical Mobile Airport Communications System (AeroMACS) is an IEEE 802.16 standard-based (WiMAX) broadband aviation transmission technology, developed to provide safety critical communications coverage for airport surface in support of fixed and mobile ground to ground applications and services. We have previously demonstrated that IEEE 802.16j-amendment-based WiMAX is most feasible for AeroMACS applications. The principal argument in favor of application of IEEE 802.16j technology is the flexible and cost effective extension of radio coverage that is afforded by relay fortified WiMAX networks, with virtually no increase in the power requirements. In this article, following introductory remarks on airport surface communications, WiMAX and AeroMACS; the IEEE 802.16j-based WiMAX technology and multihop relay systems are briefly described. The two modes of relay operation supported by IEEE 802.16j amendment; i.e., transparent (TRS) and non-transparent (NTRS) modes, are discussed in some detail. Advantages and disadvantages of using TRS and NTRS in AeroMACS networks are summarized in a table. Practical issues vis--vis the inclusion of relays in AeroMACS networks are addressed. It is argued that the selection of relay type may affect a number of network parameters. A discussion on specific benefits and challenges of inclusion of relays in AeroMACS networks is provided. The article concludes that in case it is desired or necessary to exclusively employ one type of relay mode for all applications throughout an AeroMACS network, the proper selection would be the non-transparent mode

Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

Designing multihop wireless backhaul networks with delay guarantees

Abstract — As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existing wired backhaul technologies such as copper wires running at DSL, T1, or T3 speeds can be expensive to install or lease, and are becoming a performance bottleneck as wireless access speeds increase. Longhaul, non-line-of-sight wireless technologies such as WiMAX (802.16d) hold the promise of enabling a high speed wireless backhaul as a cost-effective alternative. However, the biggest challenge in building a wireless backhaul is achieving guaranteed performance (throughput and delay) that is typically provided by a wired backhaul. This paper explores the problem of efficiently designing a multihop wireless backhaul to connect multiple wireless access points to a wired gateway. In particular, we provide a generalized link activation framework for scheduling packets over this wireless backhaul, such that any existing wireline scheduling policy can be implemented locally at each node of the wireless backhaul. We also present techniques for determining good interference-free routes within our scheduling framework, given the link rates and cross-link interference information. When a multihop wireline scheduler with worst case delay bounds (such as WFQ or Coordinated EDF) is implemented over the wireless backhaul, we show that our scheduling and routing framework guarantees approximately twice the delay of the corresponding wireline topology. Finally, we present simulation results to demonstrate the low delays achieved using our framework. I

Efficient Resource Management Mechanism for 802.16 Wireless Networks Based on Weighted Fair Queuing

Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases in host devices. This can effectively lead to very huge bottlenecks in the network causing slow sluggish performance, which may eventually reduce the speed of the network. With continuous advancement being the trend in this technology, the proposal of an efficient scheme for wireless resource allocation is an important solution to the problem of congestion. The primary area of focus will be the emerging standard for wireless networks, the 802.16 or “WiMAX”. This project, attempts to propose a mechanism for an effective resource management mechanism between subscriber stations and the corresponding base station

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

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)

Protection Schemes for 4G Multihop wireless Networks

This paper describes the relay node protection using network coding for fourth generation multihop wireless networks and analises the QoS performance with the proposed scheme. The Quality of Service performance, such as PDR, latency and jitter, are measured for different scenarios. The scenarios for 4G wireless networks include failure of a single and two relay nodes, with and without the protection scheme, and user’s mobility

Connectivity in mobile multihop relay network

Mobile Multihop Relay (MMR) network is an attractive and low-cost solution for expanding service coverage and enhancing throughput of the conventional single hop network. However, mobility of Mobile Station (MS) in MMR network might lead to performance degradation in terms of Quality of Service (QoS). Selecting an appropriate Relay Station (RS) that can support data transmission for high mobility MS to enhance QoS is one of the challenges in MMR network. The main goal of the work is to develop and enhance relay selection mechanisms that can assure continuous connectivity while ensuring QoS in MMR network using NCTUns simulation tools. The approach is to develop and enhance a relay selection for MS with continuous connectivity in non-transparent relay. In this approach, the standard network entry procedure is modified to allow continuous connectivity with reduced signaling messages whenever MS joins RS that is out of Multihop Relay Base Station (MRBS) coverage and the relay selection is based on Signal to Noise Ratio (SNR). The QoS performances of the proposed relay selections are in terms of throughput and average end-to-end (ETE) delay. The findings for the proposed relay selection in non-transparent relay shows that the throughput degradation between low mobility MS (30m/s) and high mobility MS (50m/s) is only about 2.0%. The proposed relay selection mechanisms can be applied in any high mobility multi-tier cellular network