Analysis Of Coverage Problem Based On Grid Of Hexagon

Recent years, with the rapid development of wireless communication and sensors, wireless sensor networks have wide applied not only in the military field, but also in green agriculture, medical care, transportation and other areas. Technically, coverage problem in wireless sensor networks has become one of hot research topics, the research to improving its technology and developing the algorithm has important significance in the application.In this paper, the main research is to raise the coverage rate based on the region divided by hexagon. First, we have the concept of the coverage holes, then analyzed the sensor nodes’detection radius r, the hexagon’s length L with coverage holes, and concluded:Case1L≤[2(?)13/13]r, no coverage holesCase2[2(?)13/13]r<L≤r, unless the nodes are set in an arranged way like in the middle of the hexagon, otherwise may have coverage holes;Case3L>r, coverage holes must be exist.Secondly, through the study of the detection method of coverage holes that sensor nodes are randomly in the grid of hexagon, we have proposed an algorithm to improve the coverage rate. That is to say, to make sure the number of repair nodes is minimized while the repaired area coverage rate is expected to reach a given value. Finally, we find an optimization algorithm to improve the coverage rate and repair the coverage holes, then gave an example to test and verify.