关键词: 负载均衡, 最小路集, k-连通, 生存周期, 冗余链路

Abstract: Aiming at the problems of unbalanced load of individual "bottleneck nodes", multiple redundant links, and short life cycle in the existing wireless ad hoc network topology control algorithms based on game theory, this paper proposes a multi-objective fusion ordinal potential game wireless auto Group network topology control algorithm. The algorithm first designs an improved and optimized comprehensive utility function by analyzing the influence of network connectivity, node transmit power, remaining energy, node degree, link quality, and link length on node load； based on this, a multi-objective is established Converged network topology control potential game model, and proved that the model is an ordinal potential game and has a Nash equilibrium solution； on the basis of maintaining the network k-connection, the minimum path set algorithm is used to optimize the network topology links after the game, and eliminate Redundant link. Simulation experiments and comparative analysis show that the algorithm achieves network load balancing and eliminates redundant links under the premise of ensuring network connectivity. Compared with DEBA algorithm, PGTC algorithm and EBTG algorithm, the life cycle is increased by 23. 3%, 68. 8%, 98. 5%.

Key words: load balancing, minimum path set, k-connectivity, life cycle, redundant link