Research On Target Coverage Optimization In Wireless Sensor Networks

As the "peripheral nerves" of IoT(The Internet of things) technology, WSN (WirelessSensor Networks) is composed of a large number of inexpensive, low power consumptionsensor nodes. These nodes collaborately detect the target coverage area, because each nodehas its own perception, acquisition, communications, transport and other advantages functions.And these nodes collect various objective physical information of cognitive object things inorder to meet people’s needs to obtain information.Our thesis mainly expands analysis and research from two aspects in both "optimizingdeployment" and "covering problem", namely in the specific target coverage area of wirelesssensor networks, how to make use of redundant nodes resources in WSN to both achievenetwork optimization deployment and effectively enhance and expand the coverageperformance of WSN. Our thesis will complete the following main contents:(1)Research on hole patching in WSN based on the best candidate node. On thecondition that location information of hole boundary nodes have been known, this algorithmimproved PATT algorithm existed, select the best redundant node, and move it to the bestrepair location to both increase the net coverage area of the target area, and reduce the holearea. Through simulation experiments, compared with the existing PATT algorithm under thesame conditions of experimental parameters, this algorithm reduces the number of additionalnew mobile node by using redundant nodes，which achieves coverage resource optimizationeffectively.(2)Coverage hole patching algorithm based on hole intersection information. The holepatching algorithm first proposes the concept of "benchmark-intersection". Based on thetriangular geometry knowledge in hole boundary nodes, this algorithm determines thelocation to be repaired, and then filters out the node that has the selected maximum weight Kas the best repair node to complete the repair of the hole completely. Through simulationexperiments, under the same conditions of experimental parameters, this algorithm has abetter performance in the number of the mobile nodes、resource utilization rate and algorithmrunning time efficiency compared with the existing PATT and DACHP algorithm.(3)A coverage compensation algorithm based on vector algebra in hybrid WSN. Basedon vector algebra knowledge, hole boundary nodes and its surrounding redundant nodes runindependently each localization algorithm, and then based on both energy consumption andinitial energy of redundant nodes, the most advantage redundant node can be determined tocomplete mobile compensation. Through simulation experiments, under the same conditionsof experimental parameters, this algorithm has a better performance in both movementdistance and movement cost compared with existing COA algorithm. And this algorithm notonly improves the quality of coverage, but also achieves the optimal use of resources.