Showing papers in "IEEE Transactions on Wireless Communications in 2006"

Distributed Space-Time Coding in Wireless Relay Networks

Abstract: We apply the idea of space-time coding devised for multiple-antenna systems to the problem of communications over a wireless relay network with Rayleigh fading channels. We use a two-stage protocol, where in one stage the transmitter sends information and in the other, the relays encode their received signals into a "distributed" linear dispersion (LD) code, and then transmit the coded signals to the receive node. We show that for high SNR, the pairwise error probability (PEP) behaves as (logP/P)min{TH}, with T the coherence interval, that is, the number of symbol periods during which the channels keep constant, R the number of relay nodes, and P the total transmit power. Thus, apart from the log P factor, the system has the same diversity as a multiple-antenna system with R transmit antennas, which is the same as assuming that the R relays can fully cooperate and have full knowledge of the transmitted signal. We further show that for a network with a large number of relays and a fixed total transmit power across the entire network, the optimal power allocation is for the transmitter to expend half the power and for the relays to collectively expend the other half. We also show that at low and high SNR, the coding gain is the same as that of a multiple-antenna system with R antennas. However, at intermediate SNR, it can be quite different, which has implications for the design of distributed space-time codes

Diversity through coded cooperation

Abstract: Motivated by the recent works on the relay channel and cooperative diversity, this letter introduces coded cooperation, where cooperation is achieved through channel coding methods instead of a direct relay or repetition. Each codeword is partitioned into two subsets that are transmitted from the user's and partner's antennas, respectively. Coded cooperation achieves impressive gains compared to a non-cooperative system while maintaining the same information rate, transmit power, and bandwidth. We develop bounds on BER and FER and illustrate the advantage of coded cooperation under a number of different scenarios.

Interleave division multiple-access

Abstract: This paper provides a comprehensive study of interleave-division multiple-access (IDMA) systems. The IDMA receiver principles for different modulation and channel conditions are outlined. A semi-analytical technique is developed based on the density evolution technique to estimate the bit-error-rate (BER) of the system. It provides a fast and relatively accurate method to predict the performance of the IDMA scheme. With simple convolutional/repetition codes, overall throughputs of 3 bits/chip with one receive antenna and 6 bits/chip with two receive antennas are observed for IDMA systems involving as many as about 100 users.

Capacity scaling laws in MIMO relay networks

Abstract: The use of multiple antennas at both ends of a wireless link, popularly known as multiple-input multiple-output (MIMO) wireless, has been shown to offer significant improvements in spectral efficiency and link reliability through spatial multiplexing and space-time coding, respectively. This paper demonstrates that similar performance gains can be obtained in wireless relay networks employing terminals with MIMO capability. We consider a setup where a designated source terminal communicates with a designated destination terminal, both equipped with M antennas, assisted by K single-antenna or multiple-antenna relay terminals using a half-duplex protocol. Assuming perfect channel state information (CSI) at the destination and the relay terminals and no CSI at the source, we show that the corresponding network capacity scales as C = (M/2) log(K) + O(1) for fixed M, arbitrary (but fixed) number of (transmit and receive) antennas N at each of the relay terminals, and K rarr infin. We propose a protocol that assigns each relay terminal to one of the multiplexed data streams forwarded in a "doubly coherent" fashion (through matched filtering) to the destination terminal. It is shown that this protocol achieves the cut-set upper bound on network capacity for fixed M and K rarr infin (up to an O(1)-term) by employing independent stream decoding at the destination terminal. Our protocol performs inter-stream interference cancellation in a completely decentralized fashion, thereby orthogonalizing the effective MIMO channel between source and destination terminals. Finally, we discuss the case where the relay terminals do not have CSI and show that simple amplify-and-forward relaying, asymptotically in K, for fixed M and fixed N ges 1, turns the relay network into a point-to-point MIMO link with high-SNR capacity C = (M/2) log(SNR) + O(1), demonstrating that the use of relays as active scatterers can recover spatial multiplexing gain in poor scattering environments

A stochastic MIMO channel model with joint correlation of both link ends

