Animesh Yadav

Prof. Animesh Yadav

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 July 2017 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Open access
MZMing Zeng
Ming Zeng
AYAnimesh Yadav
Animesh Yadav
ODOctavia A. Dobre
Octavia A. Dobre
GTGeorgios I. Tsiropoulos
Georgios I. Tsiropoulos
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
In this paper, the performance of multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is investigated, when multiple users are grouped into a cluster. The superiority of MIMO-NOMA over MIMO-OMA in terms of both sum channel capacity and ergodic sum capacity is proved analytically. Furthermore, it is demonstrated that the more users are admitted to a cluster, the lower is the achieved sum rate, which illustrates the tradeoff between the sum rate and maximum number of admitted users. On this basis, a user admission scheme is proposed, which is optimal in terms of both sum rate and the number of admitted users when the signal-to-interference-plus-noise ratio thresholds of the users are equal. When these thresholds are different, the proposed scheme still achieves good performance in balancing both criteria. Moreover, under certain conditions, it maximizes the number of admitted users. In addition, the complexity of the proposed scheme is linear in the number of users per cluster. Simulation results verify the superiority of MIMO-NOMA over MIMO-OMA in terms of both sum rate and user fairness, as well as the effectiveness of the proposed user admission scheme.

1 February 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MZMing Zeng
Ming Zeng
AYAnimesh Yadav
Animesh Yadav
ODOctavia A. Dobre
Octavia A. Dobre
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
In this paper, energy efficient resource allocation is considered for an uplink hybrid system, where non-orthogonal multiple access (NOMA) is integrated into orthogonal multiple access (OMA). To ensure the quality of service for the users, a minimum rate requirement is pre-defined for each user. We formulate an energy efficiency (EE) maximization problem by jointly optimizing the user clustering, channel assignment and power allocation. To address this hard problem, a many-to-one bipartite graph is first constructed considering the users and resource blocks (RBs) as the two sets of nodes. Based on swap matching, a joint user-RB association and power allocation scheme is proposed, which converges within a limited number of iterations. Moreover, for the power allocation under a given user-RB association, we first derive the feasibility condition. If feasible, a low-complexity algorithm is proposed, which obtains optimal EE under any successive interference cancellation (SIC) order and an arbitrary number of users. In addition, for the special case of two users per cluster, analytical solutions are provided for the two SIC orders, respectively. These solutions shed light on how the power is allocated for each user to maximize the EE. Numerical results are presented, which show that the proposed joint user-RB association and power allocation algorithm outperforms other hybrid multiple access based and OMA-based schemes.

22 February 2018 in IEEE Access
Verified
Journal Article
Open access
MZMing Zeng
Ming Zeng
AYAnimesh Yadav
Animesh Yadav
ODOctavia A. Dobre
Octavia A. Dobre
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
In this paper, energy-efficient power allocation (PA) is investigated for a multiple-input multiple-output non-orthogonal multiple access system with multiple users in a cluster. To ensure the quality of service (QoS) for the users, a minimum rate requirement is pre-defined for each user. Because of the QoS requirement, it is first necessary to determine whether the considered energy-efficiency (EE) maximization problem is feasible or not, by comparing the total transmit power with the required power for satisfying the QoS of the users. If feasible, a closed-form solution is provided for the corresponding sum rate maximization problem, and on this basis, the EE maximization problem is solved by applying non-convex fractional programming. Otherwise, a low-complexity user admission scheme is proposed, which admits users one by one following the ascending order of the required power for satisfying the QoS. Numerical results are presented to validate the effectiveness of the proposed energy-efficient PA strategy and user admission scheme.

24 October 2019 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
RWRanning Wang
Ranning Wang
AYAnimesh Yadav
Animesh Yadav
EMEsraa A. Makled
Esraa A. Makled
ODOctavia A. Dobre
Octavia A. Dobre
RZRuiqin Zhao
Ruiqin Zhao
PVPramod K. Varshney
Pramod K. Varshney

1 December 2020 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
Animesh YadavAnimesh Yadav
Animesh Yadav
CQChen Quan
Chen Quan
PVPramod K. Varshney
Pramod K. Varshney
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
In this paper, we study the uplink channel throughput performance of a proposed novel multiple-antenna hybrid-domain non-orthogonal multiple access (MA-HD-NOMA) scheme. This scheme combines the conventional sparse code multiple access (SCMA) and power-domain NOMA (PD-NOMA) schemes in order to increase the number of users served as compared to conventional NOMA schemes and uses multiple antennas at the base station. To this end, a joint resource allocation problem for the MA-HD-NOMA scheme is formulated that maximizes the sum rate of the entire system. For a comprehensive comparison, the joint resource allocation problems for the multi-antenna SCMA (MA-SCMA) and multi-antenna PD-NOMA (MA-PD-NOMA) schemes with the same overloading factor are formulated as well. Each of the formulated problems is a mixed-integer non-convex program, and hence, we apply successive convex approximation (SCA)-and reweighted ℓ1 minimization-based approaches to obtain rapidly converging solutions. Numerical results reveal that the proposed MA-HD-NOMA scheme has superior performance compared to MA-SCMA and MA-PD-NOMA.

2 May 2017 in IEEE Access
Verified
Journal Article
Open access
AYAnimesh Yadav
Animesh Yadav
ODOctavia A. Dobre
Octavia A. Dobre
NANirwan Ansari
Nirwan Ansari
In this paper, we consider the problem of resource allocation in a dense small-cell network. Each small-cell base station is powered by a renewable energy source and operates in the full-duplex mode. We account for the rate-dependent energy term for data decoding into the total energy consumption at the small-cell base station. Owing to this new energy term, the transmitter and receiver operations now draw the energy from a common source. For a new energy consumption model and high interference scenario, which arises due to full-duplex communications, we formulate an energy and load aware resource management optimization problem under the energy causality and total transmit power constraints of the small-cell base station and uplink user equipments. In particular, the problem minimizes the data queue length of each network user equipment by jointly designing the beamformers, power, and sub-carrier allocation and their scheduling. Owing to the non-convexity of the problem, a global solution is inefficient; thus, we opt for the successive parametric convex approximation method to obtain a sub-optimal solution. This method solves for the convex approximate of the non-convex problem in each iteration and leads to faster convergence. For practical implementation, we further develop a distributed algorithm by using the dual decomposition framework, which relies on limited exchange of information between the involved base stations. Numerical simulations compare the network scenario which accounts for uplink channel rate-dependent energy consumption with that which ignores it. Results advocate the need for redesigning of the resource allocation scheme. In addition, numerical simulations also validate the usefulness of full-duplex communications over the half-duplex communications in terms of minimizing the sum data queue length of the users.