Network


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

Hotspot


Dive into the research topics where Dhananjaya Sarma Ponukumati is active.

Publication


Featured researches published by Dhananjaya Sarma Ponukumati.


IEEE Communications Letters | 2013

Robust Peer-to-Peer Relay Beamforming: A Probabilistic Approach

Dhananjaya Sarma Ponukumati; Feifei Gao; Chengwen Xing

In this work, we design outage constrained collaborative relay beamforming (CRBF) vectors for a peer-to-peer amplify-and-forward (AF) relay network with imperfect channel state information (CSI) at the relays. Specifically, we model channel estimation error as a Gaussian random vector with known statistical distribution. The objective is to minimize the total transmit power at relays subject to probabilistic quality of service (QoS) constraints at each receiver. To solve the original non-convex problem, we utilize Bernstein-type inequalities and recast the original probabilistic constraints into conservative deterministic linear matrix inequalities (LMI). An alternative method is to replace the probabilistic constraint with a conservative one by applying S-procedure. Employing rank relaxation technique, the two convex reformulations are numerically solved with semidefinite programming (SDP). Simulation results are provided to corroborate our studies.


global communications conference | 2011

Robust Multicell Downlink Beamforming Based on Second-Order Statistics of Channel State Information

Dhananjaya Sarma Ponukumati; Feifei Gao; Mathias Bode

In this paper, we design downlink (DL) beamforming vectors for a multiuser multicell network when only imperfect knowledge of the channel covariance is available at base stations. Specifically, we consider two different models for covariance errors: a)deterministic error bounded in a spherical region and b) stochastic error with known probability distribution. Our objective is to minimize the total DL transmit power subject to quality of service (QoS) constraint of every user. It is shown that for both uncertainty models, the optimization can be formulated as a convex semidefinite programming (SDP) problem using the standard rank relaxation approach. Interestingly, numerical results show that the obtained solutions fulfill the rank constraint and are therefore exact.


IEEE Communications Letters | 2011

Multicell Downlink Beamforming with Imperfect Channel Knowledge at Both Transceiver Sides

Dhananjaya Sarma Ponukumati; Feifei Gao; Mathias Bode; Xuewen Liao

In this letter, we design downlink beamforming vectors for a multicell network when only imperfect channel state information (CSI) is available at both base stations (BS) and mobile users (MU). We consider two different optimization criteria, i.e., minimizing the total downlink transmit power subject to quality of service (QoS) constraints at each MU and maximizing the worst-case effective signal-to-interference-plus-noise ratio (SINR) subject to BS power constraints. To solve the optimization problems, the imperfect CSI embedded QoS constraints are converted to linear matrix inequalities (LMI) with the aid of S-procedure, and then a semidefinite relaxation (SDR) approach is applied. Numerical results are provided to corroborate the proposed studies.


global communications conference | 2010

Robust General Rank Precoding Design for Amplify-and-Forward Relay Network

Dhananjaya Sarma Ponukumati; Feifei Gao; Lisheng Fan

In this paper, we consider the problem of precoding design for amplify-and-forward (AF relay network with imperfect channel state information (CSI). We find a general rank precoding matrix at the relay such that the relay transmit power is minimized subject to quality of service (QoS) constraint as the worst case signal-to-noise ratio (SNR) at the destination. Since the direct optimization is nonconvex, we apply conservative methods to reformulate it as a semi-definite programming (SDP) problem which provides the upperbound of the original objective. Specifically, we suggest two SDP formulations that can be solved efficiently via convex optimization tools. We numerically compare the proposed suboptimal methods with the existing method, i.e., collaborative robust relay beamforming (CRBF), and show that the proposed schemes achieve a significant performance gain for a majority of feasible uncertainty sizes.


international conference on communications | 2012

Robust coordinated downlink beamforming for multicell-cognitive radio networks with probabilistic constraints

Dhananjaya Sarma Ponukumati; Feifei Gao; Mathias Bode; James C. F. Li; Ming Lei

In this paper, we design downlink (DL) beam-forming vectors for a multiuser multicell cognitive radio (CR) network with imperfect channel state information (CSI) at base stations (BS). Specifically, we model channel estimation error as a random vector with known statistical distribution. Our objective is to minimize the total DL transmit power subject to probabilistic quality of service (QoS) constraints of every secondary user (SU) and primary user (PU). Utilizing Bernstein-type inequalities [12], we replace the probabilistic constraints with conservative deterministic constraints. By applying rank relaxation, the original problem is reformulated as semidefinite programming (SDP). Interestingly, numerical results show that the obtained solutions fulfill the rank constraint.


personal, indoor and mobile radio communications | 2013

Robust coordinated downlink beamforming for multicell-cognitive radio networks

Dhananjaya Sarma Ponukumati; Feifei Gao; Mathias Bode; James C. F. Li; Ming Lei

In this paper, we design downlink (DL) beamforming vectors for a multiuser multicell cognitive radio (CR) network with imperfect channel state information (CSI) at base stations (BS). Specifically, we consider deterministic error in both channel gain and channel covariance. Our objective is to minimize the total DL transmit power subject to quality of service (QoS) constraints of each secondary user (SU) and primary user (PU). The optimization problems for both uncertainty models can be transformed into convex semidefinite programming (SDP) from the standard rank relaxation approach. Interestingly, numerical results show that the obtained solutions fulfill the rank constraint and are therefore exact.


Archive | 2013

System and Methods for Cooperative Network Acquisition on a Multi-SIM Wireless Device

Dhananjaya Sarma Ponukumati; Ankammarao Ravuvari; Venugopal Krishna Srinivasa Srungaram


Archive | 2013

Multiple SIM Multiple Network Diversity For Enhancing Call Connectivity

Dhananjaya Sarma Ponukumati; Hareeswara Kumar Modali


Archive | 2015

Method and apparatus for antenna sharing for idle-idle collision scenarios in dual-radio devices

Parthasarathy Krishnamoorthy; Rashid Ahmed Akbar Attar; Ning He; Anand Rajurkar; Dhananjaya Sarma Ponukumati


Archive | 2014

System and Methods for Improving Intra-frequency Cell Reselection on a Wireless Communication Device in Connected Mode

Dhananjaya Sarma Ponukumati; Rammohan Kandlakunta; Mohit Kumar

Collaboration


Dive into the Dhananjaya Sarma Ponukumati's collaboration.

Researchain Logo
Decentralizing Knowledge