21 August 2023 in IEEE Transactions on Vehicular Technology
Due to the long-distance communication and the limited resources, traditional full offloading algorithms cannot fully exploit radio and computation resources, which may cause more delays and higher energy consumption in mobile edge computing (MEC)-based vehicle-to-everything (V2X) networks. To solve this problem, a novel resource allocation (RA) algorithm with partial offloading for uplink multiuser MEC-based V2X networks is proposed. The optimization objective is to minimize the weighted sum of delays and energy consumption subject to the constraints on the delay requirements of tasks, communication distance, and the computation capability of roadside units. The formulated problem is non-convex and challenging to solve. To this end, an alternating optimization approach is designed to convert the original problem into three subproblems. A tabu search-based matching algorithm (TSM) is designed to solve the offloading object-selection subproblem. Then, a graph coloring algorithm is used to achieve channel allocation. Moreover, the computation RA subproblem is transformed into a convex optimization problem through variable substitution, and the suboptimal offloading ratios and computation RA coefficients are obtained. Simulation results show that the proposed algorithm achieves a lower total cost than the full offloading algorithm and the shortest distance matching algorithm.
29 July 2024 in IEEE Sensors Journal
In this paper, we consider a multi-unmanned aerial vehicle (UAV)-assisted Internet-of-things (IoT) sensor system with non-orthogonal multiple access (NOMA) and aim to maximize the sum utility of bit rates of all IoT sensors through the joint optimization of user association, three-dimensional (3-D) UAV placement, decoding ordering, and power allocation. To cope with the formulated mixed-integer non-convex problem, we decompose it into four subproblems relating to each dimension of radio resources under the alternating optimization framework. For the user association or decoding ordering subproblems involving only binary variables, a novel algorithm is proposed by leveraging variable relaxation, fractional programming, and efficient bounding. For the non-convex 3-D UAV placement subproblem, the sequential quadratic programming algorithm is applied to obtain an efficient sub-optimal solution by solving a sequence of quadratic programming problems that are iteratively modified. For the power allocation subproblem, the global-optimal solution is achieved based on auxiliary variables, variable transformation, and convex optimization. Simulation results show that the proposed resource allocation strategy outperforms the state-of-the-art benchmarks that are based on the greedy algorithm, the K-means algorithm, the geometric center-based algorithm, and the deep reinforcement learning, and strikes a good balance between performance and complexity in contrast to those based on the genetic algorithm and the brute-force search.
2 July 2024 in IEEE Journal of Selected Areas in Sensors
Integrated sensing and communication (ISAC) can improve spectral, energy, and transmission efficiency. To overcome the impact of channel uncertainties, we investigate a robust beamforming design problem for a multiple-input single-output based ISAC system with imperfect channel state information (CSI), where a multi-antenna base station (BS) serves multiple wireless users and obtains state information of a point target. Based on bounded CSI error models, a total throughput maximization problem is formulated under the constraints of the minimum rate threshold of each communication user, sensing performance based on Cramér-Rao lower bound thresholds, and the maximum transmit power of the BS. The formulated problem with parameter perturbations belongs to a non-convex one that is challenging to solve. An iterative robust beamforming algorithm is designed to address this issue by employing S-procedure, semi-definite relaxation technique, Schur complementarity conditions, and successive convex approximation. Simulation results demonstrate that the proposed algorithm exhibits better convergence and stronger robustness.
16 January 2024 in IEEE Transactions on Green Communications and Networking
Backscatter communication, as an important technique in green Internet of Things, has been concerned by academic and industry to improve system capacity and simultaneously reduce network cost in a low-power-consumption way. In this paper, a sum-throughput maximization resource allocation (RA) problem is studied for a full-duplex-enhanced wireless-powered backscatter communication network, where one hybrid access point (HAP) with constant power supply can coordinate wireless energy and information transmission for multiple backscatter users without other energy sources. All users first harvest the wireless energy from the HAP during the downlink transmission and simultaneously backscatter their information to the HAP, and then send their information to the HAP during uplink transmission. Then, a sum-throughput maximization RA problem is formulated by jointly optimizing the beamforming vector of the HAP, energy-harvesting (EH) time, reflection coefficients, and the transmit power of users, where the constraints of the maximum transmit power imposed by the HAP, the minimum throughput and the EH requirement of each user are considered simultaneously. Finally, the non-convex problem is converted into a convex one by applying a series of convex optimization methods, then an iterative-based RA algorithm is proposed to solve it. Simulation results verify the effectiveness of the proposed algorithm.
5 August 2024 in IEEE Transactions on Cognitive Communications and Networking
To explore the potential of multiple collaborative reconfigurable intelligent surfaces (RISs) for wireless-powered backscatter communications (WP-BackCom), in this paper, we investigate a robust energy efficiency (EE) optimization problem for a double-RIS-assisted WP-BackCom system, where a power station (PS) transmits wireless energy signals to multiple backscatter devices (BDs) via one RIS during the energy-harvesting phase, and then all BDs use the harvested energy for active transmission via another RIS. The total EE of all BDs with bounded channel uncertainties is maximized by jointly optimizing the beamforming vectors of the PS and RISs, transmission power, reflection coefficients, and time allocation factors. To solve the challenging problem, an iterative robust resource allocation algorithm is designed by employing the alteration optimization approach, the worst-case approach, the penalty function method, and the Gaussian randomization method. Simulation results verify that the proposed algorithm has strong robustness and higher EE.
8 November 2024 in IEEE Transactions on Vehicular Technology
Rate-splitting multiple access (RSMA) is a crucial technology of 6G to achieve non-orthogonal transmission and better interference optimization. In this paper, we focus on the resource allocation (RA) problem for a RSMA-based symbiotic radio system under imperfect successive interference cancellation and imperfect channel state information. A transmit power minimization problem is formulated by jointly optimizing the beamforming vector of the primary base station, reflection coefficients and common stream. To solve the non-convex problem, an iterative-based robust RA algorithm is proposed by using the alternating optimization method, successive convex approximation, and semi-definite relaxation. Simulation results demonstrate that the proposed algorithm can effectively decrease power consumption and improve the robustness by comparing it with the RA algorithms with traditional access methods.