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

Effective capacity: a wireless link model for support of quality of service

Abstract: To facilitate the efficient support of quality of service (QoS) in next-generation wireless networks, it is essential to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay, and delay-violation probability. However, the existing wireless channel models, i.e., physical-layer channel models, do not explicitly characterize a wireless channel in terms of these QoS metrics. In this paper, we propose and develop a link-layer channel model termed effective capacity (EC). In this approach, we first model a wireless link by two EC functions, namely, the probability of nonempty buffer, and the QoS exponent of a connection. Then, we propose a simple and efficient algorithm to estimate these EC functions. The physical-layer analogs of these two link-layer EC functions are the marginal distribution (e.g., Rayleigh-Ricean distribution) and the Doppler spectrum, respectively. The key advantages of the EC link-layer modeling and estimation are: 1) ease of translation into QoS guarantees, such as delay bounds; 2) simplicity of implementation; and 3) accuracy, and hence, efficiency in admission control and resource reservation. We illustrate the advantage of our approach with a set of simulation experiments, which show that the actual QoS metric is closely approximated by the QoS metric predicted by the EC link-layer model, under a wide range of conditions.

End-to-end performance of transmission systems with relays over Rayleigh-fading channels

Abstract: End-to-end performance of two-hop wireless communication systems with nonregenerative relays over flat Rayleigh-fading channels is presented. This is accomplished by deriving and applying some new closed-form expressions for the statistics of the harmonic mean of two independent exponential variates. It is shown that the presented results can either be exact or tight lower bounds on the performance of these systems depending on the choice of the relay gain. More specifically, average bit-error rate expressions for binary differential phase-shift keying, as well as outage probability formulas for noise limited systems are derived. Finally, comparisons between regenerative and nonregenerative systems are presented. Numerical results show that the former systems clearly outperform the latter ones for low average signal-to-noise-ratio (SNR). They also show that the two systems have similar performance at high average SNR.

New exponential bounds and approximations for the computation of error probability in fading channels

Abstract: We present new exponential bounds for the Gaussian Q function (one- and two-dimensional) and its inverse, and for M-ary phase-shift-keying (MPSK), M-ary differential phase-shift-keying (MDPSK) error probabilities over additive white Gaussian noise channels. More precisely, the new bounds are in the form of the sum of exponential functions that, in the limit, approach the exact value. Then, a quite accurate and simple approximate expression given by the sum of two exponential functions is reported. The results are applied to the general problem of evaluating the average error probability in fading channels. Some examples of applications are also presented for the computation of the pairwise error probability of space-time codes and the average error probability of MPSK and MDPSK in fading channels.

A robust timing and frequency synchronization for OFDM systems

Abstract: A robust symbol-timing and carrier-frequency synchronization scheme applicable to orthogonal frequency-division-multiplexing systems is presented. The proposed method is based on a training symbol specifically designed to have a steep rolloff timing metric. The proposed timing metric also provides a robust sync detection capability. Both time domain training and frequency domain (FD) training are investigated. For FD training, maintaining a low peak-to-average power ratio of the training symbol was taken into consideration. The channel estimation scheme based on the designed training symbol was also incorporated in the system in order to give both fine-timing and frequency-offset estimates. For fine frequency estimation, two approaches are presented. The first one is based on the suppression of the interference introduced in the frequency estimation process by the training symbol pattern in the context of multipath dispersive channels. The second one is based on the maximum likelihood principle and does not suffer from any interference. A new performance measure is introduced for timing estimation, which is based on the plot of signal to timing-error-induced average interference power ratio against the timing estimate shift. A simple approach for finding the optimal setting of the timing estimator is presented. Finally, the sync detection, timing estimation, frequency estimation, and bit-error-rate performance of the proposed method are presented in a multipath Rayleigh fading channel.

Computationally efficient bandwidth allocation and power control for OFDMA

