Abstract:

The paper proposes a decentralized concurrent transmission strategy in shared channels based on an incomplete information game in Ad Hoc networks. Based on the nodal channel quality, the game can work out a channel gain threshold, which decides the candidates for taking part in the concurrent transmission. The utility formula is made for maximizing the overall throughput based on channel quality variation. For an achievable Bayesian Nash equilibrium (BNE) solution, this paper further prices the selfish players in utility functions for attempting to improve the channel gain one-sidedly. Accordingly, this game allows each node to distributedly decide whether to transmit concurrently with others depending on the Nash equilibrium (NE). Besides, to make the proposed game practical, this paper next presents an efficient particle swarm optimization (PSO) model to fasten the otherwise very slow convergence procedure due to the large computational complexity. Numerical results show the proposed approach is feasible to increase concurrent transmission opportunities for active nodes and the convergence can be swiftly obtained with a few of iteration times by the proposed PSO algorithm.