Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Neelesh B. Mehta is active.

Publication


Featured researches published by Neelesh B. Mehta.


IEEE Transactions on Wireless Communications | 2008

Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection

Ritesh Madan; Neelesh B. Mehta; Andreas F. Molisch; Jin Zhang

We consider a cooperative wireless network where a set of nodes cooperate to relay in parallel the information from a source to a destination using a decode-and-forward approach. The source broadcasts the data to the relays, some or all of which cooperatively beamform to forward the data to the destination. We generalize the standard approaches for cooperative communications in two key respects: (i) we explicitly model and factor in the cost of acquiring channel state information (CSI), and (ii) we consider more general selection rules for the relays and compute the optimal one among them. In particular, we consider simple relay selection and outage criteria that exploit the inherent diversity of relay networks and satisfy a mandated outage constraint. These criteria include as special cases several relay selection criteria proposed in the literature. We obtain expressions for the total energy consumption for general relay selection and outage criteria for the non-homogeneous case, in which different relay links have different mean channel power gains, and the homogeneous case, in which the relay links statistics are identical. We characterize the structure of the optimal transmission scheme. Numerical results show that the cost of training and feedback of CSI is significant. The optimal strategy is to use a varying subset (and number) of relay nodes to cooperatively beamform at any given time. Depending on the relative location of the relays, the source, and the destination, numerical computations show energy savings of about 16% when an optimal relay selection rule is used. We also study the impact of shadowing correlation on the energy consumption for a cooperative relay network.


IEEE Transactions on Wireless Communications | 2007

Approximating a Sum of Random Variables with a Lognormal

Neelesh B. Mehta; Jingxian Wu; Andreas F. Molisch; Jin Zhang

A simple, novel, and general method is presented in this paper for approximating the sum of independent or arbitrarily correlated lognormal random variables (RV) by a single lognormal RV. The method is also shown to be applicable for approximating the sum of lognormal-Rice and Suzuki RVs by a single lognormal RV. A sum consisting of a mixture of the above distributions can also be easily handled. The method uses the moment generating function (MGF) as a tool in the approximation and does so without the extremely precise numerical computations at a large number of points that were required by the previously proposed methods in the literature. Unlike popular approximation methods such as the Fenton-Wilkinson method and the Schwartz-Yeh method, which have their own respective short-comings, the proposed method provides the parametric flexibility to accurately approximate different portions of the lognormal sum distribution. The accuracy of the method is measured both visually, as has been done in the literature, as well as quantitatively, using curve-fitting metrics. An upper bound on the sensitivity of the method is also provided.


IEEE Transactions on Wireless Communications | 2010

Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks

Bhargav Medepally; Neelesh B. Mehta

The use of energy harvesting (EH) nodes as cooperative relays is a promising and emerging solution in wireless systems such as wireless sensor networks. It harnesses the spatial diversity of a multi-relay network and addresses the vexing problem of a relays batteries getting drained in forwarding information to the destination. We consider a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission. For a general class of stationary and ergodic EH processes, we introduce the notion of energy constrained and energy unconstrained relays and analytically characterize the symbol error rate of the system. Further insight is gained by an asymptotic analysis that considers the cases where the signal-to-noise-ratio or the number of relays is large. Our analysis quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relays energy harvesting process, but also on its transmit power setting and the other relays in the system. The optimal static transmit power setting at the EH relays is also determined. Altogether, our results demonstrate how a system that uses EH relays differs in significant ways from one that uses conventional cooperative relays.


IEEE Transactions on Wireless Communications | 2007

Performance of Fountain Codes in Collaborative Relay Networks

Andreas F. Molisch; Neelesh B. Mehta; Jonathan S. Yedidia; Jin Zhang

Cooperative communications, where parallel relays forward information to a destination node, can greatly improve the energy efficiency and latency in ad-hoc networks. However, current networks do not fully exploit its potential as they only use traditional energy-accumulation, which is often used in conjunction with repetition coding or cooperative space-time codes. In this paper, we show that the concept of mutual- information-accumulation can be realized with the help of fountain codes, and leads to a lower energy expenditure and a lower transmission time than energy accumulation. We then provide an analysis of the performance of mutual information accumulation in relay networks with N relay nodes. We first analyze the quasi-synchronuous scenario where the source stops transmitting and the relay nodes start transmitting after L relay nodes have successfully decoded the source data. We show that an optimum L exists, and is typically on the order of 3 or 4. We also give closed-form equations for the energy savings that can be achieved by the use of mutual-information-accumulation at the receiver. We then analyze and provide bounds for an alternate scenario where each relay node starts its transmission to the destination as soon as it has decoded the source data, independent of the state of the other relay nodes. This approach further reduces the transmission time, because the transmission by the relay nodes helps the other relay nodes that are still receiving.


IEEE Transactions on Wireless Communications | 2008

Asynchronous interference mitigation in cooperative base station systems

Hongyuan Zhang; Neelesh B. Mehta; Andreas F. Molisch; Jin Zhang; Huaiyu Dai

Cooperative transmission by base stations (BSs) can significantly improve the spectral efficiency of multiuser, multi-cell, multiple input multiple output (MIMO) systems. We show that contrary to what is often assumed in the literature, the multiuser interference in such systems is fundamentally asynchronous. Intuitively, perfect timing-advance mechanisms can at best only ensure that the desired signal components -but not also the interference components -are perfectly aligned at their intended mobile stations. We develop an accurate mathematical model for the asynchronicity, and show that it leads to a significant performance degradation of existing designs that ignore the asynchronicity of interference. Using three previously proposed linear preceding design methods for BS cooperation, we develop corresponding algorithms that are better at mitigating the impact of the asynchronicity of the interference. Furthermore, we also address timing-advance inaccuracies (jitter), which are inevitable in a practical system. We show that using jitter-statistics-aware precoders can mitigate the impact of these inaccuracies as well. The insights of this paper are critical for the practical implementation of BS cooperation in multiuser MIMO systems, a topic that is typically oversimplified in the literature.