Abstract: The paper studies the problem of finding an optimal subcarrier and power allocation strategy for downlink communication to multiple users in an orthogonal-frequency-division multiplexing-based wireless system. The problem of minimizing total power consumption with constraints on bit-error rate and transmission rate for users requiring different classes of service is formulated and simple algorithms with good performance are derived. The problem of joint allocation is divided into two steps. In the first step, the number of subcarriers that each user gets is determined based on the users' average signal-to-noise ratio. The algorithm is shown to find the distribution of subcarriers that minimizes the total power required when every user experiences a flat-fading channel. In the second stage of the algorithm, it finds the best assignment of subcarriers to users. Two different approaches are presented, the rate-craving greedy algorithm and the amplitude-craving greedy algorithm. A single cell with one base station and many mobile stations is considered. Numerical results demonstrate that the proposed low complexity algorithms offer comparable performance with an existing iterative algorithm.

A new simple model for land mobile satellite channels: first- and second-order statistics

Abstract: We propose a new shadowed Rice (1948) model for land mobile satellite channels. In this model, the amplitude of the line-of-sight is characterized by the Nakagami distribution. The major advantage of the model is that it leads to closed-form and mathematically-tractable expressions for the fundamental channel statistics such as the envelope probability density function, moment generating function of the instantaneous power, and the level crossing rate. The model is very convenient for analytical and numerical performance prediction of complicated narrowband and wideband land mobile satellite systems, with different types of uncoded/coded modulations, with or without diversity. Comparison of the first- and the second-order statistics of the proposed model with different sets of published channel data demonstrates the flexibility of the new model in characterizing a variety of channel conditions and propagation mechanisms over satellite links. Interestingly, the proposed model provides a similar fit to the experimental data as the well-accepted Loo's (1985) model but with significantly less computational burden.

Capacity regions for wireless ad hoc networks

Abstract: We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable-rate transmission, single-hop or multihop routing, power control, and successive interference cancellation (SIC). Multihop cellular networks and networks with energy constraints are studied as special cases. With slight modifications, the developed formulation can handle node mobility and time-varying flat-fading channels. Numerical results indicate that multihop routing, the ability for concurrent transmissions, and SIC significantly increase the capacity of ad hoc and multihop cellular networks. On the other hand, gains from power control are significant only when variable-rate transmission is not used. Also, time-varying flat-fading and node mobility actually improve the capacity. Finally, multihop routing greatly improves the performance of energy-constraint networks.

Space-time diversity systems based on linear constellation precoding

Abstract: We present a unified approach to designing space-time (ST) block codes using linear constellation precoding (LCP). Our designs are based either on parameterizations of unitary matrices, or on algebraic number-theoretic constructions. With an arbitrary number of N/sub t/ transmit- and N/sub r/ receive-antennas, ST-LCP achieves rate 1 symbol/s/Hz and enjoys diversity gain as high as N/sub t/N/sub r/ over (possibly correlated) quasi-static and fast fading channels. As figures of merit, we use diversity and coding gains, as well as mutual information of the underlying multiple-input-multiple-output system. We show that over quadrature-amplitude modulation and pulse-amplitude modulation, our LCP achieves the upper bound on the coding gain of all linear precoders for certain values of N/sub t/ and comes close to this upper bound for other values of N/sub t/, in both correlated and independent fading channels. Compared with existing ST block codes adhering to an orthogonal design (ST-OD), ST-LCP offers not only better performance, but also higher mutual information for N/sub t/>2. For decoding ST-LCP, we adopt the near-optimum sphere-decoding algorithm, as well as reduced-complexity suboptimum alternatives. Although ST-OD codes afford simpler decoding, the tradeoff between performance and rate versus complexity favors the ST-LCP codes when N/sub t/, N/sub r/, or the spectral efficiency of the system increase. Simulations corroborate our theoretical findings.

Planning UMTS base station location: optimization models with power control and algorithms

