Delay-aware Link Scheduling and Routing in Wireless Mesh Networks

Resource allocation is a critical task in computer networks because of their capital-intensive nature. In this thesis we apply operations research tools and technologies to model, solve and analyze resource allocation problems in computer networks with real-time traffic. We first study Wireless Mesh Networks, addressing the problem of link scheduling with end-to-end delay constraints. Exploiting results obtained with the Network Calculus framework, we formulate the problem as an integer non-linear optimization problem. We show that the feasibility of a link schedule does depend on the aggregation framework. We also address the problem of jointly solving the routing and link scheduling problem optimally, taking into account end-to-end delay guarantees. We provide guidelines and heuristics. As a second contribution, we propose a time division approach in CSMA MAC protocols in the context of 802.11 WLANs. By grouping wireless clients and scheduling time slots to these groups, not only the delay of packet transmission can be decreased, but also the goodput of multiple WLANs can be largely increased. Finally, we address a resource allocation problem in wired networks for guaranteed-delay traffic engineering. We formulate and solve the problem under different latency models. Global optimization let feasible schedules to be computed with instances where local resource allocation schemes would fail. We show that this is the case even with a case-study network, and at surprisingly low average loads

Bender's Decomposition for Optimization Design Problems in Communication Networks

Various types of communication networks are constantly emerging to improve connectivity services and facilitate the interconnection of various types of devices. This involves the development of several technologies, such as device-to-device communications, wireless sensor networks and vehicular communications. The various services provided have heterogeneous requirements on the quality metrics such as throughput, end-to-end latency and jitter. Furthermore, different network technologies have inherently heterogeneous restrictions on resources, for example, power, interference management requirements, computational capabilities, and so on. As a result, different network operations such as spectrum management, routing, power control and offloading need to be performed differently. Mathematical optimization techniques have always been at the heart of such design problems to formulate and propose computationally efficient solution algorithms. One of the existing powerful techniques of mathematical optimization is Benders Decomposition (BD), which is the focus of this article. Here, we briefly review different BD variants that have been applied in various existing network types and different design problems. These main variants are the classical, the combinatorial, the multi-stage, and the generalized BD. We discuss compelling BD applications for various network types including heterogeneous cellular networks, infrastructure wired wide area networks, smart grids, wireless sensor networks, and wireless local area networks. Mainly, our goal is to assist the readers in refining the motivation, problem formulation, and methodology of this powerful optimization technique in the context of future networks. We also discuss the BD challenges and the prospective ways these can be addressed when applied to communication networks' design problems

Spectral Efficiency of Multi-User Adaptive Cognitive Radio Networks

In this correspondence, the comprehensive problem of joint power, rate, and subcarrier allocation have been investigated for enhancing the spectral efficiency of multi-user orthogonal frequency-division multiple access (OFDMA) cognitive radio (CR) networks subject to satisfying total average transmission power and aggregate interference constraints. We propose novel optimal radio resource allocation (RRA) algorithms under different scenarios with deterministic and probabilistic interference violation limits based on a perfect and imperfect availability of cross-link channel state information (CSI). In particular, we propose a probabilistic approach to mitigate the total imposed interference on the primary service under imperfect cross-link CSI. A closed-form mathematical formulation of the cumulative density function (cdf) for the received signal-to-interference-plus-noise ratio (SINR) is formulated to evaluate the resultant average spectral efficiency (ASE). Dual decomposition is utilized to obtain sub-optimal solutions for the non-convex optimization problems. Through simulation results, we investigate the achievable performance and the impact of parameters uncertainty on the overall system performance. Furthermore, we present that the developed RRA algorithms can considerably improve the cognitive performance whilst abide the imposed power constraints. In particular, the performance under imperfect cross-link CSI knowledge for the proposed `probabilistic case' is compared to the conventional scenarios to show the potential gain in employing this scheme

Optimizing multiuser MIMO for access point cooperation in dense wireless networks

As the usage of wireless devices continues to grow rapidly in popularity, wireless networks that were once designed to support a few laptops must now host a much wider range of equipments, including smart phones, tablets, and wearable devices, that often run bandwidth-hungry applications. Improvements in wireless local access network (WLAN) technology are expected to help accommodate the huge traffic demands. In particular, advanced multicell Multiple-Input Multiple-Output (MIMO) techniques, involving the cooperation of APs and multiuser MIMO processing techniques, can be used to satisfy the increasing demands from users in high-density environments. The objective of this thesis is to address the fundamental problems for multiuser MIMO with AP cooperation in dense wireless network settings. First, for a very common multiuser MIMO linear precoding technique, block diagonalization, a novel pairing-and-binary-tree based user selection algorithm is proposed. Second, without the zero-forcing constraint on the multiuser MIMO transmission, a general weighted sum rate maximization problem is formulated for coordinated APs. A scalable algorithm that performs a combined optimization procedure is proposed to determine the user selection and MIMO weights. Third, we study the fair and high-throughput scheduling problem by formally specifying an optimization problem. Two algorithms are proposed to solve the problem using either alternating optimization or a two-stage procedure. Fourth, with the coexistence of both stationary and mobile users, different scheduling strategies are suggested for different user types. The provided theoretical analysis and simulation results in this thesis lay out the foundation for the realization of the clustered WLAN networks with AP cooperation.Ph.D

Resource Optimization in Multi-Tier HetNets Exploiting Multi-Slope Path Loss Model

Current resource allocation techniques in cellular networks are largely based on single-slope path loss model, which falls short in accurately capturing the effect of physical environment. The phenomenon of densification makes cell patterns more irregular; therefore, the multi-slope path loss model is more realistic to approximate the increased variations in the links and interferences. In this paper, we investigate the impacts of multi-slope path loss models, where different link distances are characterized by different path loss exponents. We propose a framework for joint user association, power and subcarrier allocation on the downlink of a heterogeneous network (HetNet). The proposed scheme is formulated as a weighted sum rate maximization problem, ensuring the users' quality-of-service requirements, namely users' minimum rate, and the base stations' (BSs) maximum transmission power. We then compare the performance of the proposed approach under different path loss models with demonstrate the effectiveness of dual-slope path loss model in comparison to the single-slope path loss model. Simulation results show that the dual-slope model leads to significant improvement in network's performance in comparison to the standard single-slope model by accurately approximating the path loss exponent dependence on the link distance. Moreover, it improves the user offloading from macrocell BS to small cells by connecting the users to nearby BSs with minimal attenuation. It has been shown that the path loss exponents significantly influence the user association lying across the critical radius in the case of the dual-slope path loss model