Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments: A Game-Theoretic Approach
Xin Lin, Aijun Liu, Wanli Ni, Kang An, Chen Han, Zhixiang Gao, Symeon Chatzinotas · IEEE Transactions on Vehicular Technology · 2024
Recently, the hierarchical coalition-based Ad-hoc network (HCAN) has been adopted to establish link connection in adversarial environments. In this paper, a game-theoretic-based link access (GTLA) approach is proposed to maximize the sum rate of HCAN. Our scheme consists of two phases: the assignment between coalition head (CH) and coalition member (CM) as well as the matching between CH and disconnected node (DN). Firstly, the CH-CM assignment problem is formulated as a coalition formation game (CFG). It's proved that the CFG with the two-side best order is an exact potential game (EPG), which can significantly mitigate co-channel interference and hostile jamming. Secondly, the CH-DN matching problem is formulated as a bilateral many-to-one matching game. Then a partial mutual benefit order (PMBO) based matching algorithm with low computational complexity is designed to reconstruct broken links. Finally, simulation results are provided to verify the superior performance of our scheme.