Abstract: -This paper presents a novel stochastic channel model for multiple-input multiple-output (MIMO) wireless radio channels. In contrast to state-of-the-art stochastic MIMO channel models, the spatial correlation properties of the channel are not divided into separate contributions from transmitter and receiver. Instead, the joint correlation properties are modeled by describing the average coupling between the eigenmodes of the two link ends. The necessary and sufficient condition for the proposed model to hold is that the eigenbasis at the receiver is independent of the transmit weights, and vice versa. The authors discuss the mathematical elements of the model, which can be easily extracted from measurements, from a radio propagation point of view and explain the underlying assumption of the model in physical terms. The validation of the proposed model by means of measured data obtained from two completely different measurement campaigns reveals its ability to better predict capacity and spatial channel structure than other popular stochastic channel models.

Modulation and demodulation for cooperative diversity in wireless systems

Abstract: This paper develops a general framework for maximum likelihood (ML) demodulation in cooperative wireless communication systems. Demodulators with piecewise-linear combining are proposed as an accurate approximation of the nonlinear ML detectors for coherent and noncoherent decode-and-forward (DF). The detectors with piecewise-linear combiner not only have certain implementation advantages over the nonlinear ML detectors, but also can lead to tight closed-form approximations for their error probabilities. High SNR approximations are derived based on the closed-form BER expressions. For noncoherent DF, the approximation suggests a different optimal location for the relay in DF than for the relay in amplify-and-forward (AF). A set of tight bounds of diversity order for coherent and noncoherent DF with multiple relays is also provided, and comparison between DF and AF suggests that DF with more than one relay loses about half of the diversity order of AF

Error rate performance analysis of coded free-space optical links over gamma-gamma atmospheric turbulence channels

Abstract: Error control coding can be used over free-space optical (FSO) links to mitigate turbulence-induced fading. In this paper, we derive error performance bounds for coded FSO communication systems operating over atmospheric turbulence channels, considering the recently introduced gamma-gamma turbulence model. We derive a pairwise error probability (PEP) expression and then apply the transfer function technique in conjunction with the derived PEP to obtain upper bounds on the bit error rate. Simulation results are further demonstrated to confirm the analytical results

Virtual MIMO-based cooperative communication for energy-constrained wireless sensor networks

Abstract: An energy-efficient virtual multiple-input multiple-output (MIMO)-based communication architecture is proposed for distributed and cooperative wireless sensor networks. Assuming a space-time block coding (STBC) based MIMO system, the energy and delay efficiencies of the proposed scheme are derived using semi-analytic techniques. The dependence of these efficiency values on physical channel propagation parameters, fading coherence time and the amount of required training is also investigated. The results show that with judicious choice of design parameters the virtual MIMO technique can be made to provide significant energy and delay efficiencies, even after allowing for additional training overheads.

Analysis of wireless geolocation in a non-line-of-sight environment

Abstract: We present an analysis of the time-of-arrival (TOA), time-difference-of-arrival (TDOA), angle-of-arrival (AOA) and signal strength (SS) based positioning methods in a non-line-of-sight (NLOS) environment. Single path (line-of-sight (LOS) or NLOS) propagation is assumed. The best geolocation accuracy is evaluated in terms of the Cramer-Rao lower bound (CRLB) or the generalized CRLB (G-CRLB), depending on whether prior statistics of NLOS induced errors are unavailable or available. We then show that the maximum likelihood estimator (MLE) using only LOS estimates and the maximum a posteriori probability (MAP) estimator using both LOS and NLOS data can asymptotically achieve the CRLB and the G-CRLB, respectively. Hybrid schemes that adopt more than one type of position-pertaining data and the relationship among the four methods in terms of their positioning accuracy are also investigated.

Distributed algorithms for maximum lifetime routing in wireless sensor networks

Abstract: A sensor network of nodes with wireless transceiver capabilities and limited energy is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at which the first node in the network drains out of energy. The problem is formulated as a linear programming problem and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms have low computational complexity and are guaranteed to converge to an optimal routing scheme that maximizes the network lifetime. The algorithms are illustrated by an example in which an optimal flow is computed for a network of randomly distributed nodes. We also show how our approach can be used to obtain distributed algorithms for many different extensions to the problem. Finally, we extend our problem formulation to more general definitions of network lifetime to model realistic scenarios in sensor networks

RSS-Based Location Estimation with Unknown Pathloss Model

