Research On Routing Algorithm Based On Regional Energy Consumption Perception For Wireless Sensor Networks

Wireless Sensor Networks(WSNs)is composed of sensor nodes with small shape,limited energy storage and insufficient computing power.Because the environment of node deployment is very severe,and the energy stored by nodes is limited,the maintenance of network becomes very difficult.Therefore,designing a network topology with excellent energy consumption and excellent fault tolerance,and improving the lifetime of the network has become a boost and guarantee to accelerate the development of wireless sensor network technology.The routing structure of the network is one of the important characteristics of WSNs.As an important part of network topology,the research of routing structure is of great importance in the development of wireless sensor networks.The routing structure of WSNs is composed of several stages,and the key is node clustering stage and inter cluster communication stage.Through the design of efficient routing structure,reducing the energy consumption of nodes in wireless sensor networks and maximizing the network lifetime,this is the focus of this paper.In this paper,we focus on the two key stages of node clustering and inter cluster communication,namely,node information backhaul,energy consumption equalization for each node,and path selection strategy for data transmission in detection area:(1)Aiming at the problem of routing structure design in clustering stage.Due to the information transmission in the classical routing protocol(i.e.the ineffective propagation of information),the energy consumption of nodes in the network is wasted,which seriously curbed the prolongation of network lifetime.The energy loss caused by backhaul and the imbalance of energy consumption in classical LEACH protocol,In this paper,a new WSNs routing algorithm FA-LEACH is proposed.Based on the residual energy information of nodes,the algorithm establishes cluster head node candidate sets,introduces the concept of pre sensing area,and establishes the evaluation node importance index based on the position and orientation information of cluster head nodes,and selects relay nodes attached to cluster head nodes(that is,attached cluster heads nodes).Solve the problem of information backtracking by selectively transmitting information from the cluster head nodes.(2)Aiming at the problem of routing structure design for inter cluster communication phase.Because of the limited energy and insufficient computing resources,WSNs can only meet the needs of specific applications only through the cooperation and competition among cluster heads.Game theory is a strategy to solve the problem of cooperation and competition among participants in a game.In this paper,a new clustering routing algorithm based on mixed Nash equilibrium game is proposed based on the strategy of maximizing revenue in Nash equilibrium theory in game theory.MNE.In the clustering stage,the algorithm determines the forward sensing area,considers the energy and location information of the region,and determines the cluster head node in the adaptive angle constraint area.Through the mixed Nash equilibrium game strategy,the relay node selection of node information multi hop transmission is achieved to achieve the goal of energy balance consumption and prolong the network lifetime.