multimedia transmission over wireless networks: performance analysis and optimal resource allocation

In recent years, multimedia applications such as video telephony, teleconferencing, and video streaming, which are delay sensitive and bandwidth intensive, have started to account for a significant portion of the data traffic in wireless networks. Such multimedia applications require certain quality of service (QoS) guarantees in terms of delay, packet loss, buffer underflows and overflows, and received multimedia quality. It is also important to note that such requirements need to be satisfied in the presence of limited wireless resources, such as power and bandwidth. Therefore, it is critical to conduct a rigorous performance analysis of multimedia transmissions over wireless networks and identify efficient resource allocation strategies. Motivated by these considerations, in the first part of the thesis, performance of hierarchical modulation-based multimedia transmissions is analyzed. Unequal error protection (UEP) of data transmission using hierarchical quadrature amplitude modulation (HQAM) is considered in which high priority (HP) data is protected more than low priority (LP) data. In this setting, two different types of wireless networks are considered. Specifically, multimedia transmission over cognitive radio networks and device-to-device (D2D) cellular wireless networks is addressed. Closed-form bit error rate (BER) expressions are derived and optimal power control strategies are determined. Next, throughput and optimal resource allocation strategies are studied for multimedia transmission under delay QoS and energy efficiency (EE) constraints. A Quality-Rate (QR) distortion model is employed to measure the quality of received video in terms of peak signal-to-noise ratio (PSNR) as a function of video source rate. Effective capacity (EC) is used as the throughput metric under delay QoS constraints. In this analysis, four different wireless networks are taken into consideration: First, D2D underlaid wireless networks are addressed. Efficient transmission mode selection and resource allocation strategies are analyzed with the goal of maximizing the quality of the received video at the receiver in a frequency-division duplexed (FDD) cellular network with a pair of cellular users, one base station and a pair of D2D users under delay QoS and EE constraints. A full-duplex communication scenario with a pair of users and multiple subchannels in which users can have different delay requirements is addressed. Since the optimization problem is not concave or convex due to the presence of interference, optimal power allocation policies that maximize the weighted sum video quality subject to total transmission power level constraint are derived by using monotonic optimization theory. The optimal scheme is compared with two suboptimal strategies. A full-duplex communication scenario with multiple pairs of users in which different users have different delay requirements is addressed. EC is used as the throughput metric in the presence of statistical delay constraints since deterministic delay bounds are difficult to guarantee due to the time-varying nature of wireless fading channels. Optimal resource allocation strategies are determined under bandwidth, power and minimum video quality constraints again using the monotonic optimization framework. A broadcast scenario in which a single transmitter sends multimedia data to multiple receivers is considered. The optimal bandwidth allocation and the optimal power allocation/power control policies that maximize the sum video quality subject to total bandwidth and minimum EE constraints are derived. Five different resource allocation strategies are investigated, and the joint optimization of the bandwidth allocation and power control is shown to provide the best performance. Tradeoff between EE and video quality is also demonstrated. In the final part of the thesis, power control policies are investigated for streaming variable bit rate (VBR) video over wireless links. A deterministic traffic model for stored VBR video, taking into account the frame size, frame rate, and playout buffers is considered. Power control and the transmission mode selection with the goal of maximizing the sum transmission rate while avoiding buffer underflows and overflows under transmit power constraints is exploited in a D2D wireless network. Another system model involving a transmitter (e.g., a base station (BS)) that sends VBR video data to a mobile user equipped with a playout buffer is also adopted. In this setting, both offline and online power control policies are considered in order to minimize the transmission power without playout buffer underflows and overflows. Both dynamic programming and reinforcement learning based algorithms are developed

Adaptive Video Streaming for Wireless Networks with Multiple Users and Helpers

We consider the optimal design of a scheduling policy for adaptive video streaming in a wireless network formed by several users and helpers. A feature of such networks is that any user is typically in the range of multiple helpers. Hence, in order to cope with user-helper association, load balancing and inter-cell interference, an efficient streaming policy should allow the users to dynamically select the helper node to download from, and determine adaptively the video quality level of the download. In order to obtain a tractable formulation, we follow a "divide and conquer" approach: i) Assuming that each video packet (chunk) is delivered within its playback delay ("smooth streaming regime"), the problem is formulated as a network utility maximization (NUM), subject to queue stability, where the network utility function is a concave and componentwise non-decreasing function of the users' video quality measure. ii) We solve the NUM problem by using a Lyapunov Drift Plus Penalty approach, obtaining a scheme that naturally decomposes into two sub-policies referred to as "congestion control" (adaptive video quality and helper station selection) and "transmission scheduling" (dynamic allocation of the helper-user physical layer transmission rates).Our solution is provably optimal with respect to the proposed NUM problem, in a strong per-sample path sense. iii) Finally, we propose a method to adaptively estimate the maximum queuing delays, such that each user can calculate its pre-buffering and re-buffering time in order to cope with the fluctuations of the queuing delays. Through simulations, we evaluate the performance of the proposed algorithm under realistic assumptions of a network with densely deployed helper nodes, and demonstrate the per-sample path optimality of the proposed solution by considering a non-stationary non-ergodic scenario with user mobility, VBR video coding.Comment: final version to appear in IEEE Transactions on Communication

