Font Size: a A A

Research On Energy Balanced Routing Algorithm Based On Chaotic Ant Colony Algorithm In Wireless Sensor Networks

Posted on:2019-12-31Degree:MasterType:Thesis
Country:ChinaCandidate:B WuFull Text:PDF
GTID:2428330545491411Subject:Software engineering
Abstract/Summary:PDF Full Text Request
As a new frontier technology,wireless sensor network is changing the interaction between the human information world and the physical world,and has been widely used in various fields.Especially with the development and popularization of AI,the scale and industrialization of WSN applications will be further promoted.The wireless sensor network also has the limitation of energy constraints.How to design efficient routing strategy to save network energy consumption and to balance the energy consumption of each node in the network is the focus of the research in this field.In view of the problems of high energy consumption,easy access to local optimality and uneven energy consumption of network nodes,the following research work is carried out in this dissertation.1.From the point of view of network energy efficiency and network delay,a regional energy balance routing algorithm based on chaotic ant colony is proposed.This algorithm is based on node location through the division of nodes and jump probability,and searches the latent nodes with both energy and delay in the division area,and based on the chaotic ant colony algorithm basis.At the same time,the neighbor selection strategy is put forward in combination with the residual energy factors of the wireless sensor network nodes.In order to reduce the influence of the inferior value and the communication amount among the ants,the ant global optimal solution strategy is proposed.In order to enhance the ant search ability and speed up the convergence of the algorithm,the adaptive disturbance strategy and the algorithm end condition are respectively proposed.To find the global optimal solution and avoid falling into the local optimal solution.2.Aiming at the high energy consumption problem of the C/S(client/server)routing protocol in the traditional wireless sensor network,a mobile agent energy balance routing algorithm based on the chaotic ant colony is proposed.According to the difference of energy consumption and function of the intermediate node and data source node in the wireless sensor network,the difference energy consumption model is established.Considering the information gain of the data source node and the energy state of the intermediate nodes,the different influence intensity is given by the chaotic ant colony algorithm,and the node region density is considered as the influence factor of the node potential,and the two chaotic search is found in the mobile agent perception range and the migration range,thus increasing the perception environment of the mobile agent.Ability to enhance the autonomy of mobile agents.In order to reduce the amount of computation,speed up the convergence of the algorithm,select the region division of the data transmission direction as the neighborhood,and to further increase the self-organization ability of the system to introduce the adaptive disturbance strategy.The algorithm shows better energy consumption performance in small scale wireless sensor network environment.The simulation experiments show that the two routing schemes have obvious advantages in terms of network energy consumption,network delay,node equilibrium energy distribution and network lifetime.Compared with the previous methods,the average energy consumption is 6.2% and 6.67% respectively.
Keywords/Search Tags:chaotic ant colony, energy region partition, global optimal solution preservation, mobile agent, node energy consumption difference, sensing intensity, energy balance
PDF Full Text Request
Related items