Searcharxiv⌕ Search

arXiv subjects

Mohammad Shikh-Bahaei

Publications and source records attributed to Mohammad Shikh-Bahaei.

At least 55 records · Page 3Linked to original sources

Delay Minimization for Federated Learning Over Wireless Communication Networks

In this paper, the problem of delay minimization for federated learning (FL) over wireless communication networks is investigated. In the considered model, each user exploits limited local computational resources to train a local FL model with its collected data and, then, sends the trained FL model parameters to a base station (BS) which aggregates the local FL models and broadcasts the aggregated FL model back to all the users. Since FL involves learning model exchanges between the users and the BS, both computation and communication latencies are determined by the required learning accuracy level, which affects the convergence rate of the FL algorithm. This joint learning and communication problem is formulated as a delay minimization problem, where it is proved that the objective function is a convex function of the learning accuracy. Then, a bisection search algorithm is proposed to obtain the optimal solution. Simulation results show that the proposed algorithm can reduce delay by up to 27.3% compared to conventional FL methods.

eess.SP↗

Reflections in the Sky: Joint Trajectory and Passive Beamforming Design for Secure UAV Networks with Reconfigurable Intelligent Surface

This paper investigates the problem of secure energy efficiency maximization for a reconfigurable intelligent surface (RIS) assisted uplink wireless communication system, where an unmanned aerial vehicle (UAV) equipped with an RIS works as a mobile relay between the base station (BS) and a group of users. We focus on maximizing the secure energy efficiency of the system via jointly optimizing the UAV's trajectory, the RIS's phase shift, users' association and transmit power. To tackle this problem, we divide the original problem into three sub-problems, and propose an efficient iterative algorithm. In particular, the successive convex approximation method (SCA) is applied to solve the nonconvex UAV trajectory, the RIS's phase shift, and transmit power optimization sub-problems. We further provide two schemes to simplify the solution of phase and trajectory sub-problem. Simulation results demonstrate that the proposed algorithm converges fast, and the proposed design can enhance the secure energy efficiency by up to 38\% gains, as compared to the traditional schemes without any RIS.

eess.SP↗

Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels

In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and time-slot allocation are jointly optimized by solving the non-convex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in multi-antenna BC systems.

eess.SP↗

A Priority-Based Cross-Layer Design for Future VANETs through Full-Duplex Technology

Among all requirements for vehicle-to-everything (V2X) communications, successful delivery of packets with small delay is of the highest significance. Especially, the delivery of a message before a potential accident (i.e. emergency message) should be guaranteed. In this work, we propose a novel cross-layer design to enhance the delivery of emergency messages so that accidents can be further avoided. Particularly, in the PHY layer, imperfect full-duplex (FD) simultaneous transmitting and sensing is analysed and dynamic thresholds for determining the channel status before and during transmissions are mathematically formulated. Then a novel FD MAC protocol, named priority-based multiple access (PBMA), based on prioritised messaging between different vehicles is proposed. Average collision probability, collision duration, waiting time as well as successful delivery rate of the system are formulated too. The delivery performance of emergency messages is also mathematically derived. In addition, comparisons have been made among three different mechanisms. Benchmark is the DSRC standard which uses half-duplex (HD) technology with enhanced distributed channel access (EDCA) protocol. We also compare our proposed protocol with FD EDCA. Simulations have verified the accuracy of our analysis. They have also illustrated the delivery of emergency messages has been enhanced by deploying our proposed design.

cs.NI↗

Energy-Efficient Wireless Communications with Distributed Reconfigurable Intelligent Surfaces

This paper investigates the problem of resource allocation for a wireless communication network with distributed reconfigurable intelligent surfaces (RISs). In this network, multiple RISs are spatially distributed to serve wireless users and the energy efficiency of the network is maximized by dynamically controlling the on-off status of each RIS as well as optimizing the reflection coefficients matrix of the RISs. This problem is posed as a joint optimization problem of transmit beamforming and RIS control, whose goal is to maximize the energy efficiency under minimum rate constraints of the users. To solve this problem, two iterative algorithms are proposed for the single-user case and multi-user case. For the single-user case, the phase optimization problem is solved by using a successive convex approximation method, which admits a closed-form solution at each step. Moreover, the optimal RIS on-off status is obtained by using the dual method. For the multi-user case, a low-complexity greedy searching method is proposed to solve the RIS on-off optimization problem. Simulation results show that the proposed scheme achieves up to 33\% and 68\% gains in terms of the energy efficiency in both single-user and multi-user cases compared to the conventional RIS scheme and amplify-and-forward relay scheme, respectively.

