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

Power optimization, network coding and decision fusion in multi-access relay networks

Multi-access relay (MAR) assisted communication appears in various applications such as hierarchical wireless sensor networks (WSN), two-way relay channels (TWRC) etc. since it provides a high speed and reliable communication with considerably large coverage. In this thesis, we develop the optimal power allocation, network coding and information fusion techniques to improve the performance of MAR channel by considering certain criterion (e.g., minimizing the average symbol error rate (SER) or maximizing the average sum-rate. For this purpose, we first derive optimal information fusion rules for hierarchical WSNs with the use of complete channel state information (CSI) and the partial CSI using channel statistics (CS) with the exact phase information. Later, we investigate the optimization of the MAR channel that employs complex field network coding (CFNC), where we have used two different metrics during the optimization: achievable sum rate and SER bound of the network under the assumption of receiver CSI. After that, we formulate the optimal power allocation problem to maximize the achievable sum rate of the MAR with decode and forward relaying while considering fairness among users in terms of their average achievable information rates under the constraints on the total power and network geometry. We show that this problem is non-convex and nonlinear, and obtain an analytical solution by properly dividing parameter space into four regions. Then, we derive an average SER bound for the CFNC coded MAR channel and aim to jointly optimize the CFNC and the relay power by minimizing SER bound under the total power constraint, which we prove as a convex program that cannot be solved analytically since the Karush-Khun-Tucker (KKT) conditions result in highly nonlinearity equations. Following that, we devise an iterative method to obtain SER optimal solutions which uses the information theoretical rate optimal analytical solution during the initialization and we show that this speeds up the convergence of the iterative method as compared to equal power allocation scheme. Next, we integrate CFNC into WSNs that operate over non-orthogonal communication channel, and derive optimal fusion rule accordingly, combine the SER bound minimization and the average rate-fairness ideas to come up with an approximate analytical method to jointly optimize CFNC and the relay power. Simulation results show that the proposed methods outperform the conventional methods in terms of the detection probability, achievable average sum-rate or average SER

JOINT ENERGY BEAMFORMING AND TIME ASSIGNMENT FOR COOPERATIVE WIRELESS POWERED NETWORKS

Wireless power transfer (WPT) and radio frequency (RF)-based energy har- vesting arouses a new wireless network paradigm termed as wireless powered com- munication network (WPCN), where some energy-constrained nodes are enabled to harvest energy from the RF signals transferred by other energy-sufficient nodes to support the communication operations in the network, which brings a promising approach for future energy-constrained wireless network design. In this paper, we focus on the optimal WPCN design. We consider a net- work composed of two communication groups, where the first group has sufficient power supply but no available bandwidth, and the second group has licensed band- width but very limited power to perform required information transmission. For such a system, we introduce the power and bandwidth cooperation between the two groups so that both group can accomplish their expected information delivering tasks. Multiple antennas are employed at the hybrid access point (H-AP) to en- hance both energy and information transfer efficiency and the cooperative relaying is employed to help the power-limited group to enhance its information transmission throughput. Compared with existing works, cooperative relaying, time assignment, power allocation, and energy beamforming are jointly designed in a single system. Firstly, we propose a cooperative transmission protocol for the considered system, where group 1 transmits some power to group 2 to help group 2 with information transmission and then group 2 gives some bandwidth to group 1 in return. Sec- ondly, to explore the information transmission performance limit of the system, we formulate two optimization problems to maximize the system weighted sum rate by jointly optimizing the time assignment, power allocation, and energy beamforming under two different power constraints, i.e., the fixed power constraint and the aver- age power constraint, respectively. In order to make the cooperation between the two groups meaningful and guarantee the quality of service (QoS) requirements of both groups, the minimal required data rates of the two groups are considered as constraints for the optimal system design. As both problems are non-convex and have no known solutions, we solve it by using proper variable substitutions and the semi-definite relaxation (SDR). We theoretically prove that our proposed solution method can guarantee to find the global optimal solution. Thirdly, consider that the WPCN has promising application potentials in future energy-constrained net- works, e.g., wireless sensor network (WSN), wireless body area network (WBAN) and Internet of Things (IoT), where the power consumption is very critical. We investigate the minimal power consumption optimal design for the considered co- operation WPCN. For this, we formulate an optimization problem to minimize the total consumed power by jointly optimizing the time assignment, power allocation, and energy beamforming under required data rate constraints. As the problem is also non-convex and has no known solutions, we solve it by using some variable substitutions and the SDR method. We also theoretically prove that our proposed solution method for the minimal power consumption design guarantees the global optimal solution. Extensive experimental results are provided to discuss the system performance behaviors, which provide some useful insights for future WPCN design. It shows that the average power constrained system achieves higher weighted sum rate than the fixed power constrained system. Besides, it also shows that in such a WPCN, relay should be placed closer to the multi-antenna H-AP to achieve higher weighted sum rate and consume lower total power

DELAY MINIMIZATION IN ENERGY CONSTRAINED WIRELESS COMMUNICATIONS

In wireless communications and networks, especially for many real-time applications, the average delay packets experience is an important quality of service criterion. Therefore, it is imperative to design advanced transmission schemes to jointly address the goals of reliability, high rates and low delay. Achieving these objectives often requires careful allocation of given resources, such as energy, power, rate, among users. It also requires a close collaboration between physical layer, medium access control layer, and upper layers, and yields cross-layer solutions. We first investigate the problem of minimizing the overall transmission delay of packets in a multiple access wireless communication system, where the transmitters have average power constraints. We formulate the problem as a constrained optimization problem, and then transform it into a linear programming problem. We show that the optimal policy has a threshold structure: when the sum of the queue lengths is larger than a threshold, both users should transmit a packet during the current slot; when the sum of the queue lengths is smaller than a threshold, only one of the users, the one with the longer queue, should transmit a packet during the current slot. Then, we study the delay-optimal rate allocation in a multiple access wireless communication system. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region. Next, we extend the delay-optimal rate allocation problem to a communication channel with two transmitters and one receiver, where the underlying rate region is approximated as a general pentagon. We show that the delay-optimal policy has a switch curve structure. For the discounted-cost problem, we prove that the switch curve has a limit along one of the dimensions. The existence of a limit in the switch curve along one of the dimensions implies that, once the queue state is beyond the limit, the system always operates at one of the corner points, implying that the queues can be operated partially distributedly. Next, we shift our focus from the average delay minimization problem to transmission completion time minimization problem in energy harvesting communication systems. We first consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modeled to arrive at the source node randomly. Our goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the time by which all packets are delivered is minimized. Under a deterministic system setting, we develop an optimal off-line scheduling policy which minimizes the transmission completion time, under causality constraints on both data and energy arrivals. Then, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature. We first analyze the structural properties of the optimal transmission policy. We prove that the optimal total transmit power has the same structure as the optimal single-user transmit power. We also prove that there exists a cut-off power level for the stronger user. If the optimal total transmit power is lower than this level, all transmit power is allocated to the stronger user, and when the optimal total transmit power is larger than this level, all transmit power above this level is allocated to the weaker user. Based on these structural properties of the optimal policy, we propose an algorithm that yields the globally optimal off-line scheduling policy. Next, we investigate the transmission completion time minimization problem in a two-user AWGN multiple access channel. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline. Then, based on the sequence of maximum departure regions at energy arrival epochs, we decompose the transmission completion time minimization problem into a convex optimization problem and solve it efficiently. Finally, we investigate the average delay minimization problem in a single-user communication channel with an energy harvesting transmitter. We consider three different cases. In the first case, both the data packets and the energy to be used to transmit them are assumed to be available at the transmitter at the beginning. In the second case, while the energy is available at the transmitter at the beginning, packets arrive during the transmissions. In the third case, the packets are available at the transmitter at the beginning and the energy arrives during the transmissions, as a result of energy harvesting. In each scenario, we find the structural properties of the optimal solution, and develop iterative algorithms to obtain the solution