Ananthanarayanan Chockalingam

Throughput analysis of TCP on channels with memory

The focus of this paper is to analyze the relative sensitivity of the bulk throughput performance of different versions of TCP, viz., OldTahoe, Tahoe, Reno, and New Reno, to channel errors that are correlated. We investigate the performance of a single wireless TCP connection in a local environment by modeling the correlated packet loss/error process (e.g., as induced by a multipath fading channel) as a first-order Markov chain. A major contribution of the paper is a unified analytical approach which allows the evaluation of the throughput performance of various versions of TCP. The main findings of this study are that 1) error correlations significantly affect the performance of TCP, and in particular may result in considerably better performance for Tahoe and NewReno; and 2) over slowly fading channels which are characterized by significant channel memory, Tahoe performs as well as NewReno. This leads us to conclude that a clever design of the lower layers that preserve error correlations, naturally present on wireless links because of the fading behavior, could be an attractive alternative to the development or the use of more complex versions of TCP.

Wireless TCP performance with link layer FEC/ARQ

We investigate the performance of TCP Tahoe and NewReno on wireless links with a FEC/ARQ protocol at the link layer. The effect of link layer (LL) parameters like the LL packet size, number of LL transmission attempts, and FEC code rate on the TCP throughput is evaluated. It is shown that the retransmissions at the link layer must persist long enough to outlast the average bad state duration of the Rayleigh fading process in order to achieve performance better than TCP without an ARQ at the link layer. It is further shown that with a suitable link layer in place, TCP Tahoe offers as high a throughput as offered by other enhanced versions like NewReno in the considered wireless environment.

Performance of TCP/RLP protocol stack on correlated fading DS-CDMA wireless links

In this paper, we present the throughput performance of the transport control protocol/radio link protocol (TCP/RLP) stack on correlated fading direct-sequence code-division multiple-access (DS-CDMA) wireless links. It is shown that because of significant burstiness in RLP frame errors in highly correlated Rayleigh fading, longer persistence at the RLP layer to recover lost RLP frames (more than the IS-99 specified three retransmission attempts at the RCP layer) is beneficial at low-link fading margins.

Performance of closed-loop power control in DS-CDMA cellular systems

In situations where the round-trip delay between the mobile and the base stations is smaller than the correlation time of the channel, power control schemes using feedback from the base station can effectively compensate for the fast fading due to multipath. We study several closed-loop power control (CLPC) algorithms by analysis and detailed simulation. We introduce a new loglinear model for analyzing the received power correlation statistics of a CLPC scheme. The model provides analytical expressions for the temporal correlation of the power controlled channel parameterized by the update rate, loop delay, and vehicle speed. The received power correlation statistics quantify the ability of closed-loop power control to compensate for the time-varying channel. To study more complex update strategies, detailed simulations that estimate the channel bit-error performance are carried out. Simulation results are combined with coding bounds to obtain quasi-analytic estimates of the reverse link capacity in a direct-sequence code-division multiple-access (DS-CDMA) cellular system. The quasi-analytic approach quantifies the performance improvements due to effective power control in both single-cell and multicell DS-CDMA systems operating over both frequency-nonselective and frequency-selective fading channels. The effect of nonstationary base stations on the system performance is also presented.

Performance of TCP on wireless fading links with memory

In this paper, the bulk throughput performance of TCP NewReno over wireless fading links having memory is studied. Like TCP Tahoe, the NewReno version of TCP implements a fast retransmit procedure, but it uses a different congestion window adaptation algorithm. In this study, we show that, for the default parameters of the BSD implementation of TCP over a 1.5 Mbps wireless link having a very small bandwidth-delay product, and as long as sufficiently large advertised window sizes are used, the burstiness in packet errors caused by slow multipath fading (experienced by slow moving users) significantly benefits NewReno compared to i.i.d. packet errors (experienced at vehicular user speeds). We further show that, in such slow fading conditions, NewReno performs no better than Tahoe, mainly due to the high degree of correlation in the fading process.

High-Rate Space–Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16×16 and 32×32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

Energy efficiency of media access protocols for mobile data networks

As mobile terminals are powered by a finite battery source, energy constraints play a major role in the design of wireless communications systems. In this letter, based on a general analytical framework, we study the energy efficiency of a class of multiple access schemes, using the average number of correctly transmitted packets for a given amount of allocated energy as an appropriate metric. We show that a good choice of the protocol rules can significantly improve the energy efficiency.

Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 × 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 × 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10-3 BER.

Mobile base stations placement and energy aware routing in wireless sensor networks

Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) top-Kmax algorithm, ii) maximizing the minimum residual energy (max-min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations

Performance of a wireless access protocol on correlated Rayleigh-fading channels with capture

The throughput performance of a wireless media access protocol taking into account the effect of correlated channel fading, capture, and propagation delay is analyzed. For efficient access on the uplink (mobile-to-base-station link), the protocol makes use of the uplink channel status information which is conveyed to the mobiles through a busy/idle flag broadcast on the downlink (base-station-to-mobile link). A first-order Markov model is used to describe the correlation in the packet success/failure process on a Rayleigh-fading channel. The analytical results obtained through the first-order Markov approximation of the channel are compared to those obtained from an independent and identically distributed (i.i.d.) channel model. The Markovian-fading channel model is shown to provide better performance results than the i.i.d. channel model. Simulations show that a first-order Markov approximation of the Rayleigh-fading process is quite accurate. An enhanced version of the access protocol to take advantage of the memory in the fading channel behavior is proposed and analyzed. The effect of retransmission of erroneous data packets and propagation delay on the throughput is also analyzed. It is shown that the access protocol with an error detect (ED) feature is efficient in slow fading (e.g., pedestrian user speeds), whereas a retransmission protocol is more efficient in fast fading (e.g., vehicular user speeds).