Efficient and Virtualized Scheduling for OFDM-Based High Mobility Wireless Communications Objects

Services providers (SPs) in the radio platform technology standard long term evolution (LTE) systems are enduring many challenges in order to accommodate the rapid expansion of mobile data usage. The modern technologies demonstrate new challenges to SPs, for example, reducing the cost of the capital and operating expenditures while supporting high data throughput per customer, extending battery life-per-charge of the cell phone devices, and supporting high mobility communications with fast and seamless handover (HO) networking architecture. In this thesis, a variety of optimized techniques aimed at providing innovative solutions for such challenges are explored. The thesis is divided into three parts. The first part outlines the benefits and challenges of deploying virtualized resource sharing concept. Wherein, SPs achieving a different schedulers policy are sharing evolved network B, allowing SPs to customize their efforts and provide service requirements; as a promising solution for reducing operational and capital expenditures, leading to potential energy savings, and supporting higher peak rates. The second part, formulates the optimized power allocation problem in a virtualized scheme in LTE uplink systems, aiming to extend the mobile devices’ battery utilization time per charge. While, the third part extrapolates a proposed hybrid-HO (HY-HO) technique, that can enhance the system performance in terms of latency and HO reliability at cell boundary for high mobility objects (up to 350 km/hr; wherein, HO will occur more frequent). The main contributions of this thesis are in designing optimal binary integer programmingbased and suboptimal heuristic (with complexity reduction) scheduling algorithms subject to exclusive and contiguous allocation, maximum transmission power, and rate constraints. Moreover, designing the HY-HO based on the combination of soft and hard HO was able to enhance the system performance in term of latency, interruption time and reliability during HO. 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 especially in virtualized resources sharing scenarios that can support high data rates with improving quality of services (QoSs)

A Survey on 5G Usage Scenarios and Traffic Models

The fifth-generation mobile initiative, 5G, is a tremendous and collective effort to specify, standardize, design, manufacture, and deploy the next cellular network generation. 5G networks will support demanding services such as enhanced Mobile Broadband, Ultra-Reliable and Low Latency Communications and massive Machine-Type Communications, which will require data rates of tens of Gbps, latencies of few milliseconds and connection densities of millions of devices per square kilometer. This survey presents the most significant use cases expected for 5G including their corresponding scenarios and traffic models. First, the paper analyzes the characteristics and requirements for 5G communications, considering aspects such as traffic volume, network deployments, and main performance targets. Secondly, emphasizing the definition of performance evaluation criteria for 5G technologies, the paper reviews related proposals from principal standards development organizations and industry alliances. Finally, well-defined and significant 5G use cases are provided. As a result, these guidelines will help and ease the performance evaluation of current and future 5G innovations, as well as the dimensioning of 5G future deployments.This work is partially funded by the Spanish Ministry of Economy and Competitiveness (project TEC2016-76795-C6-4-R)H2020 research and innovation project 5G-CLARITY (Grant No. 871428)Andalusian Knowledge Agency (project A-TIC-241-UGR18)

Multiuser Diversity Management for Multicast/Broadcast Services in 5G and Beyond Networks

