Enabling Techniques Design for QoS Provision in Wireless Communications

Guaranteeing Quality of Service (QoS) has become a recognized feature in the design of wireless communications. In this thesis, the problem of QoS provision is addressed from different prospectives in several modern communication systems. In the first part of the thesis, a wireless communication system with the base station (BS) associated by multiple subscribers (SS) is considered, where different subscribers require different QoS. Using the cross-layer approach, the conventional single queue finite state Markov chain system model is extended to multiple queues\u27 scenario by combining the MAC layer queue status with the physical layer channel states, modeled by finite state Markov channel (FSMC). To provide the diverse QoS to different subscribers, a priority-based rate allocation (PRA) algorithm is proposed to allocate the physical layer transmission rate to the multiple medium access control (MAC) layer queues, where different queues are assigned with different priorities, leading to their different QoS performance and thus, the diverse QoS are guaranteed. Then, the subcarrier allocation in multi-user OFDM (MU-OFDM) systems is stuied, constrained by the MAC layer diverse QoS requirements. A two-step cross-layer dynamic subcarrier allocation algorithm is proposed where the MAC layer queue status is firstly modeled by a finite state Markov chain, using which MAC layer diverse QoS constraints are transformed to the corresponding minimum physical layer data rate of each user. Then, with the purpose of maximizing the system capacity, the physical layer OFDM subcarriers are allocated to the multiple users to satisfy their minimum data rate requirements, which is derived by the MAC layer queue status model. Finally, the problem of channel assignment in IEEE 802.11 wireless local area networks (WLAN) is investigated, oriented by users\u27 QoS requirements. The number of users in the IEEE 802.11 channels is first determined through the number of different channel impulse responses (CIR) estimated at physical layer. This information is involved thereafter in the proposed channel assignment algorithm, which aims at maximum system throughput, where we explore the partially overlapped IEEE 802.11 channels to provide additional frequency resources. Moreover, the users\u27 QoS requirements are set to trigger the channel assignment process, such that the system can constantly maintain the required QoS

Evaluation of Interference-Cancellation Based MAC Protocols for Vehicular Communications

Vehicular communications form an important part of future intelligent transport systems. Wireless connectivity between vehicles can enhance safety in vehicular networks and enable new services such as adaptive traffic control, collision detection and avoidance. As several new algorithms are being developed for enhancing vehicle to vehicle wireless connectivity, it is important to validate the performance of these algorithms using reasonably accurate wireless channel models. Specifically, some recent developments in the medium access control (MAC) layer algorithms appear to have the potential to improve the performance of vehicle to vehicle communications; however, these algorithms have not been validated with realistic channel models encountered in vehicular communications. The aforementioned issues are addressed in this thesis and correspondingly, there are two main contributions - (i) A complete IEEE 802.11p based transceiver model has been simulated in MATLAB and its performance & reliability are tested using existing empirically-developed wireless channel models. (ii) A new MAC layer algorithm based on slotted ALOHA with successive interference cancellation(SIC) has been evaluated and tested by taking into consideration the performance of underlying physical layer. The performance of slotted ALOHA-SIC and the already existing carrier sense multiple access with collision avoidance (CSMA/CA) scheme with respect to channel access delay and average packet loss ratio is also studied

Low complexity channel models for approximating flat Rayleigh fading in network simulations

The intricate dependency of networking protocols upon the performance of the wireless channel motivates the investigation of network channel approximations for fading channels. Wireless networking protocols are increasingly being designed and evaluated with the assistance of networking simulators. While evaluating networking protocols such as medium access control, routing, and reliable transport, the network channel model, and its associated capacity, will drastically impact the achievable network throughput. Researcher relying upon simulation results must therefore use extreme caution to ensure the use of similar channel models when performing protocol comparisons. Some channel approximations have been created to mimic the behavior of a fading environment, however there exists little to no justification for these channel approximations. This dissertation addresses the need for a computationally efficient fading channel approximation for use in network simulations. A rigorous flat fading channel model was developed for use in accuracy measurements of channel approximations. The popular two-state Markov model channel approximation is analyzed and shown to perform poorly for low to moderate signal-to-noise ratios (SNR). Three novel channel approximations are derived, with multiple methods of parameter estimation. Each model is analyzed for both statistical performance and network performance. The final model is shown to achieve very accurate network throughput performance by achieving a very close matching of the frame run distributions. This work provides a rigorous evaluation of the popular two-state Markov model, and three novel low complexity channel models in both statistical accuracy and network throughput performance. The novel models are formed through attempts to match key statistical parameters of frame error run and good frame run statistics. It is shown that only matching key parameters is insufficient to achieve an acceptable channel approximation and that it is necessary to approximate the distribution of frame error duration and good frame run duration. The final novel channel approximation, the three-state run-length model, is shown to achieve a good approximation of the desired distributions when some key statistical parameters are matched

Cooperative Detection and Network Coding in Wireless Networks

