Ali Arshad Nasir

Ali Arshad Nasir

Auto-generated profile, based on publicly available information

Ali Arshad Nasir

King Fahd University of Petroleum and Minerals

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
20 March 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ANAli Arshad Nasir
Ali Arshad Nasir
HTHoang Duong Tuan
Hoang Duong Tuan
Trung Q. DuongTrung Q. Duong
Trung Q. Duong
H. Vincent PoorH. Vincent Poor
H. Vincent Poor

30 October 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ANAli Arshad Nasir
Ali Arshad Nasir
HTH. D. Tuan
H. D. Tuan
HNHa Nguyen
Ha Nguyen
MDMerouane Debbah
Merouane Debbah
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
Providing ultra reliable and low-latency communication (URLLC) is considered one of the major challenges for wireless communication networks. This paper considers a downlink URLLC system in which a base station (BS) serves multiple single-antenna users in the short blocklength regime. With the objective of maximizing the users’ minimum rate, three different optimization problems are considered: (i) joint design of bandwidth and power allocation for the case of a single-antenna BS; (ii) beamforming design for the case of a multiple-antenna BS; (iii) design of power allocation with regularized zero-forcing beamforming for the case of a multiple-antenna BS. In the short blocklength regime, the achievable rate is a complicated function of bandwidth and power allocation coefficients or beamforming vectors, which makes these max-min rate optimization problems challenging to solve. This work develops path-following algorithms, which generate a sequence of improved feasible points and at least converge to a locally optimal solution, to solve these three optimization problems. Performance of the proposed algorithms is analyzed through extensive simulations under various settings of transmit power budget, number of users, total bandwidth, transmission time, and number of transmit antennas at the BS. Simulation results clearly demonstrate the merits of the proposed algorithms.

9 April 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ANAli Arshad Nasir
Ali Arshad Nasir
HTHoang Duong Tuan
Hoang Duong Tuan
Hien Quoc NgoHien Quoc Ngo
Hien Quoc Ngo
Trung Q. DuongTrung Q. Duong
Trung Q. Duong
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
This paper considers cell-free massive MIMO (cfm-MIMO) for downlink ultra reliable and low-latency communication (URLLC). At the time of writing, cfm-MIMO has only been considered for communication in the long blocklength regime (LBR), whose throughput is determined by the Shannon capacity with the interference treated as Gaussian noise. Conjugate beamforming (CB) is often used as it requires only local channel state information (CSI) for implementation but its design is based on a large-scale nonconvex problem, which is computationally intractable. The rate function in URLLC is much more complex than the Shannon rate function. The paper proposes a special class of CB, which admits a low-scale optimization formulation for computational tractability. Accordingly, a new path-following algorithm, which generates a sequence of better feasible points and converges at least to a locally optimal solution, is developed for optimizing URLLC rates and cfm-MIMO energy efficiency. Furthermore, the paper also develops improper Gaussian signaling to improve both the Shannon rate and URLLC rate.

3 July 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
HYHongwen Yu
Hongwen Yu
HTHoang Duong Tuan
Hoang Duong Tuan
ANAli Arshad Nasir
Ali Arshad Nasir
Trung Q. DuongTrung Q. Duong
Trung Q. Duong
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
This paper considers a network consisting of a multiple antenna array access point serving multiple single antenna downlink users with the assistance of a reconfigurable intelligent surface (RIS). The reflecting coefficients of the RIS can be programmed to ensure that the signals reflected from the RIS elements add coherently at the users. The joint design of these programmable reflecting coefficients and transmit beamforming to maximize the users’ worst rate is addressed. Under either proper Gaussian signaling (PGS) or improper Gaussian signaling (IGS), the design poses a very computationally challenging nonconvex problem. Based on their exactly penalized optimization reformulation, which incorporates the computationally intractable unit-modulus constraints on the reflecting coefficients into the optimization objectives, new iterative algorithms of low computational complexity, which converge at least to a locally optimal solution, are developed. The provided simulations show not only the benefit of using the RIS, but also the advantage of IGS over PGS in delivering higher rates to users.

20 March 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZSzhichao sheng
zhichao sheng
HTHoang Duong Tuan
Hoang Duong Tuan
ANAli Arshad Nasir
Ali Arshad Nasir
Trung Q. DuongTrung Q. Duong
Trung Q. Duong
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy throughput per Joule under link security requirements. Three scenarios for the access of channel state information are considered: the perfect channel state information, partial channel state information with channels from the transmitters to the eavesdropper exponentially distributed, and not perfectly known channels between the transmitters and the users with exponentially distributed errors. The paper develops various path-following procedures of low complexity and rapid convergence for the optimal power allocation. Their effectiveness and viability are illustrated through numerical examples. The power allocation schemes are shown to achieve both high secrecy throughput and energy efficiency.

3 May 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
Zeeshan KaleemZeeshan Kaleem
Zeeshan Kaleem
WKWaqas Khalid
Waqas Khalid
AMAli Muqaibel
Ali Muqaibel
ANAli Arshad Nasir
Ali Arshad Nasir
Chau YuenChau Yuen
Chau Yuen
George K. KaragiannidisGeorge K. Karagiannidis
George K. Karagiannidis
Unmanned air vehicle (UAV) as an aerial base station (ABS) has attracted the attention of cellular service providers to enable emergency communications. However, the unplanned multiple ABS deployment poses severe interference challenges that degrade the user’s performance. To maximize the system sum capacity, we propose the use of K -means and Q -learning assisted 3D ABS Placement and Power allocation algorithm (KQPP). Specifically, we combine the benefits of K -means and Q -learning algorithms to achieve this goal. As a result, we successfully improve the sum capacity by satisfying all the users’ minimum data rate requirements. The proposed approach achieves 6bps/Hz and 16bps/Hz higher sum-capacity gain compared to equal power allocation and particle swarm optimization (PSO)-based power allocation schemes, respectively.