Abstract: Classical coverage models, adopted for second-generation cellular systems, are not suited for planning Universal Mobile Telecommunication System (UMTS) base station (BS) location because they are only based on signal predictions and do not consider the traffic distribution, the signal quality requirements, and the power control (PC) mechanism. We propose discrete optimization models and algorithms aimed at supporting the decisions in the process of planning where to locate new BSs. These models consider the signal-to-interference ratio as quality measure and capture at different levels of detail the signal quality requirements and the specific PC mechanism of the wideband CDMA air interface. Given that these UMTS BS location models are nonpolynomial (NP)-hard, we propose two randomized greedy procedures and a tabu search algorithm for the uplink (mobile to BS) direction which is the most stringent one from the traffic point of view in the presence of balanced connections such as voice calls. The different models, which take into account installation costs, signal quality and traffic coverage, and the corresponding algorithms, are compared on families of small to large-size instances generated by using classical propagation models.

Experimental characterization of the MIMO wireless channel: data acquisition and analysis

Abstract: Detailed performance assessment of space-time coding algorithms in realistic channels is critically dependent upon accurate knowledge of the wireless channel spatial characteristics. This paper presents an experimental measurement platform capable of providing the narrowband channel transfer matrix for wireless communications scenarios. The system is used to directly measure key multiple-input-multiple-output parameters in an indoor environment at 2.45 GHz. Linear antenna arrays of different sizes and construction with up to ten elements at transmit and receive are utilized in the measurement campaign. This data is analyzed to reveal channel properties such as transfer matrix element statistical distributions and temporal and spatial correlation. Additionally, the impact of parameters such as antenna element polarization, directivity, and array size on channel capacity are highlighted. The paper concludes with a discussion of the relationship between multipath richness and path loss, as well as their joint role in determining channel capacity.

The Ricean K factor: estimation and performance analysis

Abstract: In wireless communications, the relative strength of the direct and scattered components of the received signal, as expressed by the Ricean K factor, provides an indication of link quality. Accordingly, efficient and accurate methods for estimating K are of considerable interest. In this paper, we propose a general class of moment-based estimators which use the signal envelope. This class of estimators unifies many of the previous estimators, and introduces new ones. We derive, for the first time, the asymptotic variance (AsV) of these estimators and compare them with the Cramer-Rao bound (CRB). We then tackle the problem of estimating K from the in-phase and quadrature-phase (I/Q) components of the received signal and illustrate the improvement in performance as compared with the envelope-based estimators. We derive the CRBs for the I/Q data model, which, unlike the envelope CRB, is tractable for correlated samples. Furthermore, we introduce a novel estimator that relies on the I/Q components, and derive its AsV even when the channel samples are correlated. We corroborate our analytical findings by simulations.

A joint-channel diagonalization for multiuser MIMO antenna systems

Abstract: In this paper, we address the problem of improving the performance of multiuser space-division multiplexing (SDM) systems where multiple independent signal streams can be transmitted in the same frequency and time slot. The problem is important in multiuser multiple-input multiple-output systems where communication from one base station to many mobile stations can occur simultaneously. Our objective is to devise a multiuser linear space-time precoder for simultaneous channel diagonalization of the multiuser channels enabling SDM. Our new approach is based on diagonalizing the multiuser channel matrices and we use a variation of successive Jacobi rotations. In addition to the diagonalization, our approach attempts to optimize the resultant channel gains for performance enhancement. Our method is valid for both frequency-flat and frequency-selective fading channels but we assume that the base station knows all the channels and that they are quasi-stationary.

A channelized digital ultrawideband receiver

