Research On Self-organization Of Wireless Sensor Networks Based On Target Tracking

Wireless sensor network(Wireless Sensor Networks)technology can be widely used in social life,thanks to the rapid progress of wireless communication,micro sensor technology and so on.Target tracking is one of the most important applications of WSN.However,the sensor nodes that make up the network are limited because of their small size and limited battery life,which makes the wireless sensor network computing ability,storage capacity and infinite communication ability limited.In order to deal with this problem,WSN in the process of target tracking,the design of a routing protocol has good stability,low complexity and energy efficiency to prolong the network life cycle,meet the needs of practical applications become the focus of this paper.In this paper,the basic theory of target tracking is introduced,and the typical target tracking method is compared and analyzed.It is concluded that the cluster-based target tracking method has certain advantages in tracking accuracy,complexity,energy consumption and fault tolerance.Therefore,this paper focuses on the study of target tracking oriented clustering routing protocol,proposed a multilevel heterogeneous clustered wireless sensor network algorithm based on partition distance(MHCADP).First of all,in the process of node deployment,the monitoring area is divided according to the distance from the base station,so as to form a special "back" font distribution,and then deploy different energy nodes;Then,in the process of clustering,the cluster head chooses to consider the residual energy of the node and avoids the high energy node to continue to serve as cluster head when the residual energy is lower than the ordinary node after many times as cluster head,thus balancing the network energy consumption;Finally,in the process of data transmission,the distance between the nodes and the base station as well as the residual energy of the nodes are considered,and different transmission modes are selected to avoid energy waste and improve energy efficiency.Through the simulation experiments are conducted to compare the performance of MHCADP,SEP,LEACH three kinds of routing protocol,the results show that the MHCADP algorithm proposed in this paper can save the network energy consumption and prolong the network life cycle,compared with LEACH and SEP,the proposed algorithm can improve 57% and48%.In the design of cluster based routing protocols,in order to avoid the conflict between multiple goals,select the optimal cluster head,this paper analyzes the basic theory of particle swarm optimization algorithm,and based on the algorithm of MHCADP network model,proposed a chaotic particle swarm optimization based on adaptive inertia weight(AWCPSO)clustering algorithm in wireless sensor network.Firstly,the chaos theory and particle swarm optimization algorithm are combined to solve the problem that particle swarm optimization algorithm is easy to fall into local optimum.Secondly,aiming at the problem that the inertia weight has significant influence on the performance of the algorithm,a new adaptive inertia weight method is proposed.When the cluster head is selected,the residual energy of the node and the distance of the base station are considered,and the probability of the node as cluster head is taken into account.The number of cluster heads is chosen to satisfy the optimal cluster number,which further improves the energy efficiency of the network and prolongs the life cycle of the network.Finally,compared and analyzed through simulation experiments,the results show that the AWCPSO clustering algorithm is proposed in this paper to extend the network life cycle and so on saving the network energy consumption and,compared to MHCADP,SEP and DEEC algorithm were increased by 17.88%,62.31%,16.45%.