PROJECT TITLE :
Super-Modular Game-Based User Scheduling and Power Allocation for Energy-Efficient NOMA Network - 2018
In this Project, we tend to contemplate a single cell downlink non-orthogonal multiple access (NOMA) network and aim at maximizing the energy efficiency. The energy-efficient resource allocation problem is formulated as a non-convex and NP-laborious downside. To decrease the computation complexity, we have a tendency to decouple the optimization drawback as a subchannel matching theme and power allocation subproblems. Within the subchannel matching theme, a non-cooperative game is applied to model this downside. To discuss the existence of Nash equilibrium (NE), we tend to introduce an excellent-modular game and then design an algorithm to converge to the NE purpose. Moreover, a greed subchannel matching algorithm with low complexity is given through a 2-way selection between users and subchannels. But, for given subchannel matching theme, power allocation remains a non-convex drawback, that is troublesome to get the optimal solution. We tend to then remodel the non-convex problem to a convex problem by applying a successive convex approximation method. Afterward, we offer an algorithm to converge to suboptimal solution by solving a convex downside iteratively. Finally, simulation result demonstrates that the energy potency performance of the NOMA system is better than the orthogonal frequency division multiple access system.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here