Abstract: Recently, received signal strength (RSS)-based location estimation technique has been proposed as a low-cost, low-complexity solution for many novel location-aware applications. In the existing studies, radio propagation pathloss model is assumed known a priori, which is an oversimplification in many application scenarios. In this paper we present a detailed study on the RSS-based joint estimation of unknown location coordinates and distance-power gradient, a parameter of pathloss model. A nonlinear least-square estimator is presented and the performance of the algorithm is studied based on CRB and various simulation results. From simulation results it is shown that the proposed joint estimator is especially useful for location estimation in unknown or changing environments

Asynchronous cooperative diversity

Abstract: Cooperative diversity, which employs multiple nodes for the simultaneous relaying of a given packet in wireless ad hoc networks, has been shown to be an effective means of improving diversity, and, hence, mitigating the detrimental effects of multipath fading. However, in previously proposed cooperative diversity schemes, it has been assumed that coordination among the relays allows for accurate symbol-level timing synchronization at the destination and orthogonal channel allocation, which can be quite costly in terms of signaling overhead in mobile ad hoc networks, which are often defined by their lack of a fixed infrastructure and the difficulty of centralized control. In this paper, cooperative diversity schemes are considered that do not require symbol-level timing synchronization or orthogonal channelization between the relays employed. In the process, a novel minimum mean-squared error (MMSE) receiver is designed for combining disparate inputs in the multiple-relay channel. Outage probability calculations and simulation results demonstrate the not unexpected significant performance gains of the proposed schemes over single-hop transmission, and, more importantly, demonstrate performance comparable to schemes requiring accurate symbol-level synchronization and orthogonal channelization

Optimal training signals for MIMO OFDM channel estimation

Abstract: This paper presents general classes of optimal training signals for the estimation of frequency-selective channels in MIMO OFDM systems. Basic properties of the discrete Fourier transform are used to derive the optimal training signals which minimize the channel estimation mean square error. Both single and multiple OFDM training symbols are considered. Several optimal pilot tone allocations across the transmit antennas are presented and classified as frequency-division multiplexing, time-division multiplexing, code-division multiplexing in the frequency-domain, code-division multiplexing in the time-domain, and combinations thereof. All existing optimal training signals in the literature are special cases of the presented optimal training signals and our designs can be applied to pilot-only schemes as well as pilot-data-multiplexed schemes.

Downlink Radio Resource Allocation for Multi-Cell OFDMA System

Abstract: This paper presents a radio resource control (RRC) scheme for OFDMA systems where dynamic resource allocation is realized at both a radio network controller (RNC) and base stations (BSs). The scheme is semi-distributed in the sense that the RRC decision is split between RNC and BSs. RNC makes decision on which channel is used by which BS at super-frame level and BSs then make decision on which user is assigned to which channel at frame-level. Two optimization problems for RNC and BSs are formulated and computationally efficient algorithms that perform the function of interference avoidance and traffic/channel adaptation are developed. Numerical analysis is performed under several cell configurations to show tradeoffs between sector interference suppression and dynamic interference avoidance. The results indicate that with reasonable signaling overhead, the protocol and the associated algorithms yield excellent performance for both real-time and non real-time services, even under fast fading

Performance degradation of OFDM systems due to Doppler spreading

Abstract: The focus of this paper is on the performance of orthogonal frequency division multiplexing (OFDM) signals in mobile radio applications, such as 802.11a and digital video broadcasting (DVB) systems, e.g., DVB-CS2. The paper considers the evaluation of the error probability of an OFDM system transmitting over channels characterized by frequency selectivity and Rayleigh fading. The time variations of the channel during one OFDM symbol interval destroy the orthogonality of the different subcarriers and generate power leakage among the subcarriers, known as inter-carrier interference (ICI). For conventional modulation methods such as phase-shift keying (PSK) and quadrature-amplitude modulation (QAM), the bivariate probability density function (pdf) of the ICI is shown to be a weighted Gaussian mixture. The large computational complexity involved in using the weighted Gaussian mixture pdf to evaluate the error probability serves as the motivation for developing a two-dimensional Gram-Charlier representation for the bivariate pdf of the ICI. It is demonstrated that its truncated version of order 4 or 6 provides a very good approximation in the evaluation of the error probability for PSK and QAM in the presence of ICI. Based on Jakes' model for the Doppler effects, and an exponential multipath intensity profile, numerical results for the error probability are illustrated for several mobile speeds

Capacity of MIMO Rician channels

