arXiv subjects

Muhammad Fainan Hanif

Publications and source records attributed to Muhammad Fainan Hanif.

13 recordsLinked to original sources

arXiv2026

Multicasting Pinching Antenna Systems With LoS Blockage

Pinching-antenna systems (PASS) represent a promising customizable wireless access mechanism in high-frequency bands, enabled by dielectric waveguides and movable dielectric particles, called pinching antennas (PAs). In this work, we study optimal position allocation of PAs in PASS for multicasting in the downlink when a line-of-sight (LoS) link does not necessarily exist between all users and the PAs. The multicasting problem is solved by leveraging minorization-maximization (MM) principle to yield a provably convergent algorithm. In each run of the MM based procedure, we solve a convex surrogate problem using two methods called the candidate search method (CSM) and the bisection search method (BSM). With both BSM and CSM, we not only report superior performance of the multicasting PASS in non-LoS environments compared to conventional antenna systems (CAS), but also determine that BSM yields better overall computational complexity when the number of users and PAs increases. For example, we report that when we have 8 PAs and 25 users, the execution time with the CSM is approximately 2.5 times that with the BSM.

cs.IT↗

arXiv2025

A Robust Design for BackCom Assisted Hybrid NOMA

Hybrid non-orthogonal multiple access (H-NOMA) is inherently an enabler of massive machine type communications, a key use case for sixth-generation (6G) systems. Together with backscatter communication (BackCom), it seamlessly integrates with the traditional orthogonal multiple access (OMA) techniques to yield superior performance gains. In this paper, we study BackCom assisted H-NOMA uplink transmission with the aim of minimizing power with imperfect channel state information (CSI), where a generalized representation for channel estimation error models is used. The considered power minimization problem with aggregate data constraints is both non-convex and intractable. For the considered imperfect CSI models, we use Lagrange duality and the majorization-minimization principle to produce a conservative approximation of the original problem. The conservative formulation is relaxed by incorporating slack variables and a penalized objective. We solve the penalized tractable approximation using a provably convergent algorithm with polynomial complexity. Our results highlight that, despite being conservative, the proposed solution results in a similar power consumption as for the nominal power minimization problem without channel uncertainties. Additionally, robust H-NOMA is shown to almost always yield more power efficiency than the OMA case. Moreover, the robustness of the proposed solution is manifested by a high probability of feasibility of the robust design compared to the OMA and the nominal one.

cs.IT↗

arXiv2023

A Low-Complexity Solution to Sum Rate Maximization for IRS-assisted SWIPT-MIMO Broadcasting

This paper focuses on the fundamental problem of maximizing the achievable weighted sum rate (WSR) at information receivers (IRs) in an intelligent reflecting surface (IRS) assisted simultaneous wireless information and power transfer system under a multiple-input multiple-output (SWIPT-MIMO) setting, subject to a quality-of-service (QoS) constraint at the energy receivers (ERs). Notably, due to the coupling between the transmit precoding matrix and the passive beamforming vector in the QoS constraint, the formulated non-convex optimization problem is challenging to solve. We first decouple the design variables in the constraints following a penalty dual decomposition method, and then apply an alternating gradient projection algorithm to achieve a stationary solution to the reformulated optimization problem. The proposed algorithm nearly doubles the WSR compared to that achieved by a block-coordinate descent (BCD) based benchmark scheme. At the same time, the complexity of the proposed scheme grows linearly with the number of IRS elements while that of the benchmark scheme is proportional to the cube of the number of IRS elements.

eess.SP↗

arXiv2021

A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access

To mitigate computational power gap between the network core and edges, mobile edge computing (MEC) is poised to play a fundamental role in future generations of wireless networks. In this letter, we consider a non-orthogonal multiple access (NOMA) transmission model to maximize the worst task to be offloaded among all users to the network edge server. A provably convergent and efficient algorithm is developed to solve the considered non-convex optimization problem for maximizing the minimum number of offloaded bits in a multi-user NOMAMEC system. Compared to the approach of optimized orthogonal multiple access (OMA), for given MEC delay, power and energy limits, the NOMA-based system considerably outperforms its OMA-based counterpart in MEC settings. Numerical results demonstrate that the proposed algorithm for NOMA-based MEC is particularly useful for delay sensitive applications.

cs.IT↗

arXiv2015

A Minorization-Maximization Method for Optimizing Sum Rate in Non-Orthogonal Multiple Access Systems

Non-orthogonal multiple access (NOMA) systems have the potential to deliver higher system throughput, compared to contemporary orthogonal multiple access techniques. For a linearly precoded multiple-input multiple-output (MISO) system, we study the downlink sum rate maximization problem, when the NOMA principles are applied. Being a non-convex and intractable optimization problem,we resort to approximate it with a minorization-maximization algorithm (MMA), which is a widely used tool in statistics. In each step of the MMA, we solve a second-order cone program, such that the feasibility set in each step contains that of the previous one, and is always guaranteed to be a subset of the feasibility set of the original problem. It should be noted that the algorithm takes a few iterations to converge. Furthermore, we study the conditions under which the achievable rates maximization can be further simplified to a low complexity design problem, and we compute the probability of occurrence of this event. Numerical examples are conducted to show a comparison of the proposed approach against conventional multiple access systems. NOMA is reported to provide better spectral and power efficiency with a polynomial time computational complexity.

cs.IT↗

arXiv2013

Computationally Efficient Robust Beamforming for SINR Balancing in Multicell Downlink

