Directed Hypergraph based Channel Allocation for Ultra Dense Cloud D2D Communications with Asymmetric

Directed Hypergraph based Channel Allocation for Ultra Dense Cloud D2D Communications with Asymmetric

Abstract:

In this paper, we investigate channel allocation for ultradense device-to-device (D2D) communications. Different from both binary graph and undirected hypergraph interference model, an improved directed hypergraph is applied to simultaneously represent cumulative and asymmetric interference aspects in the context of ultradense communications. We formulate the channel access problem in cloud D2D communication networks as a directed-hypergraph-based local altruistic game, which is proved to be an exact potential game. Then, a multiagent concurrent learning scheme in centralized-distributed fashion is proposed to search the optimal pure Nash equilibrium, which can also maximize the normalized network capacity. Finally, simulation results are presented to validate the proposed learning scheme.