The Study Of Target Coverage And QoS Routing Algorithm In Wireless Sensor Network

With nearly10years rapid development of communications and electronic technology,wireless sensor networks has received more and more attention, also is facing unprecedentedopportunities for development.In sensor networks, there are two important technologiescoverage control and routing algorithm.Among them coverage control is the basis for theother technologies, relative to other area-based coverage, the research based on targetcoverage started late, especially the problem of target coverage based on thethree-dimensional heterogeneous sensor is even more urgent to be studied.(1) Through the study of probability perception model of three dimensional spaceheterogeneous sensor network, this paper summarized target coverage problem intomultidimensional vector model of states0-1which can simplify complexity of the model. Inorder to solve the problem of covering all the goals in the region with the least number ofnodes, this paper use binary difference algorithm which can solve the0-1model appropriateinto the target coverage algorithm. Simulation results show that, Compared to the binarydifference algorithm and genetic algorithm, In the premise covering all target, the number ofsensors and iterations both declined. Also this paper explored impacts of the cover problem bythe perception radius,the target density and the attenuation factor, proved the effectiveness ofthe target coverage problem using binary difference algorithm.(2) Transmission energy consumption has become increasingly prominent as theimportance of wireless sensor networks, this paper take the issue of energy consumption asone of the important constraints,and take energy consumption into the QoS evaluation systemfor solving the optimal path.Although the ant colony algorithm has with a goodself-organization and the ability of parallel which can solve that problem effectively,but theant colony algorithm exists blind searching at the early running, and easy to fall into localoptimal solutions.This paper improved the ant colony algorithm,combine clonal selectionalgorithm and ant colony algorithm,which take the use of clonal selection algorithm’sexcellent global searching capability to guide ant colony system to find the global optimumsolution,and also import this improved algorithm into QoS routing algorithm.Simulationresults verify the improved algorithm, and illustrate that the algorithm is effective,feasible canmeet the demand for energy consumption, time-delay and bandwidth.