eess.SP↗

Joint Beamforming, User Association, and Height Control for Cellular-Enabled UAV Communications

Supporting reliable and seamless mobility for aerial users, such as unmanned aerial vehicles (UAVs), is a key challenge for the next-generation cellular systems. To tackle this challenge, we propose a joint beamforming, user association, and UAV-height control framework for cellular-connected multi-UAV networks with multiple antenna base stations (BSs). With the aim of maximizing the minimum achievable rate for UAVs subject to co-existed terrestrial user equipment's rate constraints, we devise a hierarchical bi-layer iterative algorithm to optimize BSs' beamforming vectors, UAV association matrix, and the height of UAVs jointly. With the aid of projection gradient method in inner layer iteration and geometric program modelling plus convex-concave procedure in outer layer iteration, our proposed algorithm is proved to converge to a local optimum. Taking mobility characteristics of UAVs into account, we also exploit our proposed algorithm for imperfect channel estimation scenario. Numerical results show that our proposed algorithm can achieve improved UAVs' minimum achievable rate compared with that of the conventional nearest association of UAVs for both perfect and imperfect channel estimation scenarios. Moreover, we also examine the trade-off between the UAVs' minimum achievable rate and the frequency for updating optimization variables with single moving UAV.

cs.IT↗

Resource Allocation for UAV Assisted Wireless Networks with QoS Constraints

For crowded and hotspot area, unmanned aerial vehicles (UAVs) are usually deployed to increase the coverage rate. In the considered model, there are three types of services for UAV assisted communication: control message, non-realtime communication, and real-time communication, which can cover most of the actual demands of users in a UAV assisted communication system. A bandwidth allocation problem is considered to minimize the total energy consumption of this system while satisfying the requirements. Two techniques are introduced to enhance the performance of the system. The first method is to categorize the ground users into multiple user groups and offer each group a unique RF channel with different bandwidth. The second method is to deploy more than one UAVs in the system. Bandwidth optimization in each scheme is proved to be a convex problem. Simulation results show the superiority of the proposed schemes in terms of energy consumption.

eess.SP↗

Channel Assignment in Uplink Wireless Communication using Machine Learning Approach

This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. A convex optimization based algorithm is provided to obtain the optimal channel assignment, where the closed-form solution is obtained in each step. Due to high computational complexity in the convex optimization based algorithm, machine learning approaches are employed to obtain computational efficient solutions. More specifically, the data are generated by using convex optimization based algorithm and the original problem is converted to a regression problem which is addressed by the integration of convolutional neural networks (CNNs), feed-forward neural networks (FNNs), random forest and gated recurrent unit networks (GRUs). The results demonstrate that the machine learning method largely reduces the computation time with slightly compromising of prediction accuracy.

eess.SP↗

Energy Efficient UAV Communication with Energy Harvesting

This paper investigates an unmanned aerial vehicle (UAV)-enabled wireless communication system with energy harvesting, where the UAV transfers energy to the users in half duplex or full duplex, and the users harvest energy for data transmission to the UAV. We minimize the total energy consumption of the UAV while accomplishing the minimal data transmission requests of the users. The original optimization problem is decomposed into two subproblems: path planning subproblem and energy minimization subproblem with fixed path planning. For path planning subproblem, the optimal visiting order is obtained by using the dual method and the trajectory is optimized via the successive convex approximation technique. For energy minimization subproblem with fixed path planning, we firstly obtain the optimal portion of data transmission time within the entire procedure and the optimal transmission power of each user. Then, the the energy minimization subproblem is greatly simplified and it is efficiently solved via a one-dimensional search method. Simulation results are illustrated to verify the theoretical findings.

eess.SP↗

Collision Avoidance in V2X Communication Networks