In cooperative communication systems, multiple terminals in wireless networks share their antennas and resources for information exchange and processing. Recently, cooperative communications have been shown to achieve significant performance improvements in terms of transmission reliability, coverage area extension, and network throughput, with respect to existing classical communication systems. This dissertation is focused on two important applications of cooperative communications, namely: (i) cooperative distributed detection in wireless sensor networks, and (ii) many-to-many communications via cooperative space-time network coding. The first application of cooperative communications presented in this dissertation is concerned with the analysis and modeling of the deployment of cooperative relay nodes in wireless sensor networks. Particularly, in dense wireless sensor networks, sensor nodes continuously observe and collect measurements of a physical phenomenon. Such observations can be highly correlated, depending on the spatial separation between the sensor nodes as well as how the physical properties of the phenomenon are evolving over time. This unique characteristic of wireless sensor networks can be effectively exploited with cooperative communications and relays deployment such that the distributed detection performance is significantly improved as well as the energy efficiency. In particular, this dissertation studies the Amplify-and-Forward (AF) relays deployment as a function of the correlation of the observations and analyzes the achievable spatial diversity gains as compared with the classical wireless sensor networks. Moreover, it is demonstrated that the gains of cooperation can be further leveraged to alleviate bandwidth utilization inefficiencies in current sensor networks. Specifically, the deployment of cognitive AF cooperative relays to exploit empty/under-utilized time-slots and the resulting energy savings are studied, quantified and compared. The multiple terminal communication and information exchange form the second application of cooperative communications in this dissertation. Specifically, the novel concept of Space-Time-Network Coding (STNC) that is concerned with formulation of the many-to-many cooperative communications over Decode-and-Forward (DF) nodes is studied and analyzed. Moreover, the exact theoretical analysis as well as upper-bounds on the network symbol error rate performance are derived. In addition, the tradeoff between the number of communicating nodes and the timing synchronization errors is analyzed and provided as a network design guideline. With STNC, it is illustrated that cooperative diversity gains are fully exploited per node and significant performance improvements are achieved. It is concluded that the STNC scheme serves as a potential many-to-many cooperative communications scheme and that its scope goes much further beyond the generic source-relay-destination communications

High Performance WLAN Using Smart Antenna

The need for higher data rates in WLANs boosts drastically because tremendous consumer interest in emerging multimedia applications, such as HDTV, has been increased. Currently, the IEEE 802.11a/b/g WLANs provide a limited data rate for the current user application requirements. In order to overcome substantial limitations of the existing WLANs, the next generation of WLANs, IEEE 802.11n, is in the course of development and expected to support higher throughput, larger coverage area and better QoS. The high performance IEEE 802.11n WLAN can improve data rate significantly by using smart antenna systems in the physical layer to take advantage of multi-path fading of wireless channels. In this thesis, an analytical model is developed to study the MAC performance and the underlying smart antenna technologies used in multi-path fading channels. Multiple antennas employed in the AP arise two popular approaches to provide a significant performance improvement, diversity and multiplexing. Considering the diversity gain of multiple antennas at the AP in which the AP with multiple antennas serves one user at a time, the capacity and throughput can be obtained. In addition, the AP is possible to serve multiple users in the downlink, by exploiting the multiplexing gain of the wireless channel. We investigate the maximum network throughput when the traffic intensity of the AP approaches to one. Unlike most of previous research which focus on either the physical or the MAC layer performance, our analytical model jointly considers the MAC protocol and the smart antenna technology

Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks

Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay. In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime. Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol. Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices. Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems. In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory

Efficient Scheduling Algorithms for Wireless Resource Allocation and Virtualization in Wireless Networks

The continuing growth in demand for better mobile broadband experiences has motivated rapid development of radio-access technologies to support high data rates and improve quality of service (QoS) and quality of experience (QoE) for mobile users. However, the modern radio-access technologies pose new challenges to mobile network operators (MNO) and wireless device designers such as reducing the total cost of ownership while supporting high data throughput per user, and extending battery life-per-charge of the mobile devices. In this thesis, a variety of optimization techniques aimed at providing innovative solutions for such challenges are explored. The thesis is divided into two parts. In the first part, the challenge of extending battery life-per-charge is addressed. Optimal and suboptimal power-efficient schedulers that minimize the total transmit power and meet the QoS requirements of the users are presented. The second outlines the benefits and challenges of deploying wireless resource virtualization (WRV) concept as a promising solution for satisfying the growing demand for mobile data and reducing capital and operational costs. First, a WRV framework is proposed for single cell zone that is able to centralize and share the spectrum resources between multiple MNOs. Consequently, several WRV frameworks are proposed, which virtualize the spectrum resource of the entire network for cloud radio access network (C-RAN)- one of the front runners for the next generation network architecture. The main contributions of this thesis are in designing optimal and suboptimal solutions for the aforementioned challenges. In most cases, the optimal solutions suffer from high complexity, and therefore low-complexity suboptimal solutions are provided for practical systems. The optimal solutions are used as benchmarks for evaluating the suboptimal solutions. The results prove that the proposed solutions effectively contribute in addressing the challenges caused by the demand for high data rates and power transmission in mobile networks