Abstract: A channelized digital ultrawideband (UWB) receiver that efficiently samples the UWB signal at a fraction of the chip frequency is proposed. The received signal is channelized in the frequency domain by employing a bank of mixers and low-pass filters. After sampling at a much reduced frequency, digital synthesis filters optimally estimate the transmitted signals. The signal-to-noise ratio (SNR) of the proposed receiver has been solved and compared against an ideal conventional receiver, which is defined as a receiver that samples at the signal Nyquist rate. When finite resolution analog-to-digital converters (ADC) are employed in the presence of a large narrowband interferer, the proposed receiver significantly outperforms the ideal conventional receiver. For example, the SNR of the proposed receiver is as much as 20 dB higher than the ideal conventional receiver when a 4-bit ADC is used in the presence of a 50 dB (relative to the noise floor) brickwall narrowband interferer with a bandwidth of 15% of the chip frequency.

Optimization of urban optical wireless communication systems

Abstract: Urban optical wireless communication systems are considered a "last mile" technology. An optical wireless communication system uses the atmosphere as a propagation medium. In order to provide line-of-sight (LOS), the transceivers are placed on high-rise buildings. However, dynamic wind loads, thermal expansion, and weak earthquakes cause buildings to sway. These sways require the designer to increase the transmitter beam divergence angle so as to maintain LOS between the transmitter and the receiver. It is clear that an overly wide divergence angle increases the required laser power, and, as a result, terminal cost and complexity increase. On the other hand, an overly narrow beam divergence angle may result in cutoff in communication when there is building sway. In this paper, we derive a mathematical model to minimize transmitter power and optimize transmitter gain (divergence angle) as a function of the building-sway statistics, the communication system parameters, and the required bit-error probability (BEP). Reduction in laser power could improve overall system performances and cost. For example, for BEP of 10/sup -9/, we can attain at least a 4-dB reduction of the required transmitter power in comparison to a system with both half and twice the optimum beam divergence angle.

Optimum power control for successive interference cancellation with imperfect channel estimation

Abstract: Successive interference cancellation, in conjunction with orthogonal convolutional codes, has been shown to approach the Shannon capacity for an additive white Gaussian noise channel. However, this requires highly accurate estimates for the amplitude and phase of each user's signal. We derive an optimal power control strategy specifically designed to maximize the overall capacity under the constraint of a high degree of estimation error. This power control strategy presents a general formula of which other power control algorithms are special cases. Even with estimation error as high as 50%, capacity can be approximately doubled relative to not using interference cancellation. In addition, when properly applied to multicell mobile networks, this power control scheme can reduce the handset transmit power, and therefore other-cell interference, by more than an order of magnitude.

A noncooperative power control game for multirate CDMA data networks

Abstract: The authors consider a multirate code-division multiple acess system, in which all users have the same chip rate and vary their data rate by adjusting the processing gain. The receivers are assumed to be implemented using conventional matched filters, whose performance is sensitive to the received power levels. The authors' goal is to maximize the total system throughput by means of power control. A game theoretic approach is adopted. It is shown that for a certain type of pricing function, a unique Nash equilibrium solution exists and it possesses nice global properties. For example, it can be shown that for the optimal solution a high-rate connection should maintain a higher energy per bit than low-rate ones. The asymptotic spectral efficiency is also derived.

Subspace-based blind channel estimation for OFDM by exploiting virtual carriers

Abstract: Reliable channel estimation is indispensable for orthogonal frequency-division multiplexing (OFDM) systems employing coherent detection and adaptive loading in order to achieve high data rate communications. Several options exist in practical OFDM systems-including training symbols, cyclic prefix, virtual carriers, pilot tones, and receiver diversity-to facilitate channel estimation. In this paper, a subspace blind channel estimation method based on exploiting the presence of virtual carriers is proposed for OFDM systems over a time-dispersive channel. The method can be applied to conventional OFDM systems with cyclic prefix as well as OFDM systems with no cyclic prefix. The reduction/elimination of cyclic prefix thereby provides the OFDM systems the potential to achieve higher channel utilization than most previously reported cyclic prefix based estimators. Sufficient channel identifiability condition is developed as well. Comparison with two other recently reported subspace methods is presented via computer simulations to support the effectiveness of the proposed method.