In this paper we investigate collision detection and avoidance in a vehicular network of full duplex (FD) operating nodes. Each vehicle in this network senses the energy level of the channel before and during its transmission. The measured energy is compared against a dynamic threshold which is preset based on the target detection probability, transmitter's power, sensing time and self-interference cancellation (SIC) capability of the vehicles' on board units (OBU). Probabilities of detection and false alarm, detection threshold before and during transmission, and effect of residual self interference (SI) on these metrics have been formulated. It is shown that the proposed scheme would experience a shorter collision duration. Meanwhile, it also requires a minimum SIC capability for acceptable operation, below which, system throughput would be poor due to high false alarm probability. Numerical simulations verify the accuracy of our analysis. They also illustrate that the proposed model perform better than the fixed threshold strategy. A trade-off between half duplex (HD) and FD has been found and the scheme would be applicable even if SIC capability of OBUs is relatively poor, with no need for complicated and expensive devices for future vehicular communication.

cs.NI↗

Efficient Resource Allocation for Mobile-Edge Computing Networks with NOMA: Completion Time and Energy Minimization

This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize a linear combination of the completion time of all users' tasks and the total energy consumption of all users including transmission energy and local computation energy subject to computation latency, uploading data rate, time sharing and edge cloud capacity constraints. This work can significantly improve the energy efficiency and end-to-end delay of the applications in future wireless networks. For the general minimization problem, it is first transformed into an equivalent form. Then, an iterative algorithm is accordingly proposed, where closed-form solution is obtained in each step. For the special case with only minimizing the completion time, we propose a bisection-based algorithm to obtain the optimal solution. Also for the special case with infinite cloud capacity, we show that the original minimization problem can be transformed into an equivalent convex one. Numerical results show the superiority of the proposed algorithms compared with conventional algorithms in terms of completion time and energy consumption.

cs.IT↗

Delay Analysis in Full-Duplex Heterogeneous Cellular Networks

Heterogeneous networks (HetNets) as a combination of macro cells and small cells are used to increase the cellular network's capacity, and present a perfect solution for high-speed communications. Increasing area spectrum efficiency and capacity of HetNets largely depends on the high speed of backhaul links. One effective way which is currently utilized in HetNets is the use of full-duplex (FD) technology that potentially doubles the spectral efficiency without the need for additional spectrum. On the other hand, one of the most critical network design requirements is delay, which is a key representation of the quality of service (QoS) in modern cellular networks. In this paper, by utilizing tools from the stochastic geometry, we analyze the local delay for downlink (DL) channel, which is typically defined as the mean number of required time slots for a successful communication. Given imperfect self-interference (SI) cancellation in practical FD communications, we utilize duplex mode (half-duplex (HD) or FD) for each user based on the distance from its serving base station (BS). Further, we aim to investigate the energy efficiency (EE) for both duplexing modes, i.e., HD and FD, by considering local delay. We conduct extensive simulations to validate system performance in terms of local delay versus different system key parameters.

cs.NI↗

Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?

In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first derived and then substituted into the original problem. The structure of the optimal caching strategy is presented, which shows that it is optimal to cache the files with high popularity instead of the files with big size. Based on this optimal structure, we propose an iterative algorithm with low complexity to obtain a suboptimal solution, where the closed-from expression is obtained in each step. Numerical results show the superiority of our solution compared to the conventional cache strategy without considering cache and buffer tradeoff in terms of delay.

cs.IT↗

Sum-Rate Maximization of Uplink Rate Splitting Multiple Access (RSMA) Communication

In this paper, the problem of maximizing the wireless users' sum-rate for uplink rate splitting multiple access (RSMA) communications is studied. In the considered model, each user transmits a superposition of two messages to a base station (BS) with separate transmit power and the BS uses a successive decoding technique to decode the received messages. To maximize each user's transmission rate, the users must adjust their transmit power and the BS must determine the decoding order of the messages transmitted from the users to the BS. This problem is formulated as a sum-rate maximization problem with proportional rate constraints by adjusting the users' transmit power and the BS's decoding order. However, since the decoding order variable in the optimization problem is discrete, the original maximization problem with transmit power and decoding order variables can be transformed into a problem with only the rate splitting variable. Then, the optimal rate splitting of each user is determined. Given the optimal rate splitting of each user and a decoding order, the optimal transmit power of each user is calculated. Next, the optimal decoding order is determined by an exhaustive search method. To further reduce the complexity of the optimization algorithm used for sum-rate maximization in RSMA, a user pairing based algorithm is introduced, which enables two users to use RSMA in each pair and also enables the users in different pairs to be allocated with orthogonal frequency. For comparisons, the optimal sum-rate maximizing solutions with proportional rate constraints are obtained in closed form for non-orthogonal multiple access (NOMA), frequency division multiple access (FDMA), and time division multiple access (TDMA). Simulation results show that RSMA can achieve up to 10.0\%, 22.2\%, and 83.7\% gains in terms of sum-rate compared to NOMA, FDMA, and TDMA.

