Font Size: a A A

Research On Coverage Optimization And Control Technology Of Wireless Sensor Networks

Posted on:2022-05-11Degree:MasterType:Thesis
Country:ChinaCandidate:D P SongFull Text:PDF
GTID:2518306557977599Subject:Master of Engineering
Abstract/Summary:PDF Full Text Request
The research and development of wireless sensor network has been widely concerned by researchers all over the world.Throughout its development process,as the sensing terminal of wireless sensor networks,sensor nodes become smaller and more comprehensive,which makes the application scenarios of wireless sensor networks more abundant.Area coverage optimization and control technology of wireless sensor networks is an old and often new research field.Area coverage is an important index to evaluate the service quality of sensor networks,which can reflect the quality of the whole network to a great extent.Due to the particularity of the application environment of wireless sensor network,the random deployment and failure of sensor nodes will lead to the problem of incomplete coverage of network monitoring area.Sensor nodes need to adjust and control their position through autonomous movement to achieve the requirements of effective coverage of the whole network.Aiming at the coverage problem of wireless sensor networks,the research content of this thesis mainly includes two aspects: network coverage optimization and network hole compensation.The specific research work is as follows:1.According to the foraging phenomenon of beetles in nature,this thesis analyzes the formation,foraging principle and process of basic Beetle Antennae Search algorithm(BAS algorithm),and integrates with the related research problems of area coverage in wireless sensor networks to optimize and improve its food source search,step change,random direction selection,etc,and puts forward an improved Beetle Antennae Search algorithm(IBAS algorithm).In the basic BAS algorithm,after the beetle finds the food source,it determines whether it needs to be captured by comparing the strength of the odor.Once the food source with stronger smell is found,it will go immediately,which usually leads to the situation that the poor food source is ignored or concentrated in the food source with strong smell,which is often not conducive to the global search of the whole region.In IBAS algorithm,by simplifying the mathematical model of beetle,the two antennae of beetle are used to identify the strength of the food source signal and determine the direction of beetle searching for food source.When the food source with weak odor is found,we slow down the pace and search in the random direction of the surrounding area to find out whether the food source with strong odor is missing or whether the food source with weak odor is worth catching,so as to achieve better optimization in the local area.In MATLAB?R2016a software simulates the application environment of wireless sensor network,sets the parameters required by the algorithm,and carries out comparative experiments.Finally,according to the experimental data,the results show the effectiveness and feasibility of the algorithm.2.In the real environment,some areas of the whole network can not be monitored by sensor nodes due to various unpredictable factors after the deployment of sensor nodes,and in order to reduce the waste of resources caused by using a large number of sensor nodes for location deployment,this thesis proposes a hybrid sensor network composed of fixed sensor nodes and mobile sensor nodes.A void compensation algorithm(VIBAS algorithm)is proposed based on Voronoi polygon theory and its physical properties.All the fixed sensor nodes in the network area are divided into Voronoi polygons,and the hole detection criteria are used to determine the scope of the hole,and then combined with the compensation algorithm to guide the mobile sensor nodes to repair the hole in time,so as to improve the overall network coverage effect and make the sensor nodes cover more evenly in the network.
Keywords/Search Tags:Sensor networks, Coverage optimization, Hole compensation, Beetle search algorithm, Voronoi polygon
PDF Full Text Request
Related items