Optimizing an array of antennas for cellular coverage from a high altitude platform

Abstract: In a wireless communications network served by a high altitude platform (HAP) the cochannel interference is a function of the antenna beamwidth, angular separation and sidelobe level. At the millimeter wave frequencies proposed for HAPs, an array of aperture type antennas on the platform is a practicable solution for serving the cells. We present a method for predicting cochannel interference based on curve-fit approximations for radiation patterns of elliptic beams which illuminate cell edges with optimum power, and a means of estimating optimum beamwidths for each cell of a regular hexagonal layout. The method is then applied to a 121 cell architecture. Where sidelobes are modeled as a flat floor at 40-dB below peak directivity, a cell cluster size of four yields carrier-to-interference ratios (CIRs), which vary from 15 dB at cell edges to 27 dB at cell centers. On adopting a cluster size of seven, these figures increase, respectively, to 19 and 30 dB. On reducing the sidelobe level, the improvement in CIR can be quantified. The method also readily allows for regions of overlapping channel coverage to be shown.

Performance of adaptive MC-CDMA detectors in rapidly fading Rayleigh channels

Abstract: Multicarrier code-division multiple access (MC-CDMA) combines multicarrier transmission with direct sequence spread spectrum. Different approaches have been adopted which do not assume a perfectly known channel. We examine the forward-link performance of decision-directed adaptive detection schemes, with and without explicit channel estimation, for MC-CDMA systems operating in fast fading channels. We analyze theoretically the impact of channel estimation errors by first considering a simpler system employing a threshold orthogonality restoring combining (TORC) detector with a Kalman channel estimator. We show that the performance deteriorates significantly as the channel fading rate increases and that the fading rate affects the selection of system parameters. We examine the performance of more realistic schemes based on the minimum mean square error (MMSE) criterion using least mean square (LMS) and recursive least square (RLS) adaptation. We present a discussion which compares the decision-directed and pilot-aided approaches and explores the tradeoffs between channel estimation overhead and performance. We find that there is a fading rate range where each method provides a good tradeoff between performance and overhead. We conclude that the MMSE per carrier decision-directed detector with RLS estimation combines good performance in low to moderate fading rates, robustness in parameter variations, and relatively low complexity and overhead. For higher fading rates, however, only pilot-symbol-aided detectors are appropriate.

Theoretical analysis and performance of OFDM signals in nonlinear fading channels

Abstract: This paper presents an analytical framework to calculate the average symbol-error rate (SER) of uncoded orthogonal frequency-division multiplexing (OFDM) systems in realistic scenarios impaired by transmitter nonlinearity and frequency-selective fading channels. The results are applicable to cyclically extended OFDM signals characterized by a high number of carriers, which can be modeled as complex Gaussian processes. To avoid intercarrier interference, we also assume that the symbol duration is shorter than the channel coherence time. We derive analytical SER results in Rayleigh and Rice frequency-selective fading channels, for both the nonlinear amplification and the ideal predistortion case. Simulations results demonstrate the validity of the analytical results.

Coexistence mechanisms for interference mitigation in the 2.4-GHz ISM band

Abstract: Wireless technologies sharing the same frequency band and operating in the same environment often interfere with each other, causing severe decrease in performance. We propose two coexistence mechanisms based on traffic scheduling techniques that mitigate interference between different wireless systems operating in the 2.4-GHz industrial, medical, and scientific band. In particular, we consider IEEE 802.11 wireless local area networks (WLANs) and Bluetooth (BT) voice and data nodes, showing that the proposed algorithms can work when the two systems are able to exchange information as well as when they operate independently of one another. Results indicate that the proposed algorithms remarkably mitigate the interference between the IEEE 802.11 and BT technologies at the expense of a small additional delay in the data transfer. It is also shown that the impact of the interference generated by microwave ovens on the IEEE 802.11 WLANs performance can be significantly reduced through the mechanisms presented.

