In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of `exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the `exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets.

In this paper, a novel non-orthogonal multiple access (NOMA) enhanced device-to-device (D2D) communication scheme is considered. Our objective is to maximize the system sum rate by optimizing subchannel and power allocation. We propose a novel solution that jointly assigns subchannels to D2D groups and allocates power to receivers in each D2D group. For the subchannel assignment, a novel algorithm based on the many-to-one two-sided matching theory is proposed for obtaining a suboptimal solution. Since the power allocation problem is nonconvex, sequential convex programming is adopted to transform the original power allocation problem to a convex one. The power allocation vector is obtained by iteratively tightening the lower bound of the original power allocation problem until convergence. Numerical results illustrate that: 1) the proposed joint subchannel and power allocation algorithm are an effective approach for obtaining near-optimal performance with acceptable complexity and 2) the NOMA enhanced D2D communication scheme is capable of achieving promising gains in terms of network sum rate and the number of accessed users, compared to a traditional OMA-based D2D communication scheme.

The electric vehicle (EV) charging scheme can reduce the power generation costs and improve the smart grid resilience. However, the huge penetrations of EVs can impact the voltage stability and operating costs. In this paper, a novel EV participation charging scheme is proposed for a decentralized blockchain-enabled smart grid system. Our objectives are to minimize the power fluctuation level in the grid network and the overall charging cost for EV users. We first formulate the power fluctuation level problem of the smart grid system that take into accounts of EV battery capacities, charging rates, and EV users charging behavior. And then, we propose a novel adaptive blockchain-based electric vehicle participation (AdBEV) scheme that uses the Iceberg order execution algorithm to obtain an improved EV charging and discharging schedule. The simulation results show the proposed scheme outperforms the scheme that applying genetic algorithm approach in term of lowering the power fluctuation level and overall charging costs.

Massive multiple-input and multiple-output (MIMO) and heterogeneous networks (HetNets) have been recognized as key enabling technologies for future fifth generation (5G) mobile networks. However, the circuit power consumption of massive MIMO scales with the tremendous number of antennas. As a result, the problem of energy efficient user association in massive MIMO enabled HetNets is of vital importance. We investigate the energy efficient user association problem in massive MIMO enabled HetNets, and formulate the network logarithmic utility maximization problem. Based on the Lagrangian dual analysis, a low complexity distributed user association algorithm is developed for energy efficient fair user association while considering quality of service (QoS) provision for users. Simulation results demonstrate the effectiveness of the proposed algorithm in improving the energy efficiency and user fairness, compared to other user association algorithms.

In green communications, it is imperative to reduce the total on-grid energy consumption as well as minimize the peak on-grid energy consumption, since the large peak on-grid energy consumption will translate into the high operational expenditure (OPEX) for mobile network operators. In this paper, we consider the two-dimensional optimization to lexicographically minimize the on-grid energy consumption in heterogeneous networks (HetNets). All the base stations (BSs) therein are envisioned to be powered by both power grid and renewable energy sources, and the harvested energy can be stored in rechargeable batteries. The lexicographic minimization of on-grid energy consumption involves the optimization in both the space and time dimensions, due to the temporal and spatial dynamics of mobile traffic and green energy generation. The reasonable assumption of time scale separation allows us to decompose the problem into two sub-optimization problems without loss of optimality of the original optimization problem. We first formulate the user association optimization in space dimension via convex optimization to minimize total energy consumption through distributing the traffic across different BSs appropriately in a certain time slot. We then optimize the green energy allocation across different time slots for an individual BS to lexicographically minimize the on-grid energy consumption. To solve the optimization problem, we propose a low complexity optimal offline algorithm with infinite battery capacity by assuming non-causal green energy and traffic information. The proposed optimal offline algorithm serves as performance upper bound for evaluating practical online algorithms. We further develop some heuristic online algorithms with finite battery capacity which require only causal green energy and traffic information. The performance of the proposed optimal offline and online algorithms is evaluated by simulations.