The envisaged fifth-generation (5G) and beyond networks represent a paradigm shift for global communications, offering unprecedented breakthroughs in media service delivery with novel capabilities and use cases. Addressing the critical research verticals and challenges that characterize the International Mobile Telecommunications (IMT)-2030 framework requires a compelling mix of enabling radio access technologies (RAT) and native softwarized, disaggregated, and intelligent radio access network (RAN) conceptions. In such a context, the multicast/broadcast ser vice (MBS) capability is an appealing feature to address the ever-growing traffic demands, disruptive multimedia services, massive connectivity, and low-latency applications. Embracing the MBS capability as a primary component of the envisaged 5G and beyond networks comes with multiple open challenges. In this research, we contextualize and address the necessity of ensuring stringent quality of service (QoS)/quality of experience (QoE) requirements, multicasting over millimeter-wave (mmWave) and sub-Terahertz (THz) frequencies, and handling complex mobility behaviors. In the broad problem space around these three significant challenges, we focus on the specific research problems of effectively handling the trade-off between multicasting gain and multiuser diversity, along with the trade-off between optimal network performance and computational complexity. In this research, we cover essential aspects at the intersection of MBS, radio resource management (RRM), machine learning (ML), and the Open RAN (O-RAN) framework. We characterize and address the dynamic multicast multiuser diversity through low-complexity RRM solutions aided by ML, orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) techniques in 5G MBS and beyond networks. We characterize the performance of the multicast access techniques conventional multicast scheme (CMS), subgrouping based on OMA (S-OMA), and subgrouping based on NOMA (S-NOMA). We provide conditions for their adequate selection regarding the specific network conditions (Chapter 4). Consequently, we propose heuristic methods for the dynamic multicast access technique selection and resource allocation, taking advantage of the multiuser diversity (Chapter 5.1). Moreover, we proposed a multicasting strategy based on fixed pre-computed multiple-input multiple-output (MIMO) multi-beams and S-NOMA (Chapter 5.2). Our approach tackles specific throughput requirements for enabling extended reality (XR) applications attending multiple users and handling their spatial and channel quality diversity. We address the computational complexity (CC) associated with the dynamic multicast RRM strategies and highlight the implications of fast variations in the reception conditions of the multicast group (MG) members. We propose a low complexity ML-based solution structured by a multicast-oriented trigger to avoid overrunning the algorithm, a K-Means clustering for group-oriented detection and splitting, and a classifier for selecting the most suitable multicast access technique (Chapter 6.1). Our proposed approaches allow addressing the trade-off between optimal network performance and CC by maximizing specific QoS parameters through non-optimal solutions, considerably reducing the CC of conventional exhaustive mechanisms. Moreover, we discuss the insertion of ML-based multicasting RRM solutions into the envisioned disaggregated O-RAN framework (Chapter 6.2.5). We analyze specific MBS tasks and the importance of a native decentralized, softwarized, and intelligent conception. We assess the effectiveness of our proposal under multiple numerical and link level simulations of recreated 5G MBS use cases operating in μWave and mmWave. We evaluate various network conditions, service constraints, and users’ mobility behaviors

Heterogeneous Wireless Networks: Traffic Offloading, Resource Allocation and Coverage Analysis

Unlike 2G systems where the radius of macro base station (MBS) could reach several kilometers, the cell radius of LTE-Advanced and next generation wireless networks (NGWNs) such as 5G networks would be random and up to a few hundred meters in order to overcome the radio signal propagation impairments. Heterogeneous wireless networks (HetNets) are becoming an integral part of the NGWNs especially 5G networks, where small cell base stations (SBSs), wireless-fidelity (WiFi) access points (APs), cellular BSs and device-to-device (D2D) enabled links coexist together. HetNets represent novel approaches for the mobile data offloading, resource allocation and coverage probability problems that help to optimize the network traffic. However, heterogeneity and interworking among different radio access technologies bring new challenges such as bandwidth resource allocation, user/cell association, traffic offloading based on the user activity and coverage probability in HetNets. This dissertation attempts to address three key research areas: traffic offloading, bandwidth resource allocation and coverage probability problems in HetNets. In the first part of this dissertation, we derive the mathematical framework to calculate the required active user population factor (AUPF) of small cells based on the probabilistic traffic models. The number of total mobile users and number of active mobile users have different probabilistic distributions such as different combinations of Binomial and Poisson distributions. Furthermore, AUPF is utilized to investigate the downlink BS and backhaul power consumption of HetNets. In the second part, we investigate two different traffic offloading (TO) schemes (a) Path loss (PL) and (b) Signal-to-Interference ratio (SIR) based strategies. In this context, a comparative study on two techniques to offload the traffic from macrocell to small cell is studied. Additionally, the AUPF, small cell access scheme and traffic type are included into a PL based TO strategy to minimize the congested macrocell traffic. In the third part, the joint user assignment and bandwidth resource allocation problem is formulated as a mixed integer non-linear programming (MINLP). Due to its intractability and computational complexity, the MINLP problem is transformed into a convex optimization problem via a binary variable relaxation approach. Based on the mathematical analysis of the problem, a heuristic algorithm for joint user assignment and bandwidth allocation is presented. The proposed solution achieves a near optimal user assignment and bandwidth allocation at reduced computational complexity. Lastly, we investigate the transition between traditional hexagonal BS deployment to random BS placement in HetNets. Independent Poisson Point Processes (PPPs) are used to model the random locations of BSs. Lloyds algorithm is investigated for analyzing the coverage probability in a network which functions as a bridge between random and structural BS deployments. The link distance distribution is obtained by using the Expectation-Maximization (EM) algorithm which is further utilized for calculating the coverage probability

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