An efficient approach to multivariate Nakagami-m distribution using Green's matrix approximation

Abstract: An efficient approach for the evaluation of the Nakagami-m (1960) multivariate probability density function (PDF) and cumulative distribution function (CDF) with arbitrary correlation is presented. Approximating the correlation matrix with a Green's matrix, useful closed formulas for the joint Nakagami-m PDF and CDF, are derived. The proposed approach is a significant theoretical tool that can be efficiently used in the performance analysis of wireless communications systems operating over correlative Nakagami-m fading channels.

Training-based channel estimation for multiple-antenna broadband transmissions

Abstract: This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2/sup m/-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.

Adaptive multirate CDMA for uplink throughput maximization

Abstract: We determine the optimal adaptive rate and power control strategies to maximize the total throughput in a multirate code-division multiple-access system. The total throughput of the system provides a meaningful baseline in the form of an upper bound to the throughput achievable with additional restrictions imposed on the system to guarantee fairness. Peak power and instantaneous bit energy-to-noise spectral density constraints are assumed at the transmitter with matched filter detection at the receiver. Our results apply to frequency selective fading in so far as the bit energy-to-equivalent noise power spectral density ratio definition can be used as the quality-of-service metric. The bit energy-to-equivalent noise power spectral density ratio metric coincides with the bit-error rate metric under the assumption that the processing gains and the number of users are high enough so that self-interference can be neglected. We first obtain results for the case where the rates available to each user are unrestricted, and we then consider the more practical scenario where each user has a finite discrete set of rates. An upper bound to the maximum average throughput is obtained and evaluated for Rayleigh fading. Suboptimal low-complexity schemes are considered to illustrate the performance tradeoffs between optimality and complexity. We also show that the optimum rate and power adaptation scheme with unconstrained rates is in fact just a rate adaptation scheme with fixed transmit powers, and it performs significantly better than a scheme that uses power adaptation alone.

A mixed neural-genetic algorithm for the broadcast scheduling problem

Abstract: The broadcast scheduling problem (BSP) arises in frame design for packet radio networks (PRNs). The frame structure determines the main communication parameters: communication delay and throughput. The BSP is a combinatorial optimization problem which is known to be NP-hard. To solve it, we propose an algorithm with two main steps which naturally arise from the problem structure: the first one tackles the hardest contraints and the second one carries out the throughput optimization. This algorithm combines a Hopfield neural network for the constraints satisfaction and a genetic algorithm for achieving a maximal throughput. The algorithm performance is compared with that of existing algorithms in several benchmark cases; in all of them, our algorithm finds the optimum frame length and outperforms previous algorithms in the resulting throughput.

A comparative study of iterative channel estimators for mobile OFDM systems

Abstract: We investigate two iterative channel estimators for mobile orthogonal-frequency division multiplexing. The first estimator is based on iterative filtering and decoding whereas the second one uses an a posteriori probability (APP) algorithm. The first method consists of two cascaded one-dimensional Wiener filters, which interpolate the unknown time-varying two-dimensional frequency response in between the known pilot symbols. As shown, the performance can be increased by feeding back the likelihood values at the output of the APP-decoder to iteratively compute an improved estimate of the channel frequency response. The second method applies two APP estimators, one for the frequency and the other one for the time direction. The two estimators are embedded in an iterative loop similar to the turbo decoding principle. As shown in detail, this iterative estimator is superior and its performance is independent of whether the chosen time-frequency pilot grid satisfies the two-dimensional sampling theorem or not. The bit-error rate as a function of the signal-to-noise ratio is used as a performance measure. In addition, the convergence of the iterative decoding loop is studied with the extrinsic information transfer chart.

Layered space-time multiuser detection over wireless uplink systems

