The evolving explosion in high data rate services and applications will soon require the use of untapped, abundant unregulated spectrum of the visible light for communications to adequately meet the demands of the fifth-generation (5G) mobile technologies. Radio-frequency (RF) networks are proving to be scarce to cover the escalation in data rate services. Visible light communication (VLC) has emerged as a great potential solution, either in replacement of, or complement to, existing RF networks, to support the projected traffic demands. Despite the prolific advantages of VLC networks, VLC faces many challenges that must be resolved in the near future to achieve a full standardization and to be integrated to future wireless systems. Here, we review the new, emerging research in the field of VLC networks and lay out the challenges, technological solutions, and future work predictions. Specifically, we first review the VLC channel capacity derivation, discuss the performance metrics and the associated variables; the optimization of VLC networks are also discussed, including resources and power allocation techniques, user-to-access point (AP) association and APs-to-clustered-users-association, APs coordination techniques, non-orthogonal multiple access (NOMA) VLC networks, simultaneous energy harvesting and information transmission using the visible light, and the security issue in VLC networks. Finally, we propose several open research problems to optimize the various VLC networks by maximizing either the sum rate, fairness, energy efficiency, secrecy rate, or harvested energy.

In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF access point (AP) and multiple VLC APs. An iterative algorithm is proposed to distribute users on APs and distribute the powers of the APs on their users. In the PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for total achievable data rate maximization. In this subproblem, we propose a new efficient algorithm that finds optimal dual variables after formulating them in terms of each other. This new algorithm provides faster convergence and better performance than the traditional subgradient method. In addition, it does not depend on the step size or the initial values of the variables, which we look for, as the subgradient does. Then, we start with the user of the minimum data rate seeking another AP that offers a higher data rate for that user. Users with lower data rates continue reconnecting from one AP to another to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. Two approaches are proposed to have the joint PA and LB performed: a main approach that considers the exact interference information for all users, and a suboptimal approach that aims to decrease the complexity of the first approach by considering only the approximate interference information of users. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.

Despite the promising high-data rate features of visible light communications (VLC), they still suffer from unbalanced services due to blockages and channel fluctuation among users. This paper introduces and evaluates a new transmission scheme which adopts cooperative non-orthogonal multiple access (Co-NOMA) in hybrid VLC/radio-frequency (RF) systems, so as to improve both system sum-rate and fairness. Consider a network consisting of one VLC access point (AP) and multiple strong and weak users, where each weak user is paired with a strong user. Each weak user can be served either directly by the VLC AP, or via the strong user which converts light information received through the VLC link, and forwards the information to the weak user via the RF link. The paper then maximizes a network-wide weighted sum-rate, so as to jointly determine the strong-weak user-pairs, the serving link of each weak user (i.e., either direct VLC or hybrid VLC/RF), and the power of each user message, subject to user connectivity and transmit power constraints. The paper tackles such a mixed-integer non-convex optimization problem using an iterative approach. Simulations show that the proposed scheme significantly improves the VLC network performance (i.e., sum-rate and fairness) as compared to the conventional NOMA scheme.

Federated learning (FL) has emerged as a distributed machine learning (ML) technique to train models without sharing users’ private data. In this paper, we introduce a decentralized FL scheme that is called federated learning empowered overlapped clustering for decentralized aggregation (FL-EOCD). The introduced FL-EOCD leverages device-to-device (D2D) communications and overlapped clustering to enable decentralized aggregation, where a cluster is defined as a coverage zone of a typical device. The devices located on the overlapped clusters are called bridge devices (BDs). In the proposed FL-EOCD scheme, a clustering topology is envisioned where clusters are connected through BDs, so as the aggregated models of each cluster is disseminated to the other clusters in a decentralized manner without the need for a global aggregator or an additional hop of transmission. To evaluate our proposed FL-EOCD scheme as opposed to baseline FL schemes, we consider minimizing the overall energy-consumption of devices while maintaining the convergence rate of FL subject to its time constraint. To this end, a joint optimization problem, considering scheduling the local devices/BDs to the CHs and computation frequency allocation, is formulated, where an iterative solution to this joint problem is devised. Extensive simulations are conducted to verify the effectiveness of the proposed FL-EOCD algorithm over FL conventional schemes in terms of energy consumption, latency, and convergence rate.

Reconfigurable intelligent surfaces (RISs) have drawn considerable attention due to their ability to direct electromagnetic waves into desirable directions. Although RISs share some similarities with relays, the two have fundamental differences impacting their performance. To harness the benefits of both, we propose a downlink system wherein a relay and an RIS improve performance in terms of energy-efficiency. Using singular value decomposition (SVD), semidefinite programming (SDP), and function approximations, we propose different solutions for optimizing the beamforming matrices at the base-station (BS), the relay, and the phase shifts at the RIS to minimize the total power under quality-of-service (QoS) constraints. The problem is solved when the relay operates in half-duplex and full-duplex modes and when the reflecting elements have continuous and discrete phase shifts. Simulation results compare the performance of the system with and without the RIS or the relay, under different optimization solutions. The results show that the system with full-duplex relay and RIS outperforms the other scenarios, and the contribution of full-duplex relay is higher than that of the RIS. However, an RIS outperforms a half-duplex relay when the required QoS is high. The results also show that increasing the number of reflecting elements improves the performance better in the presence of a relay than in its absence.

This paper proposes and optimizes a cooperative non-orthogonal multiple-access (Co-NOMA) scheme in the context of multicell visible light communications (VLC) networks to mitigate inter-cell interference. Consider a network where each access-point (AP) serves two users. In each cell, the weak user (cell-edge user) can be served either directly by the VLC AP, or through the strong user that decodes the weak user message and forwards it through the radio-frequency (RF) link. The paper then considers the problem of maximizing the sum-rate under quality-of-service constraints by allocating the powers of the messages and APs, and determining the links serving each weak user. The paper solves this non-convex problem by first finding closed-form solutions of the users’ powers and link selection for fixed APs powers. The APs powers are then iteratively solved in an outer loop. Simulation results show that the proposed scheme improves the sum-rate and fairness as compared to non-orthogonal multiple-access (NOMA) scheme.