RESUMEN
In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity.
RESUMEN
Visible light communication (VLC) networks, consisting of multiple light-emitting diodes (LEDs) acting as optical access points (APs), can provide low-cost high-rate data transmission to multiple users simultaneously in indoor environments. However, the performance of VLC networks is severely limited by the interference between different users. In this paper, we establish a distributed user-centric scheduling framework based on stable marriage theory, and propose a novel decentralized scheduling method to manage interference by forming flexible amorphous cells for all users. The proposed scheduling method has provable low computational complexity and requires only the exchange of a few 1-bit messages between the APs and the users but not the feedback of the channel state information of the entire network. We further show that the proposed method can achieve both user-wise and system-wise optimality as well as a certain level of fairness. Simulation results indicate that our decentralized user-centric scheduling method outperforms existing centralized approaches in terms of throughput, fairness, and computational complexity.