Search

In this paper, we investigate the resource allocation for dense cloud non-orthogonal multiple access smallcell networks (NOMA SCN), aimed at maximizing the users' quality of service (QoE). First, we construct a directed hypergraph to model the complex inter-interference relationship for cloud NOMA SCN. Then, we formulate the QoE-oriented channel allocation and user pairing problem in NOMA SCN as a local cooperation game. The game is proved to be an exact potential game. Moreover, the optimal pure strategy Nash equilibrium (PNE) in the proposed game can maximize the network QoE level. To achieve the optimal PNE in the proposed game, we redesign a directed-hypergraph-based multi-agent learning algorithm, which allows multiple non-coupled agents in directed hypergraph to simultaneously update their actions. Finally, simulation results are presented to validate the proposed learning scheme. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper investigates the channel selection problem for anti-jamming defense in an adversarial environment. In our work, we simultaneously consider malicious jamming and co-channel interference among users, and formulate this anti-jamming defense problem as a Stackelberg game with one leader and multiple followers. Specifically, the users and jammer independently and selfishly select their respective optimal strategies and obtain the optimal channels based on their own utilities. To derive the Stackelberg Equilibrium, a hierarchical learning framework is formulated, and a hierarchical learning algorithm (HLA) is proposed. In addition, the convergence performance of the proposed HLA algorithm is analyzed. Finally, we present simulation results to validate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]