Fambirai Takawira

Nonclassical traffic modeling and performance analysis of cellular mobile networks with and without channel reservation

We present a two-moment performance analysis of cellular mobile networks with and without channel reservation. Unlike classical analysis where handoff traffic is modeled as Poisson, we characterize handoff traffic as a general traffic process and represent it using the first two moments of its offered traffic. We empirically show that handoff traffic is a smooth process under negative exponential channel holding times. We also show how one may determine customer-oriented grade-of-service parameters such as new-call blocking, handoff call blocking, and forced termination probability under the two-moment representation of traffic offered to each cell. We present extensive results validating our analysis. We compare the performance of the proposed two-moment analysis with classical single-moment analysis and simulation results. Our simulation employs five different mobility models. We show that our proposed model outperforms the existing analytical method when compared to simulation results employing all five mobility models.

Performance analysis of soft handoff in CDMA cellular networks

A unique feature of code division multiple access (CDMA) systems is the use of soft handoff between cells. Soft handoff, in general, increases the system capacity because while the link between a mobile and one base station is poor, it might be better between the same mobile and some other base station. Hence, the user may transmit at a lower power in a soft handoff situation. Teletraffic analysis of soft handoff is complex because one cannot separate transmission issues from traffic issues. Many papers in the literature have independently analyzed the effect of soft capacity and soft handoff on network performance. Some papers have analyzed the effect of soft handoff on soft capacity but there has been no proper teletraffic analysis that includes both soft capacity and soft handoff. This paper proposes a traffic model for a DS-CDMA cellular network that includes both soft capacity and soft handoff. Network performance is then computed in terms of call blocking.

Performance analysis of the linearly constrained constant modulus algorithm-based multiuser detector

This paper quantifies the adaptive performance of a blind adaptive multiuser detector (MUD) based on the linearly constrained constant modulus algorithm (LCCMA) in both a stationary and nonstationary channel. A framework is developed to apply the feedback analysis method to analyzing adaptive MUD schemes. A closed-form expression for the excess mean square error (EMSE) of LCCMA blind adaptive MUD in a CDMA communications system is derived for both of the steady-state and tracking cases. The effects of additive noise and multiple access interference are considered. A transient analysis is performed that predicts the learning curve of the adaptive filter. Computer simulation is used to verify the accuracy of the analysis.

Handoff traffic characterization in cellular networks under nonclassical arrivals and service time distributions

The phenomenal growth in the subscriber population has necessitated the accurate dimensioning and performance analysis of cellular networks. Classically, cellular networks have been analyzed using Poisson call arrivals and negative exponential channel holding times. However, these assumptions may not be valid for modern networks providing heterogeneous services and serving users with highly varied mobility. In this paper, we propose a moment-based approach for analyzing cellular networks under more generalized arrival processes and more generalized channel holding-time distributions. We present a model for accurately characterizing the handoff traffic offered by a cell to its neighbor in a simple two-cell scenario. We derive this handoff traffic for two different channel holding-time distributions. Our two-cell model easily lends itself to being used as a building block for analyzing more general cellular network layouts. We illustrate the accuracy of our analysis using comparison with simulation results.

An improved decoding algorithm for finite-geometry LDPC codes

In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.

Relay Selection for Coded Cooperative Networks with Outdated CSI over Nakagami-m Fading Channels

In this paper, we consider relay selection for turbo coded cooperative networks subject to Nakagami-m fading when the channel state information (CSI) is known at the receiver but is not necessarily ideal. This non-ideality may be due to a feedback delay caused by the difference between the instantaneous CSI during the transmission and the CSI at the time of relay selection, resulting in outdated CSI phenomena. The impact of the outdated CSI on the proposed scheme is well investigated. A closed-form expression for the exact outage probability is derived as well as its asymptotic expression in the high signal-to-noise (SNR) regime. Moreover, upper bounds on the bit-error rate (BER) are presented and a study of the diversity order reveals that for ideal CSI, full diversity in the number of relays and fading parameters m is achieved as opposed to outdated CSI where the achievable diversity is equivalent to the diversity of a coded cooperative network with a single relay.

Two bit-flipping decoding algorithms for low-density parity-check codes

In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density paritycheck (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.

The influence of spatial and temporal correlation on the capacity of MIMO channels

Wireless communication systems employing multiple antennas at both the transmitter and receiver have been shown to offer significant gains over single antenna systems. Recent studies on the capacity of multiple-input multiple output (MIMO) channels have focused on the effect of spatial correlation. The joint effect of spatial and temporal correlation has not been well studied. In this paper a geometric channel model is presented which considers motion of the receiver and non-isotropic scattering at both ends of the radio link. A joint space-time cross-correlation function is derived and variates with this correlation are generated using the vector autoregressive stochastic model. The outage capacity of this channel is considered where the effects of antenna spacing, antenna array angle, degree of non-isotropic scattering and receiver motion are investigated. When n transmit and n receive antennas are employed, it is shown that capacity still increases linearly with respect to n despite the presence of spatial and temporal correlation.

Multi-Relay Turbo-Coded Cooperative Diversity Networks Over Nakagami-

This paper studies a multi-relay adaptive turbo-coded cooperative diversity scheme over Nakagami- m fading channels. In the underlying scheme, after receiving a fraction of the codeword determined by a tradeoff parameter denoted by f, all the relays decode, and only the reliable relays forward the rest of the codeword to the destination. We assume binary phase-shift keying modulation and analyze the scheme under study in terms of bit error rate (BER) and outage probability. Union bounds on the BER are derived using the transfer function bounding and the limit-before-average techniques. Furthermore, we examine the asymptotic behavior of the system in the high-signal-to-noise-ratio (SNR) regime using the derived pairwise error probability (PEP). We also derive a closed-form expression for the outage probability of the system and its high-SNR approximation to evaluate the achievable diversity order. Simulations are provided to assess the accuracy of our analytical work.

m

Quality-of-service (QoS) guarantees are critical for the transmission of multimedia traffic over mobile wireless networks. Currently, wireless networks provide QoS guarantees using the legacy layered protocol architecture where each layer provides a separate, independent solution, with its own optimised adaptation and protection mechanisms. Cross-layer design has been proposed as a methodology to extend that paradigm in wireless links where there is interdependence between the layers and hence opportunity for information sharing. Recently, cross-layer adaptation mechanisms have been proposed which attempt to solve the QoS provisioning problem. However, most of these mechanisms only use the lower (physical and data link) layers and the possibility of using higher protocol layers remains unexplored. As a result, restrictions are placed on the system which introduces functional and efficiency limitations. Here, one such limitation is highlighted, namely the inability to insert more than one class of traffic in a physical layer frame. A physical and application layer cross-layer adaptation mechanism is then proposed, which overcomes this limitation. The performance results of the scheme show that the cross-layer mechanism can be efficiently applied for the purpose of providing QoS guarantees for multimedia traffic.