global communications conference | 2006

CTH17-2: Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection

Ritesh Madan; Neelesh B. Mehta; Andreas F. Molisch; Jin Zhang

We consider a cooperative wireless network where the source broadcasts data to relays, some or all of which cooperatively beamform to forward the data to the destination. The network is subject to an overall outage constraint. We generalize the standard approaches for cooperative communications in two respects: (i) we explicitly model and factor in the cost of acquiring channel state information (CSI), and (ii) we consider more general, yet simple, selection rules for the relays and compute the optimal one among them. These rules include as special cases several relay selection criteria proposed in the literature. We present analytical results for the homogeneous case, where the links have identical mean channel gains. For this case, we show that the optimal transmission scheme is simple and can be computed efficiently. Numerical results show that while the cost of training and feedback of CSI is significant, relay cooperation is still beneficial.


global communications conference | 2009

Implications of Energy Profile and Storage on Energy Harvesting Sensor Link Performance

Bhargav Medepally; Neelesh B. Mehta; Chandra R. Murthy

Energy harvesting sensors (EHS), which harvest energy from the environment in order to sense and then communicate their measurements over a wireless link, provide the tantalizing possibility of perpetual lifetime operation of a sensor network. The wireless communication link design problem needs to be revisited for these sensors as the energy harvested can be random and small and not available when required. In this paper, we develop a simple model that captures the interactions between important parameters that govern the communication link performance of a EHS node, and analyze its outage probability for both slow fading and fast fading wireless channels. Our analysis brings out the critical importance of the energy profile and the energy storage capability on the EHS link performance. Our results show that properly tuning the transmission parameters of the EHS node and having even a small amount of energy storage capability improves the EHS link performance considerably.


IEEE Transactions on Wireless Communications | 2003

Analysis and results for the orthogonality factor in WCDMA downlinks

Neelesh B. Mehta; Larry J. Greenstein; Thomas M. Willis; Zoran Kostic

The presence of multipaths leads to a loss of orthogonality between signals transmitted simultaneously on a wideband code-division multiple access (WCDMA) downlink. We derive general analytical expressions for the orthogonality factor (OF), which quantifies this loss of orthogonality, as a function of the instantaneous multipath fade realization of the channel. We show that the OF exhibits a significant temporal variation for the three channel profiles suggested in the WCDMA standard, namely, typical urban and rural areas and hilly terrain, which span a wide range of realistic cases. Moreover, its temporal variations and statistics vary significantly from one channel profile to another. Also, while the pulse shape and the number of RAKE fingers has only a marginal impact on the OFs statistics, the granularity in setting the finger positions has a considerable impact. The results of the work can be directly used for evaluation of the system performance of WCDMA cellular systems.


international conference on communications | 2002

Clustering of scatterers in mobile radio channels-evaluation and modeling in the COST259 directional channel model

Henrik Asplund; Andreas F. Molisch; Martin Steinbauer; Neelesh B. Mehta

We analyze the clustering of scatterers in mobile radio channels, i.e, the fact that scatterers are usually not located uniformly in the whole coverage area, but tend to occur in clusters. While this has been recognized for some time, a realistic model for this phenomenon has been lacking up to now. We first analyze measurements to extract the distribution of the number of observed clusters. We then present a model that reflects not only this distribution, but also reproduces the appearance and disappearance of clusters as the mobile station moves through the cell. Our approach has been adopted as an important part of the COST259 directional channel model, a standard model for directional mobile radio channels. Finally, we discuss the implications of the model for the system performance of CDMA and SDMA systems.


global communications conference | 2005

Flexible lognormal sum approximation method

Jingxian Wu; Neelesh B. Mehta; Jin Zhang

A simple and novel method is presented to approximate the distribution of the sum of independent, but not necessarily identical, lognormal random variables, by the lognormal distribution. It is shown that matching a short Gauss-Hermite approximation of the moment generating function of the lognormal sum with that of the lognormal distribution leads to an accurate lognormal sum approximation. The advantage of the proposed method over the ones in the literature, such as the Fenton-Wilkinson method, Schwartz-Yeh method, and the recently proposed Beaulieu-Xie method, is that it provides the parametric flexibility to handle the inevitable trade-off that needs to be made in approximating different regions of the probability distribution function. The accuracy is verified using extensive simulations based on a cellular layout

Collaboration


Dive into the Neelesh B. Mehta's collaboration.

Top Co-Authors

Avatar

Andreas F. Molisch

University of Southern California

View shared research outputs
Top Co-Authors

Avatar

Jinyun Zhang

Mitsubishi Electric Research Laboratories

View shared research outputs
Top Co-Authors

Avatar

Andreas F. Molisch

University of Southern California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Raymond Yim

Mitsubishi Electric Research Laboratories

View shared research outputs
Top Co-Authors

Avatar

Koon Hoo Teo

Mitsubishi Electric Research Laboratories

View shared research outputs
Top Co-Authors

Avatar

Pallav Sudarshan

Mitsubishi Electric Research Laboratories

View shared research outputs
Top Co-Authors

Avatar

Jobin Francis

Indian Institute of Science

View shared research outputs
Top Co-Authors

Avatar

Vinod Kristem

University of Southern California

View shared research outputs
Top Co-Authors

Avatar

Virag Shah

University of Texas at Austin

View shared research outputs
Researchain Logo
Decentralizing Knowledge