Wireless sensor network topological control method based on potential games

Abstract

The invention discloses a wireless sensor network topological control method based on potential games. A network model is determined, and a sensor network is expressed by a planar topological graph, and a connected network is determined, and then a TCBPG is established. According to the TCBPG, a payoff function of the game is determined to guarantee a Nash equilibrium solution existing in the game, and the TCBPG is defined as an ordinal potential game. After the TCBPG is determined according to the above mentioned steps, a distributed energy consumption equalization topological control algorithm is realized, and is divided into a neighbor discovering phase, a game executing phase, and a topology maintaining phase, and then a stable wireless sensor network topological structure is acquired. From a power control and energy consumption equalization angle, residual energy of nodes and transmitted power of nodes are comprehensively considered to design a new utility function, and a distributed topological control algorithm based on the potential games is provided. According to theoretical analysis and simulation results, the topology constructed by the algorithm is capable of realizing the Nash equilibrium, and is capable of guaranteeing the good characteristics of the network such as connectivity and energy consumption equalization, and therefore the life cycle of the network is prolonged.

Description

technical field [0001] The invention relates to a topology control algorithm, in particular to a potential game-based wireless sensor network topology control method. Background technique [0002] Wireless sensor networks have multi-hop characteristics, and nodes may show selfish behavior in order to save energy during data forwarding. Therefore, in recent years, game theory has been used by many scholars to study topological control problems. EIDENBENZ and others regarded the topology control problem as a non-cooperative game, and analyzed the complexity of finding the Nash equilibrium algorithm, and proposed three connectivity games, but they could not guarantee the existence of Nash equilibrium, nor did they prove the energy of the constructed topology effectiveness. Therefore, Komali et al. analyzed the topology control of the ad hoc network by using non-cooperative games, and designed a distributed optimal response algorithm MIA that can guarantee convergence. When t...

AI Technical Summary

Problems solved by technology

HAO proposed a virtual game-based distributed topology control algorithm VGEB. In this algorithm, each node independently plays the game according to the collected neighbor node information and broadcasts the power after the game. Although this algorithm reduces the cost of information exchange during the game execution process. The number of times, but the nodes need to have relatively strong computing power and large storage space to support the execution of the game

Images