![]() ; ; et al in IEEE Wireless Communications Letters (in press) We focus on the realistic maximization of the up-link minimum-signal-to-interference-plus-noise ratio (SINR) of a general multiple-input-single-output (MISO) system assisted by an intelligent reflecting ... [more ▼] We focus on the realistic maximization of the up-link minimum-signal-to-interference-plus-noise ratio (SINR) of a general multiple-input-single-output (MISO) system assisted by an intelligent reflecting surface (IRS) in the large system limit accounting for HIs. In particular, we introduce the HIs at both the IRS (IRS-HIs) and the transceiver HIs (AT-HIs), usually neglected despite their inevitable impact. Specifically, the deterministic equivalent analysis enables the derivation of the asymptotic weighted maximum-minimum SINR with HIs by jointly optimizing the HIs-aware receiver, the transmit power, and the reflect beamforming matrix (RBM). Notably, we obtain the optimal power allocation and reflect beamforming matrix with low overhead instead of their frequent necessary computation in conventional MIMO systems based on the instantaneous channel information. Monte Carlo simulations verify the analytical results which show the insightful interplay among the key parameters and the degradation of the performance due to HIs. [less ▲] Detailed reference viewed: 117 (16 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Transactions on Wireless Communications (in press) Detailed reference viewed: 47 (5 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Network (in press) The convergence of mobile edge computing (MEC) and blockchain is transforming the current computing services in wireless Internet-of-Things networks, by enabling task offloading with security enhancement ... [more ▼] The convergence of mobile edge computing (MEC) and blockchain is transforming the current computing services in wireless Internet-of-Things networks, by enabling task offloading with security enhancement based on blockchain mining. Yet the existing approaches for these enabling technologies are isolated, providing only tailored solutions for specific services and scenarios. To fill this gap, we propose a novel cooperative task offloading and blockchain mining (TOBM) scheme for a blockchain-based MEC system, where each edge device not only handles computation tasks but also deals with block mining for improving system utility. To address the latency issues caused by the blockchain operation in MEC, we develop a new Proof-of-Reputation consensus mechanism based on a lightweight block verification strategy. To accommodate the highly dynamic environment and high-dimensional system state space, we apply a novel distributed deep reinforcement learning-based approach by using a multi-agent deep deterministic policy gradient algorithm. Experimental results demonstrate the superior performance of the proposed TOBM scheme in terms of enhanced system reward, improved offloading utility with lower blockchain mining latency, and better system utility, compared to the existing cooperative and non-cooperative schemes. The paper concludes with key technical challenges and possible directions for future blockchain-based MEC research. [less ▲] Detailed reference viewed: 60 (10 UL)![]() Nguyen, van Dinh ![]() ![]() ![]() in IEEE Transactions on Wireless Communications (in press) Federated learning (FL) is capable of performing large distributed machine learning tasks across multiple edge users by periodically aggregating trained local parameters. To address key challenges of ... [more ▼] Federated learning (FL) is capable of performing large distributed machine learning tasks across multiple edge users by periodically aggregating trained local parameters. To address key challenges of enabling FL over a wireless fogcloud system (e.g., non-i.i.d. data, users’ heterogeneity), we first propose an efficient FL algorithm based on Federated Averaging (called FedFog) to perform the local aggregation of gradient parameters at fog servers and global training update at the cloud. Next, we employ FedFog in wireless fog-cloud systems by investigating a novel network-aware FL optimization problem that strikes the balance between the global loss and completion time. An iterative algorithm is then developed to obtain a precise measurement of the system performance, which helps design an efficient stopping criteria to output an appropriate number of global rounds. To mitigate the straggler effect, we propose a flexible user aggregation strategy that trains fast users first to obtain a certain level of accuracy before allowing slow users to join the global training updates. Extensive numerical results using several real-world FL tasks are provided to verify the theoretical convergence of FedFog. We also show that the proposed co-design of FL and communication is essential to substantially improve resource utilization while achieving comparable accuracy of the learning model. [less ▲] Detailed reference viewed: 92 (19 UL)![]() Zivuku, Progress ![]() ![]() ![]() in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC) (2022, April 10) Detailed reference viewed: 65 (21 UL)![]() Tran Dinh, Hieu ![]() ![]() ![]() in IEEE Transactions on Wireless Communications (2022), 21(3), 1621-1637 Unmanned aerial vehicle (UAV) communication hasemerged as a prominent technology for emergency communi-cations (e.g., natural disaster) in the Internet of Things (IoT)networks to enhance the ability of ... [more ▼] Unmanned aerial vehicle (UAV) communication hasemerged as a prominent technology for emergency communi-cations (e.g., natural disaster) in the Internet of Things (IoT)networks to enhance the ability of disaster prediction, damageassessment, and rescue operations promptly. A UAV can bedeployed as a flying base station (BS) to collect data from time-constrained IoT devices and then transfer it to a ground gateway(GW). In general, the latency constraint at IoT devices and UAV’slimited storage capacity highly hinder practical applicationsof UAV-assisted IoT networks. In this paper, full-duplex (FD)radio is adopted at the UAV to overcome these challenges. Inaddition, half-duplex (HD) scheme for UAV-based relaying isalso considered to provide a comparative study between twomodes (viz., FD and HD). Herein, a device is considered tobe successfully served iff its data is collected by the UAV andconveyed to GW timely during flight time. In this context,we aim to maximize the number of served IoT devices byjointly optimizing bandwidth, power allocation, and the UAVtrajectory while satisfying each device’s requirement and theUAV’s limited storage capacity. The formulated optimizationproblem is troublesome to solve due to its non-convexity andcombinatorial nature. Towards appealing applications, we firstrelax binary variables into continuous ones and transform theoriginal problem into a more computationally tractable form.By leveraging inner approximation framework, we derive newlyapproximated functions for non-convex parts and then develop asimple yet efficient iterative algorithm for its solutions. Next,we attempt to maximize the total throughput subject to thenumber of served IoT devices. Finally, numerical results showthat the proposed algorithms significantly outperform benchmarkapproaches in terms of the number of served IoT devices andsystem throughput. [less ▲] Detailed reference viewed: 98 (25 UL)![]() ; Nguyen, van Dinh ![]() Scientific Conference (2021, December 07) In this paper, we study short-packet communications (SPCs) in multi-hop wireless-powered Internet-of-Things networks (WPINs), where IoT devices transmit short packets to multiple destination nodes by ... [more ▼] In this paper, we study short-packet communications (SPCs) in multi-hop wireless-powered Internet-of-Things networks (WPINs), where IoT devices transmit short packets to multiple destination nodes by harvesting energy from multiple power beacons. To improve system block error rate (BLER) and throughput, we propose a best relay-best user (bR-bU) selection scheme with an accumulated energy harvesting mechanism. Closed-form expressions for the BLER and throughput of the proposed scheme over Rayleigh fading channels are derived and the respective asymptotic analysis is also carried out. To support real-time settings, we design a deep neural network (DNN) framework to predict the system throughput under different channel settings. Numerical results demonstrate that the proposed bR-bU selection scheme outperforms several baseline ones in terms of the BLER and throughput, showing to be an efficient strategy for multi-hop SPCs. The resulting DNN can estimate accurately the throughput with low execution time. The effects of message size on reliability and latency are also evaluated and discussed. [less ▲] Detailed reference viewed: 28 (1 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Transactions on Vehicular Technology (2021), 70(12), 12872-12887 The superior spectral efficiency (SE) and user fairness feature of non-orthogonal multiple access (NOMA) systems are achieved by exploiting user clustering (UC) more efficiently. However, a random UC ... [more ▼] The superior spectral efficiency (SE) and user fairness feature of non-orthogonal multiple access (NOMA) systems are achieved by exploiting user clustering (UC) more efficiently. However, a random UC certainly results in a suboptimal solution while an exhaustive search method comes at the cost of high complexity, especially for systems of medium-to-large size. To address this problem, we develop two efficient unsupervised machine learning based UC algorithms, namely k-means++ and improved k-means++, to effectively cluster users into disjoint clusters in cell-free massive multiple-input multiple-output (CFmMIMO) system. Adopting full-pilot zero-forcing at access points (APs) to comprehensively assess the system performance, we formulate the sum SE optimization problem taking into account power constraints at APs, necessary conditions for implementing successive interference cancellation, and required SE constraints at user equipments. The formulated optimization problem is highly non-convex, and thus, it is difficult to obtain the global optimal solution. Therefore, we develop a simple yet efficient iterative algorithm for its solution. In addition, the performance of collocated massive MIMO-NOMA (COmMIMO-NOMA) system is also characterized. Numerical results are provided to show the superior performance of the proposed UC algorithms compared to baseline schemes. The effectiveness of applying NOMA in CFmMIMO and COmMIMO systems is also validated. [less ▲] Detailed reference viewed: 74 (10 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Transactions on Vehicular Technology (2021), 70(12), 12872-12887 The superior spectral efficiency (SE) and user fairness feature of non-orthogonal multiple access (NOMA) systems are achieved by exploiting user clustering (UC) more efficiently. However, a random UC ... [more ▼] The superior spectral efficiency (SE) and user fairness feature of non-orthogonal multiple access (NOMA) systems are achieved by exploiting user clustering (UC) more efficiently. However, a random UC certainly results in a suboptimal solution while an exhaustive search method comes at the cost of high complexity, especially for systems of medium-to-large size. To address this problem, we develop two efficient unsupervised machine learning based UC algorithms, namely k-means++ and improved k-means++, to effectively cluster users into disjoint clusters in cell-free massive multiple-input multiple-output (CFmMIMO) system. Adopting full-pilot zero-forcing at access points (APs) to comprehensively assess the system performance, we formulate the sum SE optimization problem taking into account power constraints at APs, necessary conditions for implementing successive interference cancellation, and required SE constraints at user equipments. The formulated optimization problem is highly non-convex, and thus, it is difficult to obtain the global optimal solution. Therefore, we develop a simple yet efficient iterative algorithm for its solution. In addition, the performance of collocated massive MIMO-NOMA (COmMIMO-NOMA) system is also characterized. Numerical results are provided to show the superior performance of the proposed UC algorithms compared to baseline schemes. The effectiveness of applying NOMA in CFmMIMO and COmMIMO systems is also validated. [less ▲] Detailed reference viewed: 110 (19 UL)![]() Nguyen, van Dinh ![]() ![]() ![]() in IEEE Internet of Things Journal (2021), 8(5), 3394-3409 Federated learning (FL) allows multiple edge computing nodes to jointly build a shared learning model without having to transfer their raw data to a centralized server, thus reducing communication ... [more ▼] Federated learning (FL) allows multiple edge computing nodes to jointly build a shared learning model without having to transfer their raw data to a centralized server, thus reducing communication overhead. However, FL still faces a number of challenges such as non-iid distributed data and heterogeneity of user equipments (UEs). Enabling a large number of UEs to join the training process in every round raises a potential issue of the heavy global communication burden. To address these issues, we generalize the current state-of-the-art Federated Averaging (FedAvg) by adding a weight-based proximal term to the local loss function. The proposed FL algorithm runs stochastic gradient descent in parallel on a sampled subset of the total UEs with replacement during each global round. We provide a convergence upper bound characterizing the trade-off between convergence rate and global rounds, showing that a small number of active UEs per round still guarantees convergence. Next, we employ the proposed FL algorithm in wireless Internet-of-Things (IoT) networks to minimize either total energy consumption or completion time of FL, where a simple yet efficient path-following algorithm is developed for its solutions. Finally, numerical results on unbalanced datasets are provided to demonstrate the performance improvement and robustness on the convergence rate of the proposed FL algorithm over FedAvg. They also reveal that the proposed algorithm requires much less training time and energy consumption than the FL algorithm with full user participation. These observations advocate the proposed FL algorithm for a paradigm shift in bandwidth- constrained learning wireless IoT networks. [less ▲] Detailed reference viewed: 376 (52 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Transactions on Vehicular Communications (2021), 70(4), 3298-3313 This paper considers secure communications for an underlay cognitive radio network (CRN) in the presence of an external eavesdropper (Eve). The secrecy performance of CRNs is usually limited by the ... [more ▼] This paper considers secure communications for an underlay cognitive radio network (CRN) in the presence of an external eavesdropper (Eve). The secrecy performance of CRNs is usually limited by the primary receiver’s interference power constraint. To overcome this issue, we propose to use an unmanned aerial vehicle (UAV) as a friendly jammer to interfere Eve in decoding the confidential message from the secondary transmitter (ST). Our goal is to jointly optimize the transmit power and UAV’s trajectory in the three-dimensional (3D) space to maximize the average achievable secrecy rate of the secondary system. The formulated optimization problem is nonconvex due to the nonconvexity of the objective and nonconvexity of constraints, which is very challenging to solve. To obtain a suboptimal but efficient solution to the problem, we first transform the original problem into a more tractable form and develop an iterative algorithm for its solution by leveraging the inner approximation framework. We further extend the proposed algorithm to the case of imperfect location information of Eve, where the average worst-case secrecy rate is considered as the objective function. Extensive numerical results are provided to demonstrate the merits of the proposed algorithms over existing approaches. [less ▲] Detailed reference viewed: 82 (7 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Communications Letters (2021), 25(6), 1974-1978 Integrating the reconfigurable intelligent surface in a cell-free (RIS-CF) network is an effective solution to improve the capacity and coverage of future wireless systems with low cost and power ... [more ▼] Integrating the reconfigurable intelligent surface in a cell-free (RIS-CF) network is an effective solution to improve the capacity and coverage of future wireless systems with low cost and power consumption. The reflecting coefficients of RISs can be programmed to enhance signals received at users. This letter addresses a joint design of transmit beamformers at access points and reflecting coefficients at RISs to maximize the energy efficiency (EE) of RIS-CF networks, taking into account the limited backhaul capacity constraints. Due to a very computationally challenging nonconvex problem, we develop a simple yet efficient alternating descent algorithm for its solution. Numerical results verify that the EE of RIS-CF networks is greatly improved, showing the benefit of using RISs. [less ▲] Detailed reference viewed: 80 (5 UL)![]() Vu, Thang Xuan ![]() ![]() ![]() in IEEE Transactions on Wireless Communications (2021), 20(6), 3710-3722 We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial ... [more ▼] We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial diversity while minimizing the passive energy consumed by radio frequency (RF) components, the BS is equipped with M RF chains and N antennas, where M < N. Upon receiving pilot sequences to obtain the channel state information (CSI), the BS determines the best subset of M antennas for serving the users. We propose a joint antenna selection and precoding design (JASPD) algorithm to maximize the system sum rate subject to a transmit power constraint and quality of service (QoS) requirements. The JASPD overcomes the non-convexity of the formulated problem via a doubly iterative algorithm, in which an inner loop successively optimizes the precoding vectors, followed by an outer loop that tries all valid antenna subsets. Although approaching the (near) global optimality, the JASPD suffers from a combinatorial complexity, which may limit its application in real-time network operations. To overcome this limitation, we propose a learning-based antenna selection and precoding design algorithm (L-ASPA), which employs a deep neural network (DNN) to establish underlaying relations between the key system parameters and the selected antennas. The proposed L-ASPD is robust against the number of users and their locations, BS's transmit power, as well as the small-scale channel fading. With a well-trained learning model, it is shown that the L-ASPD significantly outperforms baseline schemes based on the block diagonalization and a learning-assisted solution for broadcasting systems and achieves higher effective sum rate than that of the JASPA under limited processing time. In addition, we observed that the proposed L-ASPD can reduce the computation complexity by 95% while retaining more than 95% of the optimal performance. [less ▲] Detailed reference viewed: 150 (39 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Communications Letters (2021), 25(1), 1089-7798 This letter considers a relay-based wireless-powered communication network to assist wireless communication between a source and multiple users. In particular, the relay adopts a nonlinear energy model to ... [more ▼] This letter considers a relay-based wireless-powered communication network to assist wireless communication between a source and multiple users. In particular, the relay adopts a nonlinear energy model to harvest energy from a power beacon and subsequently uses it for information transmission over timedivision multiple access. Aiming at the maximization of end-toend (e2e) sum throughput, we formulate a novel optimization problem that jointly optimizes the power and time fraction for energy and information transmission. For a simple yet efficient solution for the nonconvex problem, we first convert it to a more computationally tractable problem and then develop an iterative algorithm, in which closed-form solutions are obtained at each iteration. The effectiveness of our proposed approach is verified and demonstrated through simulation results. Moreover, the results reveal that the source should transmit with its maximum allowable power budget to obtain the optimal e2e sum throughput. [less ▲] Detailed reference viewed: 102 (5 UL)![]() Tran Dinh, Hieu ![]() ![]() ![]() Scientific Conference (2020, October 06) This work studies unmanned aerial vehicle (UAV) relay-assisted Internet of Things (IoT) communication networks in which a UAV is deployed as an aerial base station (BS) to collect time-constrained data ... [more ▼] This work studies unmanned aerial vehicle (UAV) relay-assisted Internet of Things (IoT) communication networks in which a UAV is deployed as an aerial base station (BS) to collect time-constrained data from IoT devices and transfer information to a ground gateway (GW). In this context, we jointly optimize the allocated bandwidth, transmission power, as well as the UAV trajectory to maximize the total system throughput while satisfying the user’s latency requirement and the UAV’s limited storage capacity. The formulated problem is strongly nonconvex which is very challenging to solve optimally. Towards an appealing solution, we first introduce new variables to convert the original problem into a computationally tractable form, and then develop an iterative algorithm for its solution by leveraging the inner approximation method. Numerical results are given to show [less ▲] Detailed reference viewed: 226 (14 UL)![]() Tran Dinh, Hieu ![]() ![]() ![]() E-print/Working paper (2020) Unmanned aerial vehicle (UAV) communication has emerged as a prominent technology for emergency communications (e.g., natural disaster) in Internet of Things (IoT) networks to enhance the ability of ... [more ▼] Unmanned aerial vehicle (UAV) communication has emerged as a prominent technology for emergency communications (e.g., natural disaster) in Internet of Things (IoT) networks to enhance the ability of disaster prediction, damage assessment, and rescue operations promptly. In this paper, a UAV is deployed as a flying base station (BS) to collect data from time-constrained IoT devices and then transfer the data to a ground gateway (GW). In general, the latency constraint at IoT users and the limited storage capacity of UAV highly hinder practical applications of UAV-assisted IoT networks. In this paper, full-duplex (FD) technique is adopted at the UAV to overcome these challenges. In addition, half-duplex (HD) scheme for UAV-based relaying is also considered to provide a comparative study between two modes (viz., FD and HD). Herein, a device is successfully served iff its data is collected by UAV and conveyed to GW within the flight time. In this context, we aim at maximizing the number of served IoT devices by jointly optimizing bandwidth and power allocation, as well as the UAV trajectory, while satisfying the requested timeout (RT) requirement of each device and the UAV’s limited storage capacity. The formulated optimization problem is troublesome to solve due to its non-convexity and combinatorial nature. Toward appealing applications, we first relax binary variables into continuous values and transform the original problem into a more computationally tractable form. By leveraging inner approximation framework, we derive newly approximated functions for non-convex parts and then develop a simple yet efficient iterative algorithm for its solutions. Next, we attempt to maximize the total throughput subject to the number of served IoT devices. Finally, numerical results show that the proposed algorithms significantly outperform benchmark approaches in terms of the number of served IoT devices and the amount of collected data. [less ▲] Detailed reference viewed: 81 (7 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Journal on Selected Areas in Communications (2020), 38(8), 1698-1718 In-band full-duplex (FD) operation is practically more suited for short-range communications such as WiFi and small-cell networks, due to its current practical limitations on the self-interference ... [more ▼] In-band full-duplex (FD) operation is practically more suited for short-range communications such as WiFi and small-cell networks, due to its current practical limitations on the self-interference cancellation. In addition, cell-free massivemultiple-input multiple-output (CF-mMIMO) is a new and scalable version of MIMO networks, which is designed to bring service antennas closer to end user equipments (UEs). To achieve higher spectral and energy efficiencies (SE-EE) of a wireless network, it is of practical interest to incorporate FD capability into CF-mMIMO systems to utilize their combined benefits. We formulate a novel and comprehensive optimization problem for the maximization of SE and EE in which power control, access point-UE (AP-UE) association and AP selection are jointly optimized under a realistic power consumption model, resulting in a difficult class of mixed-integer nonconvex programming. To tackle the binary nature of the formulated problem, we propose an efficient approach by exploiting a strong coupling between binary and continuous variables, leading to a more tractable problem. In this regard, two low-complexity transmission designs based on zero-forcing (ZF) are proposed. Combining tools from inner approximation framework and Dinkelbach method, we develop simple iterative algorithms with polynomial computational complexity in each iteration and strong theoretical performance guaranteed. Furthermore, towards a robust design for FD CFmMIMO, a novel heap-based pilot assignment algorithm is proposed to mitigate effects of pilot contamination. Numerical results show that our proposed designs with realistic parameters significantly outperform the well-known approaches (i.e., smallcell and collocated mMIMO) in terms of the SE and EE. Notably, the proposed ZF designs require much less execution time than the simple maximum ratio transmission/combining. [less ▲] Detailed reference viewed: 223 (41 UL)![]() ; ; Nguyen, van Dinh ![]() in IEEE Wireless Communications Letters (2020), 9(12), 2049-2053 This letter considers a wireless powered communication network (WPCN), where an energy-constrained device directly uses harvested energy from a power transfer source to transmit independent signals to ... [more ▼] This letter considers a wireless powered communication network (WPCN), where an energy-constrained device directly uses harvested energy from a power transfer source to transmit independent signals to multiple Internet of Things (IoT) users using orthogonal frequency division multiple access (OFDMA). Our goal is to maximize the system energy efficiency (EE) by jointly optimizing the duration of energy harvesting (EH), subcarrier and power allocation. The formulated problem is a mixed integer nonlinear programming (MINLP) problem due to the presence of binary assignment variables, and thus it is very challenging to solve it directly. By leveraging Dinkelbach method, a very efficient iterative algorithm with closed-form solutions in each iteration is developed, where its convergence is guaranteed. Numerical results show that the proposed algorithm obtains a fast convergence and outperforms baseline algorithms. Notably, they also reveal that the power source should transmit its maximum allowable power to obtain the optimal EE performance. [less ▲] Detailed reference viewed: 115 (11 UL)![]() ; Nguyen, van Dinh ![]() in IEEE International Conference on Communications (2020, June 07) This paper investigates the combined benefits of full-duplex (FD) and cell-free massive multiple-input multipleoutput (CF-mMIMO), where a large number of distributed access points (APs) having FD ... [more ▼] This paper investigates the combined benefits of full-duplex (FD) and cell-free massive multiple-input multipleoutput (CF-mMIMO), where a large number of distributed access points (APs) having FD capability simultaneously serve numerous uplink and downlink user equipments (UEs) on the same time-frequency resources. To enable the incorporation of FD technology in CF-mMIMO systems, we propose a novel heapbased pilot assignment algorithm, which not only can mitigate the effects of pilot contamination but also reduce the involved computational complexity. Then, we formulate a robust design problem for spectral efficiency (SE) maximization in which the power control and AP-UE association are jointly optimized, resulting in a difficult mixed-integer nonconvex programming. To solve this problem, we derive a more tractable problem before developing a very simple iterative algorithm based on inner approximation method with polynomial computational complexity. Numerical results show that our proposed methods with realistic parameters significantly outperform the existing approaches in terms of the quality of channel estimate and SE. [less ▲] Detailed reference viewed: 167 (31 UL)![]() ; Nguyen, van Dinh ![]() in IEEE Transactions on Communications (2020), 68(8), 4874-4890 In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output nonorthogonal multiple access networks with simultaneous wireless information and power ... [more ▼] In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output nonorthogonal multiple access networks with simultaneous wireless information and power transfer. In this system, two information users with distinct channel conditions are optimally paired while energy users perform energy harvesting (EH) under non-linearity of the EH circuits. We consider the problem of jointly optimizing user pairing and power allocation to maximize the overall spectral efficiency (SE) and energy efficiency (EE) subject to userspecific quality-of-service and harvested power requirements. A new paradigm for the EE-EH trade-off is then proposed to achieve a good balance of network power consumption. Such design problems are formulated as the maximization of nonconcave functions subject to the class of mixed-integer non-convex constraints, which are very challenging to solve optimally. To address these challenges, we first relax binary pairing variables to be continuous and transform the design problems into equivalent non-convex ones, but with more tractable forms. We then develop low-complexity iterative algorithms to improve the objectives and converge to a local optimum by means of the inner approximation framework. Simulation results show the convergence of proposed algorithms and the SE and EE improvements of the proposed HUP scheme over state-of-the-art designs. In addition, the effects of key parameters such as the number of antennas and dynamic power at the BS, target data rates, and energy threshold, on the system performance are evaluated to show the effectiveness of the proposed schemes in balancing resource utilization. [less ▲] Detailed reference viewed: 111 (16 UL) |
||