Efficient design of WIMAX/802.16 mesh networks

Broadband wireless networks are becoming increasingly popular due to their fast and inexpensive deployment and their capabilities of providing flexible and ubiquitous Internet access. While the majority of existing broadband wireless networks are still exclusively limited to single hop access, it is the ability of these networks to forward data frames over multi-hop wireless routes which enabled them to easily extend the network coverage area. Unfortunately, achieving good multi- hop throughput has been challenging due to several factors, such as lossy wireless links caused by interference from concurrent transmissions, and intra-path interference caused by transmissions on successive hops along a single path. A wireless mesh network WMN consists of a number of stationary wireless mesh routers, forming a wireless backbone. The wireless mesh routers serve as access points (APs) for wireless mobile devices, and some of them also act as gateways to the Internet via high speed wireless links. Several technologies are currently being considered for mesh (multi-hop) networks, including, IEEE 802.11 (both single channel and multi-channel), IEEE 802.16/WiMAX, and next generation cellular networks (LTE). In this work, we focus on the IEEE 802.16. To maximize the network performance of mesh networks (e.g., throughput), it is essential to consider a cross-layer design, exploiting the dependency between protocol layers such as the routing network layer and the scheduling resource allocation MAC layer. Therefore this PhD thesis considers a cross-layer design approach for designing efficient wireless mesh networks; we first develop mathematical models (link-based and path-based) for the problem of joint routing tree construction and link scheduling in WiMAX-based mesh networks with the objective of minimizing the schedule length to satisfy a set of uplink and downlink demands. This is achieved by maximizing the number of concurrent active transmissions in the network by efficiently reusing the spectrum spatially. Second, we exploit the broadcasts nature of the wireless medium and enhance our design models by incorporating opportunistic network coding into the joint routing tree construction and link scheduling problem. Identifying coding-aware routing structures and utilizing the broadcasting feature of the wireless medium play an important role in realizing the achievable gain of network coding. Last, the uprising mobile WiMAX (802.16e amendment) has introduced more difficulties and challenges into the network design problem; thus, ensuring larger connection lifetime and better routing stability become of greater interest for the joint routing and scheduling problem. This is addressed by augmenting the previously designed models. Throughout this thesis, we assume centralized scheduling at the base station (BS) and we develop, for the joint problems, integer linear programming (ILP) models which require the enumeration of all feasible solutions to reach the optimal solution. Given their complexities, we rely on optimization decomposition methods using column generation for solving each model in an efficient way

CapEst: A Measurement-based Approach to Estimating Link Capacity in Wireless Networks

Estimating link capacity in a wireless network is a complex task because the available capacity at a link is a function of not only the current arrival rate at that link, but also of the arrival rate at links which interfere with that link as well as of the nature of interference between these links. Models which accurately characterize this dependence are either too computationally complex to be useful or lack accuracy. Further, they have a high implementation overhead and make restrictive assumptions, which makes them inapplicable to real networks. In this paper, we propose CapEst, a general, simple yet accurate, measurement-based approach to estimating link capacity in a wireless network. To be computationally light, CapEst allows inaccuracy in estimation; however, using measurements, it can correct this inaccuracy in an iterative fashion and converge to the correct estimate. Our evaluation shows that CapEst always converged to within 5% of the correct value in less than 18 iterations. CapEst is model-independent, hence, is applicable to any MAC/PHY layer and works with auto-rate adaptation. Moreover, it has a low implementation overhead, can be used with any application which requires an estimate of residual capacity on a wireless link and can be implemented completely at the network layer without any support from the underlying chipset

The Bus Goes Wireless: Routing-Free Data Collection with QoS Guarantees in Sensor Networks

Abstract—We present the low-power wireless bus (LWB), a new communication paradigm for QoS-aware data collection in lowpower sensor networks. The LWB maps all communication onto network floods by using Glossy, an efficient flooding architecture for wireless sensor networks. Therefore, unlike current solutions, the LWB requires no information of the network topology, and inherently supports networks with mobile nodes and multiple data sinks. A LWB prototype implemented in Contiki guarantees bounded end-to-end communication delay and duplicate-free, inorder packet delivery—key QoS requirements in many control and mission-critical applications. Experiments on two testbeds demonstrate that the LWB prototype outperforms state-of-theart data collection and link layer protocols, in terms of reliability and energy efficiency. For instance, we measure an average radio duty cycle of 1.69 % and an overall data yield of 99.97 % in a typical data collection scenario with 85 sensor nodes on Twist. I