…policy along with a communication protocol in a MARL environment is highly complex due to the huge state space to be explored. To cope with this complexity, this work proposes…
Utilizing unmanned aerial vehicles (UAVs) in wireless communications can help to improve the capacity of terrestrial networks. In this paper, a novel method is proposed to position a UAV in…
…channel estimation errors. Numerical results show that the proposed method can reduce the computational cost to less than 4% as compared to the MAP estimation, while providing similar MSE performance….
…problem leveraging Successive Convex Approximation (SCA) with low computational complexity, which admits closed-form solution via iterative evaluation of optimal Karush-Kuhn- Tucker (KKT) conditions. Unlike in the conventional CoMP schemes, the…
While the notion of age of information (AoI) has recently been proposed for analyzing ultra-reliable low-latency communications (URLLC), most of the existing works have focused on the average AoI measure….
Data aggregation is a promising approach to enable massive machine-type communication (mMTC). Here, we first characterize the aggregation phase where a massive number of machine-type devices transmits to their respective…
In this paper, a compact textile ultrawideband (UWB) planar monopole antenna loaded with a metamaterial unit cell array (MTMUCA) structure with epsilon-negative (ENG) and near-zero refractive index (NZRI) properties is…
Robust principal component analysis (RPCA) is a powerful method for learning low-rank feature representation of various visual data. However, for certain types as well as significant amount of error corruption,…
…avoid any matrix inversion and any computations of the Gram matrix at the receiver. The algorithm provides a lower complexity compared to the conventional minimum mean square error detection technique,…
…most half of the workers are competing for the limited communication resources at any given time. Moreover, each worker exchanges the locally trained model only with two neighboring workers, thereby…