Abstract: This paper presents exact results on the capacity of multiple-input-multiple-output (MIMO) Rician channels when perfect channel state information (CSI) is assumed at the receiver but the transmitter has neither instantaneous nor statistical CSI. It first derives the exact expression for the average mutual information (MI) rate of MIMO Rician fading channels when the fading coefficients are independent but not necessarily identically distributed. The results for the independent and identically distributed (i.i.d.) MIMO Rician and Rayleigh fading channels are also obtained as special cases. These results are derived using a different approach than the one used by Telatar for the i.i.d. Rayleigh case. The complementary cumulative distribution function (CCDF) of the MI is also obtained using a Gaussian approximation. The CDF of MI can serve as an upper bound to the outage probability of nonergodic MIMO Rician channels. Numerical results confirm that for a fixed channel gain, a strong tine-of-sight component decreases the channel capacity due to the lack of scattering.

Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks

Abstract: We consider the joint optimal design of the physical, medium access control (MAC), and routing layers to maximize the lifetime of energy-constrained wireless sensor networks. The problem of computing lifetime-optimal routing flow, link schedule, and link transmission powers for all active time slots is formulated as a non-linear optimization problem. We first restrict the link schedules to the class of interference-free time division multiple access (TDMA) schedules. In this special case, we formulate the optimization problem as a mixed integerconvex program, which can be solved using standard techniques. Moreover, when the slots lengths are variable, the optimization problem is convex and can be solved efficiently and exactly using interior point methods. For general non-orthogonal link schedules, we propose an iterative algorithm that alternates between adaptive link scheduling and computation of optimal link rates and transmission powers for a fixed link schedule. The performance of this algorithm is compared to other design approaches for several network topologies. The results illustrate the advantages of load balancing, multihop routing, frequency reuse, and interference mitigation in increasing the lifetime of energy-constrained networks. We also briefly discuss computational approaches to extend this algorithm to large networks

Capacity-achieving input covariance for single-user multi-antenna channels

Abstract: We characterize the capacity-achieving input covariance for multi-antenna channels known instantaneously at the receiver and in distribution at the transmitter. Our characterization, valid for arbitrary numbers of antennas, encompasses both the eigenvectors and the eigenvalues. The eigenvectors are found for zero-mean channels with arbitrary fading profiles and a wide range of correlation and keyhole structures. For the eigenvalues, in turn, we present necessary and sufficient conditions as well as an iterative algorithm that exhibits remarkable properties: universal applicability, robustness and rapid convergence. In addition, we identify channel structures for which an isotropic input achieves capacity.

Performance bounds of multihop wireless communications with blind relays over generalized fading channels

Abstract: In this letter, efficient performance bounds for multihop wireless communications systems with non-regenerative blind relays over non-identical Nakagami-n (Rice), Nakagami-m and Nakagami-q (Hoyt) generalized fading channels, are presented. More specifically, the end-to-end signal-to-noise ratio (SNR) is formulated and upper bounded by using the well-known inequality between harmonic and geometric mean of positive random variables. This bound is used to study important system's performance metrics: i) the moments of the end-to-end SNR which are obtained in closed-forms, and ii) the outage probability and the average error probability for coherent and non-coherent modulations, which are accurately approximated using the moments-based approach. Furthermore, new analytical formulae are derived for the gain of previously proposed semi-blind relays in generalized fading environments. These kind of relays are used in numerical examples and computer simulations to verify the accuracy and to show the tightness of the proposed bounds.

Geolocation in mines with an impulse response fingerprinting technique and neural networks

Abstract: The location of people, mobile terminals and equipment is highly desirable for operational enhancements in the mining industry. In an indoor environment such as a mine, the multipath caused by reflection, diffraction and diffusion on the rough sidewall surfaces, and the non-line of sight (NLOS) due to the blockage of the shortest direct path between transmitter and receiver are the main sources of range measurement errors. Unreliable measurements of location metrics such as received signal strengths (RSS), angles of arrival (AOA) and times of arrival (TOA) or time differences of arrival (TDOA), result in the deterioration of the positioning performance. Hence, alternatives to the traditional parametric geolocation techniques have to be considered. In this paper, we present a novel method for mobile station location using wideband channel measurement results applied to an artificial neural network (ANN). The proposed system, the wide band neural network-locate (WBNN-locate), learns off-line the location 'signatures' from the extracted location-dependent features of the measured channel impulse responses for line of sight (LOS) and non-line of sight (NLOS) situations. It then matches on-line the observation received from a mobile station against the learned set of 'signatures' to accurately locate its position. The location accuracy of the proposed system, applied in an underground mine, has been found to be 2 meters for 90% and 80% of trained and untrained data, respectively. Moreover, the proposed system may also be applicable to any other indoor situation and particularly in confined environments with characteristics similar to those of a mine (e.g. rough sidewalls surface).

