Font Size: a A A

Clustering And Routing Planning Of Wireless Sensor Network Based On The Improved Ant Colony Algorithm

Posted on:2018-07-07Degree:MasterType:Thesis
Country:ChinaCandidate:C D JinFull Text:PDF
GTID:2348330536979585Subject:Circuits and Systems
Abstract/Summary:PDF Full Text Request
Wireless sensor network features the low cost,strong dynamic topology,and widespread applications makes it become one of the current research hotspots Due to the particularity of geography,once the nodes in the wireless sensor network are scattered,they cannot be recycled or charged.Therefore,the energy of the whole network is limited.This feature makes the maximization of the network energy utilization becomes one of the principles of WSN clustering and path planning.Existing literature shows that the artificial intelligence algorithm can complete the wireless sensor network's clustering and path planning effectively.Artificially intelligent ant colony algorithm which has positive manages to simulate the natural ants foraging process this paper analyzes the existing relevant literature,proposes a scheme to improve the energy efficiency of the WSN clustering and path planning.The main work of this paper is as follows:(1)This paper aims at addressing the problem of the traditional artificially intelligent ant colony algorithm with respect to the complexity of transition probability,the stagnant calculation process and the insufficient utilization of the optimal sequence positive feedback.Based on a series of improved ant colony algorithms,this paper proposes a self.adjustable randomly.perturbed ant colony algorithm and combine the self.adjusting random perturbation ant colony algorithm with chaos,which enhances the convergence and globality of artificially intelligent ant colony algorithm.(2)In the WSN that has fixed cluster heads the nodes are allocated to the cluster heads according to the clustering scheme.Then the information collected by the nodes is sent to the cluster heads.The cluster heads receive and process the data,thus converging the data in the form of multi.hop then send it to the base station.This paper proposes an improved ant colony algorithm to complete the clustering scheme of nodes and the path optimization of cluster heads.The proposed algorithm avoids the shortcomings of clustering route algorithm that is slow and easily fall into the local optimal solution.Finally,the superiority of proved ant colony algorithm is proved by simulation.(3)In order to make the most use of the energy of WSN,LEACH and other protocols adopt the strategy of round.robin cluster heads to produce the optimal cluster head set.then the nodes are allocated to the nearest cluster head according to the optimal distance principle.In this paper,we not only propose an improved ant colony algorithm,but also takes the energy consumption of the entire network and each sensor node into account,and produce the optimal cluster head set by iteration.The simulation results show that the self.adjustable randomly perturbed ant colony algorithm is superior to the LEACH protocol in such environment by simulating the energy consumption of system and the death trend of the exhaustion of node energy.
Keywords/Search Tags:Wireless Sensor Network, Ant Colony Optimization, Chaos Perturbation, Clustering Route, Energy Priority
PDF Full Text Request
Related items