Mobility and resource management for 5G heterogeneous networks

The conventional topology of current cellular networks is a star structure, where central control points usually serve as base stations (BSs). This provides the advantage of simplicity while still providing quality of service (QoS). For next-generation networks, however, this topology is disadvantageous and difficult to use due to the insufficient availability of network access. The hybrid topology radio network will thus naturally be the future mobile access network that can help to overcome current and future challenges efficiently. Therefore, relay technology can play an important role in a hybrid cellular network topology. Today, with the recent long-term evolution-advanced (LTE-A) standards, the 3rd Generation Partnership Project (3GPP) supports a single-hop relay technology in which the radio access link between the BS and users is relayed by only one relay station (RS). With the help of multi-hop relay, however, the radio link between the BS and users can be extended to more than two hops to improve the coverage and network capacity. Multiple hops to transmit data to and from the corresponding BS results in the reduction of path loss. However, using a multi-hop relay system requires more radio resources to transmit data through different hops. More interference is also created due to a greater number of simultaneous transmissions in the network. New mobility and resource management schemes are thus important for achieving a high QoS while increasing the whole network capacity. In the first part, the problem of relay selection and radio resource allocation is studied, and choosing how the bandwidth should be shared between direct, backhaul, and access links in multi-hop relay networks is discussed. In such a network, resource allocation plays a critical role because it manages channel access in both time and frequency domains and determines how resources are allocated for different links. The proposed solution includes a nonlinear programming technique and a heuristic method. First, the problem formulation of resource allocation and relay selection is presented to provide an integrated framework for multi-hop relay networks. Second, an analytical solution to the problem is presented using a nonlinear programming technique. Finally, an iterative two-stage algorithm is presented to address the joint resource allocation and relay selection problem in multi-hop relay networks Under backhaul and capacity limitation constraints. In particular, the first stage proposed a fast approximation analytical solution for a resource allocation algorithm that takes into account the trade-off between the optimality and the complexity of the multi-hop relay architecture; the second stage presented a heuristic relay selection strategy that considers the RS load and helps to keep the relay from being overloaded is proposed. In the second part, the mobility problem in downlink multi-hop relay networks is addressed. In addition to the resource allocation issue, the relay selection problem is studied from a network layer perspective. Therefore, this part includes the issue of radio path selection. As an alternative to the heuristic algorithm developed in the previous part, the presented work describes the development and evaluation of a relay-selection scheme based on a Markov decision process (MDP) that considers the RS load and the existing radio-link path to improve handoff performance. First, the problem formulation of resource allocation and relay selection is presented. Second, an MDP mathematical model is developed to solve the relay selection problem in a decentralized way and to make the selection process simple. This relay selection scheme has the objective of maintaining the throughput and ensuring seamless mobility and service continuity to all mobile terminals while reducing the handoff frequency and improving handoff performance. In the third part, the admission and power control problem of a general heterogeneous network (HetNet) consisting of several small cells (SCs) is solved. Compared to the first two parts of this work, the system is expanded from a multi-hop RS to a general SC context. This part therefore focuses only on the access link problem, assuming the capacity of the SC backhaul links are large enough not to be bottlenecks. This part mainly deals with the problem of how to maximize the number of admitted users in an overloaded system while minimizing the transmit power given a certain QoS level. First, the problem is formulated to address concerns about QoS requirements in a better way. Second, a Voronoi-based user association scheme for maximizing the number of admitted users in the system under QoS and capacity limitation constraints is proposed to find near-optimal solutions. Finally, a twostage algorithm is presented to address the joint admission and power control problem in a downlink heterogeneous SC network. In particular, the first stage proposes a dynamic call admission control policy that considers the SC load and call-level QoS while also helping to keep the system from being overloaded. The second stage presents an adaptive power allocation strategy that considers both user distribution and the density of SCs in HetNets. Finally, the proposed solutions are evaluated using extensive numerical simulations, and the numerical results are presented to provide a comparison with related works found in the literature