The COST259 Directional Channel Model-Part I: Overview and Methodology

Abstract: This paper describes a model for mobile radio channels that includes consideration of directions of arrival and is thus suitable for simulations of the performance of wireless systems that use smart antennas. The model is specified for 13 different types of environments, covering macro- micro- and picocells. In this paper, a hierarchy of modeling concepts is described, as well as implementation aspects that are valid for all environments. The model is based on the specification of directional channel impulse response functions, from which the impulse response functions at all antenna elements can be obtained. A layered approach, which distinguishes between external (fixed), large-scale-, and small-scale- parameters allows an efficient parameterization. Different implementation methods, based on either a tapped-delay line or a geometrical model, are described. The paper also derives the transformation between those two approaches. Finally, the concepts of clusters and visibility regions are used to account for large delay and angular spreads that have been measured. In two companion papers, the environment-specific values of the model parameters are explained and justified

Vertical handover-decision-making algorithm using fuzzy logic for the integrated Radio-and-OW system

Abstract: -Due to the complementary nature of radio and optical wireless (OW) both in capacity and coverage, the combined use of both for data transmission could have advantages over a single media. However, big technical challenges for vertical-handover (VHO) strategy arise for such an integrated system. According to different interruption types and traffic modes, two basic VHO schemes can be applied: immediate VHO (I-VHO) and dwell VHO (D-VHO). This paper proposes a novel fuzzy-logic (FL)-based decision-making algorithm for VHO, which is capable of combining the merits of both schemes to achieve excellent handover in terms of packet transfer delay for all the cases considered here. The strength of FL in handling uncertain and conflicting decision metrics is exploited. Since excessive transfer delay results in disrupted connection and corrupted service, the proposed FL-based VHO decision-making algorithm has the potential to provide a better quality of service (QoS) to users in future wireless broadband communications.

Cross-layer optimization of wireless networks using nonlinear column generation

Abstract: We consider the problem of finding the jointly optimal end-to-end communication rates, routing, power allocation and transmission scheduling for wireless networks. In particular, we focus on finding the resource allocation that achieves fair end-to-end communication rates. Using realistic models of several rate and power adaption schemes, we show how this cross-layer optimization problem can be formulated as a nonlinear mathematical program. We develop a specialized solution method, based on a nonlinear column generation technique, and prove that it converges to the globally optimal solution. We present computational results from a large set of networks and discuss the insight that can be gained about the influence of power control, spatial reuse, routing strategies and variable transmission rates on network performance.

MASK: anonymous on-demand routing in mobile ad hoc networks

Abstract: The shared wireless medium of mobile ad hoc networks facilitates passive, adversarial eavesdropping on data communications whereby adversaries can launch various devastating attacks on the target network. To thwart passive eavesdropping and the resulting attacks, we propose a novel anonymous on-demand routing protocol, termed MASK, which can accomplish both MAC-layer and network-layer communications without disclosing real IDs of the participating nodes under a rather strong adversary model. MASK offers the anonymity of senders, receivers, and sender-receiver relationships in addition to node unlocatability and untrackability and end-to-end flow untraceability. It is also resistant to a wide range of attacks. Moreover, MASK preserves the high routing efficiency as compared to previous proposals. Detailed simulation studies have shown that MASK is highly effective and efficient

Performance analysis of turbo-coded APSK modulations over nonlinear satellite channels

Abstract: This paper investigates the performance of M-ary amplitude-phase shift keying (APSK) digital modulation over typical nonlinear satellite channels. The effect of the satellite nonlinearity is studied, and distortion pre- and post-compensation techniques for coded APSK are presented. Moreover, clock timing, signal amplitude and carrier phase recovery schemes are discussed. For the latter, a new class of non turbo decoder-aided closed-loop phase synchronizers featuring good performance and low complexity is studied. Finally, an end-to-end coded APSK system simulator inclusive of the satellite channel model and synchronization sub-systems is discussed and its performance compared to standard trellis-coded QAM concatenated with Reed-Solomon codes, showing a remarkable gain in both power and spectral efficiency. Coded APSK, recently selected for the new standard -DVB-S2- for digital video broadcasting and interactive broadband satellite services, is shown to represent a powerand spectral-efficient solution for satellite nonlinear channels