We address the problem of downlink beamformer design for signal-to-interference-plus-noise ratio (SINR) balancing in a multiuser multicell environment with imperfectly estimated channels at base stations (BSs). We first present a semidefinite program (SDP) based approximate solution to the problem. Then, as our main contribution, by exploiting some properties of the robust counterpart of the optimization problem, we arrive at a second-order cone program (SOCP) based approximation of the balancing problem. The advantages of the proposed SOCP-based design are twofold. First, it greatly reduces the computational complexity compared to the SDP-based method. Second, it applies to a wide range of uncertainty models. As a case study, we investigate the performance of proposed formulations when the base station is equipped with a massive antenna array. Numerical experiments are carried out to confirm that the proposed robust designs achieve favorable results in scenarios of practical interest.

cs.IT↗

arXiv2013

Efficient Solutions for Weighted Sum Rate Maximization in Multicellular Networks With Channel Uncertainties

The important problem of weighted sum rate maximization (WSRM) in a multicellular environment is intrinsically sensitive to channel estimation errors. In this paper, we study ways to maximize the weighted sum rate in a linearly precoded multicellular downlink system where the receivers are equipped with a single antenna. With perfect channel information available at the base stations, we first present a novel fast converging algorithm that solves the WSRM problem. Then, the assumption is relaxed to the case where the error vectors in the channel estimates are assumed to lie in an uncertainty set formed by the intersection of finite ellipsoids. As our main contributions, we present two procedures to solve the intractable nonconvex robust designs based on the worst case principle. The proposed iterative algorithms solve the semidefinite programs in each of their steps and provably converge to a locally optimal solution of the robust WSRM problem. The proposed approaches are numerically compared against each other to ascertain their robustness towards channel estimation imperfections. The results clearly indicate the performance gain compared to the case when channel uncertainties are ignored in the design process. For certain scenarios, we also quantify the gap between the proposed approximations and exact solutions.

cs.IT↗

arXiv2012

Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink

The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior performance of the proposed approach is established by numerically comparing it to other known solutions.

cs.IT↗

arXiv2009

On the Statistics of Cognitive Radio Capacity in Shadowing and Fast Fading Environments (Journal Version)

In this paper we consider the capacity of the cognitive radio channel in different fading environments under a low interference regime. First we derive the probability that the low interference regime holds under shadow fading as well as Rayleigh and Rician fast fading conditions. We demonstrate that this is the dominant case, especially in practical cognitive radio deployment scenarios. The capacity of the cognitive radio channel depends critically on a power loss parameter, $α$, which governs how much transmit power the cognitive radio dedicates to relaying the primary message. We derive a simple, accurate approximation to $α$ in Rayleigh and Rician fading environments which gives considerable insight into system capacity. We also investigate the effects of system parameters and propagation environment on $α$ and the cognitive radio capacity. In all cases, the use of the approximation is shown to be extremely accurate.

cs.IT↗

arXiv2009

Level Crossing Rates of Interference in Cognitive Radio Networks

The future deployment of cognitive radios is critically dependent on the fact that the incumbent primary user system must remain as oblivious as possible to their presence. This in turn heavily relies on the fluctuations of the interfering cognitive radio signals. In this letter we compute the level crossing rates of the cumulative interference created by the cognitive radios. We derive analytical formulae for the level crossing rates in Rayleigh and Rician fast fading conditions. We approximate Rayleigh and Rician level crossing rates using fluctuation rates of gamma and scaled noncentral $χ^2$ processes respectively. The analytical results and the approximations used in their derivations are verified by Monte Carlo simulations and the analysis is applied to a particular CR allocation strategy.

cs.IT↗

arXiv2009

On the Statistics of Cognitive Radio Capacity in Shadowing and Fast Fading Environments

In this paper we consider the capacity of the cognitive radio channel in a fading environment under a "low interference regime". This capacity depends critically on a power loss parameter, $α$, which governs how much transmit power the cognitive radio dedicates to relaying the primary message. We derive a simple, accurate approximation to $α$ which gives considerable insight into system capacity. We also investigate the effects of system parameters and propagation environment on $α$ and the cognitive radio capacity. In all cases, the use of the approximation is shown to be extremely accurate. Finally, we derive the probability that the "low interference regime" holds and demonstrate that this is the dominant case, especially in practical cognitive radio deployment scenarios.

cs.IT↗

arXiv2009

Performance of Cognitive Radio Systems with Imperfect Radio Environment Map Information

In this paper we describe the effect of imperfections in the radio environment map (REM) information on the performance of cognitive radio (CR) systems. Via simulations we explore the relationship between the required precision of the REM and various channel/system properties. For example, the degree of spatial correlation in the shadow fading is a key factor as is the interference constraint employed by the primary user. Based on the CR interferers obtained from the simulations, we characterize the temporal behavior of such systems by computing the level crossing rates (LCRs) of the cumulative interference represented by these CRs. This evaluates the effect of short term fluctuations above acceptable interference levels due to the fast fading. We derive analytical formulae for the LCRs in Rayleigh and Rician fast fading conditions. The analytical results are verified by Monte Carlo simulations.

cs.IT↗

arXiv2009

Interference and Deployment Issues for Cognitive Radio Systems in Shadowing Environments

In this paper we describe a model for calculating the aggregate interference encountered by primary receivers in the presence of randomly placed cognitive radios (CRs). We show that incorporating the impact of distance attenuation and lognormal fading on each constituent interferer in the aggregate, leads to a composite interference that cannot be satisfactorily modeled by a lognormal. Using the interference statistics we determine a number of key parameters needed for the deployment of CRs. Examples of these are the exclusion zone radius, needed to protect the primary receiver under different types of fading environments and acceptable interference levels, and the numbers of CRs that can be deployed. We further show that if the CRs have apriori knowledge of the radio environment map (REM), then a much larger number of CRs can be deployed especially in a high density environment. Given REM information, we also look at the CR numbers achieved by two different types of techniques to process the scheduling information.

cs.IT↗