Research On Data Fusion Algorithm Based On Mobile Agent In Wireless Sensor Networks

As the great-leap-forward development of the computer technology,wireless communication technology,sensor technology and the embedded system technology,some kinds of micro-sensor arise at the historic moment,which are capable of sensing information about targets,computing on data sets from sensor nodes and communication among sensors in networks.Wireless Sensor Networks(WSN)is composed by this kind of micro sensor nodes which are deployed in a random or artificial way in the specified monitoring area,using wireless communication mode to form a multiple hops self-organizing distributed network.WSN has the characteristics of large scale,the dynamical topological structure,self-organizing,and the application of high correlation,which bring a fundamental change in the traditional way of data collection.However,the limitation of the sensor node energy resources,equipment storage and computation capacity,especially the constraints from energy resources,greatly hinders the development of WSN oriented with more large-scale and diverse applications.In the initial stage of this dissertation,a series of problems arising from the increase of network size in wireless sensor networks based on traditional C/S computing model are analyzed and discussed.Then,wireless sensor network based on Mobile Agent computing model is taken as the research theme to carry out theoretical analysis and technical research.The main work of this thesis is as follows:Firstly,In the Mobile Agent computing model,the mobile agent's visiting itinerary has a direct impact on energy consumption of the network and the performance of data fusion.Therefore,this dissertation studies and improves the mobile agent's itinerary planning method.On this basis,two kinds of itinerary planning methods are proposed respectively:(1)Mobile Agent Itinerary Planning Method Based on Data Scale in WSN.The algorithm mainly determines the number of Mobile Agent required by the network according to the size of each cluster of the network,and then defines the visiting order of the mobile agent to the network sensor node.(2)Mobile Agent Itinerary Planning Method Based on Iterative Local Search in WSN.This algorithm mainly focuses on the existing problem of multi-agent itinerary planning method,and uses the Iterative Local Search theory to optimize and improve.Secondly,the efficiency of the data fusion algorithm used by the mobile agent computing model also plays a significant role in the final data fusion effect.In this thesis,several common data fusion algorithms are analyzed and studied.On the basis of this research,a kind of mobile agent data fusion algorithm based on data sampling is proposed.To refine some of defects in data fusion efficiency and accuracy,this algorithm mainly reduces the amount of transmitted data on the network and improves the accuracy of data aggregation.Finally,In order to verify the availability and feasibility of these proposed algorithms of the thesis,the simulation experiment under TinyOS simulation platform TOSSIM is made in this dissertation.The experimental result demonstrates that the proposed algorithms perform significantly in terms of energy-efficient,balanced load,reducing network delay and depressing network overhead,prolonging the lifecycle of the network.