The COST 259 Directional Channel Model-Part II: Macrocells

Abstract: This paper describes the attributes of the COST 259 directional channel model that are applicable for use in the design and implementation of macrocellular mobile and portable radio systems and associated technology. Special care has been taken to model all propagation mechanisms that are currently understood to contribute to the characteristics of practical macrocellular channels and confirm that large scale, small scale, and directional characteristics of implemented models are realistic through their comparison with available measured data. The model that is described makes full use of previously published work, as well as incorporating some new results. It is considered that its implementation should contribute to a too) that can be used for simulations and comparison of different aspects of a large variety of wireless communication systems, including those that exploit the spatial aspects of radio channels, as, for example, through the use of adaptive antenna systems

Novel Sum-of-Sinusoids Simulation Models for Rayleigh and Rician Fading Channels

Abstract: The statistical properties of Clarke's fading model with a finite number of sinusoids are analyzed, and an improved reference model is proposed for the simulation of Rayleigh fading channels. A novel statistical simulation model for Rician fading channels is examined. The new Rician fading simulation model employs a zero-mean stochastic sinusoid as the specular (line-of-sight) component, in contrast to existing Rician fading simulators that utilize a non-zero deterministic specular component. The statistical properties of the proposed Rician fading simulation model are analyzed in detail. It is shown that the probability density function of the Rician fading phase is not only independent of time but also uniformly distributed over [-pi, pi). This property is different from that of existing Rician fading simulators. The statistical properties of the new simulators are confirmed by extensive simulation results, showing good agreement with theoretical analysis in all cases. An explicit formula for the level-crossing rate is derived for general Rician fading when the specular component has non-zero Doppler frequency

On the capacity of doubly correlated MIMO channels

Abstract: In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming the channel is unknown at the transmitter and perfectly known at the receiver. We first derive the determinant representation for the exact characteristic function of the capacity, which is then used to determine the trace representations for the mean, variance, skewness, kurtosis, and other higher-order statistics (HOS). These results allow us to exactly evaluate two relevant information-theoretic capacity measures - ergodic capacity and outage capacity - and the HOS of the capacity for such a MIMO channel. The analytical framework presented in the paper is valid for arbitrary numbers of antennas, and generalizes the previously known results for independent and identically distributed or one-sided correlated MIMO channels to the case when fading correlation exists on both sides. We verify our analytical results by comparing them with Monte Carlo simulations for a correlation model based on realistic channel measurements as well as a classical exponential correlation model

Supporting QoS in IEEE 802.11e wireless LANs

Abstract: In the emerging IEEE 802.11e MAC protocol, the enhanced distributed channel access (EDCA) is proposed to support prioritized QoS; however, it cannot guarantee strict QoS required by real-time services such as voice and video without proper network control mechanisms. To overcome this deficiency, we first build an analytical model to derive an average delay estimate for the traffic of different priorities in the unsaturated 802.11e WLAN, showing that the QoS requirements of the real-time traffic can be satisfied if the input traffic is properly regulated. Then, we propose two effective call admission control schemes and a rate control scheme that relies on the average delay estimates and the channel busyness ratio, an index that can accurately represent the network status. The key idea is, when accepting a new real-time flow, the admission control algorithm considers its effect on the channel utilization and the delay experienced by existing real-time flows, ensuring that the channel is not overloaded and the delay requirements are not violated. At the same time, the rate control algorithm allows the best effort traffic to fully use the residual bandwidth left by the real-time traffic, thereby achieving high channel utilization

Optimal transmission scheduling over a fading channel with energy and deadline constraints

Abstract: We seek to maximize the average data throughput of a single transmitter sending data over a fading channel to a single user class. The transmitter has a fixed amount of energy and a limited amount of time to send data. Given that the channel state determines the throughput obtained per unit of energy expended, the goal is to obtain a policy for scheduling transmissions that maximizes the expected data throughput. We develop a dynamic programming formulation that leads to an optimal transmission schedule, first where the present channel state is known just before transmission, and then to the case where the current channel state is unknown before transmission, but observed after transmission and evolves according to a Markov process. We then extend our approach to the problem of minimizing the expected energy required to send a fixed amount of data over a fading channel given deadline constraints.