cs.IT↗

A Neural Network Prediction Based Adaptive Mode Selection Scheme in Full-Duplex Cognitive Networks

We propose a neural network (NN) predictor and an adaptive mode selection scheme for the purpose of both improving secondary user's (SU's) throughput and reducing collision probability to the primary user (PU) in full-duplex (FD) cognitive networks. SUs can adaptively switch between FD transmission-and-reception (TR) and transmission-and-sensing (TS) modes based on the NN prediction results for each transmission duration. The prediction performance is then analysed in terms of prediction error probability. We also compare the performance of our proposed scheme with conventional TR and TS modes in terms of SUs average throughput and collision probability, respectively. Simulation results show that our proposed scheme achieves even better SUs average throughput compared with TR mode. Meanwhile, the collision probability can be reduced close to the level of TS mode.

eess.SP↗

Optimization of Rate Allocation and Power Control for Rate Splitting Multiple Access (RSMA)

In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, each base station (BS) divides the messages that must be transmitted to its users into a `private' part and a `common' part. Here, the common message is a message that all users want to receive and the private message is a message that is dedicated to only a specific user. The RSMA mechanism enables a BS to adjust the split of common and private messages so as to control the interference by decoding and treating interference as noise and, thus optimizing the data rate of users. To maximize the users' sum-rate, the network can determine the rate allocation for the common message to meet the rate demand, and adjust the transmit power for the private message to reduce the interference. This problem is formulated as an optimization problem whose goal is to maximize the sum-rate of all users. To solve this nonconvex maximization problem, the optimal power used for transmitting the private message to the users is first obtained in closed form for a given rate allocation and common message power. Based on the optimal private message transmission power, the optimal rate allocation is then derived under a fixed common message transmission power. Subsequently, a one-dimensional search algorithm is proposed to obtain the optimal solution of common message transmission power. Simulation results show that the RSMA can achieve up to 15.6\% and 21.5\% gains in terms of data rate compared to non-orthogonal multiple access (NOMA) and orthogonal frequency-division multiple access (OFDMA), respectively.

eess.SP↗

Energy Efficient Resource Allocation for Mobile-Edge Computation Networks with NOMA

This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize the total energy consumption of all users including transmission energy and local computation energy subject to computation latency and cloud computation capacity constraints. We first prove that the total energy minimization problem is a convex problem, and it is optimal to transmit with maximal time. Then, we accordingly proposed an iterative algorithm with low complexity, where closed-form solutions are obtained in each step. The proposed algorithm is successfully shown to be globally optimal. Numerical results show that the proposed algorithm achieves better performance than the conventional methods.

eess.SP↗

Energy Efficient Resource Allocation in UAV-Enabled Mobile Edge Computing Networks

In this paper, we consider the sum power minimization problem via jointly optimizing user association, power control, computation capacity allocation and location planning in a mobile edge computing (MEC) network with multiple unmanned aerial vehicles (UAVs). To solve the nonconvex problem, we propose a low-complexity algorithm with solving three subproblems iteratively. For the user association subproblem, the compressive sensing based algorithm is accordingly is proposed. For the computation capacity allocation subproblem, the optimal solution is obtained in closed form. For the location planning subproblem, the optimal solution is effectively obtained via one-dimensional search method. To obtain a feasible solution for this iterative algorithm, a fuzzy c-means clustering based algorithm is proposed. Numerical results show that the proposed algorithm achieves better performance than conventional approaches.

cs.IT↗