Abstract: In this paper, we investigate the use of layered space-time (also known as the vertical Bell Laboratories layered space-time (V-BLAST) scheme) for multiuser detection in fading channels. The multiple transmit antennas in V-BLAST are treated as individual mobile station transmitters, while the base station consists of multiple receive antennas. In the proposed system, users are organized in groups and allocated a unique spreading code within the same group. Using these codes, we are able to separate the different groups, and layered space-time algorithm is then invoked to further remove the remaining interference between users. A decorrelator-type receiver-based layered space-time detection is proposed for both complex and real constellations. For the latter case, we derive our receiver after evaluating and comparing the performance of two decorrelators based on the V-BLAST scheme. It is demonstrated that a significant performance improvement and increase in system capacity is obtained with very low spreading factors. Further results are also introduced by considering reduced complexity receivers based on serial layered space-time group multiuser detection, and parallel layered space-time group multiuser detection.

WCFQ: an opportunistic wireless scheduler with statistical fairness bounds

Abstract: We present wireless credit-based fair queuing (WCFQ), a new scheduler for wireless packet networks with provable statistical short- and long-term fairness guarantees. WCFQ exploits the fact that users contending for the wireless medium will have different "costs" of transmission depending on their current channel condition. For example, in systems with variable coding, a user with a high-quality channel can exploit its low-cost channel and transmit at a higher data rate. Similarly, a user in a code-division multiple access system with a high-quality channel can use a lower transmission power. Thus, WCFQ provides a mechanism to exploit inherent variations in channel conditions and select low-cost users in order to increase the system's overall performance (e.g., total throughput). However, opportunistic selection of the best user must be balanced with fairness considerations. In WCFQ, we use a credit abstraction and a general "cost function" to address these conflicting objectives. This provides system operators with the flexibility to achieve a range of performance behaviors between perfect fairness of temporal access independent of channel conditions and purely opportunistic scheduling of the best user without consideration of fairness. To quantify the system's fairness characteristics within this range, we develop an analytical model that provides a statistical fairness bound in terms of the cost function and the statistical properties of the channel. An extensive set of simulations indicate that the scheme is able to achieve significant throughput gains while balancing temporal fairness constraints.

Optimal resource allocation in multiservice CDMA networks

Abstract: This paper addresses the problem of dynamic resource allocation in a multiservice direct-sequence code-division multiple-access (DS-CDMA) wireless network supporting real-time (RT) and nonreal-time (NRT) communication services. For RT users, a simple transmission power allocation strategy is assumed that maximizes the amount of capacity available to NRT users without violating quality of service requirements of RT users. For NRT users, a joint transmission power and spreading gain (transmission rate) allocation strategy, obtained via the solution of a constrained optimization problem, is provided. The solution maximizes the aggregate NRT throughput, subject to peak transmission power constraints and the capacity constraint imposed by RT users. The optimization problem is solved in a closed form, and the resulting resource allocation strategy is simple to implement as a hybrid CDMA/time-division multiple-access strategy. Numerical results are presented showing that the optimal resource allocation strategy can offer substantial performance gains over other conventional resource allocation strategies for DS-CDMA networks.

A self-encryption mechanism for authentication of roaming and teleconference services

Abstract: A simple authentication technique for use in the global mobility network (GLOMONET) is proposed. This technique is based on the concept of distributed security management, i.e., the original security manager administrates the original authentication key (long-term secret key) acquired when a user makes a contract with his home network, while a temporary security manager is generated for a roaming user in the visited network that provides roaming services. The temporary security manager will take the place of the original security manager when the roaming user stays in the service area of the visited network. In the proposed authentication protocol for the regular communication phase, the procedures of the original security manager and the temporary security manager are the same except for introducing different parameters. Furthermore, the proposed technique not only reduces the number of transmissions during the authentication phase, but it also can decrease the complexity of mobile equipment. The idea behind the proposed technique is to introduce a simple mechanism which is called "self-encryption". We also suggest that this mechanism can be easily adopted as the authentication function for the secure teleconference service.